JMO2023
JMO2023
2023
ArtJapan Mathematical
of Problem Solving Olympiad
AoPS Online Preliminary
Beast Academy AoPS Academy
1 Find the smallest positive integer, such that the sum and the product of it and are both square numbers.
YII.I.
view topic
2 For any positive integer, if the number of 's in its digits is greater than the number of 's in its digits, we call that is a good number. And if the number
of 's in its digits is more than the number of 's in its digits, we call that is a bad number. For example, there are two 's and one in the number
YII.I.
, so is a good number. But in the number , the number of and are both one, so is neither a good number nor a bad number.
view topic
Find the difference of numbers of good numbers and bad numbers among the positive integer not greater than .
3 Suppose is a regular triangle with side length . Take points on the side respectively, such that ,
. Find the length of . YII.I.
view topic
4
For any two positive real numbers , we define . Find the value of
YII.I.
view topic
5 Suppose is a set of pair-wisely different positive integers. If can form an arithmetic series (in this order),
find the smallest positive value of . YII.I.
view topic
6 A regular hexagon is inscribed in a rectangle as shown in the picture. If the area of the shaded triangle and shaded quadrilateral are
respectively. Find the area of the hexagon.
YII.I.
view topic
YII.I.
view topic
8 Consider a figure consisting with circles and segments, as shown in the picture. We fill each circle with a number in . For any method
of filling numbers, we define the beauty value of this method as the number of lines where the difference between the numbers written on the two
YII.I.
circles at both ends is . If is the maximum possible beauty value among all the methods of filling numbers, find the number of methods such that view topic
its beauty value is .
YII.I.
view topic
10 In an acute triangle , we define is the projection of on the side , and is the mid-point of . Take a point on the line segment
such that . If we have and , find the .
YII.I.
view topic
11 A, B play a game. In the beginning, they write the numbers on the blackboard, and fix a non-empty subsets of .
Then, A erase all numbers in on the blackboard. From now on, they start with B and take turns doing the following:
YII.I.
- Choose one or more integer(s), such that any of them is not coprime with any number erased in the opponent's last turn. Then erase this nunber or view topic
these numbers on the blackboard.
If someone cannot choose at least one number and erase it, the game is over. This people loses and his opponent wins.
How many are there, in which A always has a strategy to win, regardless of B's actions?
12 The set consists with some functions from to satisfying the following two conditions:
- For any function in and two integers ( ), we have . YII.I.
- For any functions in and any integer ( ), we have . view topic
Find the maximal possible number of elements in .
https://artofproblemsolving.com/community/c3290889_2023_japan_mathematical_olympiad_preliminary 1/1