Linear Recurrences
Linear homogeneous recurrence relations with constant coefficients and finite order
[Read More]
-
-
Inverse Function Order Summation
Here are two ideas that appear often. [Read More] -
Farey Sequence
Farey sequence [Read More] -
Lambek Moser
Euclid 2011, Problem 9. In this problem they gave us: [Read More] -
Post's correspondence problem
A type of problem that can be attempted at any age
A word is a concatenation of $0$ or more letters from a finite alphabet. Consider the alphabet ${a,b}$ consisting of the letters $a$ and $b$. Examples of words on this alphabet are $a, b, aab, babaa$ and the empty word $``”$, which is often denoted by $\epsilon$. Words can be concatenated. This means putting... [Read More]