Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?

KöMaL Problems in Mathematics, October 2021

Please read the rules of the competition.


Show/hide problems of signs:


Problems with sign 'K'

Deadline expired on November 10, 2021.


K. 699. We have six discs. Each disc has a letter on one side (A, B, C, D, E, F), and a number on the other side (1, 2, 3, 4, 5, 6, in some order). The discs are placed on the table with their letter side up. Given that the sum of the numbers on the discs marked A, B and C is 14, and the sum of the numbers on discs A, D and E is 12, what is the minimum number of discs to be turned over in order to know which number is on which disc?

(5 pont)

solution (in Hungarian), statistics


K. 700. We have ten cards numbered 1, 2, 3, 4, 5, 6, 7, 8, 9 and 10. The cards are placed on the table in a row, and their numbers are added up in sets of three: first the cards in positions 1, 2, 3; then those in positions 2, 3, 4; followed by positions 3, 4, 5; and so on; finally adding up the numbers on the cards in positions 8, 9, 10. The sums obtained in this way are 14, 18, 24, 23, 24, 21, 16, 12, in this order. What is the sum of the numbers on the cars in the first and last positions?

(5 pont)

solution (in Hungarian), statistics


K. 701. A flea is sitting on the 0 mark of the number line, ready to jump. With each jump of the flea it moves 3 or 5 units either to the left or to the right. The flea needs to visit every integer from 1 to 20. Find a possible sequence of at most 22 jumps that will let the flea achieve that goal.

(5 pont)

solution (in Hungarian), statistics


Problems with sign 'K/C'

Deadline expired on November 10, 2021.


K/C. 702. Five cards were drawn from a deck of 52 French cards. It turned out that none of them are face cards, and there is at least one card from each suit. The sum of the even denominations among them is equal to the sum of the odd denominations. The sum of the spades is 14, the sum of the red cards is 10, and the card with the lowest denomination is a heart. Which cards were drawn?

(5 pont)

solution (in Hungarian), statistics


K/C. 703. In a positive decimal fraction, the decimal point is shifted four places to the right. The resulting number is four times the reciprocal of the original number. What is the original number?

(5 pont)

solution (in Hungarian), statistics


Problems with sign 'C'

Deadline expired on November 10, 2021.


C. 1684. Prove that there exists no pentagon in which all sides are equal in length and two angles are \(\displaystyle 60^{\circ}\).

(5 pont)

solution (in Hungarian)


C. 1685. In a royal dynasty, there are eight brothers. The present king is the eldest brother. As a rule, a brother will come to the throne when he is the oldest of those alive. However, there is a curse on the dynasty: whenever each of three successive brothers comes to the throne, the following brother will die from despair. In how many different ways may the brothers rule? (Only the set of those coming to throne matters.)

(5 pont)

solution (in Hungarian)


C. 1686. The hypotenuse of the right-angled triangle \(\displaystyle ABC\) is \(\displaystyle AB\). The interior angle bisector \(\displaystyle f\) drawn from vertex \(\displaystyle A\) intersects side \(\displaystyle BC\) at point \(\displaystyle D\). Prove that the geometric mean of line segments \(\displaystyle AB-BD\) and \(\displaystyle AC+CD\) equals the length of angle bisector \(\displaystyle f = AD\).

Proposed by N. Zagyva, Baja

(5 pont)

solution (in Hungarian)


C. 1687. I found three shopping lists in a shopping bag. The first list included 23 buns, 13 apples and 15 eggs, the second list had 9 buns, 3 apples and 28 eggs, and the third one had 25 buns, 18 apples and 11 eggs. The amount paid for these items on list one was 2021 forints (HUF, Hungarian currency), and the items on lists two and three cost 2031 and 2041 forints, but I cannot remember which sum belongs to which list. Each of the three kinds of products costs a whole number of forints a piece. What is the piece price of each item?

Proposed by M. E. Gáspár, Budapest

(5 pont)

solution (in Hungarian)


C. 1688. The single mode of a set of data is \(\displaystyle 2\), the median is \(\displaystyle 3\), the mean is \(\displaystyle 4\), and the range is \(\displaystyle 5\). How many elements may the data set have?

(5 pont)

solution (in Hungarian), statistics


Problems with sign 'B'

Deadline expired on November 10, 2021.


B. 5190. In a table of \(\displaystyle n\) rows and \(\displaystyle k\) columns, there is \(\displaystyle -1\) written in each field. In each move, one row and one column is selected. Each number in the row is changed to the opposite, and then each number in the column is changed to the opposite.

For what values of \(\displaystyle n\) and \(\displaystyle k\) is it possible to achieve a value of \(\displaystyle +1\) in every field of the whole table?

Proposed by J. Szoldatics, Budapest

(3 pont)

solution (in Hungarian)


B. 5191. We have a wooden set square, but the hypotenuse has been chewed by a rabbit. With the set square we can join points lying close enough, we can extend straight line segments, and we can draw a perpendicular to any line at any point. Can we construct the centre of a given circle however large its size?

Proposed by M. E. Gáspár, Budapest

(4 pont)

solution (in Hungarian), statistics


B. 5192. Eight boys decided to play a game of football, four against four, on each of the first seven days of the autumn break. Is it possible to organize the teams so that any set of three boys would play in the same team at least once?

Based on the idea of M. E. Gáspár, Budapest

(5 pont)

solution (in Hungarian)


B. 5193. In an acute-angled triangle \(\displaystyle ABC\), \(\displaystyle \angle BCA =45^{\circ}\), the feet of the altitudes on sides \(\displaystyle BC\), \(\displaystyle CA\), \(\displaystyle AB\) are \(\displaystyle D\), \(\displaystyle E\), \(\displaystyle F\), respectively, and the orthocentre is \(\displaystyle M\). Point \(\displaystyle F\) divides line segment \(\displaystyle AB\) in a ratio \(\displaystyle {AF}:{FB}={2}:{3}\). \(\displaystyle G\) is the point on side \(\displaystyle AC\) for which \(\displaystyle CG=BM\). Show that the centroid of triangle \(\displaystyle ABG\) is \(\displaystyle M\).

(4 pont)

solution (in Hungarian), statistics


B. 5194. In a triangle \(\displaystyle ABC\), \(\displaystyle \angle ABC =2\angle CAB\). Side \(\displaystyle AB\) touches the inscribed circle at point \(\displaystyle E\), and intersects the angle bisector drawn from \(\displaystyle C\) at point \(\displaystyle F\). Prove that \(\displaystyle AF=2BE\).

(4 pont)

solution (in Hungarian), statistics


B. 5195. Prove that the inequality \(\displaystyle x^{p}\cdot y^{1-p}<x+y\) holds for every pair of positive real numbers \(\displaystyle (x,y)\), and all real numbers \(\displaystyle 0<p<1\).

(3 pont)

solution (in Hungarian), statistics


B. 5196. Let \(\displaystyle p(x)=2x+1\). \(\displaystyle A\) is a subset of set \(\displaystyle S=\{1,2,\dots,2021\}\) such that it contains at most one of the numbers \(\displaystyle n\), \(\displaystyle p(n)\), \(\displaystyle p\big(p(n)\big)\) for every \(\displaystyle n\), but this condition will not hold anymore if any extra element of \(\displaystyle S\) is added to \(\displaystyle A\). What may be the number of elements in the set \(\displaystyle A\)?

(6 pont)

solution (in Hungarian), statistics


B. 5197. Let \(\displaystyle \mathbb{N}\) denote the set of non-negative integers, and let \(\displaystyle k\) be a given positive integer. Is there a monotonically increasing function \(\displaystyle f \colon \mathbb{N} \to \mathbb{N}\) such that

\(\displaystyle f\big(f(x)\big) = f(x) + x + k \)

for all \(\displaystyle x \in \mathbb{N}\)?

(6 pont)

solution (in Hungarian)


Problems with sign 'A'

Deadline expired on November 10, 2021.


A. 806. Four distinct lines are given in the plane, which are not concurrent and no three of which are parallel. Prove that it is possible to find four points in the plane, \(\displaystyle A\), \(\displaystyle B\), \(\displaystyle C\) and \(\displaystyle D\) with the following properties:

\(\displaystyle (i)\) \(\displaystyle A\), \(\displaystyle B\), \(\displaystyle C\) and \(\displaystyle D\) are collinear in this order;

\(\displaystyle (ii)\) \(\displaystyle AB=BC=CD\);

\(\displaystyle (iii)\) with an appropriate order of the four given lines \(\displaystyle A\) is on the first, \(\displaystyle B\) is on the second, \(\displaystyle C\) is on the third and \(\displaystyle D\) is on the fourth line.

Proposed by Kada Williams, Cambridge

(7 pont)

solution (in Hungarian)


A. 807. Let \(\displaystyle n \ge 2\) be a given integer. Let \(\displaystyle G\) be a finite simple graph with the property that each of its edges is contained in at most \(\displaystyle n\) circuits. Prove that the chromatic number of the graph is at most \(\displaystyle n+1\).

Proposed by Ádám Schweitzer, Budapest

(7 pont)

solution (in Hungarian)


A. 808. Find all triples of positive integers \(\displaystyle a\), \(\displaystyle b\) and \(\displaystyle c\) such that \(\displaystyle a\), \(\displaystyle b\) and \(\displaystyle c\) are pairwise relatively prime and

\(\displaystyle a^2+3b^2c^2=7^c. \)

Proposed by Nikolai Beluhov, Bulgaria

(7 pont)

solution (in Hungarian), statistics


Upload your solutions above.