BD Math Olympiad 2022 national questions

BD Math Olympiad 2022 national questions

 

 Primary level

1. āĻāĻ•āϟāĻŋ āϞāĻžāχāύ⧇ 50 āϜāύ āĻŽāĻžāύ⧁āώ āĻĻāĻžāρāĻĄāĻŧāĻŋāϝāĻŧ⧇ āφāϛ⧇, āĻāĻĻ⧇āϰ āĻ•āϝāĻŧ⧇āĻ•āϜāύ āϏāĻ¤ā§āϝāĻŦāĻžāĻĻā§€ āϝāĻžāϰāĻž āϏāĻŦāϏāĻŽāϝāĻŧ āϏāĻ¤ā§āϝ āĻŦāϞ⧇ āĻāĻŦāĻ‚ āĻŦāĻžāĻ•āĻŋāϰāĻž āĻŽāĻŋāĻĨā§āϝāĻžāĻŦāĻžāĻĻā§€ āϝāĻžāϰāĻž āϏāĻŦāϏāĻŽāϝāĻŧ āĻŽāĻŋāĻĨā§āϝāĻž āĻŦāϞ⧇āĨ¤ āϞāĻžāχāύ⧇āϰ āĻĒāĻŋāĻ›āύ āĻĨ⧇āϕ⧇ āĻĒā§āϰāĻĨāĻŽ āϜāύ āĻŦāϞāϞ, “āφāĻŽāĻžāϰ āϏāĻžāĻŽāύ⧇ āϏāĻŦāĻžāχ āĻŽāĻŋāĻĨā§āϝāĻžāĻŦāĻžāĻĻā§€â€, āĻĻā§āĻŦāĻŋāϤ⧀āϝāĻŧ āϜāύ āĻŦāϞāϞ, “āφāĻŽāĻžāϰ āĻĒāĻŋāĻ›āύ⧇ āϏāĻŦāĻžāχ āĻŽāĻŋāĻĨā§āϝāĻžāĻŦāĻžāĻĻā§€â€, āϤ⧃āϤ⧀āϝāĻŧ āϜāύ āĻŦāϞāϞ, “āφāĻŽāĻžāϰ āϏāĻžāĻŽāύ⧇ āϏāĻŦāĻžāχ āĻŽāĻŋāĻĨā§āϝāĻžāĻŦāĻžāĻĻā§€â€, āϚāϤ⧁āĻ°ā§āĻĨ āϜāύ āĻŦāϞāϞ, “āφāĻŽāĻžāϰ āĻĒāĻŋāĻ›āύ⧇ āϏāĻŦāĻžāχ āĻŽāĻŋāĻĨā§āϝāĻžāĻŦāĻžāĻĻā§€â€… āĻ…āĻ°ā§āĻĨāĻžā§Ž āĻĒā§āϰāĻĨāĻŽ āϜāύ āĻĨ⧇āϕ⧇, āϤ⧃āϤ⧀āϝāĻŧ, āĻĒāĻžā§āϚāĻŽ,… 49-āϤāĻŽ āϏāĻŦāĻžāχ āĻŦāϞāϞ “āφāĻŽāĻžāϰ āϏāĻžāĻŽāύ⧇ āϏāĻŦāĻžāχ āĻŽāĻŋāĻĨā§āϝāĻžāĻŦāĻžāĻĻā§€â€ āĻāĻŦāĻ‚ āĻĒāĻŋāĻ›āύ āĻĨ⧇āϕ⧇ āĻĻā§āĻŦāĻŋāϤ⧀āϝāĻŧ, āϚāϤ⧁āĻ°ā§āĻĨ,… 50-āϤāĻŽ āϏāĻŦāĻžāχ āĻŦāϞāϞ “āφāĻŽāĻžāϰ āĻĒāĻŋāĻ›āύ⧇ āϏāĻŦāĻžāχ āĻŽāĻŋāĻĨā§āϝāĻžāĻŦāĻžāĻĻā§€āĨ¤â€ āϏāĻ°ā§āĻŦā§‹āĻšā§āϚ āĻ•āϤ āϜāύ āϏāĻ¤ā§āϝāĻŦāĻžāĻĻā§€, āϏ⧇āĻ•ā§āώ⧇āĻ¤ā§āϰ⧇ āϏāĻ¤ā§āϝāĻŦāĻžāĻĻā§€āϰāĻž āĻ•āĻžāϰāĻž āĻ•āĻžāϰāĻž?

In a line 50 people are standing, some of them are truthful who always speak the truth and remaining are liars who always tell lies. The first person from the back of the line says, “Everyone in front of me is a liar”, the second person says, “Everyone behind me is a liar”, the third person says,“Everyone in front of me is a liar”, the fourth person says, “Everyone behind me is a liar”, … In other words, the first, third, fifth, ¡ ¡ ¡ , 49-th person from the back say, “Everyone in front of me is a liar” and the second, forth, sixth, ¡ ¡ ¡ , 50-th person from the back say, “Everyone behind me is a liar”. At most how many of them are truthful, and in that case who are the truthful?

2. āϚāĻŋāĻ¤ā§āϰ⧇ ABCD, BDFE, ACGH āϤāĻŋāύāϟāĻŋ āĻŦāĻ°ā§āĻ—āĨ¤ ADFEIGH āϏāĻŽā§āĻĒā§‚āĻ°ā§āĻŖ āĻŦāĻšā§āϭ⧁āϜāϟāĻŋāϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞ 750 āĻŦāĻ°ā§āĻ— āĻāĻ•āĻ• āĻšāϞ⧇ BD-āĻāϰ āĻĻ⧈āĻ°ā§āĻ˜ā§āϝ āĻ•āϤ?

BD Math Olympiad 2022 national questions

In the figure ABCD,BDFE,ACGH are three squares. If the area of the whole polygon ADFEIGH is 750 square units, what is the length of BD?

3. āϜāĻžāĻšāĻŋāύ 1 āĻĨ⧇āϕ⧇ 2000-āĻāϰ āĻŽāĻ§ā§āϝ⧇ āϏāĻŦāϗ⧁āϞ⧋ āϏāĻ‚āĻ–ā§āϝāĻž āĻāĻ•āϟāĻŋ āϏāĻžāϰāĻŋāϤ⧇ āϞāĻŋāĻ–āϞ⧋āĨ¤ āϤāĻžāϰāĻĒāϰ āĻĒā§āϰāϤāĻŋāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āύāĻŋāĻšā§‡ āĻ“āχ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻĄāĻžāύ⧇ āϝāϤāϗ⧁āϞ⧋ 0 āφāϛ⧇ āϤāĻž āϞāĻŋāĻ–āϞ⧋āĨ¤ āϝ⧇āĻŽāύ: 1010-āĻāϰ āύāĻŋāĻšā§‡ 1, 500-āĻāϰ āύāĻŋāĻšā§‡ 2, 7-āĻāϰ āύāĻŋāĻšā§‡ 0 āχāĻ¤ā§āϝāĻžāĻĻāĻŋāĨ¤ āĻāχ āύāϤ⧁āύ āϏāĻžāϰāĻŋāϰ āϏāĻŦāϗ⧁āϞ⧋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āϝ⧋āĻ—āĻĢāϞ āĻ•āϤ?

Zahin writes all the numbers between 1 and 2000 in a row. Then under every number he
writes the number of 0 at the right of that number. For example: 1 under 1010, 2 under 500, 0 under 7 etc. What is the sum of all the numbers in this new row?

4. a, b āĻĻ⧁āϟāĻŋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āϝ⧇āϗ⧁āϞ⧋āϰ āĻŽāĻ§ā§āϝ⧇ āĻ•āĻŽāĻĒāĻ•ā§āώ⧇ āĻāĻ•āϟāĻŋ āĻĒā§‚āĻ°ā§āĻŖāĻŦāĻ°ā§āĻ—āĨ¤ āϤāĻžāĻĻ⧇āϰ āϞ.āϏāĻž.āϗ⧁. (āϞāĻ•ā§āĻˇā§āϝ āϏāĻžāϧāĻžāϰāĻŖ āϗ⧁āĻŖāĻŋāϤāĻ•) ⧭⧍ āĻšāϞ⧇ āĻāĻŽāύ āĻ•āϤāϗ⧁āϞāĻŋ (a, b) āĻœā§‹āĻĄāĻŧāĻž (x, y) āĻāĻŦāĻ‚ (y, x) āĻ­āĻŋāĻ¨ā§āύ?
āĻāĻ•āϟāĻŋ āĻĒā§‚āĻ°ā§āĻŖāĻŦāĻ°ā§āĻ— āϏāĻ‚āĻ–ā§āϝāĻž āĻšāϞ āĻāĻŽāύ āϏāĻ‚āĻ–ā§āϝāĻž āϝāĻžāϕ⧇ āĻĻ⧁āχāϟāĻŋ āĻāĻ•āχ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āϗ⧁āĻŖāĻĢāϞ āĻšāĻŋāϏ⧇āĻŦ⧇ āϞ⧇āĻ–āĻž āϝāĻžāϝāĻŧāĨ¤
āϝ⧇āĻŽāύ: 25 = 5 × 5, 81 = 9 × 9, 1 × 1 = 1āĨ¤

a, b are two positive integers such that at least one of them is a perfect square. If the LCM (Least Common Multiple) of the two numbers is 72, then how many such (a, b) exists ((x, y) and (y, x) are different)? A perfect square is a number that can be expressed as the product of two equal numbers. For example: 25 = 5 × 5, 81 = 9 × 9, 1 × 1.

5. ABC āĻāĻ•āϟāĻŋ āϏāĻŽāĻŦāĻžāĻšā§ āĻ¤ā§āϰāĻŋāϭ⧁āϜ āϝāĻžāϰ āĻŦāĻžāĻšā§āϰ āĻĻ⧈āĻ°ā§āĻ˜ā§āϝ ⧍ā§Ļ āĻāĻ•āĻ•āĨ¤ A-āϕ⧇ āϕ⧇āĻ¨ā§āĻĻā§āϰ āĻ•āϰ⧇ āĻāĻ•āϟāĻŋ āĻŦ⧃āĻ¤ā§āϤāĻžāϚāĻžāĻĒ āφāρāĻ•āĻž āĻšāϞ āϝāĻžāϰ āĻŦā§āϝāĻžāϏāĻžāĻ°ā§āϧ ā§Ģ āĻāĻ•āĻ•āĨ¤ āϚāĻžāĻĒāϟāĻŋ AB āĻāĻŦāĻ‚ AC-āϕ⧇ āĻŽāĻšāĻžāĻ•ā§āϰāĻŽā§‡ B’ āĻāĻŦāĻ‚ C’-āĻ āϛ⧇āĻĻ āĻ•āϰ⧇āĨ¤ āĻāĻ•āϟāĻŋ ā§§ āĻāĻ•āĻ• āĻŦā§āϝāĻžāϏāĻžāĻ°ā§āϧ⧇āϰ āĻŦ⧃āĻ¤ā§āϤāĻžāĻ•āĻžāϰ āϚāĻžāĻ•āĻž āϝāĻĻāĻŋ BB’C’C āϏāĻŽā§āĻĒā§‚āĻ°ā§āĻŖ āĻĒāĻĨ āĻ…āϤāĻŋāĻ•ā§āϰāĻŽ āĻ•āϰ⧇, āϤāĻžāĻšāϞ⧇ āĻ•āϤāĻŦāĻžāϰ āϚāĻžāĻ•āĻžāϟāĻŋ āϘ⧁āϰāĻŦ⧇?

%Focuse keyword%

â–ŗABC is an equilateral triangle that has side-length 20 unit. An arc is drawn with the center at A and radius 5 unit. The arc intersects AB and AC at points B′ and C′ respectively. If a circular wheel with a radius of 1 unit travels the whole path BB′C′C, then how many times will the wheel rotate?

6. āĻāĻ•āϟāĻŋ āĻĒāĻžāϞāĻŋāύāĻĄā§āϰ⧋āĻŽ āϏāĻ‚āĻ–ā§āϝāĻž āĻšāϞ āĻāĻŽāύ āϏāĻ‚āĻ–ā§āϝāĻž āϝāĻžāϕ⧇ āωāĻ˛ā§āϟāĻŋāϝāĻŧ⧇āĻ“ āϞāĻŋāĻ–āϞ⧇ āĻāĻ•āχ āĻšāϝāĻŧāĨ¤
āϝ⧇āĻŽāύ: 12321, 39093 āχāĻ¤ā§āϝāĻžāĻĻāĻŋāĨ¤

āĻ•. āĻ•āϤāϗ⧁āϞ⧋ 5 āĻ…āĻ™ā§āϕ⧇āϰ āĻĒāĻžāϞāĻŋāύāĻĄā§āϰ⧋āĻŽ āϏāĻ‚āĻ–ā§āϝāĻž āϰāϝāĻŧ⧇āϛ⧇?
āĻ–. āĻ•āϤāϗ⧁āϞ⧋ 7 āĻ…āĻ™ā§āϕ⧇āϰ āĻĒāĻžāϞāĻŋāύāĻĄā§āϰ⧋āĻŽ āϏāĻ‚āĻ–ā§āϝāĻž āϰāϝāĻŧ⧇āϛ⧇, āϝāĻžāϰāĻž 3 āĻĻā§āĻŦāĻžāϰāĻž āĻŦāĻŋāĻ­āĻžāĻœā§āϝ?

A Palindrome number is a number which stays the same if the digits are written in reverse.
For example: 12321, 39093 etc.
A. How many 5 digit Palindrome numbers are there?
B. How many 7 digit Palindrome numbers are there, which are also divisible by 3?

7. āϤāĻžāĻšāύāĻŋāĻ•āϕ⧇ āϕ⧇āĻžāύ⧋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž n āĻĻāĻŋāϝāĻŧ⧇ āϏ⧇ āĻāϰ āϏāĻžāĻĨ⧇ āϏāĻšāĻŽā§ŒāϞāĻŋāĻ• āϏāĻ•āϞ āϏāĻ‚āĻ–ā§āϝāĻž āϞāĻŋāĻ–āĻŦ⧇āĨ¤ āĻ…āĻ°ā§āĻĨāĻžā§Ž āϝāĻžāĻĻ⧇āϰ āϏāĻžāĻĨ⧇ n āĻāϰ āĻ—.āϏāĻž.āϗ⧁. (āĻ—āϰāĻŋāĻˇā§āĻ  āϏāĻžāϧāĻžāϰāĻŖ āϗ⧁āĻŖāĻŋāϤāĻ•) ā§§āĨ¤ āϝ⧇āĻŽāύ, n = 10 āĻĻāĻŋāϞ⧇ āϏ⧇ 1, 3, 7, 9, 11, 13, … āϞāĻŋāϖ⧇ āĻĻ⧇āĻŦ⧇ āϝ⧇āϗ⧁āϞ⧋ n-āĻāϰ āϏāĻžāĻĨ⧇ āϏāĻšāĻŽā§ŒāϞāĻŋāĻ•āĨ¤ āϤāĻžāĻšāύāĻŋāĻ•āϕ⧇ āϕ⧋āύ⧋ n āĻĻāĻŋāϞ⧇ āϤāĻžāϰ āϞāĻŋāĻ¸ā§āĻŸā§‡ āĻĻ⧇āĻ“āϝāĻŧāĻž āϏāĻ‚āĻ–ā§āϝāĻžāϗ⧁āϞ⧋ āϝāĻĻāĻŋ āĻāĻ•āϟāĻŋ āϏāĻŽāĻžāĻ¨ā§āϤāϰ āĻ…āύ⧁āĻ•ā§āϰāĻŽ āϤ⧈āϰāĻŋ āĻ•āϰ⧇, āϤāĻŦ⧇ n āĻāϰ āĻŽāĻžāύ āϕ⧀ āϕ⧀ āĻšāϤ⧇ āĻĒāĻžāϰ⧇?
āĻāĻ•āϟāĻŋ āϏāĻŽāĻžāĻ¨ā§āϤāϰ āĻ…āύ⧁āĻ•ā§āϰāĻŽā§‡ āĻĒāϰāĻĒāϰ āĻĻ⧁āχāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻ…āĻ¨ā§āϤāϰ āϏāĻŦāϏāĻŽāϝāĻŧ āĻāĻ•āχ āĻŽāĻžāύ āĻšāϝāĻŧāĨ¤
āϝ⧇āĻŽāύ: 3, 7, 11, 15, 19, …

If Thanic is given any positive integer n, he writes down all the integers co-prime to the
given number – meaning numbers with which the GCD (Greatest Common Divisor) of n is 1. For
example, if n = 10 is given, he keeps writing 1, 3, 7, 9, 11, 13, ¡ ¡ ¡ . If after giving Thanic some integer n the numbers he writes down form an arithmetic progression, then what are the possible values for n?
In an arithmetic progression the difference between two consecutive terms are always the same. For
example: 3, 7, 11, 15, 19, ¡ ¡ ¡

8. āĻĒā§āϰāĻŽāĻžāĻŖ āĻ•āϰ āϝ⧇ x⁴ – y⁴ = xÂŗ + x × y² – 26 āĻšāϞ⧇ x, y āωāĻ­āϝāĻŧāχ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āĻšāϤ⧇ āĻĒāĻžāϰ⧇ āύāĻžāĨ¤
āĻāĻ–āĻžāύ⧇ āϝ⧇āϕ⧋āύ⧋ āϏāĻ‚āĻ–ā§āϝāĻž z āĻāϰ āϜāĻ¨ā§āϝ, z⁴ = z × z × z × z āĻŦā§‹āĻāĻžāϝāĻŧ, zÂŗ = z × z × z, āĻāĻŦāĻ‚ z² = z × zāĨ¤

Prove that if x⁴ – y⁴ = xÂŗ + x × y² – 26 , then both x, y cannot be positive integers. Here
for any number z, z⁴ = z × z × z × z, zÂŗ = z × z × z, and z² = z × z.

 

Junior level

1. ABC āĻāĻ•āϟāĻŋ āϏāĻŽāĻŦāĻžāĻšā§ āĻ¤ā§āϰāĻŋāϭ⧁āϜ āϝāĻžāϰ āĻŦāĻžāĻšā§āϰ āĻĻ⧈āĻ°ā§āĻ˜ā§āϝ 20 āĻāĻ•āĻ•āĨ¤ A-āϕ⧇ āϕ⧇āĻ¨ā§āĻĻā§āϰ āĻ•āϰ⧇ āĻāĻ•āϟāĻŋ āĻŦ⧃āĻ¤ā§āϤ āφāρāĻ•āĻž āĻšāϝāĻŧ⧇āϛ⧇ āϝāĻžāϰ āĻŦā§āϝāĻžāϏāĻžāĻ°ā§āϧ 5 āĻāĻ•āĻ•āĨ¤ āĻŦ⧃āĻ¤ā§āϤāϟāĻŋ AB āĻāĻŦāĻ‚ AC-āϕ⧇ āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ B’ āĻāĻŦāĻ‚ C’-āϤ⧇ āϛ⧇āĻĻ āĻ•āϰ⧇āĨ¤ āĻāĻ•āϟāĻŋ 1 āĻāĻ•āĻ• āĻŦā§āϝāĻžāϏāĻžāĻ°ā§āϧ⧇āϰ āϚāĻžāĻ•āĻž āϝāĻĻāĻŋ BB’C’C āĻĒāĻĨ⧇ āϏāĻŽā§āĻĒā§‚āĻ°ā§āĻŖāĻ­āĻžāĻŦ⧇ āĻ˜ā§‹āϰ⧇, āϤāĻŦ⧇ āϚāĻžāĻ•āĻž āĻ•āϤāĻŦāĻžāϰ āϘ⧁āϰāĻŦ⧇?

%Focuse keyword%

â–ŗABC is an equilateral triangle that has side-length 20 unit. An arc is drawn with the center at A and radius 5 unit. The arc intersects AB and AC at points B′ and C′ respectively. If a circular wheel with a radius of 1 unit travels the whole path BB′C′C, then how many times will the wheel rotate?

2. āĻāĻ•āϟāĻŋ āĻĒāĻžāϞāĻŋāύāĻĄā§āϰ⧋āĻŽ āϏāĻ‚āĻ–ā§āϝāĻž āĻšāϞ āĻāĻŽāύ āϏāĻ‚āĻ–ā§āϝāĻž āϝāĻž āωāĻ˛ā§āϟāĻŋāϝāĻŧ⧇āĻ“ āĻĒāĻĄāĻŧāϞ⧇ āĻāĻ•āχ āĻĨāĻžāϕ⧇āĨ¤
āϝ⧇āĻŽāύ: 12321, 39093 āχāĻ¤ā§āϝāĻžāĻĻāĻŋāĨ¤

āĻ•. āĻ•āϤāϗ⧁āϞ⧋ 5 āĻ…āĻ™ā§āϕ⧇āϰ āĻĒāĻžāϞāĻŋāύāĻĄā§āϰ⧋āĻŽ āϏāĻ‚āĻ–ā§āϝāĻž āϰāϝāĻŧ⧇āϛ⧇?
āĻ–. āĻ•āϤāϗ⧁āϞ⧋ 7 āĻ…āĻ™ā§āϕ⧇āϰ āĻĒāĻžāϞāĻŋāύāĻĄā§āϰ⧋āĻŽ āϏāĻ‚āĻ–ā§āϝāĻž āϰāϝāĻŧ⧇āϛ⧇, āϝāĻžāϰāĻž 3 āĻĻā§āĻŦāĻžāϰāĻž āĻŦāĻŋāĻ­āĻžāĻœā§āϝ?

A Palindrome number is a number which stays the same if the digits are written in reverse.
For example: 12321, 39093 etc.
A. How many 5 digit Palindrome numbers are there?
B. How many 7 digit Palindrome numbers are there, which are also divisible by 3?

3. āϤāĻžāĻšāύāĻŋāĻ•āϕ⧇ āϕ⧋āύ⧋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž n āĻĻāĻŋāϝāĻŧ⧇ āϏ⧇ āĻāϰ āϏāĻžāĻĨ⧇ āϏāĻšāĻŽā§ŒāϞāĻŋāĻ• āϏāĻ•āϞ āϏāĻ‚āĻ–ā§āϝāĻž āϞāĻŋāĻ–āĻŦ⧇āĨ¤ āĻ…āĻ°ā§āĻĨāĻžā§Ž āϝāĻžāĻĻ⧇āϰ āϏāĻžāĻĨ⧇ n āĻāϰ āĻ—.āϏāĻž.āϗ⧁. (āĻ—āϰāĻŋāĻˇā§āĻ  āϏāĻžāϧāĻžāϰāĻŖ āϗ⧁āĻŖāĻŋāϤāĻ•) 1āĨ¤ āϝ⧇āĻŽāύ, n = 10 āĻĻāĻŋāϞ⧇ āϏ⧇ 1, 3, 7, 9, 11, 13, ……… āϞāĻŋāĻ–āĻŦ⧇āĨ¤ āϤāĻžāĻšāύāĻŋāĻ•āϕ⧇ āϕ⧋āύ⧋ n āĻĻāĻŋāϞ⧇ āϤāĻžāϰ āϞāĻŋāĻ¸ā§āĻŸā§‡ āĻĻ⧇āĻ“āϝāĻŧāĻž āϏāĻ‚āĻ–ā§āϝāĻžāϗ⧁āϞ⧋ āϝāĻĻāĻŋ āĻāĻ•āϟāĻŋ āϏāĻŽāĻžāĻ¨ā§āϤāϰ āĻ…āύ⧁āĻ•ā§āϰāĻŽ āϤ⧈āϰāĻŋ āĻ•āϰ⧇, āϤāĻŦ⧇ n āĻāϰ āĻŽāĻžāύ āϕ⧀ āϕ⧀ āĻšāϤ⧇ āĻĒāĻžāϰ⧇?
āĻāĻ•āϟāĻŋ āϏāĻŽāĻžāĻ¨ā§āϤāϰ āĻ…āύ⧁āĻ•ā§āϰāĻŽā§‡ āĻĒāϰāĻĒāϰ āĻĻ⧁āχāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻ…āĻ¨ā§āϤāϰ āϏāĻŦāϏāĻŽāϝāĻŧ āĻāĻ•āχ āĻŽāĻžāύ āĻšāϝāĻŧāĨ¤
āϝ⧇āĻŽāύ: 3, 7, 11, 15, 19, …………..

If Thanic is given any positive integer n, he writes down all the integers co-prime to the
given number – meaning numbers with which the GCD (Greatest Common Divisor) of n is 1. For
example, if n = 10 is given, he keeps writing 1, 3, 7, 9, 11, 13, ¡ ¡ ¡ . If after giving Thanic some integer n the numbers he writes down form an arithmetic progression, then what are the possible values for n? In an arithmetic progression the difference between two consecutive terms are always the same. For
example: 3, 7, 11, 15, 19, ¡ ¡ ¡

4. āϚāĻŋāĻ¤ā§āϰ⧇ ABCD āφāϝāĻŧāϤ āϝ⧇, AB = BE, CD = DF āĻāĻŦāĻ‚ AF = 3 āĻāĻ•āĻ•āĨ¤ āĻ›āĻžāϝāĻŧāĻžāĻ•ā§ƒāϤāĻŋāϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞ āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ x āĻ“ y, āϝ⧇āĻ–āĻžāύ⧇ y – x = \frac{80 - 25\pi}{4} āĻŦāĻ°ā§āĻ— āĻāĻ•āĻ•āĨ¤
ABCD-āĻāϰ āĻŦāĻžāĻšāĻŋāϰ⧇āϰ āĻĻ⧈āĻ°ā§āĻ˜ā§āϝāϗ⧁āϞāĻŋ āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āĻšāϞ⧇ āĻāϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞ āύāĻŋāĻ°ā§āĻŖāϝāĻŧ āĻ•āϰāĨ¤

%Focuse keyword%

In rectangle ABCD in the figure, AB = BE,CD = DF and AF = 3 units. The areas of
the two shaded regions are x and y respectively, where y − x = \frac{80 - 25\pi}{4} square units. If the sides of the rectangle have integer lengths, then find its area.

5. āĻŦāĻžāĻ¸ā§āϤāĻŦ x āĻāϰ āϜāĻ¨ā§āϝ āϏāĻ•āϞ āϏāĻŽāĻžāϧāĻžāύ āύāĻŋāĻ°ā§āĻŖāϝāĻŧ āĻ•āϰ:
\lfloor x \rfloor^3 - 7 \left\lfloor x + \frac{1}{3} \right\rfloor = -13
āĻāĻ–āĻžāύ⧇ \lfloor x \rfloor āĻšāϞ⧋ āĻĢā§āϞ⧋āϰ āĻĢāĻžāĻ‚āĻļāύ, āϝāĻž āĻĻā§āĻŦāĻžāϰāĻž x-āĻāϰ āĻšā§‡āϝāĻŧ⧇ āϏāĻŽāĻžāύ āĻŦāĻž āϛ⧋āϟ āϏāĻ°ā§āĻŦā§‹āĻšā§āϚ āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āĻŦā§‹āĻāĻžāϝāĻŧāĨ¤ āϝ⧇āĻŽāύ:
\lfloor 2.1 \rfloor = 2, \quad \lfloor 3 \rfloor = 3, \quad \lfloor -1.6 \rfloor = -2

Find all solutions for real x: \lfloor x \rfloor^3 - 7 \left\lfloor x + \frac{1}{3} \right\rfloor = -13  . Here ⌊x⌋ is the floor function, which
represents the largest integer less than or equal to x. For example: ⌊2.1⌋ = 2, ⌊3⌋ = 3, ⌊−1.6⌋ = −2.

6. āĻĒā§āϰāĻ¤ā§āϝāϝāĻŧ āĻ“ āĻĒāĻžāϰāϭ⧇āϜ āĻĻā§â€™āϜāύ⧇āϰ āĻ•āĻžāϛ⧇ āĻĻ⧁āϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻž āϘāĻžāϤāĻ•ā§āϰāĻŽā§‡ n āĻāĻŦāĻ‚ m āφāϛ⧇ āϝ⧇āĻ–āĻžāύ⧇ n > māĨ¤ āĻĒā§āϰāϤāĻŋāĻĻāĻŋāύ, āĻĒā§āϰāĻ¤ā§āϝāϝāĻŧ āϤāĻžāϰ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋāϕ⧇ 2 āĻĻāĻŋāϝāĻŧ⧇ āϗ⧁āĻŖ āĻ•āϰ⧇ 2 āĻŦāĻŋāϝāĻŧā§‹āĻ— āĻ•āϰ⧇, āφāϰ āĻĒāĻžāϰāϭ⧇āϜ āϤāĻžāϰ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋāϕ⧇ 2 āĻĻāĻŋāϝāĻŧ⧇ āϗ⧁āĻŖ āĻ•āϰ⧇ 2 āϝ⧋āĻ— āĻ•āϰ⧇āĨ¤ āĻ…āĻ°ā§āĻĨāĻžā§Ž, āĻĒā§āϰāĻĨāĻŽāĻĻāĻŋāύ āϤāĻžāĻĻ⧇āϰ āϏāĻ‚āĻ–ā§āϝāĻž āĻĻ⧁āϟāĻŋ āĻšāĻŦ⧇ āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ (2n – 2) āĻāĻŦāĻ‚ (2m + 2)āĨ¤ āĻāĻŽāύ āĻ¸ā§āĻŦāĻžāĻ­āĻžāĻŦāĻŋāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž x āĻĒā§āϰāĻŽāĻžāĻŖāϏāĻš āύāĻŋāĻ°ā§āĻŖāϝāĻŧ āĻ•āϰ āϝ⧇āĻ–āĻžāύ⧇ n – m â‰Ĩ 2 āĻšāϞ⧇ āĻĒā§āϰāϤāĻŋāĻĻāĻŋāύāχ āĻĒā§āϰāĻ¤ā§āϝāϝāĻŧ⧇āϰ āϏāĻ‚āĻ–ā§āϝāĻž āĻĒāĻžāϰāϭ⧇āĻœā§‡āϰ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻĨ⧇āϕ⧇ āĻŦāĻĄāĻŧ āĻšāĻŦ⧇āĨ¤

Pratyya and Payel have a number each, n and m respectively, where n > m. Everyday,
Pratyya multiplies his number by 2 and then subtracts 2 from it, and Payel multiplies his number by 2 and then add 2 to it. In other words, on the first day their numbers will be (2n − 2) and (2m + 2) respectively. Find minimum integer x with proof such that if n − m â‰Ĩ x, then Pratyya’s number will be larger than Payel’s number everyday.

7. āĻāĻ•āϟāĻŋ n āφāĻ•āĻžāϰ⧇āϰ āĻ¤ā§āϰāĻŋāϭ⧁āϜ āĻšāĻšā§āϛ⧇ āĻ…āύ⧇āĻ•āϗ⧁āϞ⧋ āĻŦ⧃āĻšā§ŽāĻ•āĻžāϰ āĻ•āĻŽā§āĻĒā§‹āύ⧇āĻ¨ā§āĻŸā§‡āϰ āϏāĻŽāĻˇā§āϟāĻŋ āϝāĻžāĻĻ⧇āϰ āĻāĻ•āϟāĻŋ āϏāĻŽāĻŦāĻžāĻšā§ āĻ¤ā§āϰāĻŋāϭ⧁āϜāĻžāĻ•āĻžāϰ āϰ⧂āĻĒ āϰāϝāĻŧ⧇āϛ⧇ āĻāĻŦāĻ‚ āĻĒā§āϰāϤāĻŋ āĻŦāĻžāĻšā§ āĻŦāĻžāϰāĻŦāĻžāϰ āĻĻ⧁āϟāĻŋ āĻ•āϰ⧇ āύāĻŽā§āĻŦāϰ āύāĻŽā§āĻŦāϰāĨ¤ āϝ⧇āĻŽāύ, āϚāĻŋāĻ¤ā§āϰ⧇ 5 āφāĻ•āĻžāϰ⧇āϰ āĻ¤ā§āϰāĻŋāϭ⧁āϜ āĻĻ⧇āĻ–āĻžāύ⧋ āĻšāϝāĻŧ⧇āϛ⧇āĨ¤ āĻļ⧁āϰ⧁āϤ⧇ āϏāĻŽāĻ¸ā§āϤ āĻ•āĻŽā§āĻĒā§‹āύ⧇āĻ¨ā§āϟ āĻšā§‡āϤ⧁ āϏāĻžāχāĻĄā§‡ āωāĻĒāϰ⧇āϰ āĻĻāĻŋāϕ⧇ āϰāϝāĻŧ⧇āϛ⧇āĨ¤ āϤ⧁āĻŽāĻŋ āĻāĻ•āĻŦāĻžāϰ⧇ āĻĒāĻžā§āϚāĻŽāĻžāĻ‚āĻļ āĻ¸ā§āĻĒāĻ°ā§āĻļ āĻ•āϰ⧇ āĻāĻŽāύ āϤāĻŋāύāϟāĻŋ āĻ•āϰ⧇ āĻ•āĻŽā§āĻĒā§‹āύ⧇āĻ¨ā§āϟ āωāĻ˛ā§āϟāĻŋāϝāĻŧ⧇ āϰāĻžāĻ–āϤ⧇ āĻĒāĻžāϰ⧋āĨ¤

āĻ•. āĻĒā§āϰāĻŽāĻžāĻŖ āĻ•āϰ, n = 3 āĻšāϞ⧇, āϤ⧁āĻŽāĻŋ āĻāĻŽāύāĻ­āĻžāĻŦ⧇ āĻŦ⧇āĻļ āĻ•āϝāĻŧ⧇āĻ•āĻŦāĻžāϰ āϤāĻŋāύāϟāĻŋ āĻ•āϰ⧇ āĻ•āĻŽā§āĻĒā§‹āύ⧇āĻ¨ā§āϟ āωāĻ˛ā§āϟāĻŋāϝāĻŧ⧇ āϏāĻŽāĻ¸ā§āϤ āĻ•āĻŽā§āĻĒā§‹āύ⧇āĻ¨ā§āϟ āϏāĻžāχāĻĄā§‡ āωāĻĒāϰ⧇ āφāύāϤ⧇ āĻĒāĻžāϰāĻŦ⧇āĨ¤
āĻ–. āĻĒā§āϰāĻŽāĻžāĻŖ āĻ•āϰ, n āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ 3 āĻĻā§āĻŦāĻžāϰāĻž āĻŦāĻŋāĻ­āĻžāĻœā§āϝ āĻšāϞ⧇, āϤ⧁āĻŽāĻŋ āĻāĻŽāύāĻ­āĻžāĻŦ⧇ āĻŦ⧇āĻļ āĻ•āϝāĻŧ⧇āĻ•āĻŦāĻžāϰ āϤāĻŋāύāϟāĻŋ āĻ•āϰ⧇ āĻ•āĻŽā§āĻĒā§‹āύ⧇āĻ¨ā§āϟ āωāĻ˛ā§āϟāĻŋāϝāĻŧ⧇ āϏāĻŽāĻ¸ā§āϤ āĻ•āĻŽā§āĻĒā§‹āύ⧇āĻ¨ā§āϟ āϏāĻžāχāĻĄā§‡ āωāĻĒāϰ⧇ āφāύāϤ⧇ āĻĒāĻžāϰāĻŦ⧇āĨ¤

%Focuse keyword%

A triangle of size n is a collection of a number of circular coins which are placed in the shape of an equilateral triangle and there are n coins along each side. For example, in the figure a triangle of size 5 is shown. At first the Heads side of every coin is faced up. At a time, you can take three coins that are touching each other and flip their side.
A. Prove that, if n = 3, you can make the Tails side of all the coins faced up after flipping three coins at a time in this method a few times.
B. Prove that, if the number n is divisible by 3, you can make the Tails side of all the coins faced up after flipping three coins at a time in this method a few times.

8. āĻĒā§āϰāĻŽāĻžāĻŖāϏāĻš āϏāĻ•āϞ āĻœā§‹āĻĄāĻŧ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āĻŦ⧇āϰ āĻ•āϰ āϝāĻžāĻĻ⧇āϰāϕ⧇ āĻĻ⧁āχāϟāĻŋ āĻŽā§ŒāϞāĻŋāĻ• āĻœā§‹āĻĄāĻŧ āϏāĻ‚āĻ–ā§āϝāĻž āϝ⧋āĻ—āĻĢāϞ āĻšāĻŋāϏ⧇āĻŦ⧇ āϞ⧇āĻ–āĻž āϝāĻžāϝāĻŧ āύāĻžāĨ¤

Find, with proof, all even positive integers that cannot be expressed as the sum of two composite odd numbers.

BdMO-2022-National-Questions

Leave a Comment

Your email address will not be published. Required fields are marked *

error: Content is protected !!
Scroll to Top