Skip to main content

Practice your course, one problem at a time

13,280 original problems in 70 university courses, with a hint whenever you get stuck.

Start training
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.

ProveSample claim

Let aa and bb be arbitrary odd integers. Prove that a+ba+b is even.

  1. Shuffled line 1

    Adding these two representations gives a+b=(2m+1)+(2n+1)a+b=(2m+1)+(2n+1).

  2. Shuffled line 2

    Since bb is odd, choose an integer nn such that b=2n+1b=2n+1.

  3. Shuffled line 3

    Since aa is odd, choose an integer mm such that a=2m+1a=2m+1.

  4. Shuffled line 4

    Adding and regrouping gives (2m+1)+(2n+1)=2(m+n)+1(2m+1)+(2n+1)=2(m+n)+1.

+3 more lines. Not all of them belong.

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.

  1. Parson's Programming Puzzles: A Fun and Effective Learning Tool for First Programming CoursesParsons and Haden, ACE 2006
  2. Proof Blocks: Autogradable Scaffolding Activities for Learning to Write ProofsPoulsen, Viswanathan, Herman and West, ITiCSE 2022
  3. Evaluating Proof Blocks Problems as Exam QuestionsPoulsen, Viswanathan, Herman and West, ICER 2021
  4. 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

  1. Attempt
  2. Hint
  3. Worked solution
  4. Review
Try a problem

Try one problem first

No account needed. Your work stays on this page and is not saved.

Proof: make a limit precise problem

For each positive integer nn, let an=n/(n+2)a_n=n/(n+2). Prove from the definition of convergence that an→1a_n\to1.

Show a hintProof: make a limit precise hint

The definition asks: given any ε>0\varepsilon>0, can you make ∣an−1∣<ε|a_n-1|<\varepsilon for every sufficiently large nn? First simplify ∣an−1∣|a_n-1|.

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.

Get your free month