HUNTERTUTORING

Review — Difficulty 3/10

View PDF →

Graph theory & combinatorics · Graph algorithms and structures

Review skills for this standard. Write answers where shown.

Together with a parent

1. How many subsets does a set with 9 elements have? ___ 2. Prove or disprove: if n is even, n² is even. 3. P(at least one head in 8 fair tosses) = ___

Written review

1. How many subsets does a set with 11 elements have? ___ 2. Prove or disprove: if n is even, n² is even. 3. P(at least one head in 10 fair tosses) = ___ 4. Write the recurrence aₙ = 10aₙ₋₁ with a₀ = 1 ___ 5. Graph with 12 vertices — minimum edges for connectivity? ___ 6. Convert 50₁₀ to base 11. = ___

_See printable PDF for diagram._

___________________________ ___________________________ ___________________________ ___________________________ ___________________________

Skills checklist

  • [ ] Applies counting principles correctly
  • [ ] Writes structured proofs

___________________________ ___________________________ ___________________________ ___________________________

For your personal study only. Copying, printing, screenshotting, or sharing this material is not permitted and may result in loss of access.