Finding all prime solutions


by secretchord
Tags: prime, solutions
secretchord
secretchord is offline
#1
Feb23-13, 01:42 AM
P: 1
I want to solve equation [itex]x(x+1)+y(y+1)=z(z+1)[/itex] over primes. I found a solution x=y=2, z=3 and I have a hypothesis that this is the only solution over prime numbers, but I cannot prove it or find any other solution. Any hints, please?
Phys.Org News Partner Science news on Phys.org
SensaBubble: It's a bubble, but not as we know it (w/ video)
The hemihelix: Scientists discover a new shape using rubber bands (w/ video)
Microbes provide insights into evolution of human language
mfb
mfb is offline
#2
Feb23-13, 08:16 AM
Mentor
P: 10,854
I can confirm that there are no other solutions for x,y below 100 000.
The fact that 2 is in that one solution could be a hint that there are no other solutions, but I don't see a simple proof.

Python:
def isprime(n):
    for x in range(2, int(n**0.5)+1):
        if n % x == 0:
            return False
    return True

primes= []
for x in range(2,100000):
  if(isprime(x)):
    primes.append(x)

for x in primes:
  if(x%1000==1):
    print("computing: ",x)
  for y in primes:
    zz=x*(x+1)+y*(y+1)
    z=1/2*(1+4*zz)**0.5-1/2
    if(round(z,0)==z and isprime(z)):
      print(x,y,round(z,0))
coolul007
coolul007 is offline
#3
Feb23-13, 09:31 AM
coolul007's Avatar
P: 234
The terms A(A+1) are twice the sum of a series, dividing by 2 we get an equation that says: I need to sums of series that add to a third sum. This is about as far as I got, May not be much help but is a different view.


Register to reply

Related Discussions
Finding f inverse prime at a point c Calculus & Beyond Homework 1
Solutions to Polignac's and Twin Prime's Conjecture Linear & Abstract Algebra 20
Show -1 and +1 are only solutions to x^2 = 1 (mod p^2) for odd prime p. Calculus & Beyond Homework 3
Finding the aproximate integer Sqrt of a large prime General Math 2
finding y prime (derivative) Introductory Physics Homework 2