Coin tossing (Posted on 2004-06-11)

	Submitted by Federico Kereki
Rating: 3.6667 (6 votes)
Solution:	(Hide)
10 times; the odds are TRI(n)/2^n, which for n=10 is 504/1024, about 50%. TRI(n) is the Fibonacci-like series defined by TRI(i)=2^i for i=0 to 2, and TRI(i)=TRI(i-3)+TRI(i-2)+TRI(i-1) for i=3 or greater. For the second question, see the comments.

	Subject	Author	Date
	Puzzle Thoughts	K Sengupta	2024-01-11 11:13:09
	simulations	Charlie	2004-06-17 11:12:25
	The first part now, re: Now that I know...	Charlie	2004-06-17 08:51:29
	Now that I know...	Charlie	2004-06-16 21:04:17
	Answer to the second question	Ruopeng Wang	2004-06-16 11:11:29
	Solution?	Ruopeng Wang	2004-06-16 10:57:59
	re(5): Markov chain solution - 2nd part	Charlie	2004-06-15 13:06:13
	re(4): Markov chain solution - 2nd part	Federico Kereki	2004-06-15 10:43:45
	re: Technically Speaking	Charlie	2004-06-14 22:39:15
	Technically Speaking	Jeremiah	2004-06-14 21:14:37
	re: Markov chain solution - 2nd part	Charlie	2004-06-13 13:49:52
	re: Exhaustion--1st and 2nd questions--the program	Charlie	2004-06-13 11:53:37
	Exhaustion--1st and 2nd questions	Charlie	2004-06-13 11:25:55
	re(3): Markov chain solution - 2nd part	Charlie	2004-06-13 10:32:10
	re(2): Markov chain solution - 2nd part	Oskar	2004-06-13 10:24:11
	re: Markov chain solution - 2nd part	Charlie	2004-06-13 00:40:26
	Markov chain solution - 2nd part	Oskar	2004-06-12 23:09:11
	Markov chain solution - 1st part	Oskar	2004-06-12 23:04:29
	Markov chain solution	Oskar	2004-06-12 22:55:14
	re(2): solution	Charlie	2004-06-12 10:15:33
	re: solution	Oskar	2004-06-12 00:04:51
	drat	rixar	2004-06-11 18:30:16
	simpleton's guess	rixar	2004-06-11 18:23:13
	solution	Charlie	2004-06-11 15:50:05
	Solution	Nick Hobson	2004-06-11 15:43:57
	Solution?	Erik O.	2004-06-11 14:12:46