Puzzles
20 December
A number is called a perfect power if it is equal to nk for some integer n and some integer k > 1. 2025 is a perfect power (452)
and 23 more than 2025 is also a perfect power (211).
What is the only three-digit perfect power that is 29 less than another perfect power?
19 December
Eve uses the digits 1, 2, 3, 4, 5, 6, 7, 8 and 9 to write five square numbers (using each digit exactly once). What is largest square number that she made?
18 December
There are 5 different ways to make a set of numbers between 1 and 5 such that the smallest number in the set is equal to the number of numbers in the set. These 5 sets are: {1}, {2, 3}, {2, 4}, {2, 5} and {3, 4, 5}.
How many ways are there to make a set of numbers between 1 and 14 such that the smallest number in the set is equal to the number of numbers in the set?
17 December
A sequence of zeros and ones can be reduced by writing a 0 or 1 under each pair of numbers: 1 is written if the numbers are the same, 0 is written if they are not.
This process can be repeated until there is a single number. For example, if we start with the sequence 1, 1, 1, 0, 1 (of length 5), we get:
1
1
1
0
1
1
1
0
0
1
0
1
0
0
1
The final digit is a 1.
How many sequences of zeros and ones of length 10 are there that when reduced lead to the final digit being a 1?
16 December
Put the digits 1 to 9 (using each digit exactly once) in the boxes so that the sums are correct. The sums should be read left to right and top to bottom ignoring the usual order of operations. For example, 4+3×2 is 14, not 10.
Today's number is the product of the numbers in the red boxes.
| – | ÷ | = 1 | |||
| ÷ | + | × | |||
| × | – | = 37 | |||
| × | ÷ | ÷ | |||
| + | + | = 17 | |||
| = 2 | = 1 | = 2 |
15 December
The odd factors of 2025 are 1, 3, 5, 9, 15, 25, 27, 45, 75, 81, 135, 225, 405, 675 and 2025. There are 15 of these factors and 15 is itself an odd factor of 2025.
What is the smallest three-digit number whose number of odd factors is itself an odd factor of the number?
14 December
There are five ways to make a list of four As and Bs that don't contain an odd number of consecutive As:
- B,B,B,B
- A,A,B,B
- B,A,A,B
- B,B,A,A
- A,A,A,A
How many ways are there to make a list of eleven As and Bs that don't contain an odd number of consecutive As?
13 December
Today's number is given in this crossnumber. No number in the completed grid starts with 0.
|
|
| |||||||||||||||||||||||||||||||||
Archive
Show me a random puzzle Most recent collections
Advent calendar 2025
Advent calendar 2024
Advent calendar 2023
Advent calendar 2022
List of all puzzles
Tags
taxicab geometry combinatorics polygons powers albgebra graphs medians functions logic bases area expansions median odd numbers surds quadrilaterals 2d shapes wordplay multiples integration angles square numbers averages circles triangles trigonometry triangle numbers cryptic crossnumbers prime numbers integers partitions geometry lists colouring lines cryptic clues multiplication polynomials indices games money christmas chalkdust crossnumber differentiation addition square grids coordinates 3d shapes sequences number geometric mean time irreducible numbers floors rectangles squares pentagons folding tube maps xor determinants quadratics star numbers rugby cube numbers speed factorials coins advent palindromes books dice tangents percentages regular shapes perfect numbers the only crossnumber algebra geometric means perimeter products gerrymandering ave proportion remainders prime factors clocks sum to infinity sport tiling matrices probability routes consecutive numbers unit fractions people maths symmetry cubics balancing digital clocks dodecagons dominos volume sets hexagons neighbours doubling multiplaction squares range probabilty chess grids menace dates arrows numbers factors crosswords scales sums complex numbers decahedra spheres ellipses consecutive integers square roots chocolate crossnumbers planes shapes cards axes calculus pascal's triangle tournaments digits shape binary fractions parabolas means elections even numbers division mean digital products© Matthew Scroggs 2012–2026

