- algorithm algorithms approximation arithmetic art Babylonian beauty binary binomial coefficients book review bracelets carnival Carnival of Mathematics change chess chess board combinatorics consecutive cookies counting decadic decimal derivatives diagrams divisibility divisors education expansion factorization fibonacci floor foundations fractal fractions game games GIMPS graph graphs Haskell history humor hyperbinary idempotent integers integral interactive intuition irrational irrationality Ivan Niven latex logic Mersenne metric multiplication negative notation number numbers permutations pi prime primes programming proof puzzle rectangles repunit review sequence squares triangular video visualization
### Blogroll

### Fun

### Reference

### Categories

- algebra (14)
- arithmetic (35)
- books (25)
- calculus (6)
- challenges (46)
- combinatorics (6)
- complex numbers (3)
- computation (30)
- convergence (9)
- counting (28)
- famous numbers (38)
- fibonacci (14)
- fractals (12)
- games (17)
- geometry (27)
- golden ratio (8)
- group theory (3)
- humor (6)
- induction (7)
- infinity (17)
- iteration (15)
- links (70)
- logic (6)
- meta (37)
- modular arithmetic (10)
- number theory (47)
- open problems (11)
- paradox (1)
- pascal's triangle (8)
- pattern (54)
- people (19)
- pictures (28)
- posts without words (3)
- primes (23)
- probability (3)
- programming (15)
- proof (42)
- puzzles (10)
- recursion (8)
- review (17)
- sequences (26)
- solutions (24)
- teaching (9)
- trig (3)
- Uncategorized (1)
- video (18)

### Archives

- May 2014 (1)
- December 2013 (1)
- October 2013 (1)
- July 2013 (1)
- June 2013 (1)
- May 2013 (1)
- April 2013 (3)
- March 2013 (3)
- February 2013 (2)
- January 2013 (5)
- December 2012 (3)
- November 2012 (4)
- October 2012 (5)
- September 2012 (1)
- August 2012 (4)
- July 2012 (1)
- June 2012 (6)
- May 2012 (2)
- April 2012 (3)
- March 2012 (1)
- February 2012 (4)
- January 2012 (5)
- December 2011 (1)
- November 2011 (7)
- October 2011 (4)
- September 2011 (6)
- July 2011 (2)
- June 2011 (4)
- May 2011 (5)
- April 2011 (2)
- March 2011 (4)
- February 2011 (1)
- January 2011 (1)
- December 2010 (1)
- November 2010 (4)
- October 2010 (2)
- September 2010 (1)
- August 2010 (1)
- July 2010 (1)
- June 2010 (2)
- May 2010 (3)
- April 2010 (1)
- February 2010 (6)
- January 2010 (3)
- December 2009 (8)
- November 2009 (7)
- October 2009 (3)
- September 2009 (3)
- August 2009 (1)
- June 2009 (4)
- May 2009 (5)
- April 2009 (4)
- March 2009 (2)
- February 2009 (1)
- January 2009 (7)
- December 2008 (1)
- October 2008 (2)
- September 2008 (7)
- August 2008 (1)
- July 2008 (1)
- June 2008 (1)
- April 2008 (5)
- February 2008 (4)
- January 2008 (4)
- December 2007 (3)
- November 2007 (12)
- October 2007 (2)
- September 2007 (4)
- August 2007 (3)
- July 2007 (1)
- June 2007 (3)
- May 2007 (1)
- April 2007 (4)
- March 2007 (3)
- February 2007 (7)
- January 2007 (1)
- December 2006 (2)
- October 2006 (2)
- September 2006 (6)
- July 2006 (4)
- June 2006 (2)
- May 2006 (6)
- April 2006 (3)
- March 2006 (6)

### Meta

# Category Archives: modular arithmetic

## 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 lehmer, lucas, Mersenne, prime, test
3 Comments

## Visualizing Pascal’s triangle remainders

In a comment on my previous post, Juan Valera mentioned something about visualizing multiples of prime numbers in Pascal’s Triangle: In college, there was a poster with different Pascal Triangles, each of them highlighting the multiples of different prime numbers. … Continue reading

Posted in fractals, modular arithmetic, pascal's triangle, pattern, pictures
Tagged color, diagrams, visualization
15 Comments

## Fibonacci multiples, solution 1

In a previous post, I challenged you to prove If evenly divides , then evenly divides , where denotes the th Fibonacci number (). Here’s one fairly elementary proof (though it certainly has a few twists!). Pick some arbitrary and … Continue reading

Posted in fibonacci, modular arithmetic, number theory, pattern, pictures, proof, sequences
Tagged divisibility, fibonacci, proof, remainders
5 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 decadic, Haskell, idempotent, streaming, u
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 decadic, idempotent, self, square
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 repunit

## 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 divisibility, Fermat, prime, proof, repunit
1 Comment