Brainlag Plus
Brainlag PlusProof and show that
Prove facts about consecutive, odd and even numbers and n² patterns, show identities, and explain why checking examples is not a proof.
The building blocks
A proof must work for every whole number, so use a letter:
- even: 2n; odd: 2n + 1
- consecutive numbers: n, n + 1, n + 2
- consecutive even numbers: 2n, 2n + 2, 2n + 4; consecutive odd numbers: 2n + 1, 2n + 3
- a multiple of k: kn
The rest of this lesson and its 9 practice questions are in Plus.
Screen 1 of 5, free to read.
- 9 exam-style questions, marked as you go, each with a worked solution
- Anything you get wrong is saved to your flashcards