Skip to main content
-
Challenge 26: Product of a sequence with limit zero and a bounded sequence
-
Challenge 25: If the interleaving of two sequences converges to L, then both converge to L
-
Challenge 24: The sequence 1, -1, 1, -1,... is not convergent (2nd version)
-
Challenge 23: The constant sequence aₙ = L converges to L
-
Lean 4 for mathematicians: a teacher's guide
-
Challenge 22: Subsequences with different limits imply non-convergence
-
Challenge 21: Subsequences have the same limit as the sequence
-
Challenge 20: If aₙ → L and M is an upper bound of aₙ, then L ≤ M
-
Challenge 19: Convergent sequences are Cauchy sequences
-
Challenge 18: Convergence of the product of convergent sequences
-
Challenge 17: Convergent sequences are bounded
-
Challenge 16: For every n ∈ N, n(n+1)(2n+1) is divisible by 6
-
Challenge 15: There exists k ∈ ℕ such that, for all n ∈ ℕ, (n + k)² ≤ 2ⁿ⁺ᵏ
-
Challenge 14: For all n ∈ ℕ, 2n + 9 ≤ 2ⁿ⁺⁴
-
Challenge 13: Reverse triangle inequality: ||x| - |y|| ≤ |x - y|
-
Challenge 12: If aₙ → L, bₙ → M and L < M, then eventually aₙ < bₙ
-
Challenge 11: If aₙ converges to L, then |aₙ| converges to |L|
-
Challenge 10: If aₙ → L with L ≠ 0, then |aₙ| ≥ |L|/2 eventually
-
Challenge 9: Uniqueness of the limit
-
Challenge 8: Sequences with infinitely many large terms do not converge to small limits
-
Challenge 7: The composition of injective functions is injective
-
Challenge 6: If aₙ and cₙ converge to L and aₙ ≤ bₙ ≤ cₙ for all n, then bₙ converges to L
-
Challenge 5: 5²ⁿ - 2³ⁿ is divisible by 17
-
If a converges to L, then (∃ N)(∀ n ≥ N)[aₙ ≥ L - 1]
-
If aₙ converges to L and bₙ to M, then aₙ+bₙ converges to L+M.
-
Challenge 4: There are infinitely many prime numbers
-
Challenge 3: If aₙ converges to L, then 2aₙ converges to 2L
-
Challenge 2: The sequence 1, -1, 1, -1,... is not convergent
-
Challenge 1: The sequence 1/n converges to 0
-
Proof challenges in Lean 4
-
Praeclarum theorema
-
Nicomachus’s theorem
-
If uₙ tends to a y vₙ tends to b, then uₙvₙ tends to ab
-
If the limit of the sequence u(n) is a and c ∈ ℝ, then the limit of u(n)c is ac
-
If u(n) tends to a, then 7u(n) tends to 7a
-
Pigeonhole principle
-
If f ∘ f is bijective, then f is bijective
-
Brahmagupta-Fibonacci identity
-
Proofs of ∑k<n. 2ᵏ = 2ⁿ-1
-
Proofs of "∑i<n. i = n(n-1)/2"
-
Proofs of "If p > -1, then (1+p)ⁿ ≥ 1+np"
-
Proofs of 0³+1³+2³+3³+···+n³ = (n(n+1)/2)²
-
Proofs of a+aq+aq²+···+aqⁿ = a(1-qⁿ⁺¹)/(1-q)
-
Proofs of a+(a+d)+(a+2d)+···+(a+nd)=(n+1)(2a+nd)/2
-
Proofs of "0+1+2+3+···+n=n(n + 1)/2"
-
If f is continuous at a and the limit of u(n) is a, then the limit of f(u(n)) is f(a)
-
If x is the limit of u and y is an upper bound of u, then x ≤ y
-
If (∀ ε > 0, y ≤ x + ε), then y ≤ x
-
If x is the supremum of set A, then ((∀ y)[y < x → (∃ a ∈ A)[y < a]]
-
Equivalence of definitions of the Fibonacci function
-
Proofs of "flatten (mirror a) = reverse (flatten a)"
-
Proofs that the mirror function of binary trees is involutive
-
Equivalence of reverse definitions
-
Proofs of take n xs ++ drop n xs = xs
-
Proofs of the equality length(xs ++ ys) = length(xs) + length(ys)