Tags » Primes

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… 648 more words

Number Theory

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… 186 more words

Number Theory

Repunit prime

In the United States, today is abbreviated 10/31. Define the th repunit number as


a base-10 number consisting of consecutive 1s. For example,

, 21 more words


Engaging students: Finding prime factorizations

In my capstone class for future secondary math teachers, I ask my students to come up with ideas for engaging their students with different topics in the secondary mathematics curriculum. 730 more words


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. 643 more words

Number Theory

The convergence of prime sums and their corresponding inequalities. Pt 1

The First Sum

Recently I have been looking to practice some of the skills I learnt from the IB calculus option textbook, and I found… 548 more words