Simon’s Fibonacci Music Pesano Periods

Simon writes: I have composed a piece of music based on the Fibonacci sequence, using modular arithmetic (I assigned numbers from 0-6, the remainders after ÷ by 7, to notes … Continue reading Simon’s Fibonacci Music Pesano Periods

Fun with Brilliant’s Computer Courses

“Mom, how long would it take a supercomputer running at 10^15 additions per second to calculate the 1000th Fibonacci number?” Simon has learned this problem from the new course he … Continue reading Fun with Brilliant’s Computer Courses

Simon’s proof that every Fibonacci number is a sum of its neighbouring Lucas numbers divided by 5

This has probably been proven before, but Simon likes to come up with his own proof. Here he uses proof by induction, that is a proof that proves that some … Continue reading Simon’s proof that every Fibonacci number is a sum of its neighbouring Lucas numbers divided by 5

A Cool Number Guessing Trick! Or Brown’s Criterion in Processing

This is a fun number guessing trick, based on powers of 2 and the Fibonacci sequence, that even little kids can enjoy. You don’t have to know anything about the … Continue reading A Cool Number Guessing Trick! Or Brown’s Criterion in Processing

Simon’s Fibonacci function and Fibonacci counter in p5.js

Simon came up with this Fibonacci function while taking a walk downtown: f(0) = 0 f(1) = 1 f(n) = f(n-1)+f(n-2) When we got home, he used the function to … Continue reading Simon’s Fibonacci function and Fibonacci counter in p5.js