Find the largest natural number n ≤ 4 0 0 0 0 0 0 , for which the expression n + n + n + ⋯ is rational.
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.
Let, y = n + n + n + . . . . . . . . . . . .
⇒ y = n + y ⇒ y 2 = n + y ⇒ y 2 − y = n ⇒ y ( y − 1 ) = n
Here, n is multiplication of 2 consecutive number. Now we take the highest limit for n and root it we find,
4 0 0 0 0 0 0 = 2 0 0 0
Now we take 1 9 9 9 and 2 0 0 0 to multiply to find the largest n
And the largest n = 1 9 9 9 × 2 0 0 0 = 3 9 9 8 0 0 0
great method, thank you !
Let s = n + n + n + ⋯ , then it's true that s = n + s . The solution of a quadratic equation for s is 2 1 ± 1 + 4 n , and because s is supposed to be rational, then it must also be true that 1 + 4 n = a 2 (where a is a rational number). By simplifying the expression we get n = 4 a 2 − 1 . For n to be whole, a also has to be whole, because if a = q p is a fraction in it's basic form, then n = 4 q 2 p 2 − q 2 is supposed to be a whole number, and so q would need to divide p , which is in controversy with q p in it's basic form. By further simplifying we get n = 2 a − 1 × 2 a + 1 which shows that a has to be odd, and for n ≤ 4 0 0 0 0 0 0 , 2 a + 1 = 2 0 0 0 . From which n = 1 9 9 9 × 2 0 0 0 = 3 9 9 8 0 0 0
Problem Loading...
Note Loading...
Set Loading...
If we let S = n + n + n + ⋯ , we also get that S = n + S . Squaring both sides, rearranging to find n and factorising, we get n = S ( S − 1 ) . To find the largest value of n , we want the largest value of S . Since 4 0 0 0 0 0 0 = 2 0 0 0 , the values of S and S − 1 can't be 2 0 0 1 and 2 0 0 0 , but the largest values are 2 0 0 0 × 1 9 9 9 = 3 9 9 8 0 0 0