Proof: Suppose the number is rational, and let where and are integers. Then , which can be written as

.

This contradicts the Fermat’s Last Theorem. QED

________________________________

ADDENDUM: This is a perfectly correct proof, although it is akin to killing a mosquito using a bazooka.

Which reminds me of a story that happened 12 years ago. I was in Form 5 and had been called to attend the IMO selection camp at UPM. At the time, I knew much less mathematics compared to the other students, so I wasn’t so sure whether I could make the team.

During an introductory lecture, Prof. Abu Osman gave us this problem:

Given positive integers such that . Prove that .

Being a wiseass, I immediately shouted out, “Solved it! Using the FLT we must have and we know that the smallest Pythagorean triple is so we’re done.”

One of the students in the camp quickly shot me down, and explained that we were not supposed to use any advanced results since we were doing high school contest problems. I protested, “but the FLT is true, isn’t it? Tanya prof kalau tak percaya.” He countered, “that is probably not the solution the author had in mind.” I then turned away and muttered in disgust, “who the hell cares what the author had in mind…” .

The intended solution goes like this: We can assume that . From the equation, we have

.

Since , we have , and the second bracket is . Therefore, , and so .

This entry was posted on Friday, December 31st, 2010 at 1:05 pm and is filed under Math and Science. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

Participate in the World's Largest Math Competition. Contest Day: 26 March 2015!

BEAVER INFORMATICS COMPETITION

To be held for the first time in Malaysia. Tentative: August 2015. Stay tuned!

Order My Books

Click on image for more details

My Amazon.com Wishlist

Books as gifts

SUHAIMI RAMLY

I am an entrepreneur and educator. I am based in Kuala Lumpur, Malaysia.

Many people know me as Bal. This is the nickname that I am stuck with since high school.

My day job is running two companies I founded in 2007: Aidan Corporation (an IT company) and ArdentEdu (an educational consulting company). Both companies are based in KL.

Since 2006, I have been training the Malaysian national team to the International Mathematical Olympiad (IMO). Also, I volunteer as an MIT Educational Counselor. I conduct interviews for MIT applicants from Malaysia.

I founded the Malaysian Informatics and Programming Society (MIPS) in 2011, to disseminate algorithmic thinking and programming education among high school students. MIPS run the Malaysian Computing Competition, which is open to all Malaysian school students, and the Malaysian Computing Olympiad, which is an invitation-only programming contest.

Since 2012, I am the Director of Kangaroo Math Competition (KMC) Malaysia. KMC is the largest math competition in the world, with more than 6 million participants annually.

To know more about me, click on the About page.

Welcome to my website. Don't forget to leave comments.

nice! =)

Sir, can you explain more on the last paragraph of the proof. Because I cant understand why the second bracket is >na^(n-1)?

change all the b and c to a.

Thanks.. Happy New Year!