Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Possible Duplicate:
To show that Fermat number $F_{5}$ is divisible by $641$.

How to prove that $641$ divides $2^{32}+1$? What the technical way will be for this question? I want to teach it to my students. Any help. :-)

share|cite|improve this question

marked as duplicate by Asaf Karagila, Arturo Magidin, Ross Millikan, Byron Schmuland, Zev Chonoles Jun 8 '12 at 19:27

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

This has already been asked in this math.SE question (and therefore should be closed as a duplicate). – Zev Chonoles Jun 8 '12 at 18:14
@ZevChonoles: I didn't know that. Thank you. – Basil R Jun 8 '12 at 18:17
In a nutshell. Look at the congruences: $$\eqalign{ & {2^{16}} \equiv 65536 \equiv 154\bmod 641 \cr & {2^{32}} \equiv {154^2} \equiv - 1\bmod 641 \cr & {2^{32}} + 1 \equiv 0\bmod 641 \cr} $$ – Pedro Tamaroff Jun 8 '12 at 18:26
up vote 5 down vote accepted

In light of Peter's comment:

we have:


$2^4=16, 2^8=256,$



the rest is very easy.

share|cite|improve this answer
Nicely done $+1\quad \ddot\smile\quad$ – amWhy Mar 6 '13 at 0:50

Not the answer you're looking for? Browse other questions tagged or ask your own question.