4 citations · 5 across the 5 of their papers we have counts for
6 papers
Littlewood Polynomials, Spectral-Null Codes, and Equipowerful Partitions
Joe Buhler, Shahar Golan, Rob Pratt +1
Let denote . A polynomial is a Littlewood polynomial (LP) of length if the are for , and for…
Repeatedly Appending Any Digit to Generate Composite Numbers
Jon Grantham, Witold Jarnicki, John Rickert +1
We investigate the problem of finding integers such that appending any number of copies of the base-ten digit to yields a composite number. In particular, we prove that…
Too Many Hats
Rob Pratt, Stan Wagon, Michael Wiener +1
A puzzle about prisoners trying to identify the color of a hat on their head leads to a version where there are k more hats than prisoners. This generalized puzzle is related to th…
The Quadrahelix: A Nearly Perfect Loop of Tetrahedra
Michael Elgersma, Stan Wagon
In 1958, S. Świerczkowski proved that there cannot be a closed loop of congruent interior-disjoint regular tetrahedra that meet face-to-face. Such closed loops do exist for the oth…
Properties, Proved and Conjectured, of Keller, Mycielski, and Queen Graphs
Witold Jarnicki, Wendy Myrvold, Peter Saltzman +1
We prove several results about three families of graphs. For queen graphs, defined from the usual moves of a chess queen, we find the edge-chromatic number in almost all cases. In…
How to lose as little as possible
Vittorio Addona, Stan Wagon, Herb Wilf
Suppose Alice has a coin with heads probability and Bob has one with heads probability . Now each of them will toss their coin times, and Alice will win iff she gets m…