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) āϏāĻāĻā§āϝāĻžāĻā§āϞā§āϰ āĻāϤāĻā§āϞ⧠āĻŦāĻŋāύā§āϝāϏā§āϤ-āĻĒā§āϰāĻžā§ āĻŦāĻŋāύā§āϝāĻžāϏ āĻāĻā§? 
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.