1
$\begingroup$

I just wrote a simple recursive program together with my kids using Snap! It works like this:

Draw a V shape. At each of the ends draw either a small shape or another V-shape.

The chance of drawing another V-shape is p.

Question: What can be said about

  • the average number of Vs drawn in one run
  • the probability that the number of Vs is infinite (the program never ends).
$\endgroup$
  • 1
    $\begingroup$ See Branching process and extinction problem $\endgroup$ – dEmigOd Dec 9 '17 at 9:06
  • 1
    $\begingroup$ Look at this: pub.ist.ac.at/~oajanki/book-030-033.pdf $\endgroup$ – Paul Dec 9 '17 at 17:58
  • $\begingroup$ @Paul Thanks. that contains the answer. Do you want to write one? Otherwise I'll do it myself. $\endgroup$ – Jens Schauder Dec 9 '17 at 20:15
  • $\begingroup$ @JensSchauder Go ahead $\endgroup$ – Paul Dec 9 '17 at 20:43

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.