Any cata athena QWERTY keh salle Anse
Contest Number 1 iitecactoriae’ orion) spbnlpts etsy sande
NEW YORK MATHEMATICS LEAGUE
PO. Box 1090, Manhasset, New York 11030-8090
All official participants must take this contest at the same time.
October 15, 2024
Name ‘Teacher Grade Level Score
Time Limit: 30 minutes NEXT CONTEST: NOV. 12, 2024
11. Asshown, alline segment drawn from a vertex of [>
a rectangle, through a diagonal, to a side of the | SZ.
rectangle, partitions the rectangle into triangles
with respective areas 2, 4, and 8, and a (shaded) | // 8
quadrilateral of area x. What is the value of x?
Answer Column
14.
12. I wrote a list of the squares of the first 2024 positive integers. How
many of these squares leave a remainder of 1 when divided by 4?
12.
1-3, What is the greatest integer 1 < 0 that satisfies =!
13,
1-4, Merlin’s hat doubles any money
put into it. Merlin let me use the
hat, but he would take $16 from
the hat after each doubling. I put
money into Merlin’s empty hat.
Each time Merlin took his $16,
the amount of money remaining
in the hat doubled. After the
fourth doubling, when Merlin
took his share, the hat was emp-
tied. How many dollars did I put into Merlin’s empty hat at the start?
14.
1-5, Two non-congruent triangles have 5 parts (sides and/or angles) of
one congruent to 5 parts of the other. The smaller triangle’s short-
est side has length 8, and the larger triangle’s longest side has
length 32. What is the product of the smaller triangle’s side-lengths?
15,
1-6. Of the different ordered triples of positive integers (a,b), for which
a
3. Multiply through by
50m to get m > 150, which we rewrite as -n > 150.
Multiplying by -1, we get m < ~
such negative integer n is [=151]-
$0 the greatest
Problem 1-4
Method I: Work backwards. We get the sequence
1016-824 12-28 14-30-15. Now, read
from right to left. The sequence shown involves 4
doublings, so the answer is [15].
Method II: Let n = the number of dollars I put into
Merlin’s hat. After one doubling and removal of $16,
$(2n—16) is in the hat. After the second doubling and
removal of $16, there is ${(4n—32) —16) = $(4n—48)
in the hat. Continuing, the third and fourth doubling
and removal of $16 respectively leaves $(8n~112)
and $(16n—240) in the hat. Because 16n=240 = 0,
we get n = 15.
Problem 1-5
Non-congruent triangles can't have three pairs of con-
sgruent sides, so the triangles have three pairs of con-
gruent angles (hence are similar triangles) and two
pairs of congruent sides. If the smaller triangle's sides
have lengths 8 = 23 < x < y, then, by similarity, the
larger triangle’s shortest side must exceed 8. Its sides
must be x < y < 32 = 25, The two triangles are
similar, so 23/x = x/y = 9/25. Equating the first and
last fractions, we get xy = 23x25 = 28. The length
of the shortest side of the smaller triangle is 8 = 2°,
so the product of the lengths of the smaller triangle's
three sides is 28x 2° = 2"! = [2048]
Problem 1
Let's model a+b+c = 180. Imagine lining up 180
sticks, one for each 1°. There are 179 spaces between
the 180 sticks. Any 2 of these spaces split the sticks
into 3 piles. The number of sticks to the left of the
first chosen space is the first angle’s measure. The
number of sticks between the selected spaces is the
measure of the second angle, and the number of sticks
right of the second selected space is the third angle's
measure, There are 79) = 15931 ways to choose
the 3 angles. Now, remove every angle triple with at
least 2 equal angles. In one case, every angle is 60°.
Otherwise, say the first ewo angles are equal. Each can,
have a measure of 1, 2, 3,..., 59, 61, 62,... , 88,
89, a total of 88 ways. Altogether, there are 3X 88 =
264 ways for exactly two of the angles to be equal.
‘Thus, there are 15931—264—1 = 15666 ways to rep-
resent possible degree-measures of three angles with
different measures. There are 3! = 6 ways to assign
cach set of different degree-measures to the 3 angles.
Because only one of those 6 assignments will be in
the size order a