A plane is divided into two parts by an ellipse. How many parts can a plane be at most divided by 10 ellipses?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Great solution @Vishnu H Nair
This was a great problem!!
We will use method of successive differences to solve it. Please bear in mind that this may not work for all such problems, this one is simple, therefore it works here.
Denote maximum number of parts for n ellipses as a n
Difficult part: Find a n for n = 1 , 2 , 3 and finally, if possible 4 . I did do this. And got the values as: 2 , 6 , 1 4 , 2 6 respectively.
Now, we can see that the successive differences are as follows:
a 1 a 2 a 3 a 4 2 6 1 4 2 6 4 8 1 2 4 4 0
Since the difference vanishes after two levels, we can conclude that the formula for a n is a quadratic in n .
Let a n = p n 2 + q n + r
Solving for p , q , r using known values of a n , we get: p = 2 , q = − 2 , r = 2
Hence a n = 2 n 2 − 2 n + 2 ⇒ a 1 0 = 1 8 2
Very nice solution but come on provide something else for the difficult part .
Log in to reply
Actually you do not need to calculate for 4 . You can guess that it is a quadratic straight away from first three. I do not know any other way, sorry. Maybe @Vishnu H Nair (asker)can help?
Problem Loading...
Note Loading...
Set Loading...
Let the plane be divided into at most A n parts by n ellipses. The ( n + 1 ) t h ellipse intersect the n ellipses at most at 4 n distinct points.Thus the ( n + 1 ) t h ellipse is divided into 4 n arcs and every original region is divided into two parts by each arc. So we get,
A n + 1 = A n + 4 n and A 1 = 2
So after summing it up,we get,
A n = 2 n 2 − 2 n + 2
For n = 1 0 ,we get A 1 0 = 1 8 2 .