Akiva's question at Yahoo Answers regarding a Diophantine equation

  • Context: MHB 
  • Thread starter Thread starter MarkFL
  • Start date Start date
Click For Summary
SUMMARY

The Diophantine equation X^2 + 1 = 2y^2 has been analyzed, revealing that solutions include pairs such as (1, 1), (7, 5), and (41, 29). The relationship between these solutions and Pythagorean triples has been established, specifically those where one leg is one unit longer than the other. The recursive formulas for generating solutions are x_{n+1} = 6x_n - x_{n-1} and y_{n+1} = 6y_n - y_{n-1}, with closed forms derived for both x_n and y_n. An infinite number of solution pairs exist, confirming the equation's complexity and richness.

PREREQUISITES
  • Understanding of Diophantine equations
  • Familiarity with Pell's equation
  • Knowledge of recursive sequences
  • Basic concepts of Pythagorean triples
NEXT STEPS
  • Study Pell's equation and its applications in number theory
  • Explore recursive sequences and their properties
  • Investigate the relationship between triangular numbers and Diophantine equations
  • Learn about generating functions in the context of integer sequences
USEFUL FOR

Mathematicians, number theorists, and students interested in Diophantine equations and their applications in algebra and number theory.

MarkFL
Gold Member
MHB
Messages
13,284
Reaction score
12
Here is the question:

X^2 + 1 = 2y^2 Diophantine equation?

I've been thinking about what whole numbers x and y satisfy:
x^2 + 1 = 2y^2

I know that (1, 1) works, as do (7, 5) and (41, 29), but I want a formula that gives me the next one, or any given one. What's the pattern?

The question is equivalent to asking which triangular numbers are twice other ones (the first three are (0, 0), (3, 2) (3rd is 6, 2nd is 3), and (20, 14)), and which right triangles with integer legs have one leg 1 unit longer than the other (first three triplets are (0, 1, 1), (3, 4, 5), (20, 21, 29)).

I'm not sure how to solve it. Which numbers x and y satisfy it? Is there an equation to find, say, the 20th x and y? Are there an infinite number of pairs that satisfy it, or just a few? Please help.

I have posted a link there to this topic so the OP can see my work.
 
Mathematics news on Phys.org
Hello Akiva,

The Diophantine equation you are considering is closely related to Pell's equation.

You have made the astute observation that the solutions to this equation are related to Pythagorean triples where the legs differ by 1. You may find http://www.mathhelpboards.com/f49/pell-sequence-2905/ to be of interest.

Okay, you have found the solutions:

$(x,y)=(1,1),\,(7,5),\,(41,29)$

At this point, we could hypothesize that $x$ and $y$ can be given recursively with:

$$S_{n+1}=6S_{n}-S_{n-1}$$

which leads to the characteristic equation:

$$r^2-6r+1=0$$

which has the roots:

$$r=3\pm2\sqrt{2}=\left(1\pm\sqrt{2} \right)^2$$

and so we know the closed form is:

$$S_n=k_1\left(1-\sqrt{2} \right)^{2n}+k_2\left(1+\sqrt{2} \right)^{2n}$$

Next, we may using the initial values for each sequence to determine the parameters.

For $x_n$, we may use:

$$x_1=k_1\left(1-\sqrt{2} \right)^{2}+k_2\left(1+\sqrt{2} \right)^{2}=1$$

$$x_2=k_1\left(1-\sqrt{2} \right)^{4}+k_2\left(1+\sqrt{2} \right)^{4}=7$$

This gives rise to the system:

$$3\left(k_1+k_2 \right)+2\sqrt{2}\left(k_2-k_1 \right)=1$$

$$17\left(k_1+k_2 \right)+12\sqrt{2}\left(k_2-k_1 \right)=7$$

Multiplying the first equation by $-6$, then adding, we get:

$$-k_1-k_2=1\,\therefore\,k_1=-1-k_2$$

Substituting into the first equation for $k_1$, there results:

$$-3+2\sqrt{2}\left(2k_2+1 \right)=1$$

Solving for $k_2$, we find:

$$k_2=\frac{\sqrt{2}-1}{2}$$

Thus:

$$k_1=-1-\frac{\sqrt{2}-1}{2}=-\frac{\sqrt{2}+1}{2}$$

and so we find:

$$x_n=-\frac{\sqrt{2}+1}{2}\left(1-\sqrt{2} \right)^{2n}+\frac{\sqrt{2}-1}{2}\left(1+\sqrt{2} \right)^{2n}$$

$$x_n=\frac{1}{2}\left(\left(\sqrt{2}-1 \right)\left(1+\sqrt{2} \right)^{2n}-\left(\sqrt{2}+1 \right)\left(1-\sqrt{2} \right)^{2n} \right)$$

For $y_n$, we may use:

$$y_1=k_1\left(1-\sqrt{2} \right)^{2}+k_2\left(1+\sqrt{2} \right)^{2}=1$$

$$y_2=k_1\left(1-\sqrt{2} \right)^{4}+k_2\left(1+\sqrt{2} \right)^{4}=5$$

This gives rise to the system:

$$3\left(k_1+k_2 \right)+2\sqrt{2}\left(k_2-k_1 \right)=1$$

$$17\left(k_1+k_2 \right)+12\sqrt{2}\left(k_2-k_1 \right)=5$$

Multiplying the first equation by $-6$, then adding, we get:

$$-k_1-k_2=-1\,\therefore\,k_1=1-k_2$$

Substituting into the first equation for $k_1$, there results:

$$3+2\sqrt{2}\left(2k_2-1 \right)=1$$

Solving for $k_2$, we find:

$$k_2=\frac{\sqrt{2}-1}{2\sqrt{2}}$$

Thus:

$$k_1=1-\frac{\sqrt{2}-1}{2\sqrt{2}}=\frac{\sqrt{2}+1}{2\sqrt{2}}$$

and so we find:

$$y_n=\frac{\sqrt{2}+1}{2\sqrt{2}}\left(1-\sqrt{2} \right)^{2n}+\frac{\sqrt{2}-1}{2\sqrt{2}}\left(1+\sqrt{2} \right)^{2n}$$

$$y_n=\frac{1}{2\sqrt{2}}\left(\left(\sqrt{2}+1 \right)\left(1-\sqrt{2} \right)^{2n}+\left(\sqrt{2}-1 \right)\left(1+\sqrt{2} \right)^{2n} \right)$$

So, in summary, we find an infinite number of solution pairs, given:

i) recursively:

$$x_{n+1}=6x_{n}-x_{n-1}$$ where $$x_1=1,\,x_2=7$$

$$y_{n+1}=6y_{n}-y_{n-1}$$ where $$y_1=1,\,x_2=5$$

ii) closed form:

$$x_n=\frac{1}{2}\left(\left(\sqrt{2}-1 \right)\left(1+\sqrt{2} \right)^{2n}-\left(\sqrt{2}+1 \right)\left(1-\sqrt{2} \right)^{2n} \right)$$

$$y_n=\frac{1}{2\sqrt{2}}\left(\left(\sqrt{2}+1 \right)\left(1-\sqrt{2} \right)^{2n}+\left(\sqrt{2}-1 \right)\left(1+\sqrt{2} \right)^{2n} \right)$$
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 48 ·
2
Replies
48
Views
4K
  • · Replies 12 ·
Replies
12
Views
8K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
4
Views
2K
  • · Replies 19 ·
Replies
19
Views
6K