Archive

This week

11/12/2010
11/05/2010
10/29/2010
10/22/2010
10/12/2010
10/05/2010
09/28/2010
06/15/2010
06/08/2010
06/01/2010
05/25/2010
05/18/2010
05/11/2010
05/04/2010
04/27/2010
04/20/2010
04/13/2010
04/06/2010
03/30/2010
03/09/2010
03/02/2010
02/23/2010
02/16/2010
02/09/2010
02/02/2010
01/26/2010
01/19/2010
01/12/2010
01/05/2010
12/08/2009
12/01/2009
11/24/2009
11/17/2009
11/10/2009
11/03/2009
10/27/2009
10/20/2009
10/13/2009
10/06/2009
09/29/2009
07/14/2009
07/07/2009
06/23/2009
06/02/2009
05/26/2009
05/19/2009
05/12/2009
05/05/2009
04/28/2009
04/21/2009
04/14/2009
04/07/2009
03/31/2009
03/17/2009
03/10/2009
03/03/2009
02/24/2009
02/17/2009
02/10/2009
02/03/2009
01/27/2009
01/20/2009
01/13/2009
01/06/2009
12/02/2008
11/25/2008
11/18/2008
11/11/2008
11/04/2008
10/28/2008
10/21/2008
10/14/2008
10/07/2008
09/30/2008
09/23/2008
09/09/2008
08/26/2008
08/19/2008
08/12/2008
08/05/2008
07/29/2008
07/22/2008
07/15/2008
07/08/2008
07/01/2008
06/24/2008
06/10/2008
06/03/2008
05/27/2008
05/20/2008
05/13/2008
05/06/2008
04/29/2008
04/22/2008
04/15/2008
04/08/2008
04/01/2008
03/18/2008
03/11/2008
03/04/2008
02/26/2008
02/19/2008
02/12/2008
02/05/2008
01/29/2008
01/22/2008
01/15/2008
01/08/2008
12/04/2007
11/27/2007
11/20/2007
11/13/2007
11/06/2007
10/30/2007
10/16/2007

September 23–September 29, 2008

Problem

The sequence

S = 1, 0, 1, 0, 1, 0, 3, 5, 0, 9, ...

is generated by starting with "1, 0, 1, 0, 1, 0"; every successive number is found by adding the previous six numbers and taking the last digit. Prove that the pattern "0, 1, 0, 1, 0, 1" will never appear in S.

Solution

here.

List of solvers

Dustin Moody (graduate); Gary Raymond (staff); Peiyush Jain, Steve Wilmarth, Lloyd Sakazaki (outside).

Peiyush Jain wins the prize!