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.
Also what's with the picture? Made me almost not answer the problem..
Log in to reply
The staff put it on
Lololol
I find this solution quite complicated. Can we just solve it with simple methods?
Log in to reply
This was how Ramanujan solved it
See my solution down ;)
then simply use a calculator :P
what method you have adopted to solve it?
Basicly we looking for vertex of a function that the main identity is square root, if you ask, me the question is badly frased.
How do you come up with the 1st equation?
can you tell me about any book dt cotains these types of challenging problems
how you put f(x)=x+n+a ???
How did u guess the substitution u hv made(f(x)=x+n+a)??
why (f(x))² = f(x)= x+n+a ?? i don't understand what happened with f(x+n)
that' s really good
WTF?! Is my computer glitching, or has this problem become a level 5 calculus question?! Rating 2004!
@Michael Tong , 43 upvotes for this problem.. ......
Good solution
Very well written.I was really not aware of this as a Ramanujan problem.
Use Calculator
First, if we write n × ( n + 2 ) = n × 1 + ( n + 1 ) ( n + 3 ) ),
And we defined F(n)= n × ( n + 2 ) .
So we have that,
F(n)= n × 1 + ( n + 1 ) ( n + 3 )
F(n)= n × 1 + f ( n + 1 )
F(n)= n × 1 + ( n + 1 ) × 1 + ( n + 2 ) × ( n + 4 )
F(n)= n × 1 + ( n + 1 ) × 1 + ( n + 2 ) × 1 + ( n + 3 ) × ( n + 5 )
So, n × 1 + ( n + 1 ) × 1 + ( n + 2 ) × 1 + . . . = n × ( n + 2 )
Then, if we replace n = 1
1 × ( 1 + 2 ) = 1 × 1 + 2 × 1 + 3 × 1 + . . . )
3 = 1 × 1 + 2 × 1 + 3 × 1 + . . . )
Ramanujan's solution
I like this one! Is more easy that my long solution.. lim n → ∞ 1 + 2 × 1 + 3 × 1 + . . . and find how the sequence converges..
excellent
Really elegant solution. But how did you come up with the ffirst identity ?
brilliant ramanujan
perfect :) :)
The problem above can simplify to (1 + 2x4)^(1/2) = 9^(1/2) = 3. ANSWER : 3
How do you simplify it?
Log in to reply
Can you add a solution that explains how to solve this problem?
Log in to reply
In order to solve this question, use need to use a more general formulation.
F ( x ) = a x + ( n + a ) 2 + x a ( x + n ) + ( n + a ) 2 + ( x + n ) . . .
F ( x ) 2 = a x + ( n + a ) 2 + x F ( x + n )
F ( x ) = x + n + a
If we input x = 2 , n = 1 and a = 0 , we get an answer of 3.
This is a problem first published by the great Indian mathematician S.Ramanujan in the Journal of the Indian Mathematical Society in early 1900's.
How did you do that?
how did u came up with that solution?
Well took a calculator ; first sqrt(1+4)=sqrt(5)*3= 6.708 ; Then added 1 == 7.708 again sqrt(7.708)=2.7763; multiplied it by 2 to get 5.552 ; added 1 6.552 then sqrt(6.552) =2.559... Since the sum is a positive sum and root values cannot be accurately typed with a computer(not perfect squares), I guessed the answer to be 3.... :)
Try to use the calculator and determine the values by increasing the numbers as shown in the sequence and you will notice that the values are approaching 3 but doesn't equal it!
Try to use actual math and determine the values and you will notice that the correct answer is 3
I guess, at some point, after a certain n, we will have a remainder term which can be considered as n(1+sqrt(1+nsqrt(1+...nsqrt(..............))))) which should be solvable by usual methods. The above seems similar to the expression : sqrt(1+sqrt(1+sqrt(1+......) which is phi. My guess the above expression would n*phi. Another possibility is that after many nestings, the nested terms would evaluate to 1
"n(1+sqrt(1+nsqrt(1+...nsqrt(..............))))) " Do you mean n 1 + n 1 + n 1 + . . . . If so you can rearrange this to get 2 n 2 + n 4 + n 2 ≈ n 2 + 1 for large n .
The value of n 1 + ( n + 1 ) 1 + ( n + 2 ) 1 + . . . = n ( n + 2 ) .
Problem Loading...
Note Loading...
Set Loading...
This is a known problem given by Ramanujan. We will investigate a more general case:
f ( x ) = a x + ( n + a ) 2 + x a ( x + n ) + ( n + a ) 2 + ( x + n ) …
f ( x ) 2 = a x + ( n + a ) 2 + x a ( x + n ) + ( n + a ) 2 + ( x + n ) …
f ( x ) 2 = a x + ( n + a ) 2 + x f ( x + n )
Letting f ( x ) = x + n + a , we find that this satisfies our question. (In particular, ( x + n + a ) 2 = a x + ( a + n ) 2 + x ( x + 2 n + a ) )
Thus, our question gives a = 0 , n = 1 , x = 2 , so f ( x ) = 0 + 1 + 2 = 3 .