All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Integer Pair and Infinite Puzzle (Posted on 2015-09-20)
Each of p and q is a positive integer with gcd (p,q) =1 and the equation:
(x+p)3 = q*x has exactly three distinct integer solutions in x.

Do there exist infinitely many pairs (p,q) satisfying the given conditions? Give reasons for your answer.

 No Solution Yet Submitted by K Sengupta No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 Solution | Comment 1 of 2
This was a tough problem.  I'm not sure I can even explain how I got to my solution but here is the form of all solutions I found:
Consider the left and right sides of the equations as functions and shift them to the right by p:
x3 = q*(x-p)
this will make things a little simpler.  Any solutions to this equation can just be shifted back, so the number of solutions is unchanged as is the number of pairs (p,q).

There are an infinite number pairs.
For any integer n, let p=n(n+1) = n²+n
and q = (n²+n+1)³
These are clearly relatively prime.

The equation becomes x=(n²+n+1)³(x-n²-n)

The three solutions are as follows:
If x=(n²+n+1)
(n²+n+1)³=(n²+n+1)³((n²+n+1)-n²-n)

If x=n(n²+n+1)=(n³+n²+n)
n³(n²+n+1)³=(n²+n+1)³(n³+n²+n-n²-n)

If x= -(n+1)(n²+n+1)=-n³-2n²-2n-1
-(n+1)³(n²+n+1)³=(n²+n+1)³(-n³-2n²-2n-1-n²-n)

For example if n=5
p=5*6=30
q=31³=29791
the equation
x³=29791(x-30)
has solutions
x=31, x=155, x=-186

Corresponding to the untranslated equation
(x+30)³=29791x
having solutions 1, 125, -216

Hmmm... This is the first I noticed those cubes so there may be something simpler going on than I found.

 Posted by Jer on 2015-09-22 13:39:31
Please log in:
 Login: Password: Remember me: Sign up! | Forgot password

 Search: Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information