Thread Closed

prime numbers problem

 
Share Thread Thread Tools
Mar10-09, 05:29 PM   #1
 

prime numbers problem


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.
 
PhysOrg.com
PhysOrg
science news on PhysOrg.com

>> Front-row seats to climate change
>> Attacking MRSA with metals from antibacterial clays
>> New formula invented for microscope viewing, substitutes for federally controlled drug
Mar10-09, 06:28 PM   #2
 
Blog Entries: 3
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
 
Mar10-09, 06:47 PM   #3
 
Recognitions:
Gold Membership Gold Member
Science Advisor Science Advisor
Retired Staff Staff Emeritus
What if r divides the denominator?
 
Mar10-09, 06:54 PM   #4
 

prime numbers problem


What's r?
 
Mar10-09, 07:15 PM   #5
 
Recognitions:
Gold Membership Gold Member
Science Advisor Science Advisor
Retired Staff Staff Emeritus
Quote by Carl140 View Post
What's r?
Some number that happens to divide the denominator.
 
Mar10-09, 07:23 PM   #6
 
I still don't get it, sorry. Can you please explain a little bit more?
 
Mar10-09, 08:28 PM   #7
 
Blog Entries: 3
I think I have a solution but I won't post it without moderator approval.
 
Mar11-09, 12:16 AM   #8
 
Blog Entries: 3
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.
 
Mar11-09, 06:16 PM   #9
 
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.
 
Mar13-09, 03:26 PM   #10
 
Quote by Carl140 View Post
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
 
Mar13-09, 03:31 PM   #11
 
Quote by de_brook View Post
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
 
Thread Closed
Thread Tools


Similar Threads for: prime numbers problem
Thread Forum Replies
a prime number which equals prime numbers General Math 10
Where Fibonacci numbers surpass prime numbers Linear & Abstract Algebra 4
prime numbers use Linear & Abstract Algebra 3
A formula of prime numbers for interval (q; (q+1)^2), where q is prime number. Linear & Abstract Algebra 0
Prime Numbers in the Diophantine equation q=(n^2+1)/p and p is Prime Linear & Abstract Algebra 5