Question

# If S’ and S are the foci of the ellipse and a<b and P (x, y) be a point on it, then the value of SP + S’P is

- 2b
- 2a
- a – b
- a + b.

Hint:

### In an ellipse if P is a point on it and SS' are foci then

**SP + S'P = Length of Major axis**

## The correct answer is: 2b

### Given :

S’ and S are the foci of the ellipse and a < band P (x, y) be a point on it

Note :In an ellipse if P is a point on it and SS' are foci then

SP + S'P = Length of Major axis

### Related Questions to study

### The eccentricity of the curve represented by the equation x^{2} + 2y^{2} – 2x + 3y + 2 = 0 is

### The eccentricity of the curve represented by the equation x^{2} + 2y^{2} – 2x + 3y + 2 = 0 is

### The foci of the ellipse 25 (x + 1)^{2} + 9 (y + 2)^{2} = 225 are

### The foci of the ellipse 25 (x + 1)^{2} + 9 (y + 2)^{2} = 225 are

### The eccentricity of the ellipse 9x^{2} + 5y^{2} – 30y = 0 is

### The eccentricity of the ellipse 9x^{2} + 5y^{2} – 30y = 0 is

### The sum of all possible numbers greater than 10,000 formed by using {1,3,5,7,9} is

### The sum of all possible numbers greater than 10,000 formed by using {1,3,5,7,9} is

### Number of different permutations of the word 'BANANA' is

**In this question, one might think that the total number of permutations for the word BANANA is 6!**

This is wrong because in the word BANANA we have the letter A repeated thrice and the letter N repeated twice.

### Number of different permutations of the word 'BANANA' is

**In this question, one might think that the total number of permutations for the word BANANA is 6!**

This is wrong because in the word BANANA we have the letter A repeated thrice and the letter N repeated twice.

### The number of one - one functions that can be defined from into is

### The number of one - one functions that can be defined from into is

### Four dice are rolled then the number of possible out comes is

### Four dice are rolled then the number of possible out comes is

### The number of ways in which 5 different coloured flowers be strung in the form of a garland is :

### The number of ways in which 5 different coloured flowers be strung in the form of a garland is :

### Number of ways to rearrange the letters of the word CHEESE is

### Number of ways to rearrange the letters of the word CHEESE is

### The number of ways in which 17 billiard balls be arranged in a row if 7 of them are black, 6 are red, 4 are white is

We cannot arrange the billiards balls as follows:

There are 17 balls, so the total number of arrangements = 17!

This is incorrect because this method is applicable only when the balls are distinct, not identical. But, in our case, all the balls of the same color are identical.

### The number of ways in which 17 billiard balls be arranged in a row if 7 of them are black, 6 are red, 4 are white is

We cannot arrange the billiards balls as follows:

There are 17 balls, so the total number of arrangements = 17!

This is incorrect because this method is applicable only when the balls are distinct, not identical. But, in our case, all the balls of the same color are identical.

### Number of permutations that can be made using all the letters of the word MATRIX is

### Number of permutations that can be made using all the letters of the word MATRIX is

### The number of different signals that can be made by 5 flags from 8 flags of different colours is :

Each of the different arrangements which can be made by taking some or all of a number of things at a time is called permutation. The number of permutation without any repetition states that arranging n objects taken r at a time is equivalent to filling r places out of n things =n(n−1)(n−2)......(n−r−1) ways =

Thus we can say that the permutation concerns both the selection and the arrangement of the selected things in all possible ways.

### The number of different signals that can be made by 5 flags from 8 flags of different colours is :

Each of the different arrangements which can be made by taking some or all of a number of things at a time is called permutation. The number of permutation without any repetition states that arranging n objects taken r at a time is equivalent to filling r places out of n things =n(n−1)(n−2)......(n−r−1) ways =

Thus we can say that the permutation concerns both the selection and the arrangement of the selected things in all possible ways.