Solve k^2-1=a^2+b^2: Find Positive Ints

  • Thread starter Thread starter AM-GM
  • Start date Start date
Click For Summary
The equation k^2 - 1 = a^2 + b^2 has been shown to have infinitely many positive integer solutions, with examples provided such as k = 9, a = 4, and b = 8. The proof involves manipulating the equation to express k and a in terms of b, specifically choosing b to be even, which ensures that b^2 + 1 is odd. If b^2 + 1 is prime, k + a can be set to this prime, while if it is not prime, k + a and k - a can be chosen as its two odd factors. The discussion also touches on the comparison between the number of Pythagorean triplets and the solutions to this equation, concluding that both sets are countably infinite. The requirement for b to be even is essential for the proof's structure and the properties of the resulting equations.
AM-GM
Messages
2
Reaction score
0
are there any positive integers k,a, b such that this equation is satisfied:

k^2-1=a^2+b^2
 
Physics news on Phys.org
Yes, for example k = 9, a = 4, b = 8.
 
thanks, how do i go about proving that infinite solutions exist?
 
The solution

Here's the solution.
We have:
k^2-a^2=b^2-1
(k+a)(k-a)=b^2+1

Then choose b such that b is even.
This implies b^2+1 is odd. If b^2+1 is a prime, then put k+a=b^2+1 and k-a=1. You will get k&a. If b^2+1 is not a prime, then choose k+a and k-a as its two odd factors. Solving, you get k & a.
As there is solution for all b>0 and b even, there are infinitely many solutions.
 
You can see that Orthodontist's solution is also one of these.
 
the case with 1 is a special case of
k^2=a^2+b^2+c^2
a good question that might arose from this is what number is greater: the number of pythogrean triplets or the above qudroplets?
 
neither, they are both the same (countably infinite); it is not a difficulct question, and has indeed already been answered in this thread where it is asserted that there are infinitely many solutions to

k^2-1=a^2+b^2
 
Aditya89 said:
Here's the solution.
We have:
k^2-a^2=b^2-1
(k+a)(k-a)=b^2+1

Then choose b such that b is even.
This implies b^2+1 is odd. If b^2+1 is a prime, then put k+a=b^2+1 and k-a=1. You will get k&a. If b^2+1 is not a prime, then choose k+a and k-a as its two odd factors. Solving, you get k & a.
As there is solution for all b>0 and b even, there are infinitely many solutions.

why should b be even?
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
643
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 40 ·
2
Replies
40
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
6
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K