Language Tactics Playground Academy Problems Pricing

All problemsProblems LeaderboardRanking My progressProgress

Courses →Get thePass · €10

42. Infinitely many primes

HardChallengeProofAcademy Pass

Euclid’s theorem: above every number there is a prime.

number theory strong induction classic theorems

Opening the problem…

Similar problems

44. The square root of 2 is irrational Hard
43. Every number has a prime factor Hard
33. Cantor’s diagonal argument Medium

← 41. Trapping rain water 43. Every number has a prime factor →

A comprehensive learning platform for the Lean 4 programming language and theorem prover.

Lean 4 on GitHub

Learn

Language Guide
Tactics Reference
Lean Playground
Interactive Academy
Lean Problems
Proof Stories
Pricing

Community

Community Forum
Lean Zulip
Official Lean Website
Mathlib Documentation

Site

About
Contact
Editorial Policy
Your Account

Policies

Privacy Policy
Terms of Use
Withdraw from contract
Legal Notice

Built for the Lean community. Not officially affiliated with the Lean FRO. Lean is a trademark of Lean FRO, LLC.