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

### Fun

### Reference

### Categories

- algebra (43)
- arithmetic (60)
- books (28)
- calculus (7)
- challenges (51)
- combinatorics (12)
- complex numbers (6)
- computation (42)
- convergence (9)
- counting (32)
- famous numbers (48)
- fibonacci (18)
- fractals (13)
- games (25)
- 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 (71)
- open problems (11)
- paradox (1)
- pascal's triangle (8)
- pattern (82)
- people (20)
- pictures (60)
- posts without words (15)
- primes (35)
- probability (6)
- programming (17)
- proof (66)
- puzzles (11)
- recursion (12)
- review (19)
- sequences (28)
- solutions (28)
- teaching (14)
- trig (3)
- Uncategorized (6)
- video (19)

### Archives

- 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: computation

## Golden numbers are Fibonacci

This post is fourth in a series, proving the curious fact that is a Fibonacci number if and only if one (or both) of or is a perfect square; we call numbers of this form golden numbers. Last time, I … Continue reading

Posted in arithmetic, computation, famous numbers, fibonacci, proof
Tagged Cassini, fibonacci, formula, lucas, square, test
2 Comments

## Fibonacci numbers are golden

Recall that a “golden number” (this is not standard terminology) is a number such that one (or both) of or is a perfect square. In this post, I’ll explain Gessel’s proof that every Fibonacci number is golden. First, we need … Continue reading

Posted in arithmetic, computation, famous numbers, fibonacci, proof
Tagged Cassini, fibonacci, formula, lucas, square, test
1 Comment

## Testing Fibonacci numbers: the proofs

In my last post I stated this surprising theorem: is a Fibonacci number if and only if one of is a perfect square. If one of is a perfect square, then let’s say that is a “golden number” (a nod, … Continue reading

Posted in arithmetic, computation, famous numbers, fibonacci, proof
Tagged fibonacci, formula, square, test
1 Comment

## Testing Fibonacci numbers

From a recent post on Brian Hayes’ blog, bit-player, I learned the following curious fact: is a Fibonacci number if and only if either or is a perfect square. Recall that the Fibonacci numbers begin where each number is the … Continue reading

Posted in arithmetic, computation, famous numbers, fibonacci
Tagged fibonacci, formula, square, test
8 Comments

## M74207281 is prime!

I’m a bit late to the party, but the Great Internet Mersenne Prime Search has recently announced a newly verified prime number, , with a whopping 22,338,618 decimal digits! This is now the largest known prime number (though of course … 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 6: The Proof Begins

Today we’re going to start in on proving the Lucas-Lehmer test. Yesterday we saw how, given a Mersenne number , we can define a sequence of integers , with the claim that if and only if is prime. We’re going … Continue reading

Posted in algebra, arithmetic, computation, number theory, primes
Tagged lehmer, lucas, MaBloWriMo, Mersenne, omega, prime, proof, test
1 Comment