Tag Archives: Fermat

Euler’s Theorem: proof by modular arithmetic

In my last post I explained the first proof of Fermat’s Little Theorem: in short, and hence . Today I want to show how to generalize this to prove Euler’s Totient Theorem, which is itself a generalization of Fermat’s Little … Continue reading

Posted in number theory, primes, proof | Tagged , , ,

Fermat’s Little Theorem: proof by modular arithmetic

In a previous post I explained four (mostly) equivalent statements of Fermat’s Little Theorem (which I will abbreviate “FlT”—not “FLT” since that usually refers to Fermat’s Last Theorem, whose proof I am definitely not qualified to write about!). Today I … Continue reading

Posted in number theory, primes, proof | Tagged , , | 8 Comments

Four formats for Fermat: correction!

In my previous post I explained three variants on Fermat’s Little Theorem, as well as a fourth, slightly more general variant, which it turns out is often called Euler’s Totient Theorem. Here’s what I said: If and is any integer, … Continue reading

Posted in number theory, primes | Tagged , , , , , , | 4 Comments

Four formats for Fermat

In my previous post I mentioned Fermat’s Little Theorem, a beautiful, fundamental result in number theory that underlies lots of things like public-key cryptography and primality testing. (It’s called “little” to distinguish it from his (in)famous Last Theorem.) There are … Continue reading

Posted in number theory, primes, proof | Tagged , , | 3 Comments

New baby, and primality testing

I have neglected writing on this blog for a while, and here is why: Yes, there is a new small human in my house! So I won’t be writing here regularly for the near future, but do hope to still … Continue reading

Posted in meta, number theory, primes | Tagged , , , | 10 Comments

Book review: Fermat’s Enigma

Fermat’s Enigma: The Epic Quest to Solve the World’s Greatest Mathematical ProblemSimon Singh After having it recommended to me several times, I finally picked up this book when I happened to see it at our favorite local used bookstore. I … Continue reading

Posted in books, open problems, proof, review | Tagged , , , | 10 Comments

Fun with repunit divisors: proofs

As promised, here are some solutions to the repunit puzzle posed in my previous post. (Stop reading now if you don’t want to see solutions yet!) Prove that every prime other than 2 or 5 is a divisor of some … Continue reading

Posted in iteration, modular arithmetic, number theory, pattern, primes, proof | Tagged , , , , | 1 Comment