How many solutions does this equation have?

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 aa and bb, the number of unique positive integer solutions, (x,y)(x,y), to the following equation:

x2+ax=y2+byx^2+ax=y^2+by

Any insight would be much appreciated, and if necessary I can give further context for the question.

Thanks!

#NumberTheory

Note by Daniel Castle
2 years, 11 months ago

No vote yet
1 vote

  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:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \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"

Steven Chase - 2 years, 11 months ago

Hint: Multiply both sides by 4, then complete the square.

Hint 2: Rearrange them to get (2x+a)2(2y+b)2=a2b2 (2x+a)^2 - (2y + b)^2 = a^2-b^2. Factorize both sides.

Hint 3: Divide both sides by (ab)(a+b)(a-b)(a+b) .

Hint 4: 1=1×1=1×11 = 1\times1=-1\times-1.

Pi Han Goh - 2 years, 11 months ago
×

Problem Loading...

Note Loading...

Set Loading...