8 Jan
2016
8 Jan
'16
10:22 p.m.
On Jan 8, 2016, at 6:22 PM, James Propp <jamespropp@gmail.com> wrote: . . . . . . I just learned about another nice example from Barry Cipra. His Bricklayer's Challenge ( http://www.pavelspuzzles.com/2012/11/the_bricklayers_challenge.html) appears to be solvable for every n, but nobody knows how to prove it for infinitely many n.
At that URL I see three challenges mentioned, none of them depending on an integer n. Feel free to clarify. —Dan . . . . . .