Recursive Probability (and a Shortcut!) [CleverMath Combo 150]

preview_player
Показать описание
Presenting an interesting probability problem that has a standard long way to solve it and a short clever way!
  1. Cyclic Squares
  2. Mathematics
  3. Probability (Measurement System)
  4. Recursion
Рекомендации по теме
Recursive Probability (and 0:09:01

Recursive Probability (and a Shortcut!) [CleverMath Combo 150]

5 Simple Steps 0:21:03

5 Simple Steps for Solving Any Recursive Problem

Probability: Recursive Probability 0:13:34

Probability: Recursive Probability

Recursive Formulas For 0:02:54

Recursive Formulas For Sequences

Recursive probability for 0:14:07

Recursive probability for competitive mathematics

Permutation and Combination 0:00:30

Permutation and Combination #mathsscam #shorts #youtubeshorts #trending

The coin flip 0:04:23

The coin flip conundrum - Po-Shen Loh

Recursion - Mastering 0:28:41

Recursion - Mastering AMC 10/12

Recursive Probabilities | 0:10:48

Recursive Probabilities | QOTD 04/02/21

Quant Interview Puzzle: 0:22:28

Quant Interview Puzzle: Expected Tosses for 3 Consecutive Heads - Recurrence & Markov Chains

Shortcut + GATE 0:05:17

Shortcut + GATE 2004 | Solved Problems | GateAppliedcourse

How to Develop 0:11:35

How to Develop Recursion Formula for Binomial Distribution

When mathematicians get 0:00:37

When mathematicians get bored (ep1)

How REAL Men 0:00:35

How REAL Men Integrate Functions

Recursive Step Counting 0:21:51

Recursive Step Counting - Mastering AMC 8

Recurring Probabilities | 0:09:27

Recurring Probabilities | AIME II 2018 Problem 13

Binomial Distribution: Recursive 0:08:39

Binomial Distribution: Recursive Representation

Finding the Next 0:00:34

Finding the Next Number in the Series | Math Riddle | JusticeTheTutor #math #maths #shorts

functions explained in 0:00:21

functions explained in 17 seconds! (Algebra 1)

Recursive Counting 0:07:47

Recursive Counting

How to Solve 0:05:59

How to Solve a Second Order Linear Homogeneous Recurrence Relation(Distinct Real Roots Case)

Section 9.4 Notes 0:07:09

Section 9.4 Notes - Recursive Formulas

Recursive sum implementation 0:05:15

Recursive sum implementation (how to implement a recursive function)

How to determine 0:01:49

How to determine the rule for a sequence

Комментарии
Автор

I used the state-based solution that also happened to be the official one.
This is so much nicer!

edgarwang
Автор

why is A separated from BA in the end game ?

pengyu
Автор

i came here to find out how to do the calculation and then found out at 4:12 that it was skipped :(
i know you can "just find the value of p", but i was hoping there was a generic way to do this because i'm trying to solve a similar case which can happen in a million different setups....

HoDx
Автор

isn't BA similar to CA? i mean in both cases the last A is what is important.

viiarush
Автор

I got 110. Your m+n isn't a whole number, and I don't think your work is correct.
P(Sum 12)= 1/36
P(consecutive Sum 7s)= (1/6)(1/6)
E(Time to Sum 12)= 1/P = 36 rolls.
E(Time to 7, 7)= 36 first roll, 37 second roll = 37 rolls.
P(12 before 7, 7)= 37/73.
M+N= 110.

darbyl