2019 Mock State Competition Target Round Problems 1 & 2: Do Not Begin Until You Are Instructed To Do So

0
1
2
3
4
5
2019 6
Mock State Competition 7
Target Round 8
Problems 1 & 2 9
Name
School
Chapter
DO NOT BEGIN UNTIL YOU ARE INSTRUCTED TO DO SO.
This section of the competition consists of eight problems, which will be

presented in pairs. Work on one pair of problems will be completed and
answers will be collected before the next pair is distributed. The time limit
for each pair of problems is six minutes. The first pair of problems is on the
other side of this sheet. When told to do so, turn the page over and begin
working. This round assumes the use of calculators, and calculations also
may be done on scratch paper, but no other aids are allowed. All answers
must be complete, legible and simplified to lowest terms. Record only final
answers in the blanks in the left-hand column of the problem sheets. If
you complete the problems before time is called, use the time remaining to
check your answers.
Author: scrabbler94
LATEX by: scrabbler94
Test-solved by: martinba314, TheEvaluator, kevinmathz, Stormersyle,
popcorn1
Problem 1 Problem 2 Scorer’s Initials
F OUNDING S PONSORS : National Society of Professional Engineers, National Council of Teachers of Mathematics and CNA Foundation
Copyright scrabbler94 2019. All rights reserved.
03-MS19TAR1
1. years John’s age, in years, is equal to the sum of the ages of his three children. Twelve
years ago, John’s age was equal to twice the sum of the ages of his three children
then. How old is John currently?
2. keystrokes Maria’s calculator is broken, and only the ‘1’, ‘2’, and ‘+’ buttons work cor-
rectly. For example, to obtain the number 27, Maria keys in 22 + 2 + 2 + 1,
which requires eight keystrokes. What is the fewest number of keystrokes Maria
needs in order to obtain the number 2019?
Copyright scrabbler94 2019. All rights reserved. 2019 State Target Round.
0
1
2
3
4
5
2019 6
Target Round 8
Problems 3 & 4 9
Name
School
Chapter
03-MS19TAR2
3. units In a coordinate plane, the graph of the parabola y = x2 intersects the graph of the
line y = 2x + 5 at two different points M and N. What is the length of segment
MN? Express your answer in simplest radical form.
4. A frog starts at point A on the 3 × 3 grid of points shown below, where every
pair of points that are 1 unit apart is connected by an edge. Every second, the
frog randomly chooses an edge adjacent to its current point, and moves 1 unit
along that edge. The frog may revisit an edge or point. What is the probability
that after four seconds, the frog is at point B? Express your answer as a common
fraction.
0
1
2
3
4
5
2019 6
Target Round 8
Problems 5 & 6 9
Name
School
Chapter
03-MS19TAR3
5. cm2 Isosceles trapezoid ABCD has side lengths AB = 10 cm, and BC = CD = DA
= 6 cm. A circle passes through points A, B, C, and D. What is the area of this
circle? Express your answer in terms of π.
6. strings Let A = 1, B = 2, . . . , Z = 26. The product of a string of letters is defined as the

product of the corresponding numbers of each letter in the string. For example,
the product of the four-letter string “MATH” is 13 × 1 × 20 × 8 = 2080. How
many six-letter strings have a product of 32,032?
0
1
2
3
4
5
2019 6
Target Round 8
Problems 7 & 8 9
Name
School
Chapter
03-MS19TAR4
7. ways The figure below contains seven circles arranged in a hexagonal shape. Each
circle is to contain a different integer between 1 and 9, inclusive, such that the
sum of the three integers contained within any triangle is divisible by 3. In how
many ways can this be done? Two ways that differ only by rotation or reflection
are distinguishable.
8. Define the base factorial representation of a positive integer n by n =

(dk dk−1 dk−2 . . . d1 ), which satisfies the following properties:
• 0 ≤ di ≤ i for all i between 1 and k inclusive

• The leading digit dk is greater than or equal to 1
• n = dk × k! + dk−1 × (k − 1)! + . . . + d2 × 2! + d1 × 1!.
For example, 46 = 1 × 4! + 3 × 3! + 2 × 2! + 0 × 1!, so the base factorial rep-

resentation of the number 46 is (1320). Let N denote the sum of all positive
integers less than or equal to 720 whose base factorial representation contains
the digit 0 at least once. What is the remainder when N is divided by 720?

2019 Mock State Competition Target Round Problems 1 & 2: Do Not Begin Until You Are Instructed To Do So

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

2019 Mock State Competition Target Round Problems 1 & 2: Do Not Begin Until You Are Instructed To Do So

Uploaded by

Copyright:

Available Formats

0

DO NOT BEGIN UNTIL YOU ARE INSTRUCTED TO DO SO.

This section of the competition consists of eight problems, which will be

Problem 1 Problem 2 Scorer’s Initials

DO NOT BEGIN UNTIL YOU ARE INSTRUCTED TO DO SO.

Problem 3 Problem 4 Scorer’s Initials

DO NOT BEGIN UNTIL YOU ARE INSTRUCTED TO DO SO.

Problem 5 Problem 6 Scorer’s Initials

6. strings Let A = 1, B = 2, . . . , Z = 26. The product of a string of letters is defined as the

DO NOT BEGIN UNTIL YOU ARE INSTRUCTED TO DO SO.

Problem 7 Problem 8 Scorer’s Initials

8. Define the base factorial representation of a positive integer n by n =

• 0 ≤ di ≤ i for all i between 1 and k inclusive

For example, 46 = 1 × 4! + 3 × 3! + 2 × 2! + 0 × 1!, so the base factorial rep-

You might also like