Scribd
Upload
19 views2 pages

2018PascalContest (1) - 4-5

The document presents a series of mathematical problems, including calculations involving prime numbers, angles in geometric figures, distance and speed, area of polygons, combinatorial paths, properties of circuits, and averages of student heights. Each problem is followed by multiple-choice answers. The problems require knowledge in various areas of mathematics, including geometry, algebra, and combinatorics.

Uploaded by

balalishahriar223
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
19 views2 pages

2018PascalContest (1) - 4-5

The document presents a series of mathematical problems, including calculations involving prime numbers, angles in geometric figures, distance and speed, area of polygons, combinatorial paths, properties of circuits, and averages of student heights. Each problem is followed by multiple-choice answers. The problems require knowledge in various areas of mathematics, including geometry, algebra, and combinatorics.

Uploaded by

balalishahriar223
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/ 2

17. Suppose that p and q are two different prime numbers and that n = p2 q 2 .

The number
of possible values of n with n < 1000 is
(A) 5 (B) 6 (C) 4 (D) 8 (E) 7

18. In the diagram, 4P QR has ∠P QR = 120◦ . Also, ∠QP S = ∠RP S and


∠QRS = ∠P RS. (In other words, SP and SR bisect ∠QP R and ∠QRP , respectively.)
What is the measure of ∠P SR?
Q
120°

P R

(A) 130◦ (B) 120◦ (C) 140◦ (D) 160◦ (E) 150◦

19. On Monday, Mukesh travelled x km at a constant speed of 90 km/h. On Tuesday,


he travelled on the same route at a constant speed of 120 km/h. His trip on Tuesday
took 16 minutes less than his trip on Monday. The value of x is
(A) 90 (B) 112 (C) 100 (D) 96 (E) 92

20. In the diagram, P QRST is a pentagon with P Q = 8,


QR = 2, RS = 13, ST = 13, and T P = 8. Also, P 8 Q
∠T P Q = ∠P QR = 90◦ . What is the area of pentagon 2
P QRST ?
8 R
(A) 76 (B) 84 (C) 92
(D) 100 (E) 108
T
13

13

Part C: Each correct answer is worth 8.


21. A coin travels along a path that starts in an unshaded
square in the top row of the figure, that uses only diagonal
moves, and that ends in an unshaded square in the
bottom row. A diagonal move takes the coin either one
square down and one square left, or one square down and
one square right. How many different paths from the top
row to the bottom row are possible?
(A) 16 (B) 20 (C) 32
(D) 24 (E) 28
22. A Miniou circuit contains nodes and wires and obeys the
following rules: wire node
• Each wire connects two different nodes.
• There is at most one wire between each pair of
nodes.
• Exactly three wires are connected to each node.
An example of a Miniou circuit is shown. If a Miniou
circuit has 13 788 wires, how many nodes does it have?
(A) 9190 (B) 9192 (C) 9188
(D) 9186 (E) 9184

23. In the diagram, two larger circles with radius 1 have centres P and Q. Also, the
smaller circle has diameter P Q. The region inside the two larger circles and outside
the smaller circle is shaded.

P Q

The area of the shaded region is closest to


(A) 0.36 (B) 0.38 (C) 0.40 (D) 0.42 (E) 0.44

24. In Mrs. Warner’s class, there are 30 students. Strangely, 15 of the students have a
height of 1.60 m and 15 of the students have a height of 1.22 m. Mrs. Warner lines up
n students so that the average height of any four consecutive students is greater than
1.50 m and the average height of any seven consecutive students is less than 1.50 m.
What is the largest possible value of n?
(A) 8 (B) 12 (C) 11 (D) 9 (E) 10

25. P.J. starts with m = 500 and chooses a positive integer n with 1 ≤ n ≤ 499. He
applies the following algorithm to m and n:

• P.J. sets r equal to the remainder when m is divided by n.


• If r = 0, P.J. sets s = 0.
If r > 0, P.J. sets s equal to the remainder when n is divided by r.
• If s = 0, P.J. sets t = 0.
If s > 0, P.J. sets t equal to the remainder when r is divided by s.

For example, when n = 8, P.J. obtains r = 4, s = 0, and t = 0. For how many of


the positive integers n with 1 ≤ n ≤ 499 does P.J.’s algorithm give 1 ≤ r ≤ 15 and
2 ≤ s ≤ 9 and t = 0?
(A) 14 (B) 12 (C) 16 (D) 15 (E) 13

You might also like