Worksheets — Set 5

Number theory · Diophantine equations and cryptography

Print and write your answers. Use diagrams to show thinking.

Warm-up

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) = ___

_See printable PDF for diagram._

Written practice

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

___________________________ ___________________________ ___________________________ ___________________________

More written practice

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

___________________________ ___________________________ ___________________________ ___________________________ ___________________________

Patterns and rules

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

_See printable PDF for diagram._

___________________________ ___________________________ ___________________________ ___________________________

Parent tip: Use trees or tables for counting