Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#477 Re: Computer Math » Markov chains » 2014-09-16 00:43:33

Yes. Just subtract 1/5 of the probability for those you don't need. E.g.: P1(11)=P(11)-P(10)/5.

#478 Re: Computer Math » Markov chains » 2014-09-16 00:37:23

Just one. For example, there is 1/5 chance to get to 1 in one sequence of rolls. To get 11..14, something more has to be done to prevent counting the cases where we get to a lower one, but that is easy.

#479 Re: Computer Math » Markov chains » 2014-09-16 00:09:15

It's the probability of getting to a number while rolling.

#483 Re: Help Me ! » Quick Question » 2014-09-15 11:23:27

Hm, have you tried completing tbe square? You will see for which value of t, h reaches its maximum. The total time is twice as long.

#486 Re: Computer Math » Markov chains » 2014-09-15 09:01:56

with a(0)=1 and a(n)=0 when n<0

#487 Re: Computer Math » Markov chains » 2014-09-15 08:40:47

It was supposed to just calculate the 10 probability.

Either way, I think I have a recurrence.

#488 Re: Computer Math » Markov chains » 2014-09-15 06:15:36

Well, it already does probabilities, but it is incorrect. It counts thing like 5,5,0.

#491 Re: Puzzles and Games » Do you have what it takes to be an engineer in the Air Force? » 2014-09-15 02:05:54

In a particular case, programming the ground to move as you wish.

#494 Re: Help Me ! » Permutation Problems » 2014-09-15 01:20:45

Hm, you just list out all the possibilities.

#496 Re: Help Me ! » Permutation Problems » 2014-09-15 01:14:24

16 is old enough.

You can do it by casework, then.

#498 Re: Help Me ! » Permutation Problems » 2014-09-15 00:50:03

I think repetitions must be allowed. If not, the solution is 0.

Board footer

Powered by FluxBB