Practice your course, one problem at a time
13,280 original problems in 70 university courses, with a hint whenever you get stuck.
Choose your courseChangeHide
Proof BlocksBeta
Or build a proof, one line at a time
Put the shuffled lines in order and leave out the impostors. Free, no account.
Let and be arbitrary odd integers. Prove that is even.
- Shuffled line 1
Adding these two representations gives .
- Shuffled line 2
Since is odd, choose an integer such that .
- Shuffled line 3
Since is odd, choose an integer such that .
- Shuffled line 4
Adding and regrouping gives .
Why this works
Proof Blocks grew out of Parsons problems, a studied way to learn programming. In published studies, students learned about as much from Proof Blocks as from writing proofs from scratch, in much less time.
- Parson's Programming Puzzles: A Fun and Effective Learning Tool for First Programming CoursesParsons and Haden, ACE 2006
- Proof Blocks: Autogradable Scaffolding Activities for Learning to Write ProofsPoulsen, Viswanathan, Herman and West, ITiCSE 2022
- Evaluating Proof Blocks Problems as Exam QuestionsPoulsen, Viswanathan, Herman and West, ICER 2021
- Efficiency of Learning from Proof Blocks Versus Writing ProofsPoulsen, Gertner, Cosman, West and Herman, SIGCSE 2023
Every Linear Algebra I problem on ProofAnvil also has a proof checked by Lean 4, a proof assistant.
How practice works
- Attempt
- Hint
- Worked solution
- Review
Try a problem
Try one problem first
No account needed. Your work stays on this page and is not saved.
For each positive integer , let . Prove from the definition of convergence that .
Show a hint
Proof: make a limit precise hintThe definition asks: given any , can you make for every sufficiently large ? First simplify .
Check against the worked answer
Let \(\varepsilon>0\). For every positive integer \(n\), \[ \left|\frac{n}{n+2}-1\right|=\left|\frac{-2}{n+2}\right|=\frac{2}{n+2}. \] Choose a positive integer \(N>2/\varepsilon\). Such an integer exists because the positive integers are unbounded. If \(n\ge N\), all denominators are positive, so \[ \frac{2}{n+2}\le\frac{2}{N+2}<\frac{2}{N}<\varepsilon. \] Thus, for every positive tolerance \(\varepsilon\), this \(N\), chosen for the given \(\varepsilon\), works for every \(n\ge N\). This is exactly the definition of \(a_n\to1\).
Your first month is free with code PROOFBLOCKS
First 200 people. No card or renewal. Optional membership: $19 USD monthly.
A free account opens the first unit of every course, with hints and solutions.