BD Math Olympiad Regional part selection questions

BD Math Olympiad Regional part selection questions

 

Primary level
1. āĻĻ⧁’āϟāĻŋ āĻ­āĻŋāĻ¨ā§āύ āĻ­āĻŋāĻ¨ā§āύ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻœā§‹āĻĄāĻŧ āϏāĻ‚āĻ–ā§āϝāĻž a āĻ“ b-āĻāϰ āϝ⧋āĻ—āĻĢāϞ ā§§ā§Ļ, āϝ⧇āĻ–āĻžāύ⧇ a > bāĨ¤ a-āĻāϰ āϏāĻ°ā§āĻŦā§‹āĻšā§āϚ āĻŽāĻžāύ āĻ•āϤ āĻšāϤ⧇ āĻĒāĻžāϰ⧇?
The sum of two distinct positive even integers a and b is 10 where a > b. Find the largest possible value of a.

2. āĻŦāĻŦ⧇āϰ āĻ¸ā§āĻŽā§ƒāϤāĻŋāĻļāĻ•ā§āϤāĻŋ āĻĒāϰ⧀āĻ•ā§āώāĻž āĻ•āϰāĻžāϰ āϜāĻ¨ā§āϝ āĻāϞāĻŋāϏ āϤāĻžāϕ⧇ ā§§ āĻĨ⧇āϕ⧇ ā§§ā§Ļ āĻĒāĻ°ā§āϝāĻ¨ā§āϤ āϏāĻ‚āĻ–ā§āϝāĻžāϗ⧁āϞ⧋ āϕ⧋āύ⧋ āĻāĻ•āϟāĻŋ āĻ•ā§āϰāĻŽā§‡ āĻŦāϞ⧇, āĻ•āĻŋāĻ¨ā§āϤ⧁ āĻŦāϞāĻžāϰ āϏāĻŽā§Ÿ āϏ⧇ āĻāĻ•āϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻž āĻŦāĻžāĻĻ āĻĻāĻŋā§Ÿā§‡ āĻŦāϞ⧇āĨ¤ āĻŦāĻŦ⧇āϰ āĻ•āĻžāϜ āĻšāϞ āĻāϞāĻŋāϏāϕ⧇ āϤāĻžāϰ āĻŦāĻžāĻĻ āĻĻ⧇āĻ“ā§ŸāĻž āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻž āĻŦāϞāĻžāĨ¤ āĻŦāĻŦ⧇āϰ āĻ¸ā§āĻŽā§ƒāϤāĻŋāĻļāĻ•ā§āϤāĻŋ āϖ⧁āĻŦ āĻāĻ•āϟāĻž āĻ­āĻžāϞ⧋ āύāĻž, āĻ•āĻŋāĻ¨ā§āϤ⧁ āϏ⧇ āĻŦ⧇āĻļ āĻŦ⧁āĻĻā§āϧāĻŋāĻŽāĻžāύāĨ¤ āϤāĻžāχ āϏ⧇ āĻāϞāĻŋāϏ⧇āϰ āĻŦāϞāĻž āϏāĻ‚āĻ–ā§āϝāĻžāϗ⧁āϞ⧋ āϝ⧋āĻ— āĻ•āϰāϤ⧇ āĻĨāĻžāϕ⧇āĨ¤ āϝāĻĻāĻŋ āϏāĻ°ā§āĻŦāĻļ⧇āώ āĻŦāĻŦ āϝ⧋āĻ—āĻĢāϞ āĻšāĻŋāϏ⧇āĻŦ⧇ ā§Ģā§Ļ āĻĒāĻžā§Ÿ, āϤāĻžāĻšāϞ⧇ āĻāϞāĻŋāϏ⧇āϰ āĻŦāĻžāĻĻ āĻĻ⧇āĻ“ā§ŸāĻž āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻž āĻ•āϤ āĻ›āĻŋāϞ?
To test Bob’s memory, Alice tells Bob the numbers 1 through 10 in some order, but she skips one number. Bob is supposed to, in return, tell Alice the skipped number. Bob doesn’t have a great memory, but he is clever, so he sums up the numbers Alice tells him. If Bob gets a sum of 50, what is the missing number?

3. āύāĻŋāĻšā§‡āϰ āϚāĻŋāĻ¤ā§āϰ⧇, A-āϕ⧇ āϕ⧇āĻ¨ā§āĻĻā§āϰ āĻ•āϰ⧇ āφāρāĻ•āĻž āĻŦ⧃āĻ¤ā§āϤ āĻĻ⧁āϟāĻŋāϰ āĻŦā§āϝāĻžāϏāĻžāĻ°ā§āϧ āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ AB = 1 āĻāĻŦāĻ‚ AC = 2āĨ¤ S1 āĻ“ S2 āĻšāϞ āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ AC āĻ“ AB āĻŦā§āϝāĻžāϏāĻžāĻ°ā§āϧāĻŦāĻŋāĻļāĻŋāĻˇā§āϟ āĻŦ⧃āĻ¤ā§āϤ⧇āϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞāĨ¤ āϝāĻĻāĻŋ S1 – S2 = aĪ€,, āϤāĻŦ⧇ a-āĻāϰ āĻŽāĻžāύ āύāĻŋāĻ°ā§āĻŖāϝāĻŧ āĻ•āϰāĨ¤BD Math Olympiad Regional part selection questions
In the figure, A is the center of the circles having radii AB = 1 and AC = 2. S1 and S2 are the areas of the circles having radii AC and AB, respectively. If S1 – S2 = aĪ€, find the value of a.

4. āϚāĻŋāĻ¤ā§āϰ⧇, A-āϕ⧇ āϕ⧇āĻ¨ā§āĻĻā§āϰ āĻ•āϰ⧇ āφāρāĻ•āĻž āĻŦ⧃āĻšā§Ž āĻĻ⧁āϟāĻŋ āĻŦ⧃āĻ¤ā§āϤ⧇āϰ āĻŦā§āϝāĻžāϏāĻžāĻ°ā§āϧ āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ AB = 1 āĻāĻŦāĻ‚ AC = 2āĨ¤ S1 āφāϰ S2 āĻšāϞ⧋ āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ AC āĻ“ AB āĻŦā§āϝāĻžāϏāĻžāĻ°ā§āϧāĻŦāĻŋāĻļāĻŋāĻˇā§āϟ āĻŦ⧃āĻ¤ā§āϤ⧇āϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞāĨ¤ āϝāĻĻāĻŋ S1 – S2 = aĪ€ āĻšāϝāĻŧ, āϤāĻŦ⧇ a-āĻāϰ āĻŽāĻžāύ āĻŦ⧇āϰ āĻ•āϰ⧋āĨ¤ (ā§Š āĻĒāϝāĻŧ⧇āĻ¨ā§āϟ)
Suppose you have the sequence of letters EBDCA. In a single step, you can swap two adjacent letters or reverse the entire sequence. What is the minimum number of steps needed to make the sequence read ABCDE?

5. ⧍ā§Ļā§Ļā§Ž āϏāĻžāϞ⧇ āĻĻāĻžāĻŦāĻž āĻĒā§āϰāϤāĻŋāϝ⧋āĻ—āĻŋāϤāĻžāϝāĻŧ ā§§ā§Ģ āϜāύ āĻāĻŦāĻ‚ ⧍ā§Ļ⧧⧍ āϏāĻžāϞ⧇ ⧍⧍ āϜāύ āĻ…āĻ‚āĻļāĻ—ā§āϰāĻšāĻŖ āĻ•āϰ⧇āĨ¤ āϝāĻĻāĻŋ āĻĒā§āϰāϤāĻŋāϝ⧋āĻ—āĻŋāϤāĻžāϝāĻŧ āĻĒā§āϰāϤāĻŋ āĻŦāĻ›āϰ āĻ…āĻ‚āĻļāĻ—ā§āϰāĻšāĻŖāĻ•āĻžāϰ⧀āϰ āϏāĻ‚āĻ–ā§āϝāĻž āĻāĻ•āχ āĻšāĻžāϰ⧇ āĻŦāĻžāĻĄāĻŧāϤ⧇ āĻĨāĻžāϕ⧇, āϤāĻžāĻšāϞ⧇ āϕ⧋āύ āϏāĻžāϞ⧇ ā§§ā§¯ā§Žā§¯ āϜāύ āĻ…āĻ‚āĻļāĻ—ā§āϰāĻšāĻŖ āĻ•āϰāĻŦ⧇?
In 2008, a chess tournament had 15 participants. In 2012, it had 22 participants. If the number of participants increases at the same rate, in which year will there be 1989 participants?

6. ABCD āĻāĻ•āϟāĻŋ āĻŦāĻ°ā§āĻ— āϝ⧇āĻ–āĻžāύ⧇ AB = 6āĨ¤ āĻŽā§āϰāϏāĻžāϞāĻŋāύ āĻŦāĻ°ā§āϗ⧇āϰ āϭ⧇āϤāϰ⧇ āĻāĻ•āϟāĻŋ āĻŦāĻŋāĻ¨ā§āĻĻ⧁ X āĻāĻŽāύāĻ­āĻžāĻŦ⧇ āύāĻŋāϞ āϝāĻžāϤ⧇ āĻŦāĻŋāĻ¨ā§āĻĻ⧁āϟāĻŋāϰ BC āĻĨ⧇āϕ⧇ 2 āĻāĻ•āĻ• āĻāĻŦāĻ‚ CD āĻĨ⧇āϕ⧇ 3 āĻāĻ•āĻ• āĻĻā§‚āϰ⧇ āĻšāϝāĻŧāĨ¤ AX-āĻāϰ āĻĻ⧈āĻ°ā§āĻ˜ā§āϝ āĻŦ⧇āϰ āĻ•āϰ⧋āĨ¤ (ā§Š āĻĒāϝāĻŧ⧇āĻ¨ā§āϟ)
ABCD is a square where AB = 6. Point X is inside the square such that its perpendicular distances from BC and CD are 2 and 3, respectively. Find the length of AX.

7. āϕ⧋āύ āĻāĻ•āϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻž āϏ⧁āĻ¨ā§āĻĻāϰ āϝāĻĻāĻŋ āϤāĻžāϰ āĻ āĻŋāĻ• ā§ĒāϟāĻŋ āĻ‰ā§ŽāĻĒāĻžāĻĻāĻ• āĻĨāĻžāϕ⧇ āĻāĻŦāĻ‚ āϏ⧇āϟāĻŋ ⧍ āĻĻā§āĻŦāĻžāϰāĻž āĻŦāĻŋāĻ­āĻžāĻœā§āϝ āĻšāϝāĻŧāĨ¤ ⧝⧝-āĻāϰ āĻšā§‡āϝāĻŧ⧇ āϛ⧋āϟ āĻ•āϤāϗ⧁āϞ⧋ āϏ⧁āĻ¨ā§āĻĻāϰ āϏāĻ‚āĻ–ā§āϝāĻž āφāϛ⧇?
A number is called beautiful if it has exactly 4 factors and is divisible by 2. How many beautiful numbers are less than 99?

8. āĻŽā§āϰāϏāĻžāϞāĻŋāύ 1, 2, 3, 4, 5, 6 āĻāχ āĻ›āϝāĻŧāϟāĻž āϏāĻ‚āĻ–ā§āϝāĻž āĻĨ⧇āϕ⧇ āĻāĻŽāύāĻ­āĻžāĻŦ⧇ āϤāĻŋāύāϟāĻž āĻŦāĻž āϤāĻžāϰ āĻŦ⧇āĻļāĻŋ āϏāĻ‚āĻ–ā§āϝāĻž āύāĻŋāϤ⧇ āϚāĻžāϝāĻŧ āϝāĻžāϤ⧇ āϤāĻžāϰ āύ⧇āĻ“āϝāĻŧāĻž āϏāĻ‚āĻ–ā§āϝāĻžāϗ⧁āϞ⧋āϰ āĻŽāĻ§ā§āϝ⧇ āĻ•āĻŽāĻĒāĻ•ā§āώ⧇ āϤāĻŋāύāϟāĻž āĻ•ā§āϰāĻŽāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻž āĻĨāĻžāϕ⧇āĨ¤ āϝ⧇āĻŽāύ, āϏ⧇ 1, 2, 3 āĻāχ āϤāĻŋāύāϟāĻž āϏāĻ‚āĻ–ā§āϝāĻž āύāĻŋāϤ⧇ āĻĒāĻžāϰ⧇; āφāĻŦāĻžāϰ 1, 2, 3, 5-āĻ“ āύāĻŋāϤ⧇ āĻĒāĻžāϰ⧇āĨ¤ āϏ⧇ āĻŽā§‹āϟ āĻ•āϤāĻ­āĻžāĻŦ⧇ āĻāχ āĻ•āĻžāϜāϟāĻž āĻ•āϰāϤ⧇ āĻĒāĻžāϰāĻŦ⧇? (6 āĻĒāϝāĻŧ⧇āĻ¨ā§āϟ)
Mursalin wants to choose 3 or more numbers from 1, 2, 3, 4, 5, 6 such that at least 3 consecutive numbers are in his chosen set. In how many ways can Mursalin do this?

 

BDMO Regional 2021 Primary pdf

Junior level
1. āĻŦāĻŦ⧇āϰ āĻ¸ā§āĻŽā§ƒāϤāĻŋāĻļāĻ•ā§āϤāĻŋ āĻĒāϰ⧀āĻ•ā§āώāĻž āĻ•āϰāĻžāϰ āϜāĻ¨ā§āϝ āĻāϞāĻŋāϏ āϤāĻžāϕ⧇ ā§§ āĻĨ⧇āϕ⧇ ā§§ā§Ļ āĻĒāĻ°ā§āϝāĻ¨ā§āϤ āϏāĻ‚āĻ–ā§āϝāĻžāϗ⧁āϞ⧋ āϕ⧋āύ⧋ āĻāĻ•āϟāĻŋ āĻ•ā§āϰāĻŽā§‡ āĻŦāϞ⧇, āĻ•āĻŋāĻ¨ā§āϤ⧁ āĻŦāϞāĻžāϰ āϏāĻŽā§Ÿ āϏ⧇ āĻāĻ•āϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻž āĻŦāĻžāĻĻ āĻĻāĻŋā§Ÿā§‡ āĻŦāϞ⧇āĨ¤ āĻŦāĻŦ⧇āϰ āĻ•āĻžāϜ āĻšāϞ āĻāϞāĻŋāϏāϕ⧇ āϤāĻžāϰ āĻŦāĻžāĻĻ āĻĻ⧇āĻ“ā§ŸāĻž āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻž āĻŦāϞāĻžāĨ¤ āĻŦāĻŦ⧇āϰ āĻ¸ā§āĻŽā§ƒāϤāĻŋāĻļāĻ•ā§āϤāĻŋ āϖ⧁āĻŦ āĻāĻ•āϟāĻž āĻ­āĻžāϞ⧋ āύāĻž, āĻ•āĻŋāĻ¨ā§āϤ⧁ āϏ⧇ āĻŦ⧇āĻļ āĻŦ⧁āĻĻā§āϧāĻŋāĻŽāĻžāύāĨ¤ āϤāĻžāχ āϏ⧇ āĻāϞāĻŋāϏ⧇āϰ āĻŦāϞāĻž āϏāĻ‚āĻ–ā§āϝāĻžāϗ⧁āϞ⧋ āϝ⧋āĻ— āĻ•āϰāϤ⧇ āĻĨāĻžāϕ⧇āĨ¤ āϝāĻĻāĻŋ āϏāĻ°ā§āĻŦāĻļ⧇āώ āĻŦāĻŦ āϝ⧋āĻ—āĻĢāϞ āĻšāĻŋāϏ⧇āĻŦ⧇ ā§Ģā§Ļ āĻĒāĻžā§Ÿ, āϤāĻžāĻšāϞ⧇ āĻāϞāĻŋāϏ⧇āϰ āĻŦāĻžāĻĻ āĻĻ⧇āĻ“ā§ŸāĻž āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻž āĻ•āϤ āĻ›āĻŋāϞ?
To test Bob’s memory, Alice tells Bob the numbers 1 through 10 in some order, but skips one number. Bob sums up the numbers Alice tells him. If Bob gets a sum of 50, what is the missing number?

2. ā§§ā§§-āϟāĻŋ āϞāĻžāϞ, ā§­-āϟāĻŋ āĻšāϞ⧁āĻĻ, āĻāĻŦāĻ‚ ā§Ŧ-āϟāĻŋ āύ⧀āϞ āĻŦāϞ⧇āϰ āĻāĻ•āϟāĻŋ āĻŦā§āϝāĻžāĻ— āĻĨ⧇āϕ⧇ āĻ•āĻŽāĻĒāĻ•ā§āώ⧇ āĻ•āϤāϗ⧁āϞāĻŋ āĻŦāϞ āϤ⧁āϞāϞ⧇ āϤ⧁āĻŽāĻŋ āύāĻŋāĻļā§āϚāĻŋāϤāĻ­āĻžāĻŦ⧇ āĻŦāϞāϤ⧇ āĻĒāĻžāϰāĻŦ⧇ āϝ⧇ āϤ⧁āĻŽāĻŋ āϏāĻŦ āϰāϙ⧇āϰ āĻ•āĻŽāĻĒāĻ•ā§āώ⧇ āĻāĻ•āϟāĻž āĻ•āϰ⧇ āĻŦāϞ āϤ⧁āϞāϛ⧋?
What is the minimum number of balls you must take out of a bag containing 11 red balls, 7 yellow balls, and 6 blue balls to guarantee that at least one ball of each color has been taken out?

3. āĻĻ⧁āϟāĻŋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŦāĻ°ā§āϗ⧇āϰ āĻŦā§āϝāĻŦāϧāĻžāύ ⧍ā§Ļā§§ā§ŦāĨ¤ āϤāĻžāĻĻ⧇āϰ āϝ⧋āĻ—āĻĢāϞ⧇āϰ āϏāĻŽā§āĻ­āĻžāĻŦā§āϝ āϏāĻ°ā§āĻŦā§‹āĻšā§āϚ āĻŽāĻžāύ āĻ•āϤ āĻšāϤ⧇ āĻĒāĻžāϰ⧇?
The squares of two positive integers differ by 2016. Find their maximum possible sum.

4. ABCD āĻāĻ•āϟāĻŋ āĻŦāĻ°ā§āĻ—āĻ•ā§āώ⧇āĻ¤ā§āϰ, āϝ⧇āĻ–āĻžāύ⧇ AB = 30āĨ¤ āĻŦāĻ°ā§āĻ—āĻ•ā§āώ⧇āĻ¤ā§āϰ⧇āϰ āĻ•āĻ°ā§āĻŖāϗ⧁āϞāĻŋ P āĻŦāĻŋāĻ¨ā§āĻĻ⧁āϤ⧇ āϛ⧇āĻĻ āĻ•āϰ⧇āĨ¤ P-āϕ⧇ āϕ⧇āĻ¨ā§āĻĻā§āϰ āĻ•āϰ⧇ 34 āĻŦā§āϝāĻžāϏāĻžāĻ°ā§āϧāĻŦāĻŋāĻļāĻŋāĻˇā§āϟ āĻāĻ•āϟāĻŋ āĻŦ⧃āĻ¤ā§āϤ āφāρāĻ•āĻž āĻšāϞ⧇, āĻāϟāĻŋ AB-āϕ⧇ E āĻāĻŦāĻ‚ F āĻŦāĻŋāĻ¨ā§āĻĻ⧁āϤ⧇ āϛ⧇āĻĻ āĻ•āϰ⧇āĨ¤ EF-āĻāϰ āĻĻ⧈āĻ°ā§āĻ˜ā§āϝ āύāĻŋāĻ°ā§āĻŖāϝāĻŧ āĻ•āϰāĨ¤
In the square ABCD, AB = 30. The diagonals of the square intersect at point P. A circle, centered at point P with diameter 34, intersects AB at E and F. Find the length of EF.

5.  āϤāĻŋāύāϟāĻŋ āĻ…āĻ‹āĻŖāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž a_1, a_2, a_3-āĻāϰ āϝ⧋āĻ—āĻĢāϞ 1010101āĨ¤ āϝāĻĻāĻŋ āĻāχ āϤāĻŋāύāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻž āϝ⧋āĻ— āĻ•āϰāĻžāϰ āϏāĻŽāϝāĻŧ āϕ⧋āύ⧋ āĻ•ā§āϝāĻžāϰāĻŋ āύāĻž āĻšāϝāĻŧ, āϤāĻŦ⧇ a_1, a_2, a_3-āĻāϰ āĻ•āϤāϗ⧁āϞāĻŋ āϏāĻŽā§āĻ­āĻžāĻŦā§āϝ āĻŽāĻžāύ āĻĨāĻžāĻ•āϤ⧇ āĻĒāĻžāϰ⧇?
Three non-negative integers a_1, a_2, a_3 sum to 1010101. No carry is performed while adding these 3 numbers. In how many ways can you choose a_1, a_2, a_3?

6. \triangle ABC-āĻ D, E āĻāĻŦāĻ‚ F āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ BC, CA āĻāĻŦāĻ‚ AB-āĻāϰ āĻŽāĻ§ā§āϝāĻŦāĻŋāĻ¨ā§āĻĻ⧁āĨ¤ BE āĻāĻŦāĻ‚ DF āϝāĻĻāĻŋ G-āĻŦāĻŋāĻ¨ā§āĻĻ⧁āϤ⧇ āϛ⧇āĻĻ āĻ•āϰ⧇āĨ¤ āϝāĻĻāĻŋ \triangle ABC-āĻāϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞ ā§Ģ⧧⧍ āĻšāϝāĻŧ, āϤāĻŦ⧇ AFGE-āĻāϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞ āĻ•āϤ?

%Focuse keyword%
In \triangle ABC, D, E and F are the midpoints of BC, CA and AB, respectively. BE and DF intersect at G. What is the area of AFGE if the area of \triangle ABC is 512

ā§­. āϕ⧋āύ⧋ āĻāĻ•āϟāĻž āϏāĻ‚āĻ–ā§āϝāĻžāϕ⧇ āϏ⧁āĻ¨ā§āĻĻāϰ āϏāĻ‚āĻ–ā§āϝāĻž āĻŦāϞāĻž āĻšāϝāĻŧ āϝāĻĻāĻŋ āϤāĻžāϰ āĻ āĻŋāĻ• ā§Ē-āϟāĻž āĻ‰ā§ŽāĻĒāĻžāĻĻāĻ• āĻĨāĻžāϕ⧇ āĻāĻŦāĻ‚ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻž ⧍ āĻĻāĻŋāϝāĻŧ⧇ āύāĻŋāσāĻļ⧇āώ⧇ āĻŦāĻŋāĻ­āĻžāĻœā§āϝ āĻšāϝāĻŧāĨ¤ ⧝⧝-āĻāϰ āĻšā§‡āϝāĻŧ⧇ āϛ⧋āϟ āĻ•āϤāϗ⧁āϞ⧋ āϏ⧁āĻ¨ā§āĻĻāϰ āϏāĻ‚āĻ–ā§āϝāĻž āφāϛ⧇?
A number is called beautiful if it has exactly 4 factors and is divisible by 2. How many beautiful numbers are less than 99?

ā§Ž. {1, 2, 3, 4, 5, 6, 7, 8}-āĻāϰ āĻ•āϤāϗ⧁āϞāĻŋ āωāĻĒāϏ⧇āϟ āϰāϝāĻŧ⧇āϛ⧇ āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ ā§ĒāϟāĻŋ āĻ•ā§āϰāĻŽāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻž āĻŦāĻŋāĻĻā§āϝāĻŽāĻžāύ?
How many subsets of {1, 2, 3, 4, 5, 6, 7, 8} contain 4 consecutive numbers?

 

BDMO Regional 2021 Junior

Secondary level

ā§§. āϚāĻŋāĻ¤ā§āϰ⧇ āĻŦāĻĄāĻŧ āĻāĻŦāĻ‚ āϛ⧋āϟ āĻŦāĻ°ā§āĻ—āĻ•ā§āώ⧇āĻ¤ā§āϰ⧇āϰ āϕ⧇āĻ¨ā§āĻĻā§āϰ āĻāĻ•āχāĨ¤ āϤāĻžāĻĻ⧇āϰ āĻŦāĻžāĻšā§āϰ āĻĻ⧈āĻ°ā§āĻ˜ā§āϝ āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ ⧧⧍ āĻāĻŦāĻ‚ ā§§ā§ĻāĨ¤ āĻ›āĻžāϝāĻŧāĻž āĻ…āĻ‚āĻļ⧇āϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞ āĻ•āϤ?%Focuse keyword%
āχāĻ‚āϰ⧇āϜāĻŋ: In the figure, the two squares have the same center. They have side lengths equal to 12 and 10. What is the area of the shaded region?

⧍. āϤ⧋āĻŽāĻžāϰ āĻ•āĻžāϛ⧇ āĻ›āϝāĻŧāϟāĻŋ āĻŦāĻžāĻ•ā§āϏ āφāϛ⧇, āϝ⧇āϗ⧁āϞ⧋āϰ āĻ—āĻžāϝāĻŧ⧇ āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ ā§§, ⧍, ā§Š, ā§Ē, ā§Ģ, āĻāĻŦāĻ‚ ā§Ŧ āϞ⧇āĻ–āĻžāĨ¤ āϤ⧋āĻŽāĻžāϰ āĻŦāĻ¨ā§āϧ⧁ āĻāχ āĻŦāĻžāĻ•ā§āϏāϗ⧁āϞ⧋āϰ āĻŽāĻ§ā§āϝ⧇ n-āϟāĻŋ āĻŦāϞ āĻ­āĻžāĻ— āĻ•āϰ⧇ āĻĻāĻŋāϝāĻŧ⧇āϛ⧇āĨ¤ n-āĻāϰ āĻŽāĻžāύ āϏāĻ°ā§āĻŦāύāĻŋāĻŽā§āύ āĻ•āϤ āĻšāϞ⧇ āϤ⧁āĻŽāĻŋ āύāĻŋāĻļā§āϚāĻŋāϤāĻ­āĻžāĻŦ⧇ āĻŦāϞāϤ⧇ āĻĒāĻžāϰāĻŦ⧇ āϝ⧇, āĻāĻŽāύ āĻāĻ•āϟāĻŋ āĻŦāĻžāĻ•ā§āϏ āφāϛ⧇ āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻŦāϞ⧇āϰ āϏāĻ‚āĻ–ā§āϝāĻž āϤāĻžāϰ āĻ—āĻžāϝāĻŧ⧇ āϞ⧇āĻ–āĻž āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŦāĻ°ā§āϗ⧇āϰ āϏāĻŽāĻžāύ āĻŦāĻž āĻŦ⧇āĻļāĻŋ?
You have six boxes numbered 1, 2, 3, 4, 5, and 6, respectively. Your friend has distributed n balls among these boxes. What is the smallest value of n for which you can guarantee that there is at least one box containing at least as many balls as the square of the number written on it?

ā§Š. āϏ⧂āĻ•ā§āĻˇā§āĻŽāϕ⧋āĻŖā§€ â–ŗABC-āĻāϰ āĻĒāϰāĻŋāϕ⧇āĻ¨ā§āĻĻā§āϰ OāĨ¤ â–ŗAOB-āĻāϰ āĻ…āĻ¨ā§āϤāσāϕ⧇āĻ¨ā§āĻĻā§āϰ IāĨ¤ āϝāĻĻāĻŋ ∠AIB = 112° āĻšāϝāĻŧ, āϤāĻžāĻšāϞ⧇ ∠ACB-āĻāϰ āĻŽāĻžāύ āĻ•āϤ āĻĄāĻŋāĻ—ā§āϰāĻŋ?
The circumcenter of the acute â–ŗABC is O. The incenter of â–ŗAOB is I. If ∠AIB = 112°, what is the value of ∠ACB in degrees?

ā§Ē. āϤāĻ¨ā§āĻŽāϝāĻŧ āĻāĻŦāĻ‚ āϰāĻžāχāϝāĻŧāĻžāύ āĻāĻ•āϟāĻŋ āϖ⧇āϞāĻž āϖ⧇āϞāϛ⧇āĨ¤ āĻĒā§āϰāĻĨāĻŽā§‡ āϤāĻ¨ā§āĻŽāϝāĻŧ āĻāĻ•āϟāĻŋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž n āĻŦ⧇āϛ⧇ āύ⧇āϝāĻŧ āϝ⧇āĻ–āĻžāύ⧇ 1 < n ≤ 50āĨ¤ āϤāĻžāϰāĻĒāϰ āϰāĻžāχāϝāĻŧāĻžāύ āĻāĻ•āϟāĻŋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž d āĻŦ⧇āϛ⧇ āύ⧇āϝāĻŧ āϝ⧇āĻ–āĻžāύ⧇ d < nāĨ¤ T(n, d) āĻšāϞ⧋ āϏāĻŦāĻšā§‡āϝāĻŧ⧇ āϛ⧋āϟ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āϝāĻžāϰ āϜāĻ¨ā§āϝ T(n, d) × d āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ n āĻĻāĻŋāϝāĻŧ⧇ āĻŦāĻŋāĻ­āĻžāĻœā§āϝāĨ¤ āϤāĻ¨ā§āĻŽāϝāĻŧ⧇āϰ āϞāĻ•ā§āĻˇā§āϝ āĻšāϞ⧋ T(n, d)-āϕ⧇ āϝāϤ āĻŦāĻĄāĻŧ āϏāĻŽā§āĻ­āĻŦ āĻŦāĻžāύāĻžāύ⧋āĨ¤ āϰāĻžāχāϝāĻŧāĻžāύ⧇āϰ āϞāĻ•ā§āĻˇā§āϝ āĻšāϞ⧋ T(n, d)-āϕ⧇ āϝāϤ āϛ⧋āϟ āϏāĻŽā§āĻ­āĻŦ āĻŦāĻžāύāĻžāύ⧋āĨ¤ n āĻšāĻŋāϏ⧇āĻŦ⧇ āϤāĻ¨ā§āĻŽāϝāĻŧ⧇āϰ āϕ⧋āύ āϏāĻ‚āĻ–ā§āϝāĻž āĻŦ⧇āϛ⧇ āύ⧇āĻ“āϝāĻŧāĻž āωāϚāĻŋāϤ?
Tanmoy and Raiyan play a game. First, Tanmoy chooses any positive integer n with 1 < n ≤ 50. Then Raiyan chooses a positive integer d with d < n. Let T(n, d) be the smallest positive integer such that n divides T(n, d) × d. Tanmoy’s goal is to make T(n, d) as large as possible while Raiyan’s goal is to make T(n, d) as small as possible. What value should Tanmoy choose for n?

ā§Ģ. āĻ•āϤāϗ⧁āϞ⧋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻŦāĻžāĻ¸ā§āϤāĻŦ āϏāĻ‚āĻ–ā§āϝāĻž  a_1, a_2, \dots, a_k-āĻāϰ āĻœā§āϝāĻžāĻŽāĻŋāϤāĻŋāĻ• āĻ—āĻĄāĻŧ āĻšāϞ⧋ \sqrt[k]{a_1a_2 \dots a_k}āĨ¤ āϕ⧋āύ⧋ āĻāĻ•āϟāĻž āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž n-āĻāϰ āĻ‰ā§ŽāĻĒāĻžāĻĻāĻ• āĻ—āĻĄāĻŧ āĻšāϞ⧋ āϤāĻžāϰ āϏāĻŦ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻ‰ā§ŽāĻĒāĻžāĻĻāϕ⧇āϰ āĻœā§āϝāĻžāĻŽāĻŋāϤāĻŋāĻ• āĻ—āĻĄāĻŧāĨ¤ āϝ⧇āϏāĻŦ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž n-āĻāϰ āĻ‰ā§ŽāĻĒāĻžāĻĻāĻ• āĻ—āĻĄāĻŧ ā§Šā§¨-āĻāϰ āĻšā§‡āϝāĻŧ⧇ āĻŦ⧇āĻļāĻŋ āύāϝāĻŧ, āϤāĻžāĻĻ⧇āϰ āϏāĻ‚āĻ–ā§āϝāĻž āϝāĻĻāĻŋ N āĻšāϝāĻŧ, āϤāĻžāĻšāϞ⧇ N-āĻāϰ āĻŽāĻžāύ āĻ•āϤ?
The geometric mean of a bunch of positive reals  a_1, a_2, \dots, a_k is \sqrt[k]{a_1a_2 \dots a_k}. The factor mean of a positive integer n is equal to the geometric mean of its (positive) factors. If the number of positive intergers
n whose factor mean is not greater than 32 is N, then what is N?
ā§Ŧ. āϚāĻŋāĻ¤ā§āϰ⧇ AP = 6, BP = 5, CQ = 7, DQ = 12, āĻāĻŦāĻ‚ PQ = 27āĨ¤

RS-āĻāϰ āĻĻ⧈āĻ°ā§āĻ˜ā§āϝ āĻ•āϤ?BD Math Olympiad Regional part selection questions

In the figure, AP = 6, BP = 5, CQ = 7, DQ = 12, and PQ = 27. What is the length of RS?

ā§­. āĻāĻ•āϟāĻž āĻĒā§āϝāĻžāϞāĻŋāύāĻĄā§āϰ⧋āĻŽāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻž āĻšāϞ⧋ āĻāĻŽāύ āĻāĻ•āϟāĻž āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āϝ⧇āϟāĻžāϕ⧇ āĻŦāĻžāĻŽ āφāϰ āĻĄāĻžāύ āĻĻāĻŋāĻ• āĻĨ⧇āϕ⧇ āĻĒāĻĄāĻŧāϞ⧇ āĻāĻ•āχ āĻšāϝāĻŧāĨ¤ āϝ⧇āĻŽāύ ⧧⧍⧍⧧ āĻāĻ•āϟāĻž āĻĒā§āϝāĻžāϞāĻŋāύāĻĄā§āϰ⧋āĻŽāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻžāϰ āωāĻĻāĻžāĻšāϰāĻŖāĨ¤ āĻŽā§āϰāϏāĻžāϞāĻŋāύ āĻāĻ•āϟāĻž āϚāĻžāϰ āĻ…āĻ™ā§āϕ⧇āϰ āĻĒā§āϝāĻžāϞāĻŋāύāĻĄā§āϰ⧋āĻŽāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻž n āύāĻŋāϞāĨ¤ āĻāϰāĻĒāϰ āϏ⧇ n-āĻāϰ āĻŽāĻžāĻā§‡āϰ āĻĻ⧁āϟāĻŋ āĻ…āĻ™ā§āĻ• āĻŽā§āϛ⧇ āĻĻāĻŋāϝāĻŧ⧇ āĻāĻ•āϟāĻž āĻĻ⧁āχ āĻ…āĻ™ā§āϕ⧇āϰ āϏāĻ‚āĻ–ā§āϝāĻž m āĻŦāĻžāύāĻžāϞāĨ¤ āϝāĻĻāĻŋ n/m āĻāĻ•āϟāĻž āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āĻšāϝāĻŧ, āϤāĻžāĻšāϞ⧇ āĻāĻŽāύ āϏāĻŽā§āĻ­āĻŦ āĻ•āϤāϗ⧁āϞ⧋ n āφāϛ⧇?

A palindromic number is a positive integer that reads the same forwards and backwards. For example, 1221 is a palindromic number. Mursalin takes a four-digit palindromic number n and deletes its middle two digits to obtain a two-digit number m. If n/m is an integer, how many possible choices for n are there?
ā§Ž. S = {1, 2, 3, â€Ļ, 12}āĨ¤ āĻ•āϤāϗ⧁āϞāĻŋ āĻĢāĻžāĻ‚āĻļāύ f: S → S āφāϛ⧇ āϝāĻžāϤ⧇ f(f(x)) = x āĻšāϝāĻŧ āĻāĻŦāĻ‚ f(x) – x, 3 āĻĻā§āĻŦāĻžāϰāĻž āĻŦāĻŋāĻ­āĻžāĻœā§āϝ āĻšāϝāĻŧ?
Let S = {1, 2, 3, â€Ļ, 12}. How many functions f: S → S are there such that f(f(x)) = x and f(x) – x is divisible by 3?

 

BDMO Regional 2021 Secondary

Higher secondary

ā§§. āĻāĻ•āϟāĻŋ āĻ•ā§āϞāĻžāϏ⧇ ā§­ āϜāύ āĻļāĻŋāĻ•ā§āώāĻžāĻ°ā§āĻĨā§€ āĻ•ā§āϰāĻŋāϕ⧇āϟ āĻĒāĻ›āĻ¨ā§āĻĻ āĻ•āϰ⧇ āφāϰ ā§Ž āϜāύ āĻļāĻŋāĻ•ā§āώāĻžāĻ°ā§āĻĨā§€ āĻĢ⧁āϟāĻŦāϞ āĻĒāĻ›āĻ¨ā§āĻĻ āĻ•āϰ⧇āĨ¤ āĻĻ⧁āχāϟāĻŋ āϖ⧇āϞāĻžāϰ āĻ…āĻ¨ā§āϤāϤ āĻāĻ•āϟāĻŋ āĻĒāĻ›āĻ¨ā§āĻĻ āĻ•āϰ⧇ āĻāĻŽāύ āĻļāĻŋāĻ•ā§āώāĻžāĻ°ā§āĻĨā§€āϰ āϏāĻ‚āĻ–ā§āϝāĻž āϝāĻĻāĻŋ n āĻšāϝāĻŧ, āϤāĻžāĻšāϞ⧇ n-āĻāϰ āϏāĻŽā§āĻ­āĻžāĻŦā§āϝ āϏāĻ°ā§āĻŦā§‹āĻšā§āϚ āĻŽāĻžāύ āĻ•āϤ?
āχāĻ‚āϰ⧇āϜāĻŋ: In a class, 7 students like cricket while 8 students like football. If n is the number of students that like at least one of these two sports, what is the maximum possible value of n?

⧍. â–ŗABC-āĻ D, E āĻāĻŦāĻ‚ F āϝāĻĨāĻžāĻ•ā§āϰāĻŽā§‡ BC, CA āĻāĻŦāĻ‚ AB-āĻāϰ āĻŽāĻ§ā§āϝāĻŦāĻŋāĻ¨ā§āĻĻ⧁āĨ¤ BE āĻāĻŦāĻ‚ DF āĻŦāĻŋāĻ¨ā§āĻĻ⧁ G-āϤ⧇ āϛ⧇āĻĻ āĻ•āϰ⧇āĨ¤ āϝāĻĻāĻŋ â–ŗABC-āĻāϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞ ā§Ģ⧧⧍ āĻšāϝāĻŧ, āϤāĻžāĻšāϞ⧇ AFGE-āĻāϰ āĻ•ā§āώ⧇āĻ¤ā§āϰāĻĢāϞ āĻ•āϤ?
In â–ŗABC, D, E and F are the midpoints of BC, CA and AB respectively. BE and DF intersect at G. What is the area of AFGE if the area of â–ŗABC is 512?

ā§Š. P(x) = xÂŗ + bx² + cx + d āϰāĻžāĻļāĻŋāϟāĻž x-āĻāϰ āĻāĻ•āϟāĻž āĻŦāĻšā§āĻĒāĻĻā§€āĨ¤ āĻĻ⧇āĻ“āϝāĻŧāĻž āφāϛ⧇, P(1) < 0, P(4) > 0, P(6) < 0 āĻāĻŦāĻ‚ P(10) > 0āĨ¤ āϝāĻĻāĻŋ P(x)-āĻāϰ āϏāĻŦāϗ⧁āϞ⧋ āĻŽā§‚āϞāχ āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āĻšāϝāĻŧ, āϤāĻžāĻšāϞ⧇ |d|-āĻāϰ āϏāĻ°ā§āĻŦā§‹āĻšā§āϚ āϏāĻŽā§āĻ­āĻžāĻŦā§āϝ āĻŽāĻžāύ āĻ•āϤ?

P(x) = xÂŗ + bx² + cx + d is a polynomial in x. You are given that P(1) < 0,P(4) > 0, P(6) < 0 and P(10) > 0. If all of the roots of P(x) are integers,what is the maximum possible value of |d|?
ā§Ē. āϤāĻ¨ā§āĻŽāϝāĻŧ āĻāĻŦāĻ‚ āϰāĻžāχāϝāĻŧāĻžāύ āĻāĻ•āϟāĻŋ āϖ⧇āϞāĻž āϖ⧇āϞāϛ⧇āĨ¤ āĻĒā§āϰāĻĨāĻŽā§‡ āϤāĻ¨ā§āĻŽāϝāĻŧ āĻāĻ•āϟāĻŋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž n āĻŦ⧇āϛ⧇ āύ⧇āϝāĻŧ āϝ⧇āĻ–āĻžāύ⧇ 1 < n ≤ 50āĨ¤ āϤāĻžāϰāĻĒāϰ āϰāĻžāχāϝāĻŧāĻžāύ āĻāĻ•āϟāĻŋ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž d āĻŦ⧇āϛ⧇ āύ⧇āϝāĻŧ āϝ⧇āĻ–āĻžāύ⧇ d < nāĨ¤ T(n, d) āĻšāϞ⧋ āϏāĻŦāĻšā§‡āϝāĻŧ⧇ āϛ⧋āϟ āϧāύāĻžāĻ¤ā§āĻŽāĻ• āĻĒā§‚āĻ°ā§āĻŖāϏāĻ‚āĻ–ā§āϝāĻž āϝāĻžāϰ āϜāĻ¨ā§āϝ T(n, d) × d āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ n āĻĻāĻŋāϝāĻŧ⧇ āĻŦāĻŋāĻ­āĻžāĻœā§āϝāĨ¤ āϤāĻ¨ā§āĻŽāϝāĻŧ⧇āϰ āϞāĻ•ā§āĻˇā§āϝ āĻšāϞ⧋ T(n, d)-āϕ⧇ āϝāϤ āĻŦāĻĄāĻŧ āϏāĻŽā§āĻ­āĻŦ āĻŦāĻžāύāĻžāύ⧋āĨ¤ āϰāĻžāχāϝāĻŧāĻžāύ⧇āϰ āϞāĻ•ā§āĻˇā§āϝ āĻšāϞ⧋ T(n, d)-āϕ⧇ āϝāϤ āϛ⧋āϟ āϏāĻŽā§āĻ­āĻŦ āĻŦāĻžāύāĻžāύ⧋āĨ¤ n āĻšāĻŋāϏ⧇āĻŦ⧇ āϤāĻ¨ā§āĻŽāϝāĻŧ⧇āϰ āϕ⧋āύ āϏāĻ‚āĻ–ā§āϝāĻž āĻŦ⧇āϛ⧇ āύ⧇āĻ“āϝāĻŧāĻž āωāϚāĻŋāϤ?
Tanmoy and Raiyan play a game. First, Tanmoy chooses any positive integer n with 1 < n ≤ 50. Then Raiyan chooses a positive integer d with d < n. Let T(n, d) be the smallest positive integer such that n divides T(n, d) × d. Tanmoy’s goal is to make T(n, d) as large as possible while Raiyan’s goal is to make T(n, d) as small as possible. What value should Tanmoy choose for n?

ā§Ģ. āϚāĻŋāĻ¤ā§āϰ⧇ AP = 6, BP = 5, CQ = 7, DQ = 12, āĻāĻŦāĻ‚ PQ = 27āĨ¤ RS-āĻāϰ āĻĻ⧈āĻ°ā§āĻ˜ā§āϝ āĻ•āϤ?

BD Math Olympiad Regional part selection questions
In the figure, AP = 6, BP = 5, CQ = 7, DQ = 12, and PQ = 27. What is the length of RS?

ā§Ŧ. S = {1, 2, â€Ļ, 10}āĨ¤ āĻ•āϤāϗ⧁āϞāĻŋ āϏ⧇āϟ X ⊆ S āφāϛ⧇ āϝāĻžāϤ⧇ x ∈ X āĻāĻŦāĻ‚ 2x ∈ S āĻšāϞ⧇ 2x ∈ X?
Let S = {1, 2, â€Ļ, 10}. How many sets X ⊆ S are there such that if x ∈ X and 2x ∈ S, then 2x ∈ X?

ā§­.āĻŽā§āϰāϏāĻžāϞāĻŋāύ āĻĻ⧁āϟāĻŋ āĻŽā§ŒāϞāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻž āĻĒāĻžāĻļāĻžāĻĒāĻžāĻļāĻŋ āϞāĻŋāϖ⧇ āĻāĻ•āϟāĻŋ āĻŦāĻĄāĻŧ āϏāĻ‚āĻ–ā§āϝāĻž āϤ⧈āϰāĻŋ āĻ•āϰāϞāĨ¤ āĻĻ⧇āĻ–āĻž āϗ⧇āϞ, āĻāχ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋāϰ āϏāĻžāĻĨ⧇ ā§Š āϝ⧋āĻ— āĻ•āϰāϞ⧇ āĻāĻ•āϟāĻŋ āĻŽā§ŒāϞāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻž p āĻāϰ āĻŦāĻ°ā§āĻ— āĻĒāĻžāĻ“āϝāĻŧāĻž āϝāĻžāϝāĻŧāĨ¤ p āĻāϰ āϏāĻŽā§āĻ­āĻžāĻŦā§āϝ āĻŽāĻžāύ⧇āϰ āϝ⧋āĻ—āĻĢāϞ āĻ•āϤ?
Mursalin writes down two prime numbers side-by-side to create a new larger number. It just happens that adding 3 to this number gives you the square of a prime number p. What is the sum of all possible values of p?

ā§Ž. S = {1, 2, 3, â€Ļ, 12}āĨ¤ āĻ•āϤāϗ⧁āϞāĻŋ āĻĢāĻžāĻ‚āĻļāύ f: S → S āφāϛ⧇ āϝāĻžāϤ⧇ f(f(x)) = x āĻšāϝāĻŧ āĻāĻŦāĻ‚ f(x) – x, 3 āĻĻā§āĻŦāĻžāϰāĻž āĻŦāĻŋāĻ­āĻžāĻœā§āϝ āύāĻž āĻšāϝāĻŧ?
Let S = {1, 2, 3, â€Ļ, 12}. How many functions f: S → S are there such that f(f(x)) = x and f(x) – x is not divisible by 3?

BDMO Regional 2021 Higher Secondary

Leave a Comment

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

error: Content is protected !!
Scroll to Top