A sweetener problem in Number Theory for RMO

Posted by

0

(I picked the following problem from Prof Titu Andreescu’s literature).

Problem:

Let p be a prime greater than 5. Prove that p-4 cannot be the fourth power of an integer.

Proof:

(By contradiction)

Assume that p-4=q^{4} for some positive integer q. Then, p=q^{4}+4 and q>1. We obtain

p=q^{4}+4q^{2}+4-4q^{2}=(q^{2}+2)^{2}-(2q)^{2}=(q^{2}-2q+2)(q^{2}+2q+2), which is a product of two integers greater than 1, contradicting the fact that p is a prime. (Note that for p>5, q>1, and so (q-1)^{2}=q^{2}-2q+1>0, or q^{2}-2q+2>1.

(Ref: 104 Number Theory Problems From the Training of the USA IMO Team by Titu Andreescu, Dorin Andrica, Zumin Feng).

More sweeteners in number theory coming soon,

Nalin Pithwa

 

 

 

 

 

 

Leave a Reply

Fill in your details below or click an icon to log in:

Gravatar
WordPress.com Logo

You are commenting using your WordPress.com account. ( Log Out /  Change )

Google photo

You are commenting using your Google account. ( Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. ( Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. ( Log Out /  Change )

Cancel

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.