- algorithm approximation art bar beauty binary binomial coefficients book cards carnival Carnival of Mathematics chocolate circle complex convolution counting decadic decimal diagrams Dirichlet factorization fibonacci fractal game games graph groups Haskell hyperbinary idempotent integers interactive irrational Ivan Niven Lagrange lehmer lucas MaBloWriMo making Mersenne moebius mu multiplication nim notation number numbers objects omega order pi prime primes primitive problem programming proof puzzle rectangles review roots sequence square strategy subgroups subset sum symmetry test triangular unit unity video visualization X
### Blogroll

### Fun

### Reference

### Categories

- algebra (46)
- arithmetic (63)
- books (29)
- calculus (7)
- challenges (52)
- combinatorics (12)
- complex numbers (6)
- computation (42)
- convergence (9)
- counting (32)
- famous numbers (48)
- fibonacci (18)
- fractals (13)
- games (28)
- geometry (56)
- golden ratio (8)
- group theory (26)
- humor (6)
- induction (7)
- infinity (19)
- iteration (24)
- links (74)
- logic (6)
- meta (40)
- modular arithmetic (24)
- number theory (72)
- open problems (11)
- paradox (1)
- pascal's triangle (8)
- pattern (85)
- people (21)
- pictures (63)
- posts without words (18)
- primes (35)
- probability (6)
- programming (17)
- proof (67)
- puzzles (11)
- recursion (12)
- review (20)
- sequences (28)
- solutions (28)
- teaching (14)
- trig (3)
- Uncategorized (6)
- video (19)

### Archives

- April 2017 (6)
- March 2017 (5)
- February 2017 (4)
- January 2017 (3)
- December 2016 (4)
- November 2016 (6)
- October 2016 (6)
- September 2016 (2)
- August 2016 (5)
- July 2016 (2)
- June 2016 (4)
- May 2016 (4)
- April 2016 (2)
- March 2016 (3)
- February 2016 (9)
- January 2016 (8)
- December 2015 (5)
- November 2015 (29)
- August 2015 (3)
- June 2015 (2)
- April 2015 (1)
- 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: iteration

## The MacLaurin series for sin(x)

In my previous post I said “recall the MacLaurin series for :” Since someone asked in a comment, I thought it was worth mentioning where this comes from. It would typically be covered in a second-semester calculus class, but it’s … Continue reading

## MaBloWriMo 16: Recap and outline

We have now established all the facts we will need about groups, and have incidentally just passed the halfway point of MaBloWriMo. This feels like a good time to take a step back and outline what we’ve done so far … Continue reading

Posted in algebra, arithmetic, computation, famous numbers, group theory, iteration, modular arithmetic, number theory, primes
Tagged groups, lehmer, lucas, MaBloWriMo, Mersenne, omega, prime, proof, summary, test
2 Comments

## MaBloWriMo 8: definition of s and mod

I was a little unsatisfied with my proof yesterday since I don’t think I did a very good job explaining how enters into things. When sinuheancelmo asked a question which seemed to show confusion on exactly that point, I figured … Continue reading

Posted in arithmetic, iteration, modular arithmetic, number theory
Tagged definition, lehmer, lucas, MaBloWriMo, Mersenne, prime, proof, test

## MaBloWriMo 7: s via omega

Yesterday, I challenged you to prove that where , , and the are defined by and . The proof is by induction on . The base case is just arithmetic: Now suppose that we already know the statement holds for … Continue reading

Posted in algebra, arithmetic, iteration, modular arithmetic, number theory
Tagged induction, lehmer, lucas, MaBloWriMo, Mersenne, prime, proof, test
11 Comments

## MaBloWriMo 5: The Lucas-Lehmer Test

We now know that can only be prime when is prime; but even when is prime, sometimes is prime and sometimes it isn’t. The Lucas-Lehmer test is a way to tell us whether is prime, for any prime . The … Continue reading

Posted in algebra, arithmetic, computation, famous numbers, iteration, modular arithmetic, number theory, primes
Tagged lehmer, lucas, MaBloWriMo, Mersenne, prime, proof, test
3 Comments

## MaBloWriMo 4: not all prime-index Mersenne numbers are prime

Over the past couple days we saw that if is composite, then is also composite. Equivalently, this means that if we want to be prime, then at the very least must also be prime. But at this point there is … Continue reading

Posted in algebra, arithmetic, computation, famous numbers, iteration, modular arithmetic, number theory, primes
Tagged lehmer, lucas, MaBloWriMo, Mersenne, prime, proof, test
1 Comment

## MaBloWriMo 3: Mersenne composites in binary

Yesterday we saw that must be composite, since . Today I’ll talk about a somewhat more intuitive way to see this. Recall that we can write numbers in base 2, or “binary”, using the digits 0 and 1 (called “bits”, … Continue reading

Posted in algebra, arithmetic, computation, famous numbers, iteration, modular arithmetic, number theory, primes
Tagged lehmer, lucas, MaBloWriMo, Mersenne, prime, proof, test
1 Comment