• Aucun résultat trouvé

The 2020 Canadian Mathematical Olympiad

N/A
N/A
Protected

Academic year: 2022

Partager "The 2020 Canadian Mathematical Olympiad"

Copied!
2
0
0

Texte intégral

(1)

The 2020 Canadian Mathematical Olympiad

A competition of the Canadian Mathematical Society and supported by the Actuarial Profession.

A full list of our competition sponsors and partners is available online at https://cms.math.ca/Competitions/Sponsors/

Official Problem Set

1. Let S be a set of n≥3 positive real numbers. Show that the largest possible number of distinct integer powers of three that can be written as the sum of three distinct elements of S is n−2.

2. A circle is inscribed in a rhombus ABCD. PointsP and Q vary on line segments AB and AD, respectively, so that P Q is tangent to the circle. Show that for all such line segments P Q, the area of triangle CP Qis constant.

A B

C D

P Q

3. A purse contains a finite number of coins, each with distinct positive integer values. Is it possible that there are exactly 2020 ways to use coins from the purse to make the value 2020?

c 2020 Canadian Mathematical Society p. 1/2

(2)

The 2020 Canadian Mathematical Olympiad

4. Let S ={1,4,8,9,16, . . .} be the set of perfect powers of integers, i.e. numbers of the form nk where n, k are positive integers and k ≥ 2. Write S = {a1, a2, a3. . .} with terms in increasing order, so that a1 < a2 < a3· · ·. Prove that there exist infinitely many integers m such that 9999 divides the differenceam+1−am.

5. There are 19,998 people on a social media platform, where any pair of them may or may not be friends. For any group of 9,999 people, there are at least 9,999 pairs of them that are friends. What is the least number of friendships, that is, the least number of pairs of people that are friends, that must be among the 19,998 people?

Important!

Please do not discuss this problem set online for at least 24 hours.

c 2020 Canadian Mathematical Society p. 2/2

Références

Documents relatifs

A player making a move chooses a positive integer k and one of the three entries on the board; then the player increases the chosen entry by k and decreases the other two entries by

This is because any host surrounded by two runs of guests causes at least two pairs of guests to chat unless these runs are both of length exactly 1.. This proves

How many ways are there to permute the first n positive integers such that in the permutation, for each value of k ≤ n, the first k elements of the permutation have distinct

This completes the induction, and thus at every step taking away the k-th entry of the permutation, there are 2 choices to eliminate an integer (the largest or the smallest) and

Previous research work has developed tools that provide users with more effective notice and choice [9, 18, 19, 31]. With increasing concerns about privacy because of AI, some

In this talk, I’ll tell the history of the development of ”Urika”, Cray’s supercomputer- based SPARQL query engine, from my point of view as the original prototyper and one of

Motivated by applications in mathematical imaging, asymptotic expansions of the heat generated by single, or well separated, small particles are derived in [5, 7] based on

Countries in the African Region have made more progress over the past 10 years but are still not on track to achieve the health and health-related MDGs despite the