Find the least positive integer n such that 1 9 n + 1 and 9 5 n + 1 are both integer squares.
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.
This question is there from the book Mathematical Olympiad Challenges, and the solution is exactly the same..... In the book it is written in short, but I think you should have elaborated....
For the Pell's Equation x 2 − 5 y 2 = − 4 , we can divide both sides by 4 , giving us:
( 2 x ) 2 − 5 ( 2 y ) 2 = − 1 .
Now the method for solving a Pell's equation with − 1 in RHS, the traditional way is to square both sides, then see, again we get the exact form of the Pell's equation.
How did u get the formula for generalized pell equation
Log in to reply
The generalised formula is there for the sequences. You can readily in a book of number theory by titu andreescu.
And from where can i learn more about it
Log in to reply
You can read about the Fibonacci sequence in Wikipedia in detail.
Problem Loading...
Note Loading...
Set Loading...
Let 9 5 n + 1 = x 2 and 1 9 n + 1 = y 2 , for some positive integers x and y . Then x 2 − 5 y 2 = − 4 , which is generalized Pell equation with solutions given by
2 x n ± y n 5 = ( 2 1 ± 5 ) n , n = 1 , 3 , 5 , . . . .
Using the general formula for the Fibonacci sequence { F k } k ≥ 0 , we conclude that y m = F 2 m − 1 , for m = 1 , 2 , 3 , . . . . It suffices to find the first term of the sequence 2 , 5 , 1 3 , 3 4 , 8 9 , 2 3 3 , 6 1 0 , 1 5 9 7 , . . . whose square is congruent to 1 ( m o d 1 9 ) . This term is F 1 7 = 1 5 9 7 , so the answer to the problem is
n = 1 9 1 ( F 1 7 2 − 1 ) = 1 3 4 2 3 2 .