Datasets:
id
stringlengths 1
4
| year
stringdate 1996-01-01 00:00:00
2024-01-01 00:00:00
| type
stringclasses 9
values | multimodal
stringclasses 1
value | category
stringclasses 34
values | subject
stringclasses 6
values | answer
stringlengths 1
467
| question
stringlengths 18
1.43k
| image
imagewidth (px) |
|---|---|---|---|---|---|---|---|---|
1942
|
1998
|
final
|
no
|
C2 L1 L2 GP
|
Logic
|
Considering then the possible differences, remembering that the first two pages must still be read by Adalberto Maria, there are 6 solutions: 14 pages, 32 pages, 50 pages, 68 pages, 86 pages or 104 pages.
|
Young Adalberto Maria eagerly resumes reading a book with fewer than 200 pages. Before diving into the new chapter, which always starts on a left-hand page, he has time to notice that the sum of all digits used to number the two pages of the open book is equal to 31. Later, overcome by tiredness, he decides to stop at the end of a right-hand page, which is also the end of a chapter, after noticing that the sum of the digits used to number the two pages is 19. All left-hand pages are numbered with an even number. How many pages has Adalberto Maria read?
| Not supported with pagination yet
|
1843
|
2000
|
semifinal
|
no
|
L1 L2 GP
|
Arithmetic
|
16810770431
|
A = 2000
B = A - 999
C = A + B - 998
D = A + B + C - 997
...
Z = A + B + C + ... + Y - 975
What is the value of Z? Note: the alphabet consists of 26 letters.
| Not supported with pagination yet
|
1868
|
2000
|
international final day 1
|
no
|
C1 C2 L1 GP L2 HC
|
Combinatorics
|
2 solutions: 0010111000, 0011101000
|
The message "10110" contains the three 3-digit sequences: 101, 011, and 110.
Today, agent 001 must send a message, as short as possible, that starts with 001 and that contains the 8 sequences: 000, 001, 010, 011, 100, 101, 110, and 111. What could this message be?
| Not supported with pagination yet
|
1873
|
2000
|
international final day 1
|
no
|
L1 GP L2 HC
|
Combinatorics
|
3 solutions: 1;1;1;3;4, 2;3;5, 1;2;3;4
|
Form a deck of 30 cards. Divide this deck into as many piles as you wish, each containing an arbitrary number of cards. Then take one card from each of the piles to form a new one (this is your first operation). Perform this operation 10 times, counting the first one among these. Describe the final state, giving the composition of the piles.
| Not supported with pagination yet
|
1880
|
2000
|
international final day 2
|
no
|
C1 C2 L1 GP L2 HC
|
Pattern Recognition
|
WRITING 2000: 22222020000
|
"Agent 002, from now on only the digits 0 and 2 are authorized in our encrypted codes. Thus, instead of writing 0, 1, 2, 3, 4, 5, 6, 7, 8, ..., we will write 0, 2, 20, 22, 200, 202, 220, 222, 2000.” Find what the representation of the year 2000 will be using this code.
| Not supported with pagination yet
|
1882
|
2000
|
international final day 2
|
no
|
C1 C2 L1 GP L2 HC
|
Logic
|
Claudine Félix, Annie Frantz, Denise Jeusse, Brigitte Mathisse, Estelle Etoisse, Fanny Logisse
|
The six girls in the room do not get along very well. Miss Felix has only one friend, who is Annie. Miss Franti's friends are Claudine, Estelle, and Fanny. Miss Jeusse's friends are Brigitte, Estelle, and Fanny. Miss Mathisse's friends are Denise and Estelle. Miss Etoisse's three friends are Annie, Brigitte, and Denise. Finally, Miss Logisse's friends are Annie and Denise.
Determine the names of each of the six girls.
Note 1: It is assumed that if Annie is friends with Brigitte, then Brigitte is friends with Annie.
Note 2: List of surnames in alphabetical order: Etoisse, Felix, Franti, Jeusse, Logisse, Mathisse; list of first names in alphabetical order: Annie, Brigitte, Claudine, Denise, Estelle, Fanny.
| Not supported with pagination yet
|
1780
|
2001
|
team games
|
no
|
C2 L1 L2
|
Pattern Recognition
|
1014492753623179984896
|
N is a positive integer that possesses an incredibly simple property: to multiply it by 7 (and obtain the product), simply move its units digit and place it in the first position (as far left as possible). What is the smallest number that possesses this property?
| Not supported with pagination yet
|
1782
|
2001
|
team games
|
no
|
C2 L1 L2
|
Pattern Recognition
|
(: 3) + 3 (for example)
|
The symbol "#" always represents the same phrase (constructed using the elementary operations of addition, subtraction, multiplication, and division, possibly performed in a certain order). Indicate one that makes the following equalities true:
21 # = 10
165 # = 58
27 # = 12
36 # = 15
(For example, for the first equality, the symbol "#" could mean: "subtract 16 and then multiply by 2"; but this meaning is not suitable for the second equality).
| Not supported with pagination yet
|
1783
|
2001
|
team games
|
no
|
C2 L1 L2
|
Arithmetic
|
4,004,001
|
What is the sum of the first 2001 odd natural numbers?
| Not supported with pagination yet
|
1789
|
2001
|
team games
|
no
|
C2 L1 L2
|
Combinatorics
|
44/120
|
A secretary writes 5 different letters, intended for 5 different people. Distracted as she is, she puts the letters in the envelopes without bothering to check the name of the recipient. What is the probability that none of the five people receives the letter that was intended for them?
| Not supported with pagination yet
|
1691
|
2002
|
team games
|
no
|
C2 L1 L2
|
Algebra
|
a = 4 (3), b = 9 (4), c = 1, d = 4, e = 3, f =0
|
Assign a number (chosen from the set {0,1,2,3,4,8,9}) to each letter in the following addition:
e d b d d
e d b d d
+ e d b d d
-----------
c f a b-1 d-1 e-1
Note: Different letters are not necessarily assigned different numbers.
| Not supported with pagination yet
|
1725
|
2002
|
Rosi's games
|
no
|
C2 L1 L2
|
Algebra
|
a=4 (3), b=9 (4), c=1, d=4, e=3, f=0
|
Assign a number (chosen from the set {0,1,2,3,4,8,9}) to each letter in the following addition:
e d b d d +
e d b d d +
e d b d d =
c f a (b-1) (d-1) (e-1)
Note: Different letters are not necessarily associated with different numbers.
| Not supported with pagination yet
|
1738
|
2002
|
semifinal
|
no
|
L1 L2 GP
|
Algebra
|
6 solutions: 123 or 132 or 213 or 231 or 312 or 321
|
To write four integers (strictly positive), we used three different digits, each of which appears twice.
If the product of the smallest and the largest of the four numbers is added to the product of the two middle numbers, the sum of the four numbers is obtained.
What are these four numbers?
| Not supported with pagination yet
|
1739
|
2002
|
semifinal
|
no
|
L2 GP
|
Combinatorics
|
The three working keys can be: 1-2-3, 2-4-5, 2-4-6, 3-6-9.
|
Of the nine keys 1, 2, 3, 4, 5, 6, 7, 8, 9 on Carla's calculator, only three work. The zero key doesn't work either.
Carla adds the six numbers that can be formed using the three distinct digits she can still type (with the three working keys) and notes with some surprise that the total is written using only the digits from these three keys (or some of them).
Which three number keys still work on Carla's calculator?
| Not supported with pagination yet
|
1740
|
2002
|
semifinal
|
no
|
L2 GP
|
Pattern Recognition
|
3 solutions: 0-3-1-4-2-5 or 1-4-2-0-3-6 or 2-0-3-1-4-7
|
Write without repetitions all natural numbers (i.e., the numbers from the set {0,1,2,3,4,…}) such that each number, starting from the second, is equal to the previous one increased by 3 or to the previous one decreased by 2.
Give the first six numbers of the list.
| Not supported with pagination yet
|
1744
|
2002
|
final
|
no
|
C1 C2 L1 L2 GP
|
Pattern Recognition
|
The code is 222242
|
4 9 9 2 4 4
The opening of a safe is controlled by a six-digit code. On the starting number 499244, the following changes can be made:
• a 4 and a 9 (which follow each other in this order) can be replaced by 2 4;
• a 2 and a 4 (which follow each other in this order) can be replaced by 9 2.
The code that opens the safe is the smallest number that can be obtained.
What is this code?
| Not supported with pagination yet
|
1570
|
2003
|
autumn games
|
no
|
C1
|
Logic
|
The last to arrive is Angelo, who arrives at 17:04.
|
Angelo, Desiderio, Renato and Pietro have decided to participate in the Mathtown marathon. Well done! All four cross the finish line with the following result. Pietro arrives at 16:56. Renato arrives 5 minutes later. Angelo arrives 10 minutes after Desiderio who, in turn, arrives 7 minutes before Renato.
What time does the last of the four friends arrive?
| Not supported with pagination yet
|
1572
|
2003
|
autumn games
|
no
|
C1
|
Logic
|
By inserting the four statements into a table, it is deduced that the Pirates book was chosen by Milena, the Ghosts book was chosen by Marco, and the Princesses book was left for Carla.
Pirati | Ghosts | Princesses
Milena | X | no | no
Marco | no | X | no
Carla | no | no | X
|
Marco, Carla, and Milena each choose a book from the Pristem library. Today, three books are available: one is a pirate story, another is a ghost story, and the last one is a princess story.
Milena: "I did not choose the ghost story."
Marco: "I left the princess story for a girl."
Carla: "Marco did not take the pirate book."
The librarian adds: "Carla already read the pirate story last week."
Which book did each of the three friends choose?
| Not supported with pagination yet
|
1587
|
2003
|
autumn games
|
no
|
L2
|
Combinatorics
|
The required number is 128572.
|
Determine the number of natural numbers that are multiples of 7, consisting of 7 digits (where the first digit is non-zero) and whose units digit is 7.
| Not supported with pagination yet
|
1597
|
2003
|
team games
|
no
|
C2 L1 L2
|
Combinatorics
|
the largest number Mauro can obtain is 95617181920.
|
Mauro has written, in a row, the positive integers up to 20: 1 2 3 4 5 …. 20. Now he is asked to delete 20 digits from the previous arrangement, in order to obtain the largest possible number. Can you help him?
| Not supported with pagination yet
|
1601
|
2003
|
team games
|
no
|
C2 L1 L2
|
Combinatorics
|
Row 1: 1 1 1 1 1 1 6, Row 2: 1 1 1 1 1 3 8, Row 3: 1 1 1 1 3 3 10, Row 4: 1 1 2 3 3 3 13, Row 5: 1 2 3 3 3 3 15, Row 6: 2 3 3 3 3 3 17, Row 7: 7 9 11 12 14 16
|
We define an anti-magic square as a gridded square whose cells are occupied by the digits 1, 2, and 3, and for which all row and column sums are different.
Can you construct a 6 x 6 anti-magic square?
| Not supported with pagination yet
|
1613
|
2003
|
Rosi's games
|
no
|
C2 L1 L2
|
Combinatorics
|
333 333 33 032 003
|
Giulio wrote the number 2003 ten times in a row, obtaining a 40-digit number. He then deletes 25 of these digits to obtain the largest possible number. What is this number?
| Not supported with pagination yet
|
1614
|
2003
|
Rosi's games
|
no
|
C2 L1 L2
|
Algebra
|
A=6; B:4; C=9 or A=4; B=6; C=3 or A=3; B=7; C=0
|
Can you substitute digits for letters in this sum, knowing that equal letters correspond to equal digits, and vice versa?
A A B +
A A A +
A A C =
---------------------------------
1 C C C
| Not supported with pagination yet
|
1623
|
2003
|
semifinal
|
no
|
C1 C2 L1
|
Logic
|
Pietro and Settimo
|
It's the first meeting of the Club of Five. Of the five boys who make it up, some are already friends, others are not. Each has two or three friends in the group and, when two boys are friends, they never have the same number of friends in the group. Angelo and Renato are friends with Pietro; Settimo has three friends. Who are Desiderio's friends?
| Not supported with pagination yet
|
1626
|
2003
|
semifinal
|
no
|
C2 L1 L2 GP
|
Pattern Recognition
|
32133123
|
The number 145541 is a palindromic number because it can be read the same way from left to right and from right to left. Furthermore, the two-digit numbers formed by consecutive digits within this number: 14, 45, 55, 54, 41 are all distinct.
Find the largest palindromic number that has the same property and consists only of the digits 1, 2, and 3.
| Not supported with pagination yet
|
1627
|
2003
|
semifinal
|
no
|
C2 L1 L2 GP
|
Algebra
|
69999 70000
|
What are the two smallest consecutive integers whose sums of digits are both divisible by 7?
| Not supported with pagination yet
|
1638
|
2003
|
final
|
no
|
C1 C2 L1 L2 GP
|
Algebra
|
1st solution: 33 Mickey Mouse albums and 35 Donald Duck albums; 2nd solution: 5 Mickey Mouse albums and 66 Donald Duck albums; 3rd solution: 61 Mickey Mouse albums and 4 Donald Duck albums;
|
The neighborhood bookseller, a comic book enthusiast, has launched a special offer for the sale of books featuring his most famous heroes. Enthusiasts are taking advantage of it. A first comic book fan buys 51 Mickey Mouse albums and 15 Donald Duck albums for a total of 2001 Euros. A second fan buys 15 Mickey Mouse albums and 55 Donald Duck albums for 2005 Euros. A third enthusiast, who had followed the purchases made by his two "colleagues," thinks: "It's not 2001, nor is it 2005. It's 2003, and I really want to spend 2003 Euros." How many Mickey Mouse and Donald Duck albums can he buy with 2003 Euros?
| Not supported with pagination yet
|
1645
|
2003
|
international final day 1
|
no
|
CE
|
Pattern Recognition
|
first line (top): 4, 13, 22, 31, 40, 49,
second line (bottom):
18, 21, 24, 27, 30, 33
|
Find the missing numbers in each line.
4 13 22 31 ? ?
18 ? 24 27 ? 33
| Not supported with pagination yet
|
1468
|
2004
|
autumn games
|
no
|
C1 C2 L1
|
Logic
|
Marco teaches in the 'Piccoli' class, Milena in the 'Medi' class and Carla in the 'Grandi' class.
|
In my new school, there are three classes: Teacher Carla's class, Teacher Milena's class, and Teacher Marco's class. In the three classes, there are the older students, the middle students, and the younger students.
The middle students do not have Teacher Marco. Teacher Milena teaches students who are younger than Teacher Carla's students. Teacher Carla, in turn, teaches students who are older than Teacher Marco's students.
Assign each teacher to their class.
| Not supported with pagination yet
|
1479
|
2004
|
team games
|
no
|
C2 L1 L2
|
Pattern Recognition
|
Row 1: -, -, -, 2, -
Row 2: -, -, 4, 3, -
Row 3: -, 2, -, 3, -
Row 4: 3, -, -, 4, -
Row 5: 2, 3, 4, 4, 3
Row 6: -, -, -, 3, -
|
A light panel consists of 30 squares that can be turned on or off. The numbers written in each square indicate the number of lit squares surrounding it (meaning they share a side or even just a vertex).
On the answer sheet, copy the numbers from the lit squares.
0 1 3 2 2
1 2 4 3 3
2 2 5 3 3
3 5 6 4 4
2 3 4 4 3
2 3 4 3 3
| Not supported with pagination yet
|
1483
|
2004
|
team games
|
no
|
C2 L1 L2
|
Pattern Recognition
|
The square of 4022029 is obtained
|
Multiplying 1, 2, 3, and 4 together and adding 1, we get 25 (which is the square of 5).
Multiplying 2, 3, 4, and 5 together and adding 1, we get 121 (which is the square of 11).
Multiplying 3, 4, 5, and 6 together and adding 1, we get 361 (which is the square of 19).
Multiplying 2004, 2005, 2006, and 2007 together and adding 1, we get the square of ...
| Not supported with pagination yet
|
1489
|
2004
|
team games
|
no
|
C2 L1 L2
|
Combinatorics
|
Row 1: 4 3 2 1
Row 2: 5 4 1 2
Row 3: 6 7 4 3
Row 4: 7 6 5 4
|
A 4x4 square is called quasi-magic when the 7 numbers in its first row and first column are precisely the integers from 1 to 7.
Furthermore, the same property holds true for the second row and second column, the third row and third column, and finally, the fourth row and fourth column.
Give an example of a quasi-magic 4x4 square (answer IMPOSSIBLE if none exists).
| Not supported with pagination yet
|
1491
|
2004
|
team games
|
no
|
C2 L1 L2
|
Combinatorics
|
Row 1: 33 13 17
Row 2: 5 21 37
Row 3: 25 29 9
|
Arrange 9 distinct odd natural numbers in the cells of a 3x3 square, such that the sum of each row, each column, and each of the two main diagonals is equal to 63.
(Instead, answer IMPOSSIBLE if you think there are no solutions).
| Not supported with pagination yet
|
1507
|
2004
|
Rosi's games
|
no
|
C2 L1 L2
|
Pattern Recognition
|
1111110212223
|
Giovanni concatenated all the numbers from 1 to 23 to form a single number. What is the smallest number that can be obtained by deleting 23 digits from that long number?
| Not supported with pagination yet
|
1530
|
2004
|
semifinal
|
no
|
L2 GP
|
Arithmetic
|
The problem admits five solutions: 1-3-20-50, 1-6-20-50, 1-7-20-50, 1-8-20-50, 1-9-20-50
|
In the kingdom of monkeys, the official currency is the "Banana". There are no banknotes. There are only four values of metal coins (expressed in "Bananas") which can be either integers less than 10, or multiples of 10 less than 100. One of the coin values is obligatorily 1, and no value other than 1 divides another of them.
To pay exactly the sum of 130 "Bananas", a minimum of 5 coins are required. To pay exactly the sum of 140 "Bananas", a minimum of 4 coins are required.
What are, in ascending order, the four coin values in the kingdom of monkeys?
| Not supported with pagination yet
|
1543
|
2004
|
final
|
no
|
GP
|
Pattern Recognition
|
The required multiple is 42244442244.
|
The smallest positive integer exactly divisible by 2004 and composed solely of the digits 2 and 4 is 222444. What is the next one?
| Not supported with pagination yet
|
1550
|
2004
|
international final day 1
|
no
|
L2 HC
|
Algebra
|
2045709
|
In the operation below, each letter represents a digit. Different letters represent different digits, and different digits are represented by different letters. No number starts with zero.
DIX + HUIT + 1111 × ZERO = DIXHUIT
Find the smallest possible value for "DIXHUIT".
| Not supported with pagination yet
|
1551
|
2004
|
international final day 1
|
no
|
L2 HC
|
Arithmetic
|
6042 × 5147 = 31931988
|
Young Malik used a numerical calculation program to calculate the product of two integers. Then, wanting to bold his result, he made a mistake and activated the 'sort' function. This function sorts in ascending order the digits of all numbers that appear on the screen. Malik then saw the numbers written below appear. Help him find the correct product.
Multiplicand: 0246
Multiplier: 1457
Product: 11338899
| Not supported with pagination yet
|
1562
|
2004
|
international final day 2
|
no
|
C1 C2 L1 GP L2 HC
|
Arithmetic
|
41 solutions : 121 -> 11 ; 132, 192 -> 12 ; 143 -> 13 ; 154 -> 14 ; 135, 165, 195 -> 15 ; 176 -> 16 ; 187 -> 17 ; 198 -> 18 ; 231 -> 21 ; 242 -> 22 ; 253 -> 23 ; 264 -> 24 ; 225, 275 -> 25 ; 286 -> 26 ; 297 -> 27 ; 341 -> 31 ; 352 -> 32 ; 363 -> 33 ; 374 -> 34; 315, 385 -> 35 ; 396 -> 36 ; 451 -> 41 ; 462 -> 42; 473 -> 43 ; 484 -> 44 ; 495 -> 45 ; 561 -> 51 ; 572 -> 52; 583 -> 53 ; 594 -> 54 ; 671 -> 61 ; 682 -> 62 ; 693 -> 63 ; 781 -> 71 ; 792 -> 72 ; 891 -> 81.
|
Matilde has written a three-digit number: 571. Then, by erasing, she deletes the central digit: 7. The remaining digits form a two-digit number: 51. Mattia proceeds in the same way starting from another three-digit number, but obtains, contrary to Matilde, a two-digit number that is a divisor of the initial three-digit number. What is this initial number?
| Not supported with pagination yet
|
1563
|
2004
|
international final day 2
|
no
|
C2 L1 GP L2 HC
|
Geometry
|
23 solutions : 1 (91), 3 (89), 5 (87), 7 (85, 91), 9 (83), 11 (81), 13 (79, 91), 15 (77), 17 (75), 19 (73), 21 (71, 77), 25 (67), 27 (65), 29 (63), 31 (61), 33 (59), 35 (57, 63), 37 (55), 39 (53, 65), 41 (51), 43 (49), 45 (47), 91 (91).
|
On grid paper, Diego drew a rectangle whose sides followed the grid lines. Then he drew a diagonal and counted the number of squares it crossed. This number was 91. What is the width of Diego's rectangle?
| Not supported with pagination yet
|
1353
|
2005
|
autumn games
|
no
|
CE C1
|
Algebra
|
Two possible solutions:
6, 3, 1
1, 4, 2
You assign the exercise only if both solutions are correct
|
Today Milena has to prepare some strawberry tarts. She can use at most 6 small molds, 5 medium molds, and 2 large molds. In each small mold, she puts 4 strawberries; in each medium mold, she puts 7 strawberries; and in each of the large ones, 13. Milena, however, wants to use all 58 strawberries she has collected. How many molds, and of what type, must she use?
| Not supported with pagination yet
|
1360
|
2005
|
autumn games
|
no
|
C2 L1 L2
|
Algebra
|
(1,11)-(2,10)-(3,9)-(4,8)-(5,7) The pairs of numbers cannot be inverted.
|
Find the value of ♥ and ♣, given that ♥ and ♣ represent positive integers with ♥<♣:
6/♥ + 6/♣ = 2 * (6/♥ * 6/♣)
| Not supported with pagination yet
|
1365
|
2005
|
autumn games
|
no
|
L2
|
Algebra
|
Two possible solutions:
290 - 283
or
670 - 667
|
Complete the equality with two three-digit numbers:
2005 + 2006 = . . . ^2 – . . . ^2
| Not supported with pagination yet
|
1369
|
2005
|
team games
|
no
|
C2 L1 L2
|
Combinatorics
|
The largest element of A is 876351240
|
Let A be the set of 9-digit numbers, all with distinct digits, that satisfy the following properties:
the number formed by its last two digits is divisible by 2;
the number formed by its last three digits is divisible by 3;
...;
the number formed by its last eight digits is divisible by 8;
the number formed by its last nine digits (i.e., the number itself) is divisible by 9.
What is the largest number in A?
| Not supported with pagination yet
|
1370
|
2005
|
team games
|
no
|
C2 L1 L2
|
Algebra
|
The maximum value of x'y is 752783760
|
What is the maximum value of the difference x–y, if x and y are elements of set A (described in question 3)?
| Not supported with pagination yet
|
1401
|
2005
|
Rosi's games
|
no
|
C2 L1 L2
|
Arithmetic
|
It can be written as $22+2$ or $3^{3}-3$
|
It's easy to write 24 with the help of three eights: 8+8+8. Could you write it using (only) another digit, repeated three times? (Allowed operations are addition, subtraction, multiplication, division, and exponentiation).
| Not supported with pagination yet
|
1403
|
2005
|
Rosi's games
|
no
|
C2 L1 L2
|
Arithmetic
|
The jersey numbers of the substituted players were 1 and 6 or 2 and 5 or, alternatively, 3 and 4
|
The sum of the numbers written on the jerseys of my soccer team is equal to 66. In the second half, I make two substitutions and bring in two fresh players, with numbers 12 and 14. Now the sum of the numbers on the jerseys is equal to 85. What were the numbers on the jerseys of the substituted players?
| Not supported with pagination yet
|
1418
|
2005
|
semifinal
|
no
|
L2 GP
|
Combinatorics
|
Mirko has chosen the following weights: 1 - 2 - 3 - 7 - 11
|
Jacob has a box of weights from an old precision scale. There are 15 weights, each marked with its value, ranging from 1 to 15 grams.
Jacob then challenges his friend Mirko as follows:
“Choose a certain number of weights from this box in order to have the smallest possible total weight. These weights must nonetheless allow you to weigh any object that weighs an integer number of grams from 1 to 11 (inclusive), by placing at most one weight on each of the two pans of the scale.”
List the weights chosen by Mirko in ascending order.
| Not supported with pagination yet
|
1425
|
2005
|
final
|
no
|
C1 C2 L1 L2
|
Combinatorics
|
One solution is given by: 1, 6, 11, 5, 10, 4, 9, 3, 8, 2, 7 (or in the reverse order)
|
Arrange the integers from 1 to 11 around a circle such that the difference between any two adjacent numbers (the larger minus the smaller) is always equal to 5 or 6. (One solution is sufficient)
| Not supported with pagination yet
|
1432
|
2005
|
final
|
no
|
L2 GP
|
Arithmetic
|
24046868
|
Write the list of the first 2005 integers: 1, 2, 3, ..., 2005. Delete the first two and write their sum at the end of the list: 3, 4, ..., 2005, 3. Continue in this way, deleting the first two remaining and adding their sum to the end of the list: 5, 6, ..., 2005, 3, 7. Keep going: continue in the same way until only one number remains. What is the sum of all the numbers written, including the initial ones?
| Not supported with pagination yet
|
1453
|
2005
|
international final day 2
|
no
|
C1 C2 L1
|
Arithmetic
|
(7+2)/9*6-4=6+4-8
-(7+2)/9*6+4=-6-4+8
(7+2)/9*6+4=6-4+8
-(7+2)/9*6-4=-6+4-8
72/9-(6*4)=-6*4+8
-72/9+(6*4)=6*4-8
-7/(2-9)*6-4=6+4-8
7/(2-9)*6+4=-6-4+8
7*2-(9+6)+4=6*4/8
-(7*2-9)+6-4=-6*4/8
etc.
|
A defective printer no longer prints the symbols + (plus), - (minus), x (multiply), : (divide), ( ) (parentheses). It has just printed:
7 2 9 6 4 = 6 4 8
Use the six preceding symbols at least once, inserting them into this formula, to transform it into an exact equality.
| Not supported with pagination yet
|
1226
|
2006
|
autumn games CE
|
no
|
CE
|
Combinatorics
|
6 numbers can be formed: 24, 26, 42, 46, 62, and 64.
|
How many three-digit numbers with distinct digits can be formed using the digits 2, 4, and 6?
| Not supported with pagination yet
|
1272
|
2006
|
Rosi's games
|
no
|
C2 L1 L2
|
Algebra
|
A=3; B=1; C=4; D=0; E=8
|
Each of the letters A, B, C, D, E always represents the same number.
Find their values such that all the additions (horizontal and vertical) are correct:
A + B + C + B = 9
+ + + +
A + A + D + A = 9
+ + + +
D + B + E + C = 13
= = = =
6 5 12 8
Find the values of the letters A, B, C, D, E.
| Not supported with pagination yet
|
1286
|
2006
|
Rosi's games
|
no
|
C2 L1 L2
|
Arithmetic
|
The seals
|
If 7 ??? eat the fish from 7 identical baskets in 7 days, and 5 seals eat the fish from 5 baskets (identical to the previous ones) in 5 days, who eats faster: the ??? or the seals?
| Not supported with pagination yet
|
1288
|
2006
|
Rosi's games
|
no
|
C2 L1 L2
|
Arithmetic
|
12:59; 15:29; 19:25; 19:52; 21:59
|
Looking at the 4 digits indicating the time on his screen, Angelo notices that their sum is equal to 17 while their product is equal to 90.
What time could it be? (There is more than one answer ...)
| Not supported with pagination yet
|
1294
|
2006
|
semifinal
|
no
|
C1 C2
|
Arithmetic
|
There are many solutions. For example: 5621x0+10x12, 56x2+10+10-12 etc.
|
5 6 2 1 0 1 0 1 2
Insert the signs + ; - ; x and possibly also parentheses between the preceding digits, so that the result of the indicated operations is equal to 120. The operation signs can be repeated and not all of them need to be used.
| Not supported with pagination yet
|
1300
|
2006
|
semifinal
|
no
|
L1 L2 GP
|
Logic
|
Two solutions: 999 and 222, 929 and 292
|
Paul Indrom, an FBI inspector, discovered two palindromic numbers, each consisting of three digits, whose sum is a four-digit palindromic number. To write the two numbers and their sum, Paul used only three different digits, one of which was used five times. What are Paul Indrom's two numbers? Note: A number is palindromic when it presents the same sequence of digits, whether read from left to right or from right to left (e.g., 22; 919; 2332).
| Not supported with pagination yet
|
1311
|
2006
|
final
|
no
|
C1 C2 L1 L2 GP
|
Logic
|
3 is opposite to 6.
|
Letizia has a (cubic) die whose faces are numbered from 1 to 6, but the sum of the points on two opposite faces is not necessarily equal to 7 (as is the case with a "normal" die).
Letizia rolls her die and observes that the sum of the points on the four lateral faces is 15. She rolls again and this time observes that the sum of the points on the four lateral faces is 12.
What is the number on the face opposite to the 6?
| Not supported with pagination yet
|
1319
|
2006
|
international final day 1
|
no
|
C1
|
Logic
|
Andrea: tuna; Sergio: cheese; GianMichele: cheese; Lorenzo: ham.
|
Andrea, Sergio, GianMichele, and Lorenzo are traveling in Paris where they are preparing for the Euromath competition. In a cafe, they order some sandwiches. Andrea would like one with tuna or chicken; Sergio would prefer one with ham or cheese; Gian Michele one with cheese or tuna; and Lorenzo one with ham or salami. The waiter brings one tuna sandwich, one ham sandwich, and two cheese sandwiches. For everyone to be satisfied, how will they distribute the sandwiches?
| Not supported with pagination yet
|
1322
|
2006
|
international final day 1
|
no
|
C1
|
Arithmetic
|
The bands are 47 and the last one is yellow.
|
Cuachumac's bedspread is 2 m 35 cm long and 1 m 35 cm wide. It is composed of fabric strips 5 cm wide and 1 m 35 cm long. Some strips are green, others yellow, and others pink. They are all arranged in the same direction and always follow each other in the following order: First a green strip, then a yellow one, then a pink one.
How many strips are used for the bedspread? If the first strip is green, what color is the last one?
| Not supported with pagination yet
|
1346
|
2006
|
international final day 2
|
no
|
L1 L2
|
Algebra
|
4 solutions: 3770, 17110, 59 194, 1006010.
|
In each of two identical rectangular baking pans, a layer of candy paste was spread, which then hardened.
A machine lowers vertically onto the pans to cut the hardened paste, so as to obtain square candies.
From the second pan, smaller candies must be obtained than those obtained from the first pan.
Thus, 2006 more candies are obtained compared to the first.
How many candies are obtained in total?
| Not supported with pagination yet
|
1141
|
2007
|
autumn games
|
no
|
C1 C2 L1
|
Logic
|
Luca is not left-handed, from e) he wears a cap, from d) he wears glasses.
|
Our four friends are named Carla, Desiderio, Luca, and Milena. Two of them wear glasses, two have a hat, and two are left-handed. The two friends who use their right hand to write wear glasses, and the two left-handed friends do not wear a hat. The left-handed friends are a boy and a girl. Desiderio is left-handed. What can be said about Luca? Is he left-handed? (yes or no?) Does he wear a hat? (yes or no?) Does he wear glasses? (yes or no?) Circle the correct answers.
| Not supported with pagination yet
|
1152
|
2007
|
team games
|
no
|
C2 L1 L2
|
Arithmetic
|
7x7-7-7-7:7+7-7 (for example).
|
Place appropriate operation signs in place of the asterisks, using all of them at least once (addition, subtraction, multiplication, division), in such a way – without using parentheses – that the result is:
7*7*7*7*7*7*7*7 = 34
(One solution is sufficient)
| Not supported with pagination yet
|
1162
|
2007
|
team games
|
no
|
C2 L1 L2
|
Algebra
|
the required number is 25116413
|
On an old sheet of paper, emerging from the memories of a cellar, a product is noted. However, time has rendered illegible the second factor and 3 of the 11 digits of the result (where each of the 3 illegible digits has now been replaced with a dot):
792 x = 1989 ·1990 · ·
By what number was 792 multiplied?
| Not supported with pagination yet
|
1205
|
2007
|
semifinal
|
no
|
L2 GP
|
Combinatorics
|
The numbers divisible by 11 are 285120.
|
Let's examine all numbers that are written using the 10 digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, each used once and only once (but which do not start with 0). How many of these numbers are divisible by 11?
| Not supported with pagination yet
|
1216
|
2007
|
final
|
no
|
C1 C2 L1 L2 GP
|
Pattern Recognition
|
• 6 numbers multiples of 3
• 5 numbers multiples of 4
• 4 numbers multiples of 5
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12
In this box, there are ……. numbers that are multiples of 3
In this box, there are ……. numbers that are multiples of 4
In this box, there are ……. numbers that are multiples of 5
Complete the sentences in the box with numbers (written in digits) so that all sentences contained in the box are simultaneously true.
| Not supported with pagination yet
|
1028
|
2008
|
team games
|
no
|
C2 L1 L2
|
Pattern Recognition
|
The largest number is 95617181920
|
Write, one after another, the integers from 1 to 20: 123...101112...1920. Then, from the resulting sequence, delete twenty digits. What is the greatest number that can remain?
| Not supported with pagination yet
|
1030
|
2008
|
team games
|
no
|
C2 L1 L2
|
Pattern Recognition
|
1 + 7 = 8
5 + 4 = 9
6 : 3 = 2
|
Replace the digits from 1 to 9 (using each digit exactly once) in place of the dots.
• • • + • • • = • • •
+ -
• • • + • • • = • • •
= =
• • • : • • • = • • •
| Not supported with pagination yet
|
1038
|
2008
|
team games
|
no
|
C2 L1 L2
|
Algebra
|
13658
|
In this sum, each letter represents a digit, and different letters represent different digits. We also know that R M Z A represents a multiple of 223. What number does the word E X T R A represent?
R M Z A +
M A T H =
__________________
E X T R A
| Not supported with pagination yet
|
1043
|
2008
|
team games
|
no
|
C2 L1 L2
|
Algebra
|
2-1; 3-1; 2-2; 5-2; 5-3;
|
Determine the pairs (a,b) of positive integers, with a ≥ b, for which (b^3+1)/(ab-1) is an integer.
| Not supported with pagination yet
|
1090
|
2008
|
final
|
no
|
L1 L2 GP
|
Algebra
|
15%, 16% and 17%
|
We decreased the width and increased the length of a rectangle by the same integer percentage. After this deformation, the rectangle's area decreased by a percentage between 2% and 3%.
By what percentage were the original width and length modified?
| Not supported with pagination yet
|
1096
|
2008
|
international final day 1
|
no
|
CE
|
Logic
|
Alternative, Alternative
|
On planet Sram there are three types of inhabitants: the Truth-tellers who always tell the truth; the Liars who always lie; and the Alternators who tell the truth once, then lie, then tell the truth, then lie, and so on.
Imagine you meet an inhabitant of planet Sram and ask them two questions, one after the other: "Are you a...?", "Are you a...?" Imagine also that your questions are such that they allow you to know what type of Sram inhabitant you are dealing with, whatever their answers may be.
What is the missing word in each of the two questions?
| Not supported with pagination yet
|
1117
|
2008
|
international final day 2
|
no
|
C1
|
Combinatorics
|
06 97 58 31 42
|
Gian Luigi is trying to remember Michele's cell phone number. He remembers that this number has 10 distinct digits, that it starts with 06, and that it does not contain any pair of consecutive digits where one is the successor of the other (i.e., it does not contain any combination like '12', '21', '23', '32', etc.). After a few moments of reflection, he also remembers that this number (naturally, considering the digits after the initial '0') is the largest possible number that has these properties. What is Michele's number?
| Not supported with pagination yet
|
1126
|
2008
|
international final day 2
|
no
|
L2 HC
|
Combinatorics
|
67645819
|
Ettore's computer password is a number N which in decimal notation is written with eight digits. Let A be the number represented by the first four digits and B that by the last four, so that the number N is written as `AB`: neither the first nor the fifth digit is `0`. Ettore knows that, if he were to forget his password, he could find it again based on the following conditions:
i) A > B;
ii) A and B are coprime (their only common divisor is 1);
iii) N is a term of the sequence whose first and second terms are A and B and whose subsequent terms are the sum of the two preceding numbers.
What is Ettore's computer password?
| Not supported with pagination yet
|
879
|
2009
|
autumn games CE
|
no
|
CE
|
Arithmetic
|
The largest odd number required is: 921
|
Write the largest three-digit odd number such that the sum of its digits is equal to 12.
| Not supported with pagination yet
|
888
|
2009
|
autumn games
|
no
|
C2 L1
|
Pattern Recognition
|
3/4040099
|
Write the result of the product indicated below in the form of an irreducible fraction (one that cannot be simplified further).
1/5 x 3/7 x 5/9 x .... x 2005/2009 x 2007/2011
| Not supported with pagination yet
|
899
|
2009
|
team games
|
no
|
C2 L1 L2
|
Combinatorics
|
381654729
|
Find a nine-digit number (all digits distinct from each other and non-zero) that is divisible by 9 and such that:
- the number formed by its first 2 digits is divisible by 2;
- the number formed by its first 3 digits is divisible by 3;
- ...
- the number formed by its first 7 digits is divisible by 7;
- the number formed by its first 8 digits is divisible by 8.
| Not supported with pagination yet
|
901
|
2009
|
team games
|
no
|
C2 L1 L2
|
Arithmetic
|
109-119-129-139-149-159-169-179-189-199
|
If a three-digit number is divided by the sum of its digits, the result is 10...with a certain remainder. What number are we talking about? (Maybe one is easy to find...the problem is finding them all...).
| Not supported with pagination yet
|
908
|
2009
|
team games
|
no
|
C2 L1 L2
|
Arithmetic
|
712000000
|
A nine-digit number (the last six, however, are all zeros), divided by 787, gives a remainder of 313. What is this number?
| Not supported with pagination yet
|
910
|
2009
|
team games
|
no
|
C2 L1 L2
|
Logic
|
Sara has to turn the cards 1-A-2-Z (points 2)
|
Each of these cards has a letter written on one side and a digit on the other. Sergio tells his sister Sara that if a card has a "1" on one side, it necessarily has an "A" on the other and vice versa. Sara doesn't believe him and decides to verify it personally. Which cards must Sara absolutely turn over to be sure that Sergio's statement is true?
| Not supported with pagination yet
|
912
|
2009
|
team games
|
no
|
C2 L1 L2
|
Combinatorics
|
481-518-592-629
|
Consider a three-digit number, all its digits distinct from each other and non-zero. This number 'has the average' when it is equal to the arithmetic mean of the 6 numbers obtained by permuting its digits in all possible ways.
What are all the three-digit numbers (with distinct, non-zero digits) that 'have the average'?
| Not supported with pagination yet
|
914
|
2009
|
team games
|
no
|
C2 L1 L2
|
Algebra
|
459-918
|
In a distant Italian final of the "International Mathematical Games Championships", less than 5000 competitors participated, coming from 5 regions. Parity had not been reached, and among the finalists from Lombardy, the boys were twice the number of girls; three times among the Sicilians; the boys were four times the number of girls in the Venetian delegation; five times among the Piedmontese; and six times among the Tuscans.
Knowing that the competitors (boys and girls) from Lombardy, Sicily, Veneto, Piedmont, and Tuscany were present in the same number, what was the total number of female finalists? (Perhaps there is more than one solution... in this case, all of them must be indicated!)
| Not supported with pagination yet
|
927
|
2009
|
Rosi's games
|
no
|
C2 L1 L2
|
Arithmetic
|
The number 2000 can be written as 1×4²×5³ or also as 1×2⁴×5³. The order of the factors is obviously not important.
|
Using the operations of addition, subtraction, multiplication, division, and exponentiation (all or just some of them), express the number 2000 using the digits 1, 2, 3, 4, 5 (each of which must appear exactly once).
| Not supported with pagination yet
|
929
|
2009
|
Rosi's games
|
no
|
C2 L1 L2
|
Arithmetic
|
The question admits different answers. For example: 98 – 76 + 54 + 3 + 21 but also (always for example) 9+8+76+5 -4 +3 + 2 + 1.
|
If you suitably separate the digits of the number 123456789 with some addition and subtraction signs, you can obtain the number 100 as a result. For example, 123-45-67+89 = 100. Can you do the same with the digits of the number 987654321?
| Not supported with pagination yet
|
930
|
2009
|
Rosi's games
|
no
|
C2 L1 L2
|
Arithmetic
|
The addition is: 120473 + 163504 = 283977.
|
Complete the following addition by inserting (once and only once) the digits in the blank spaces: 0, 2, 3, 4, 8, 9.
1 . 0 . 7 3 +
1 6 . 5 . 4 =
---------------
2 . 3 . 7 7
| Not supported with pagination yet
|
950
|
2009
|
semifinal
|
no
|
L2 GP
|
Geometry
|
(1,4,16); (2,3,14); (2,4,8); (2,5,6); (4,4,4)
|
For her celebration, Chiara and Anna's mother receives a gift from her daughters, wrapped in a box in the shape of a rectangular prism, whose dimensions are all integer numbers of centimeters. The length of the ribbon used around the package (without counting the bow) - expressed in centimeters - is equal to half the measure of the surface area of the wrapping paper (the total surface area of the prism), expressed in square centimeters. What are the three dimensions of the package, listed in ascending order?
| Not supported with pagination yet
|
967
|
2009
|
final
|
no
|
L2 GP
|
Arithmetic
|
1-2-3-4-6-8-24 ; 1-2-3-6-8-12-16
|
List (in ascending order) 7 distinct positive numbers such that their sum is divisible by each of the 7 numbers, and the sum is the smallest possible.
| Not supported with pagination yet
|
969
|
2009
|
final
|
no
|
GP
|
Pattern Recognition
|
269 – 296 – 629 – 692 – 926 – 962 – 667 – 676 – 766 – 799 – 979 – 997
|
Choose a natural number that has at most three digits and write it down. Then, sum the squares of its digits: you will get a second number. With this number, restart the operation, which consists of adding the squares of the digits and writing the result, until the number you are about to write is equal to a number already written.
For example: 409→ 97→ 130→ 10→ 1
Which number will produce the longest list?
| Not supported with pagination yet
|
980
|
2009
|
international final day 1
|
no
|
C2 L1 GP L2 HC
|
Geometry
|
3pigreco m2
|
The base of Giuliano's doghouse is shaped like a regular hexagon whose side measures 1 meter. The doghouse is enclosed and the dog is tied outside the doghouse to a vertex of the hexagon by a chain that measures 2 meters. What is, in square meters, the area of the region outside the doghouse that the dog can tread upon? Give the exact answer, using π, if necessary (assume that the dog cannot place its paws beyond the maximum extension of the chain).
| Not supported with pagination yet
|
989
|
2009
|
international final day 2
|
no
|
CE C1 C2 L1 GP L2 HC
|
Combinatorics
|
Row 1: 5
Row 2: 4 5
Row 3: 3 4 5
Row 4: 2 3 4 5
Row 5: 1 2 3 4 5
|
Write '1', '2', '3', '4' or '5' in each circle of the grid, respecting the following conditions:
– '1' must appear once, '2' twice, '3' three times, '4' four times, and '5' five times;
– No row and no column must contain the same digit twice.
| Not supported with pagination yet
|
999
|
2009
|
international final day 2
|
no
|
C2 L1 GP L2 HC
|
Arithmetic
|
418095
|
A book has pages numbered from 1 to 999 inclusive. A worm eats the paper in such a way that all zeros disappear (and no other digit). For example: '20' becomes '2'; '300' becomes '3'; '450' becomes '45'; '607' becomes '607', etc. What is the sum of all the numbers that remain to indicate the book's pages (including those that remained intact) after the worm's passage?
| Not supported with pagination yet
|
1001
|
2009
|
international final day 2
|
no
|
L1 GP L2 HC
|
Combinatorics
|
2 solutions:
Row 1: B I C
Row 2: F E D
Row 3: G A H
---
Row 1: B I D
Row 2: G E C
Row 3:F A H
|
Nine children — Alessandro, Bernardo, Clotilde, Davide, Elsa, Federico, Gabriella, Hildegard, and Ines — all have a bib with a different number. The order in which the numbers are assigned is the same as the alphabetical order of their names: the number assigned to Alessandro is smaller than the one assigned to Bernardo, which in turn is smaller than the one assigned to Clotilde, etc. Each child takes a place in a cell of a 3 × 3 square, drawn on the ground with chalk. Each cell is occupied by only one child. The square is a magic square: the sum of the numbers on the bibs of the children arranged on the same row, the same column, or the same diagonal is always the same. The square is oriented such that the number on the bib of the child placed in the top-left cell is the smallest among those placed in the four corner cells of the square, while the number on the bib of the child placed in the top-right cell is smaller than the number on the bib of the child placed in the bottom-left cell. Find the position of each child. Note: answer by writing the initials of the children's names in the cells of the diagram.
| Not supported with pagination yet
|
771
|
2010
|
autumn games
|
no
|
L2
|
Arithmetic
|
2024067
|
Amerigo, however, is grappling with a calculation. Help him calculate the value of this expression:
1 x 3 - 5 x 7 + 9 x 11 – 13 x 15 + ….. – 2005 x 2007 + 2009 x 2011
| Not supported with pagination yet
|
788
|
2010
|
team games
|
no
|
C2 L1 L2
|
Logic
|
A=4; D=1; G=6; I=2; M=8
|
Alessandra, Donato, Giovanni, Ingrid and Michele, after resting on bench no. 6, participate in a prize draw: a prize is associated with each integer from 1 to 12 (inclusive). Each of the five friends draws two numbers but, to make the game more exciting, they only communicate the sum of the drawn numbers to their friends: Alessandra 11, Donato 4, Giovanni 16, Ingrid 7, Michele 19. What is the smallest number drawn by each of the five friends?
| Not supported with pagination yet
|
836
|
2010
|
final
|
no
|
C2 L1 L2 GP
|
Algebra
|
(2,100), (4,72), (14,28)
|
Add the sum, the (positive) difference, the product, and the quotient of two positive integers. If you get 450, what are these two numbers (written in ascending order)?
| Not supported with pagination yet
|
839
|
2010
|
final
|
no
|
L2 GP
|
Algebra
|
13, 27, 35, 65, 65
|
Paolo owns a certain number of piggy banks, each of which contains an integer number of Euros. He then enjoys calculating the sum of the Euros contained in each pair of his piggy banks and writes down the resulting numbers in a notebook: 40, 48, 62, 78, 92, 100, 130 (some of these numbers were obtained twice, but none three times).
Write, in increasing order, the amounts of Euros contained in the different piggy banks.
| Not supported with pagination yet
|
853
|
2010
|
international final day 1
|
no
|
C2 L1 GP L2 HC
|
Algebra
|
7 solutions: 525; 7425; 8325; 8925; 11625; 15225; 26325.
|
An odd box is a rectangular cuboid whose three dimensions each measure an odd integer number of centimeters.
We fill it with the largest possible number of cubes with a side length of 2 cm, by arranging the edges of the cubes parallel to those of the box. What is the volume of the box, knowing that the cubes occupy 64% of it? (How many solutions does the problem admit?)
| Not supported with pagination yet
|
856
|
2010
|
international final day 1
|
no
|
L2 HC
|
Pattern Recognition
|
20121012
|
Arianna starts with 2. Then she iteratively replaces all '2's with '210', all '1's with '20', and all '0's with '1'.
And thus obtains, successively:
2; 210; 210201; 210201210120; 210201210120210201202101; ….. By convention, from left to right, the digit occupying position 0 is '2', that in position 1 is '1', that in position 2 is '0', that in position 3 is '2', and that in position 4 is '0'. What are the nine digits that occupy positions from 2002 to 2010 (inclusive)?
| Not supported with pagination yet
|
864
|
2010
|
international final day 2
|
no
|
C1 C2 L1 GP L2 HC
|
Logic
|
Alice says:"Camilla is a Yes-Yes”; Bob says:”Daniele is a Yes-Yes”; Camilla says:”Alice is a Yes-Yes"; Daniele says:"Bob is a Yes-Yes".
|
In Logicland, there are two types of people: the Yes-Yes who always tell the truth, and the No-No who never tell the truth. Two Yes-Yes and two No-No each make a statement concerning one of the other three: Alice says: "… is a Yes-Yes"; Bob says: "Daniel is a Yes-Yes"; Camilla says: "… is a Yes-Yes"; Daniel says: "… is a Yes-Yes". Complete by inserting the missing names.
| Not supported with pagination yet
|
872
|
2010
|
international final day 2
|
no
|
L1 GP L2 HC
|
Algebra
|
60481729
|
Mattia has found an eight-digit number, all of whose digits are distinct, equal to the square of the sum of the two four-digit numbers formed respectively by its first four digits and its last four digits. Find Mattia's number.
| Not supported with pagination yet
|
🧮 MathGames
MathGames is a novel benchmark of 2,183 high-quality mathematical problems—both text-only and multimodal—designed to evaluate Large Language Models (LLMs) on open-ended mathematical and logical reasoning tasks. It accompanies our EMNLP 2025 Main Track paper:
📄 Can Large Language Models Win the International Mathematical Games?
🌍 Overview
MathGames consists of carefully curated problems sourced from the International Mathematical and Logical Games Championships, an annual international competition promoting creative and logical problem solving.
Total problems: 2,183
- 🧠 1,389 textual problems
- 🖼️ 794 multimodal problems (text + image)
Format: Open-ended (no multiple-choice answers)
Age range: 8 years old to 25+
Skill taxonomy: Problems are labeled according to the underlying mathematical and logical skills required.
Validation: All problem-solution pairs were manually verified by expert annotators.
This benchmark aims to provide a structured and interpretable evaluation of the reasoning abilities of LLMs across both mathematical domains and cognitive skill levels.
All materials in MathGames are sourced from the official online archive of the PRISTEM Center, Bocconi University, which retains full rights to the original content. We obtained explicit authorization from PRISTEM to use, translate, and distribute the problems and solutions in English, in full compliance with applicable copyright and licensing regulations. This dataset is provided exclusively for research and evaluation purposes, with the primary goal of advancing studies on mathematical and logical reasoning in LLMs. Use of the data for model training, commercial redistribution, or derivative works is not permitted without prior written authorization from PRISTEM, Bocconi University.
🧩 Structure of the Competition
- The dataset mirrors the official structure of the International Mathematical and Logical Games Championships, which organizes participants by educational level into seven categories.
- Each problem in MathGames is tagged with its original competition category and phase.
- MathGames introduces also a coarse-grained taxonomy of mathematical and logical skills, capturing the primary reasoning abilities required to solve each problem:
🎓 Categories
| Code | Description |
|---|---|
| CE | 4ᵗʰ–5ᵗʰ grade (ages 9–10) |
| C1 | 6ᵗʰ–7ᵗʰ grade (first–second year of lower secondary school) |
| C2 | 8ᵗʰ–9ᵗʰ grade (third year of lower secondary to first year of upper secondary) |
| L1 | 10ᵗʰ–12ᵗʰ grade (second–fourth year of upper secondary school) |
| L2 | Final year of upper secondary to second year of university |
| GP | General Public: adults and university students |
| HC | High Competition: past finalists and medalists |
These categories ensure coverage from elementary-level reasoning to advanced logical and mathematical problem-solving.
🧠 Skill Taxonomy
- Arithmetic
- Logic
- Pattern Recognition
- Geometry
- Combinatorics
- Algebra
This taxonomy enables skill-based evaluation of LLMs’ mathematical reasoning, highlighting strengths and weaknesses across distinct domains of cognitive ability.
🏆 Competition Phases
Each championship consists of four competitive phases, progressively filtering participants based on performance:
- Quarterfinals
- Semifinals
- National Finals
- International Finals
In addition, several training and preparatory events are included, such as:
- Autumn Games
- Rosi’s Games
- Team Games
These events promote engagement and serve as practice opportunities for developing reasoning skills.
| Event | # Problems | Categories |
|---|---|---|
| Autumn Games | 478 | CE, C1, C2, L1, L2, HC |
| Team Games | 357 | C2, L1, L2 |
| Rosi’s Games | 275 | C2, L1, L2 |
| Quarterfinals | 16 | C1, C2, L1, L2 |
| Semifinals | 314 | C1, C2, L1, L2, GP |
| Final | 1,073 | CE, C1, C2, L1, L2, GP, HC |
| International Final | 421 | CE, C1, C2, L1, L2, GP, HC |
📂 Dataset Structure
Each entry in MathGames corresponds to a single problem–solution pair, optionally accompanied by an image. All problems are annotated with their competition metadata, modality, and subject category.
| Field | Type | Description |
|---|---|---|
id |
string |
Unique identifier for the problem within the dataset. |
year |
string |
Year in which the problem appeared in the competition. |
type |
string |
Competition phase or event (e.g., autumn, semifinal, final, international_final). |
multimodal |
string |
Indicates whether the problem includes an image ("yes" or "no"). |
category |
string |
One or more competition categories associated with the problem (e.g., C1, C2, L1, L2, GP). |
subject |
string |
Main mathematical domain or skill area (e.g., Logic, Combinatorics, Geometry). |
question |
string |
Full textual description of the problem as presented to participants. |
answer |
string |
Verified solution or reasoning explaining how to reach the correct answer. |
image |
Image (optional) |
Associated visual element (if multimodal == "yes"). Stored as a PIL image. |
🧩 Load Data
You can easily load the MathGames benchmark using the 🤗 datasets library:
from datasets import load_dataset
# Load the multimodal or textual subset
ds_multimodal = load_dataset("disi-unibo-nlp/MathGames", split="multimodal") # or split="textual"
# Inspect the first entry
print(ds_multimodal[0])
This is an example of a multimodal entry:
{
'id': '1952',
'year': '1996',
'type': 'semifinal',
'multimodal': 'yes',
'category': 'C1 C2 L1 L2 GP',
'subject': 'Logic',
'answer': 'The sum of four cells is always 24. The grid is:\nRow 1: 1, 6, 3\nRow 2: 9, 8, 7\nRow 3: 2, 5, 4',
'question': 'Fill the nine cells of the square above with the numbers from 1 to 9 (1 and 7 have already been placed) such that the sum of the numbers written in each 4-cell square (like those highlighted in the figure) is always the same (figure).',
'image': <PIL.JpegImagePlugin.JpegImageFile image mode=RGB size=132x75>
}
📑 Citation
If you use MathGames in your research, please cite:
@inproceedings{cocchieri-etal-2025-large,
title = "Can Large Language Models Win the International Mathematical Games?",
author = "Cocchieri, Alessio and
Ragazzi, Luca and
Tagliavini, Giuseppe and
Tordi, Lorenzo and
Carbonaro, Antonella and
Moro, Gianluca",
editor = "Christodoulopoulos, Christos and
Chakraborty, Tanmoy and
Rose, Carolyn and
Peng, Violet",
booktitle = "Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing",
month = nov,
year = "2025",
address = "Suzhou, China",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2025.emnlp-main.488/",
doi = "10.18653/v1/2025.emnlp-main.488",
pages = "9656--9682",
ISBN = "979-8-89176-332-6",
abstract = "Recent advances in large language models (LLMs) have demonstrated strong mathematical reasoning abilities, even in visual contexts, with some models surpassing human performance on existing benchmarks. However, these benchmarks lack structured age categorization, clearly defined skill requirements, and{---}crucially{---}were not designed to assess human performance in international competitions. To address these limitations, we introduce MathGames, a new benchmark of 2,183 high-quality mathematical problems (both text-only and multimodal) in an open-ended format, sourced from an international mathematical games championships. Spanning seven age groups and a skill-based taxonomy, MathGames enables a structured evaluation of LLMs' mathematical and logical reasoning abilities. Our experiments reveal a substantial gap between state-of-the-art LLMs and human participants{---}even 11-year-olds consistently outperform some of the strongest models{---}highlighting the need for advancements. Further, our detailed error analysis offers valuable insights to guide future research. The data is publicly available at https://disi-unibo-nlp.github.io/math-games."
}
📬 Contact
For questions, feedback, or collaboration inquiries, please contact:
- Alessio Cocchieri [[email protected]]
- Luca Ragazzi [[email protected]]
- Downloads last month
- 142