Scribd
Upload
258 views1 page

2023 Asc

2023 AMOC Senior Contest

Uploaded by

A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
258 views1 page

2023 Asc

2023 AMOC Senior Contest

Uploaded by

A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

DATE

Tuesday 15
AMOC SENIOR CONTEST
AMOC SENIOR August 2023
CONTEST
2023
Tuesday, 15 August 2023
Time allowed: 4 hours
No calculators are to be used
Each question is worth seven points

1. Given any finite string made up of As and Bs, an occurrence of AB may be replaced with
BBAA. Starting from any finite string of As and Bs, is it always possible to perform a
number of such replacements so that all Bs appear to the left of all As?

2. A positive integer m is given to Alice and Bob. They play a game with the following rules.
To start the game, Alice writes a single nonzero digit on a board. Bob and Alice then
take turns writing a single digit at either end of the current number on the board. A
zero may be written at the end but not at the start of the number. Bob wins and the
game ends if at any time the number on the board is divisible by m.

(i) What is the smallest value of m such that Alice can prevent Bob from ever winning?
(ii) Now suppose that Alice may start the game with any positive integer. All other
rules remain the same. What is the smallest value of m such that Alice can prevent
Bob from ever winning?

3. Points A, B, C, D lie on sides EF, F G, GH, HE, respectively, of a parallelogram EF GH.


Suppose that AC ⊥ EF , BD ⊥ F G, and ABCD is cyclic. Let Q be the point on AC
such that F Q ∥ BC.
Prove that EQ ∥ DC.

4. Counters are placed, one at a time, in the unit squares of an n × n grid according to the
following rules:

ˆ a counter can only be placed in an empty unit square


ˆ the first counter can be placed in any unit square
ˆ each subsequent counter can only be placed in a unit square S if the number of
counters already in the same row as S and the number of counters already in the
same column as S sum to an odd number.

For each value of n ≥ 2, find the smallest possible number of empty unit squares
remaining after a sequence of such placements.

5. Let a1 , a2 , . . . , an and b1 , b2 , . . . , bn be (not necessarily positive) real numbers, where


n ≥ 2. Let K be the maximum of and L be the minimum of b1 , b2 , . . . , bn .
Prove that 
ai aj |bi − bj | ≤ 12 (K − L)(a1 + a2 + · · · + an )2 .
i<j

Note that refers to summing over all pairs (i, j) such that 1 ≤ i < j ≤ n.
i<j

© 2023 Australian Mathematics Trustis supported by the Australian Government Department of Industry, Science and
The Olympiad program
Resources through the Science Competitions: Mathematics and Informatics Olympiads grant opportunity.

© 2023 Australian Mathematics Trust

You might also like