Saturday Morning Breakfast Cereal Fourier Transform

calculate until

1000

Given an integer

n

, there is a smallest base for which the number has the most fours in its representations among all bases. Consider the function

fouriest(n)

that gives such a base for

n

.

Saturday Morning Breakfast Cereal calls this the "fouriest base" [1], and considers the act of moving from one base to another with more fours to be a "fourier transform".

This Demonstration calculates the fouriest base for all numbers less than a certain limit. Often

n-4

is the fouriest base for

n

.