prime numbers problem

**Carl140** · Mar10-09, 06:29 PM

Hello,

I can't get this small contest problem. How do you solve this kind of problem?

Let p and q be prime numbers such that (p^2+q^2)/(p+q) is an integer.
Prove p=q.

**John Creighto** · Mar10-09, 07:28 PM

I can't figure it out.

p^2+q^2=n1*(p+q)

p(p-n1)+q(q-n1)=0

(p-n1)=n2*(q-n1)

p-n1+n2 n1=n2 q

**Hurkyl** · Mar10-09, 07:47 PM

What if r divides the denominator?

**Carl140** · Mar10-09, 07:54 PM

What's r?

**Hurkyl** · Mar10-09, 08:15 PM

Originally Posted by Carl140

What's r?

Some number that happens to divide the denominator.

**Carl140** · Mar10-09, 08:23 PM

I still don't get it, sorry. Can you please explain a little bit more?

**John Creighto** · Mar10-09, 09:28 PM

I think I have a solution but I won't post it without moderator approval.

**John Creighto** · Mar11-09, 01:16 AM

Okay, here is my hint. What theorem might be helpful to show what integer values of p+q will satisfy the following equation?

(p+q)^2-m(p+q)-2pq=0

Where m is an integer, p is prime and q is prime.

**Kurret** · Mar11-09, 07:16 PM

I got it.
Hint: Use the conjugate rule.

For solution

Spoiler

(p^2+q^2)/(p+q)=(p^2-q^2)+2q^2)(p+q)=p-q+q^2/((p+q)/2)

but q^2 is only divisible by 1,q,q^2. (p+q)/2 is obv not equal to 1. if it is equal to q, p=q and if it is equal to q^2, q|p and then p=q since they are prime.

**de_brook** · Mar13-09, 04:26 PM

Originally Posted by Carl140

Hello,

I can't get this small contest problem. How do you solve this kind of problem?

Let p and q be prime numbers such that (p^2+q^2)/(p+q) is an integer.
Prove p=q.

This statement can be more generalised as follows;

Let p and q be prime numbers then (p^2+q^2)/(p+q) is a prime if and only if p = q

**de_brook** · Mar13-09, 04:31 PM

Originally Posted by de_brook

This statement can be more generalised as follows;

Let p and q be prime numbers then (p^2+q^2)/(p+q) is a prime if and only if p = q

the prime is p = q