Category Archives: arithmetic

Factorization diagram card redesign: feedback welcome!

After getting a printed set of factorization diagram cards, I decided there were a few design tweaks I wanted to make. I’ve gone through a few iterations and I think they are definitely better now. Here are some representative samples … Continue reading

Posted in arithmetic, counting, pattern, pictures, primes, teaching | Tagged , , | 6 Comments

The route puzzle

While poking around some old files I came across this puzzle: (Click for a larger version.) I didn’t make it, and I have no idea where I got it from (do you know?). But in any case, wherever it comes … Continue reading

Posted in arithmetic, challenges, number theory, proof, puzzles | Tagged , , , , , , | 7 Comments

The Recamán sequence

I recently learned about a really interesting sequence of integers, called the Recamán sequence (it’s sequence A005132 in the Online Encyclopedia of Integer Sequences). It is very simple to define, but the resulting complexity shows how powerful self-reference is (for … Continue reading

Posted in arithmetic, recursion, sequences | Tagged , , , , | 5 Comments

Factorization diagram cards!

I’ve designed a set of factorization diagram cards and had them actually printed. This is one of the first times in my life when I have caused Actual Physical Objects to be created (other than using a printer I guess) … Continue reading

Posted in arithmetic, counting, pattern, pictures, primes, teaching, video | Tagged , , | 5 Comments

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 , , , , , | 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 , , , , , | 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 , , , | 1 Comment