How does ending in 5 impact the divisibility of x by 7 in Pell's equation?

  • Context: Graduate 
  • Thread starter Thread starter mathslover
  • Start date Start date
Click For Summary

Discussion Overview

The discussion centers on the relationship between the solutions of the Pell's equation \(x^2 - 2y^2 = -1\) and the divisibility of \(x\) by 7 when \(y\) ends in the digit 5. Participants explore various approaches to prove this relationship, including recursive relationships and induction.

Discussion Character

  • Exploratory
  • Technical explanation
  • Mathematical reasoning

Main Points Raised

  • One participant suggests proving that if \(y\) ends in 5, then \(x\) is divisible by 7, referencing specific solution pairs of the equation.
  • Another participant questions the validity of \(y = 15\) as a solution, noting that \(\sqrt{449}\) is not an integer.
  • A participant proposes developing a recursive relationship for the nth solution pair, indicating that this could lead to the desired proof.
  • Some participants discuss the general solution to the Pell's equation and suggest using induction as a method to approach the problem.
  • There are observations about the relationships between the solution pairs, specifically how certain combinations of \(X\) and \(Y\) relate to each other and their modular properties.
  • One participant outlines a method to show that if \(X\) and \(Y\) are solution pairs, then new pairs can be generated, and discusses the implications for divisibility by 5 and 7.

Areas of Agreement / Disagreement

Participants express various viewpoints on the relationship between \(y\) ending in 5 and \(x\) being divisible by 7, with no consensus reached on the proof or the validity of specific cases. Multiple competing views and approaches remain present in the discussion.

Contextual Notes

Some participants note the importance of specific modular conditions and the recursive nature of the solutions, but the discussion does not resolve the assumptions or dependencies on definitions related to the solutions of the Pell's equation.

mathslover
Messages
17
Reaction score
0
guys,

From the solutions of the Pell's equation x*x-2*y*y=-1,
how can we prove that whenever y ends in digit 5, then 7 | x ?

-Mathslover

Perhaps I should clarify a bit,x*x-2*y*y=-1 has solution
x=1, 7, 41, 239, 1393, 8119, 47321, 275807,...
y=1, 5, 29, 169, 985, 5741, 33461, 167305,...
and the general solution is (xn+yn*sqrt(2))=(1+sqrt(2))^(2*n+1)
Apart from induction,how can we prove whenever 5|y then 7|x ?
 
Last edited:
Physics news on Phys.org
What about y=15?
 
bel said:
What about y=15?

For y = 15 there are no solutions, since sqrt(449) isn't an integer... right?
 
The first solution pair (x,y) is (1,1). Develop a recursive relationship for the nth such pair (xn, yn) in terms of previous pair(s). The relation you want to prove will fall right out.
 
Do you the general solution to this Pellian equation? I think that is the way to approach this problem. Followed by induction.
 
Kummer said:
Do you the general solution to this Pellian equation? I think that is the way to approach this problem. Followed by induction.
[tex](1 +\sqrt{2})^n[/tex] gives [tex]X_{n}\sqrt{2} + Y_{n}[/tex] where [tex]X_{n}[/tex] and [tex]Y_{n}[/tex] for odd [tex]n[/tex] are solutions.

thus the first 3 solutions pairs X,Y are
1,1
5,7
29,41

from this one might notice that 5 = 3*1+2*1 and 29 = 3*5+2*7 and also notice that
7 = 4*1 + 3*1 and that 41=4*5+3*7.
Or simply multiply [tex](X\sqrt{2} + Y)*(1+\sqrt{2})^2[/tex] and put back into the same X,Y form to find the new X and Y.

So prove that if X and Y are a solution pair then (3X+2Y) and (4X+3Y) are the next solution pair then consider X mod 5 and Y mod 7 and you can follow the rest by induction.
 
ramsey2879 said:
[tex](1 +\sqrt{2})^n[/tex] gives [tex]X_{n}\sqrt{2} + Y_{n}[/tex] where [tex]X_{n}[/tex] and [tex]Y_{n}[/tex] for odd [tex]n[/tex] are solutions.

thus the first 3 solutions pairs X,Y are
1,1
5,7
29,41

from this one might notice that 5 = 3*1+2*1 and 29 = 3*5+2*7 and also notice that
7 = 4*1 + 3*1 and that 41=4*5+3*7.
Or simply multiply [tex](X\sqrt{2} + Y)*(1+\sqrt{2})^2[/tex] and put back into the same X,Y form to find the new X and Y.

So prove that if X and Y are a solution pair then (3X+2Y) and (4X+3Y) are the next solution pair then consider X mod 5 and Y mod 7 and you can follow the rest by induction.
Since [tex](1+\sqrt{2})^2 = 3+2\sqrt{2}[/tex] and since [tex](1+\sqrt{2})^3 = 7+5\sqrt{2}[/tex] then
[tex]X_{n} = 0 \mod 5[/tex] implies that [tex]n = 0 \mod 3[/tex]
but [tex]X_{n}[/tex] is only a solution for odd n so we calculate [tex](1 + \sqrt{2})^6 = 99 + 70\sqrt{2}[/tex] so the next solution after n = 3 (x=5, y = 7) is
[tex]X_{n+6} = 70*Y_{n} + 99*X_{n} \| Y_{n+6} = 70*2*X_{n} + 99*Y_{n}[/tex]
From inspection of the above formula it can be seen that
[tex]X_{n} = 0 \mod 5[/tex] if and only if [tex]X_{n+6} = 0 \mod 5[/tex] and
[tex]Y_{n}=0 \mod 7[/tex] if and only if [tex]Y_{n+6} = 0 \mod 7[/tex]
So our proof is complete
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
6K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 19 ·
Replies
19
Views
2K
Replies
33
Views
5K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
3
Views
2K