Category Archives: iteration

Mersenne primes and the Lucas-Lehmer test

Mersenne numbers, named after Marin Mersenne, are numbers of the form . The first few Mersenne numbers are therefore , , , , , and so on. Mersenne numbers come up all the time in computer science (for example, is … Continue reading

Posted in arithmetic, computation, famous numbers, iteration, modular arithmetic, number theory, primes | Tagged , , , , | 3 Comments

Differences of powers of consecutive integers, part II

If you spent some time playing around with the procedure from Differences of powers of consecutive integers (namely, raise consecutive integers to the th power, and repeatedly take pairwise differences until reaching a single number) you probably noticed the curious … Continue reading

Posted in arithmetic, iteration, pascal's triangle | Tagged , , , , | 3 Comments

u-tube

[This is the eighth in a series of posts on the decadic numbers (previous posts: A curiosity, An invitation to a funny number system, What does "close to" mean?, The decadic metric, Infinite decadic numbers, More fun with infinite decadic … Continue reading

Posted in computation, convergence, infinity, iteration, modular arithmetic, number theory, programming | Tagged , , , , | 2 Comments

A self-square number

[This is the seventh in a series of posts on the decadic numbers (previous posts: A curiosity, An invitation to a funny number system, What does “close to” mean?, The decadic metric, Infinite decadic numbers, More fun with infinite decadic … Continue reading

Posted in arithmetic, infinity, iteration, modular arithmetic, proof | Tagged , , , | 12 Comments

Fun with repunit divisors: more solutions

In Fun with repunit divisors I posed the following challenge: Prove that every prime other than 2 or 5 is a divisor of some repunit. In other words, if you make a list of the prime factorizations of repunits, every … Continue reading

Posted in arithmetic, iteration, modular arithmetic, number theory, primes, programming, proof, solutions | Tagged

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

m-bracelets

It is easy to generalize number bracelets to moduli other than 10—at each step, add the two previous numbers and take the remainder of the result when divided by m. Here are some pretty pictures I made of the resulting … Continue reading

Posted in arithmetic, fibonacci, iteration, pattern, pictures, sequences | 6 Comments