University of North Dakota Grades 11/12
January 12, 2026
School Team Name
Calculators are NOT allowed. Solutions
Simplify .
(20 pts) 1. 5
Solution: We have .
How many numbers from 1 to 120 (including 1 and 120) are divisible by 4 or 5?
(20 pts) 2. 48
Solution: Of the numbers from 1 to 120, there are divisible by 4, divisible by 5, and divisible by 4 and 5. By inclusion-exclusion counting, there are such numbers.
Find all positive values for a diameter of a circle for which the area of the circle is equal numerically to half of its circumference.
(20 pts) 3. 2
Solution: Let be the diameter of a circle. The condition for the area and circumference can be expressed in terms of as . Rearranging gives or equivalently . The only positive solution to the latter is .
Simplify
(20 pts) 4. 55
Solution:
Solve .
(20 pts) 5. 6
Solution: Observe squaring gives
The latter has solution . A check verifies that is a solution to the given equation.
How many sides does a dodecagon have?
(20 pts) 6.
Solution: A dodecagon has 12 sides.
Find the area of a square with perimeter 56.
(20 pts) 7.
Solution: Let be the side length of a square. If the perimeter of the square is 56, we have , so . The area of the square is .
In degrees, what acute angle does the hour and minute hands make at 3:30?
(20 pts) 8.
Solution: At 3:30, the hour hand lies halfway between 3 and 4 hour marks on the 12-hour analog clock. There are between each hour marks on the clock. Thus the angle at 3:30 between the minute and hour hand is .
A set of 5 positive integers has a median of 17 and mean of 13. What is the largest possible value in the set?
(20 pts) 9.
Solution: Let be the five positive integers. Since the median is 17, we have . A mean of 13 implies
Rearranging gives To maximize subject to the conditions given, take and . This gives .
Find the number of ways that a red and a blue die can be rolled so that their product is a multiple of 6. Assume each die is standard with 6-sides.
(20 pts) 10.
Solution: Let be a roll outcome. Then is a multiple of 6 if and only if , , , , , , , , , , , , , , . Thus, the number of ways is .
