Puzzles and Solutions 2016
All Puzzles and Solutions
Mathematical Recreations
PUZZLE of the MONTH
- Puzzles will be uploaded at the 1st day of each month.
- Solutions will be published at the beginning of the following month. It is possible that puzzles have more than one correct solution.
- You may send your solution or propose a new puzzle anytime.
- All original puzzles are under the copyright of the APM Institute and their authors.
For more details click here. Send your solution or new puzzle
May 2016 (by Kyriakos Kefalas)
R. Graham, D. Knuth and O. Patashnik ask if there exist positive integers k, n, such that:
(Problem 4.71 in Concrete Mathematics, Addison Wesley, 1998). For, n = 2, 3, … , 32, … , we have:
k = 0, 2, 0, 2, 4, 2, 0, 8, 4, 2, 4, 2, 4, 8, 0, 2, 10, 2, 16, 8, 4, 2, 16, 7, 4, 26, 16, 2, 4, 2, 0, …
(Sequence A015910 in OEIS). We immediately see that odd k, are scarce. For, k = 1, there is no solution at all. For, k = 3, the smallest solution is, n = 4700063497. In spite of this, are there infinitely many n, for each k ? For some progress on this problem see Richard Guy, Unsolved Problems in Number Theory, Springer, 2004, problem F10.
Our puzzle of the month refers to a simpler but related problem: How common are odd quotients of, 2^{n} / n ? For, n = 1, 2, 3, …, 17, …, the quotients are:
(Sequence A000799 in OEIS). We again see that odd quotients are scarce. We ask you to estimate (or even better compute) how many odd quotients appear in the set where n, takes the values, 1 ≤ n ≤ 2^{14} . For help we give the number of odd quotients for similar smaller sets:
n ≤ | odd quotients | |
1 = | 1 | 0 |
2 = | 2 | 0 |
2^{2} = | 4 | 0 |
2^{3} = | 8 | 0 |
2^{4} = | 16 | 1 |
2^{5} = | 32 | 3 |
2^{6} = | 64 | 8 |
… | … | … |
2^{14} = | 16384 | ? |
You may choose among three possible answers: A: 69, B: 369, C: 5000.
Solutions (Available after 1st June 2016)
Apr 2016 (by Kyriakos Kefalas)
Write 4 mathematical expressions that are equal to 666, using only the integers, 1, 11, 111, …, and simple mathematical operations, with the following restrictions:
- Write one expression which uses in total 8 or less digits of ‘1’.
- Write two different expressions which use in total exactly 9 digits of ‘1’.
- Write one expression which uses in total exactly 13 digits of ‘1’.
Example
OOOPS, something went wrong in this example I think, …
Solutions (Available after 1st May 2016)
Created: 21 Mar 2016 Leave your Comment