Mathematical intro to Turing machines
47544
A mathematically mature introduction to Turing Machines and Computability [reference-request]
92024
Elementary number theory - prerequisites
129299
Fibonacci sequence and Euclidean algorithm's connection.
141895
Proving that a sequence is monotone
70266
1-1 correspondence between [0,1] and [0,1)
98372
Proof of the principle of backwards induction
25064
Proving the snake lemma without a diagram chase
66019
Revisited: Binomial Theorem: An Inductive Proof
158728
Using induction for an easy proof for formal languages
129163
Showing that every positive integer can be represented in this form
150385
The use of the Axiom of Choice in this proof of the sequence lemma
124901
Big-O notation and polynomials
21254
Formal language: Proving the reverse operation on a word through induction
114355
Speeding up the built-in Rudin-Shapiro and Thue-Morse sequence functions
121575
Meet-in-the-middle with checking complexity
73050
Explanation of the binomial theorem and the associated Big O notation
3217
Construction of uncountably many non-isomorphic linear (total) orderings of natural numbers