Bd math olympiad national 2020 secondary question

 

ā§§āĨ¤ m āĻāĻŽāύ āĻāĻ•āϟāĻŋ āĻŦāĻžāĻ¸ā§āϤāĻŦ āϏāĻ‚āĻ–ā§āϝāĻž āϝāĻž 3^m = 4m āϏāĻŽā§€āĻ•āϰāĻŖ āϏāĻŋāĻĻā§āϧ āĻ•āϰ⧇āĨ¤ \frac{3^{3^m}}{m^4} -āĻāϰ āϏāĻŽā§āĻ­āĻžāĻŦā§āϝ āϏāĻ•āϞ āĻŽāĻžāύ⧇āϰ āϝ⧋āĻ—āĻĢāϞ āĻŦ⧇āϰ āĻ•āϰ⧋āĨ¤

Let be a real number such that the following equation holds: 3^m = 4m .  Compute the sum of all possible distinct values that \frac{3^{3^m}}{m^4} can take?

⧍āĨ¤ āĻāĻ•āϟāĻŋ āĻŦāĻšā§āϭ⧁āϜāϕ⧇ ‘āϏ⧁āĻ¨ā§āĻĻāϰ āĻŦāĻšā§āϭ⧁āϜ’ āĻŦāϞāĻž āϝāĻžāĻŦ⧇, āϝāĻĻāĻŋ āϤāĻžāϰ āϤāĻŋāύāϟāĻŋ āĻļā§€āĻ°ā§āώ āĻŦ⧇āϛ⧇ āύ⧇āĻ“ā§ŸāĻž āϝāĻžā§Ÿ āϝ⧇āύ āϤāĻžāĻĻ⧇āϰ āĻŽāĻžāĻā§‡ 144° āϕ⧋āĻŖ āϤ⧈āϰ⧀ āĻšā§ŸāĨ¤ n āĻŦāĻžāĻšā§ āĻŦāĻŋāĻļāĻŋāĻˇā§āϟ āĻāĻŽāύ āĻ•āϤāϗ⧁āϞ⧋ āϏ⧁āώāĻŽ āĻŦāĻšā§āϭ⧁āϜ āφāϛ⧇ āϝāĻžāĻĻ⧇āϰāϕ⧇ āϏ⧁āĻ¨ā§āĻĻāϰ āĻŦāĻšā§āϭ⧁āϜ āĻŦāϞāĻž āϝāĻžāĻŦ⧇ āϝ⧇āĻ–āĻžāύ⧇ 8 < n ≤ 2024 ?

A polygon is called beautiful if you can pick three of its vertices to have an angle of 144° . Compute the number of integers 8 < n ≤ 2024 for which a regular n – gon is beautiful.

ā§ŠāĨ¤ āĻāĻ•āϟāĻž āĻĒāĻžāĻ°ā§āϟāĻŋāϤ⧇ 11 āϜāύ āφāϛ⧇āĨ¤ āĻāĻĻ⧇āϰ āĻŽāĻ§ā§āϝ⧇ āϕ⧇āω āϕ⧇āω āĻĒāϰāĻ¸ā§āĻĒāϰ⧇āϰ āϏāĻžāĻĨ⧇ āĻšā§āϝāĻžāĻ¨ā§āĻĄāĻļ⧇āĻ• āĻ•āϰ⧇āĨ¤ āĻāχ āĻĒāĻžāĻ°ā§āϟāĻŋāϤ⧇ āϝ⧇āϕ⧋āύ⧋ āϤāĻŋāύāϜāύ⧇āϰ āĻŽāĻ§ā§āϝ⧇ āĻāĻŽāύ āĻāĻ•āϜāύ āφāϛ⧇ āϝ⧇ āĻ“āχ āϤāĻŋāύāϜāύ⧇āϰ āĻŦāĻžāĻ•āĻŋ āĻĻ⧁āχāϜāύ⧇āϰ āϏāĻžāĻĨ⧇ āĻšā§āϝāĻžāĻ¨ā§āĻĄāĻļ⧇āĻ• āĻ•āϰ⧇āĨ¤ āĻ“āχ āĻĒāĻžāĻ°ā§āϟāĻŋāϤ⧇ āϏāĻ°ā§āĻŦāύāĻŋāĻŽā§āύ āĻ•āϤāϗ⧁āϞ⧋ āĻšā§āϝāĻžāĻ¨ā§āĻĄāĻļ⧇āĻ• āĻšāϤ⧇ āĻĒāĻžāϰ⧇?

In a party of 11 people, certain pairs of people shake hands with each other. In every group of three people, there exists one person who shakes hands with the other two. What is the minimum number of handshakes that can take place at this party?

 

Bd Math Olympiad National 2020 Secondary Questions with Solutions

ā§ĒāĨ¤ ABCD āĻāĻ•āϟāĻŋ āĻŦāĻ°ā§āĻ—āĻ•ā§āώ⧇āĻ¤ā§āϰāĨ¤ P āĻāĻŦāĻ‚ Q āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ BC āĻāĻŦāĻ‚ CD āϰ⧇āĻ–āĻžāĻ‚āĻļ⧇āϰ āωāĻĒāϰ āĻĻ⧁āχāϟāĻŋ āĻŦāĻŋāĻ¨ā§āĻĻ⧁ āϝāĻžāϤ⧇ āĻ•āϰ⧇ ∠APQ = 90° āĻšā§ŸāĨ¤ āĻĻ⧇āĻ“ā§ŸāĻž āφāϛ⧇ āϝ⧇, AP = 4 āĻāĻŦāĻ‚ PQ = 1 āĨ¤ āϝāĻĻāĻŋ AB -āĻāϰ āĻĻ⧈āĻ°ā§āĻ˜ā§āϝāϕ⧇ āϞāϘāĻŋāĻˇā§āĻ  āφāĻ•āĻžāϰ⧇ \frac{m}{n} āĻšāĻŋāϏ⧇āĻŦ⧇ āϞ⧇āĻ–āĻž āϝāĻžā§Ÿ, āϤāĻŦ⧇ m + 10n -āĻāϰ āĻŽāĻžāύ āĻŦ⧇āϰ āĻ•āϰāĨ¤

ABCD is a square. P and Q are two points in segment BC and CD respectively such that ∠APQ = 90° . It is given that AP = 4 and PQ = 1. If we express the length of segment AB as in lowest term, compute m + 10n.

ā§ĢāĨ¤ āĻāĻŽāύ āĻ•āϤāϗ⧁āϞ⧋ āĻŦāĻžāĻ¸ā§āϤāĻŦ āϏāĻ‚āĻ–ā§āϝāĻž x_1,x_2,x_3,....... āφāϛ⧇ āϝ⧇āĻ–āĻžāύ⧇ āĻāϰ āϜāĻ¨ā§āϝ, n>0 āĻšā§Ÿ āĨ¤ āϧāϰ⧋, x_{n\;+\;3}=\;x_{n\;+\;2}-2x_{n\;+\;1}+\;x_n āĻāĻŦāĻ‚ x_{98}=\;x_{99} āĻŦāϞāĻž āĻšā§Ÿā§‡āϛ⧇ āĨ¤ āωāĻĒāϰ⧇āϰ āĻļāĻ°ā§āϤ āĻ…āύ⧁āϝāĻžā§Ÿā§€, x_1 + x_2 + x_3 + ....... x_100

Let x_1,x_2,x_3,....... be real numbers so that for all n>0, x_{n\;+\;3} = \;x_{n\;+\;2}-2x_{n\;+\;1}+\;x_n . Suppose x_1 = x_2 = x_3 = 1 and you’re given that x_{98}=\;x_{99} . Find the sum x_1 + x_2 + x_3 + ....... x_100.

 

Secondary Level Math Olympiad Questions Bd 2020 National

ā§ŦāĨ¤ (1, 2, 3, 4, ………., n) āϏāĻ‚āĻ–ā§āϝāĻžāϗ⧁āϞ⧋āϰ āĻāĻ•āϟāĻž āĻŦāĻŋāĻ¨ā§āϝāĻžāϏ – a_1 , a_2 , a_3 , ....... a_n āϕ⧇ āĻŦāĻŋāĻ¨ā§āϝāĻ¸ā§āϤ-āĻĒā§āϰāĻžā§Ÿ āĻŦāϞāĻž āĻšāĻŦ⧇ āϝāĻĻāĻŋ āĻ āĻŋāĻ• āĻāĻ•āϟāĻž i ∈ {1, 2, 3, 4, ………., n – 1} āĻĨāĻžāϕ⧇ āϝāĻžāϰ āϜāĻ¨ā§āϝ a_i >  a_i + 1 āĻšā§ŸāĨ¤ (1, 2, 3, 4, ………., 13) āϏāĻ‚āĻ–ā§āϝāĻžāϗ⧁āϞ⧋āϰ āĻ•āϤāϗ⧁āϞ⧋ āĻŦāĻŋāĻ¨ā§āϝāĻ¸ā§āϤ-āĻĒā§āϰāĻžā§Ÿ āĻŦāĻŋāĻ¨ā§āϝāĻžāϏ āφāϛ⧇? Bd math olympiad national 2020 secondary question

A permutation a_1 , a_2 , a_3 , ....... a_n of the numbers (1, 2, 3, 4, ………., n) is called almost-sorted if there exists exactly one i ∈ {1, 2, 3, 4, ………., n – 1} such that a_i >  a_i + 1 . What is the number of almost-sorted permutations of the numbers (1, 2, 3, 4, ………., 13) ?
ā§­āĨ¤ ƒ āĻšāϞ⧋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻžāϰ āϏ⧇āϟ āĻĨ⧇āϕ⧇ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻžāϰ āϏ⧇āĻŸā§‡ āĻāĻŽāύ āĻāĻ•āϟāĻž āĻĢāĻžāĻ‚āĻļāύ āϝ⧇āύ āϝ⧇āϕ⧋āύ⧋ āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž n – āĻāϰ āϜāĻ¨ā§āϝ āϝāĻĻāĻŋ x_1 , x_2 , x_3 , ....... x_n āϏāĻ‚āĻ–ā§āϝāĻžāϗ⧁āϞ⧋ n- āĻāϰ āϏāĻŦāϗ⧁āϞ⧋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻ‰ā§ŽāĻĒāĻžāĻĻāĻ• āĻšā§Ÿ, āϤāĻžāĻšāϞ⧇ ƒ(x_1),  ƒ(x_1) ...... ƒ(x_s) = n . ƒ(343) + ƒ(3012)-āĻāϰ āϏāĻŽā§āĻ­āĻžāĻŦā§āϝ āϏāĻ•āϞ āĻŽāĻžāύ⧇āϰ āϝ⧋āĻ—āĻĢāϞ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰ⧋āĨ¤

Let ƒ be  a function from the set of positive integers to the set of positive integers such that for each positive integer n, if [latex] x_1 , x_2 , x_3 , ....... x_n are all the positive divisors of n, then ƒ(x_1),  ƒ(x_1) ...... ƒ(x_s) = n . Find the sum of all possible values of ƒ(343) + ƒ(3012) 

 

Bangladesh Math Olympiad 2020 National Secondary Questions

ā§ŽāĨ¤Â  ƒ:\mathbb{Z}\rightarrow\mathbb{Z}, f\left(ƒ\left(x+y\right)\right)=ƒ\left(x^2\right)+ƒ\left(y^2\right),ƒ\left(ƒ\left(2020\right)\right)=1010. ƒ(2025) āĻāϰ āĻŽāĻžāύ āĻŦ⧇āϰ āĻ•āϰ⧋āĨ¤

ƒ:\mathbb{Z}\rightarrow\mathbb{Z}, f\left(ƒ\left(x+y\right)\right)=ƒ\left(x^2\right)+ƒ\left(y^2\right),ƒ\left(ƒ\left(2020\right)\right)=1010. Find ƒ(2025). 
⧝āĨ¤ ΔABC  āĻ¤ā§āϰāĻŋāϭ⧁āϜ -āĻ AB = 12, BC = 20, CA = 16 āĨ¤ AB āĻāĻŦāĻ‚ AC āĻŦāĻžāĻšā§āϰ āωāĻĒāϰ āĻĻ⧁āχāϟāĻŋ āĻŦāĻŋāĻ¨ā§āĻĻ⧁ āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ X āĻ“ YāĨ¤ XY āϰ⧇āĻ–āĻžāĻ‚āĻļ⧇āϰ āωāĻĒāϰ āĻāĻŽāύ āĻāĻ•āϟāĻŋ āĻŦāĻŋāĻ¨ā§āĻĻ⧁ āϝ⧇āύ, \frac{XK}{KY} = \frac{7}{5} āĻšā§ŸāĨ¤ AB āĻ“ AC -āĻāϰ āωāĻĒāϰ āϝāĻĻāĻŋ X āĻāĻŦāĻ‚ Y-āĻāϰ āĻ…āĻŦāĻ¸ā§āĻĨāĻžāύ⧇āϰ āĻĒāϰāĻŋāĻŦāĻ°ā§āϤāύ āĻ•āϰāĻž āĻšā§Ÿ, āϤāĻžāĻšāϞ⧇ K -āĻāϰ āϏāĻžā§āϚāĻžāϰāĻĒāĻĨ āĻāĻ•āϟāĻŋ āύāĻŋāĻ°ā§āĻĻāĻŋāĻˇā§āϟ āĻ•ā§āώ⧇āĻ¤ā§āϰ āĻĻāĻ–āϞ āĻ•āϰ⧇āĨ¤ āϝāĻĻāĻŋ āĻāχ āĻ•ā§āώ⧇āĻ¤ā§āϰāϟāĻŋāϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞāϕ⧇ āϞāϘāĻŋāĻˇā§āĻ  āĻ•āϰ⧇ \frac{m}{n} āφāĻ•āĻžāϰ⧇ āϞ⧇āĻ–āĻž āϝāĻžā§Ÿ, āϤāĻžāĻšāϞ⧇ m + n āĻāϰ āĻŽāĻžāύ āĻ•āϤ?

In ABC , AB = 12, BC = 20, CA = 16. X and Y are two points in segment AB and AC respectively. K is a point on segment XY, such that \frac{XK}{KY} = \frac{7}{5} . If we let X and Y vary in segment AB and AC, all the positions of K covers a region. If we express the area of that region as \frac{m}{n} in lowest terms, compute m + n.

 

National Math Olympiad 2020 Secondary Question Paper Bangladesh

ā§§ā§ĻāĨ¤ āϰāĻžāĻšā§āϞ āĻ¸ā§āĻĨāĻžāύāĻžāĻ‚āĻ• āϤāϞ⧇ (3, 3) āĻŦāĻŋāĻ¨ā§āĻĻ⧁āϤ⧇ āφāϛ⧇āĨ¤ āϏ⧇ āĻāĻ•āϧāĻžāĻĒ⧇ āĻšā§Ÿ āϤāĻžāϰ āĻŦāĻŋāĻ¨ā§āĻĻ⧁āϰ āĻāĻ•āϘāϰ āωāĻĒāϰ⧇āϰ āĻŦāĻŋāĻ¨ā§āĻĻ⧁āϤ⧇ āϝ⧇āϤ⧇ āĻĒāĻžāϰ⧇ āĻ…āĻĨāĻŦāĻž āĻāĻ•āϘāϰ āĻĄāĻžāύ⧇āϰ āĻŦāĻŋāĻ¨ā§āĻĻ⧁āϤ⧇ āϝ⧇āϤ⧇ āĻĒāĻžāϰ⧇āĨ¤ āϤāĻžāϰ āĻŽā§ŒāϞāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻž āϖ⧁āĻŦāχ āĻĒāĻ›āĻ¨ā§āĻĻ, āϤāĻžāχ āϏ⧇ āĻ•āĻ–āύ⧋ āĻāĻŽāύ āϕ⧋āύ⧋ āĻŦāĻŋāĻ¨ā§āĻĻ⧁āϤ⧇ āϝāĻžāĻŦ⧇ āύāĻž āϝāĻžāϰ āϭ⧁āϜ āφāϰ āϕ⧋āϟāĻŋ āωāϭ⧟āχ āϝ⧌āĻ—āĻŋāĻ•āĨ¤ āϏ⧇ āĻ•āϤāĻ­āĻžāĻŦ⧇ (20, 13) āĻŦāĻŋāĻ¨ā§āĻĻ⧁āϤ⧇ āĻĒ⧌āρāĻ›āĻžāϤ⧇ āĻĒāĻžāϰ⧇?

Rahul is at (3, 3) on the coordinate plane. In each step, he can move one point up or one point to the right. He loves primes, and will never visit a coordinate point where both values are composite. In how many ways can he reach (20, 13) ? 
ā§§ā§§ āωāĻ°ā§āĻŽāĻŋ āĻ•āĻŽā§āĻĒāĻŋāωāϟāĻžāϰ⧇ āĻāĻ•āϟāĻž āϗ⧇āχāĻŽ āϖ⧇āϞāϛ⧇āĨ¤ āϝāĻĻāĻŋ āĻ•āĻŽā§āĻĒāĻŋāωāϟāĻžāϰ āĻ¸ā§āĻ•ā§āϰāĻŋāύ⧇ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻž āĻĻ⧇āĻ–āĻž āϝāĻžā§Ÿ, āϤāĻžāĻšāϞ⧇ āĻĒāϰ⧇āϰ āϚāĻžāϞ⧇ āϏ⧇ āĻĻ⧁āĻŸā§‹ āĻ•āĻžāϜ āĻ•āϰāϤ⧇ āĻĒāĻžāϰāĻŦ⧇āĨ¤.

(a) āϏ⧇ āĻšā§Ÿ x-āϕ⧇ 4x + 1 āĻĻāĻŋā§Ÿā§‡ āĻĒāĻžāĻ˛ā§āĻŸā§‡ āĻĻāĻŋāϤ⧇ āĻĒāĻžāϰāĻŦ⧇.

(b) āĻ…āĻĨāĻŦāĻž āϏ⧇ x - āϕ⧇ - \frac{x}{2} āĻāϰ āĻšā§‡ā§Ÿā§‡ āĻŦ⧜ āύāĻž āĻāĻŽāύ āϏāĻŦāĻšā§‡ā§Ÿā§‡ āĻŦ⧜ āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āĻĻāĻŋā§Ÿā§‡ āĻĒāĻžāĻ˛ā§āĻŸā§‡ āĻĻāĻŋāϤ⧇ āĻĒāĻžāϰāĻŦ⧇

āĻ¸ā§āĻ•ā§āϰāĻŋāύ⧇ āĻļ⧁āϰ⧁āϤ⧇ 0 āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻž āĻ›āĻŋāϞāĨ¤ āĻļ⧁āĻ¨ā§āϝ āĻŦāĻž āϤāĻžāϰ āĻšā§‡ā§Ÿā§‡ āĻŦ⧇āĻļāĻŋ āϏāĻ‚āĻ–ā§āϝāĻ• āϚāĻžāϞ āĻĻāĻŋā§Ÿā§‡ 2020-āĻāϰ āĻšā§‡ā§Ÿā§‡ āĻŦ⧜ āύāĻž āĻāĻŽāύ āĻ•āϤāϗ⧁āϞ⧋ āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻžā§Ÿ āωāĻ°ā§āĻŽāĻŋ āĻĒ⧌āρāĻ›āĻžāϤ⧇ āĻĒāĻžāϰāĻŦ⧇? āϕ⧋āύ⧋ āĻāĻ•āϟāĻž āϏāĻ‚āĻ–ā§āϝāĻžā§Ÿ āĻĒ⧌āρāĻ›āĻžāϤ⧇ āĻ—āĻŋā§Ÿā§‡ āϝāĻĻāĻŋ āĻŽāĻžāĻā§‡ 2020 - āĻāϰ āĻšā§‡ā§Ÿā§‡ āĻŦ⧜ āĻ•āĻŋāϛ⧁ āĻāϏ⧇ āĻĒā§œā§‡, āϤāĻžāĻšāϞ⧇ āĻ…āϏ⧁āĻŦāĻŋāϧāĻž āύ⧇āχāĨ¤

Urmi is playing a game on a computer. If the computer screen displays the number x, then in the next move, Urmi can do one of the following:.

Replace x by 4x + 1.

Replace x by the largest integer not greater than \frac{x}{2}
Initially, the computer screen displays 0. How many different integers less than or equal to 2020 can Urmi achieve through a sequence of moves? It is permitted for the number displayed on the screen to exceed 2020 during the sequence.
⧧⧍āĨ¤ āϜ⧟āĻĻā§€āĻĒ āĻāĻ•āϟāĻž āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž n -āϕ⧇ āϚāĻŽāĻ•āĻĒā§āϰāĻĻ āĻŦāϞ⧇ āϝāĻĻāĻŋ āĻŽā§ŒāϞāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻžāϰ āϝ⧇āϕ⧋āύ⧋ āĻ…āϏ⧀āĻŽ āϏ⧇āϟ āĻĨ⧇āϕ⧇āχ n āϟāĻž āĻŽā§ŒāϞāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻž p_1 ,p_2 , p_3 , ....... p_n āĻĒāĻžāĻ“ā§ŸāĻž āϝāĻžā§Ÿ āϝ⧇āύ p_1 p_2 p_3 ....... p_n  - 1 āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻž āĻĻā§āĻŦāĻžāϰāĻž 2020 āĻŦāĻŋāĻ­āĻžāĻœā§āϝ āĻšā§ŸāĨ¤ -āĻāϰ āĻšā§‡ā§Ÿā§‡ āϛ⧋āϟ āϏāĻŦ āϚāĻŽāĻ•āĻĒā§āϰāĻĻ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āϝ⧋āĻ—āĻĢāϞ āĻŦ⧇āϰ āĻ•āϰ⧋āĨ¤

Joydip calls a positive integer n amazing if given any infinite set of primes, he can find n primes p_1 ,p_2 , p_3 , ....... p_n from it such that p_1 p_2 p_3 ....... p_n  - 1 is divisible by . Find the sum of all amazing numbers less than 2020.

 

 

Leave a Comment

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

error: Content is protected !!
Scroll to Top