Program
History and progress transfer
Session summary
Homework — optional, outside the timer
Theory of all steps of the program by blocks. Open a topic to read it.
How a session goes
A session is 10–90 minutes: a warm-up on what you've learned, new steps with short theory and problems, practice. Each problem gives two tries: 100 points on the first, 60 on the second; after the second mistake the correct answer is shown. You move on in the program if 70 % of the problems are solved.
Problems with numbers are generated anew every time a step is repeated. A fractional answer can be entered with a comma, a point or as a fraction: 0,5, 0.5, 1/2. In Practice any topic is available without a timer.
About the course
Combinatorics (permutations, arrangements, combinations, Pascal’s triangle), classical probability, adding and multiplying probabilities, conditional probability and outcome trees, the Bernoulli formula, mean, median and mode, expected value in games. Grade 7–8 math is enough.
Course program: 26 lessons
Combinatorics: counting the options
- The sum and product rules
- Counting options: more
- Permutations and factorial
- Arrangements: order matters
- Checkpoint: counting options
Combinations and Pascal's triangle
- Combinations: order doesn't matter
- Permutations, arrangements or combinations?
- Pascal's triangle
- Checkpoint: combinations
Classical probability
- What probability is
- Probability: more
- The complementary event
- Checkpoint: classical probability
Operations with probabilities
- Adding probabilities
- Multiplying probabilities and independence
- Conditional probability
- Outcome trees
- Checkpoint: operations with probabilities
Repeated trials
- Bernoulli's formula
- The Bernoulli formula: more
- Checkpoint: repeated trials
Statistics and expected value
- Mean, median, mode, range
- Data summaries: more
- Expected value in games
- Expected value: more
- Checkpoint: statistics and expectation