Question

In: Advanced Math

find the integer solutions to A^2 + 2*B^2 = C^2?

find the integer solutions to A^2 + 2*B^2 = C^2?

Solutions

Expert Solution

the equation have an infinite number of solutions in positive integers (b=0 isn't interesting); we can find them all, using the same method as used to find all Pythagorean triples. Firstly note we can assume a,b,c have no common factor; if they did, we could divide them out. Conversely, any solution admits further solutions of the form ka,kb,kc for any positive integer k. Furthermore, if any two of a,b,c have a common factor, then it's also a factor of the third. So let's assume the values are pairwise coprime.

2b2=c2−a2=(c−a)(c+a)

The two factors on the right-hand side have a difference of 2a so are of the same parity. They cannot be both odd, since their product is even. Also if the two factors had any common factor, it would also be a factor of their common difference 2a. If any common prime factor of (c−a) and (c+a)divided a, then it would also divide (c−a)+a=c, contrary to assumption. So both terms on the right-hand side are even, and they have no common factor other than 2. This means one factor must be the square of an even number, let's call it m, and the other is twice the square of an odd number, let's call that n.

So we have the following solutions for any even m and odd n, with (m,n)=1

a=|m2−2n2|/2
b=mn
c=(m2+2n2)/2

with the absolute value needed in a depending on which term in the right-hand side product is which. These are the primitive solutions; any integer multiple of them will also be a solution.

m=2,n=1 gives the easy solution a=1,b=2,c=3 Coprime values of different parity give infinitely many others. m=4,n=3 gives the solution 12+2⋅122=172

Note you can also generate an infinite number of solutions with a=1, and in fact c/b are the alternate continued fraction convergents of √2, 3/2,17/12,99/70,…3/2,17/12,99/70,… - however, for any fixed b or c, there are only finitely many solutions (perhaps zero for some values).


Related Solutions

Write a Diophantine Equation program in C++. Find integer solutions to Ax + By = GCD...
Write a Diophantine Equation program in C++. Find integer solutions to Ax + By = GCD (A, B) Ex: a = 3, b = 6, c = 9 a = 2, b = 5 , c = 1
Find all integer solutions to the equation: a) 105x + 83y = 1 b) 105x +...
Find all integer solutions to the equation: a) 105x + 83y = 1 b) 105x + 83y = 8
How do you find all solutions to: a^2+2b^2=c^2 ?
How do you find all solutions to: a^2+2b^2=c^2 ?
roblem 3 Find the solutions to the general cubic a x^3 +b x^2+c x +d=0 and...
roblem 3 Find the solutions to the general cubic a x^3 +b x^2+c x +d=0 and the solutions to the general quartic a x^4+b x^3+c x^2+d x+e=0. Remember to put a space between your letters. The solutions to the general quartic goes on for two pages it is a good idea to maximize your page to see it. It is a theorem in modern abstract algebra that there is no solution to the general quintic in terms of radicals. Please...
Problem 3 Find the solutions to the general cubic a x^3 +b x^2+c x +d=0 and...
Problem 3 Find the solutions to the general cubic a x^3 +b x^2+c x +d=0 and the solutions to the general quartic a x^4+b x^3+c x^2+d x+e=0. Remember to put a space between your letters. The solutions to the general quartic goes on for two pages it is a good idea to maximize your page to see it. It is a theorem in modern abstract algebra that there is no solution to the general quintic in terms of radicals.
This is a combinatorics problem Suppose we wish to find the number of integer solutions to...
This is a combinatorics problem Suppose we wish to find the number of integer solutions to the equation below, where 3 ≤ x1 ≤ 9, 0 ≤ x2 ≤ 8, and 7 ≤ x3 ≤ 17. x1 + x2 + x3 = r Write a generating function for this problem, and use it to solve this problem for r = 20.
Find all solutions to the following equations: (a) √2x − 2 = √x + 1 (b)...
Find all solutions to the following equations: (a) √2x − 2 = √x + 1 (b) x4 − 5x2 + 6 = 0 (c) |3x − 7| < 5 (d) |ax + b| ≥ c Explain step by step please Suppose 4 is a right triangle with leg-lengths a and b and hypotenuse c. Find the missing side: (a) a = 3, b = 4, c =? (b) a = 12, c = 13, b =? (c) a = 6,...
Find the value of a : b : c : d, if a : b = 2 : 3, b : c = 4 : 5 and c : d = 6 : 7.
Find the value of a : b : c : d, if a : b = 2 : 3, b : c = 4 : 5 and c : d = 6 : 7.
Find the general form of all (integer) solutions for the equation 22x+48y+4z = 18.
Find the general form of all (integer) solutions for the equation 22x+48y+4z = 18.
Show that he gcd of 63 and 40 is 1 and find all integer solutions: 63s...
Show that he gcd of 63 and 40 is 1 and find all integer solutions: 63s + 40t = 1. Use the Euclidean algorithm to find the gcd. Then back solve to find s and t. To get full credit, use the format shown in the post below titled Bezout's Theorem. (See the example where we find the gcd of 18 and 5.) Bézout's theorem says "If  d is the gcd of m and n then we can find integers s...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT