While studying a particular sequence of numbers, I came across the following equation. I am looking to find, in terms of two positive integer constants and , the number of unique positive integer solutions, , to the following equation:
Any insight would be much appreciated, and if necessary I can give further context for the question.
Thanks!
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
I don't know about the general case, where x and y can go from negative infinity to positive infinity. But here's an algorithm for determining the number of (x,y) solution pairs for x between two finite integer numbers (p,q).
0) Constants (a,b) are given as inputs. (p,q) is a predetermined range for x.
1) Evaluate all integer x values in range (p,q)
2) For each x, substitute into the left side and solve the resulting quadratic for y
3) Store (x,y) pairs corresponding to real integer y solutions.
Not very insightful, but you said "any insight"
Hint: Multiply both sides by 4, then complete the square.
Hint 2: Rearrange them to get (2x+a)2−(2y+b)2=a2−b2. Factorize both sides.
Hint 3: Divide both sides by (a−b)(a+b).
Hint 4: 1=1×1=−1×−1.