Hard Math quiz

Hard Math Quiz: Challenge Problems

Try 10 hard math challenges on number theory, counting, probability, geometry, optimization, sequences, and functions. Includes hints and detailed solutions.

1 Question 1 of 10
Not answered

What are the last two decimal digits of 7222+3222?

Hint: Work modulo one hundred. Find a power of each base that leaves remainder one, then reduce the exponent for each base separately.
Explanation: We have 74≡1(mod 100) and 320≡1(mod 100). Since 222=4×55+2=20×11+2, the two powers leave remainders 49 and 9. Their sum leaves remainder 49+9=58. Thus the final two digits are 58.
2 Question 2 of 10
Not answered

How many pairs of positive integers (x,y) with x≤y satisfy 1x+1y=16?

Hint: Clear denominators and complete a product. The ordering condition means that swapping two different coordinates does not create another allowed pair.
Explanation: The equation gives x×y=6×x+6×y, hence (x−6)×(y−6)=36. Each original variable is greater than 6, so the factors are positive. The factor pairs with the first no larger than the second are (1,36), (2,18), (3,12), (4,9), and (6,6). They give 5 solutions, including the equal-coordinate case (12,12).
3 Question 3 of 10
Not answered

How many four-digit positive integers can be formed from the digits 0,1,2,3,4 without repeating a digit, if the integer must be divisible by 4?

Hint: A number is divisible by four exactly when its final two digits form a multiple of four. Separate endings that use zero from endings that leave zero available for the leading positions.
Explanation: The possible endings are 04, 12, 20, 24, 32, and 40. For each of the three endings containing zero, the first two positions have 3×2=6 arrangements. For each of the other three endings, the first digit has two nonzero choices and the second has two choices, giving 2×2=4. The total is 3×6+3×4=30. A zero is allowed at the start of a two-digit ending, but not at the start of the complete four-digit integer.
4 Question 4 of 10
Not answered

Two fair six-sided dice are rolled independently. Given that their product is even, what is the probability that their sum is odd?

Hint: Restrict the equally likely ordered outcomes to those satisfying the condition. An odd sum requires one odd result and one even result.
Explanation: There are 36 ordered outcomes. A product is odd only when both results are odd, which accounts for 3×3=9 outcomes. Thus 36−9=27 outcomes satisfy the given condition. An odd sum occurs in 2×3×3=18 ordered outcomes, all with even product. The conditional probability is 1827=23.
5 Question 5 of 10
Not answered

A right triangle has hypotenuse 25. Its inscribed circle has radius 3. What is the area of the triangle?

Hint: For a right triangle, the sum of the legs is the hypotenuse plus twice the inradius. Then use area equals inradius times semiperimeter.
Explanation: For legs a, b, hypotenuse c, and inradius r, the right-triangle identity is a+b=c+2×r. The legs therefore sum to 25+2×3=31. The semiperimeter is 31+252=28, and the area is 3×28=84. Using the hypotenuse in place of the semiperimeter would give a different quantity.
6 Question 6 of 10
Not answered

Positive real numbers x and y satisfy x+y=10. What is the minimum possible value of (x+1x)×(y+1y)?

Hint: Set the product of the two variables equal to a single positive parameter. Express the objective in terms of that parameter, find a lower bound, and check that equality is attainable.
Explanation: Let t=x×y. Then 0<t≤25 and x2+y2=100−2×t. Expanding the product gives t+x2+y2+1t=t+101t−2. By the arithmetic-geometric mean inequality, t+101t≥2×101, with equality at t=101. This product is feasible: the positive values 5+25−101 and 5−25−101 have sum ten and product 101. The minimum is therefore 2×101−2. Symmetry alone does not force the minimizing pair to have equal coordinates.
7 Question 7 of 10
Not answered

A sequence is defined by a1=2 and an+1=an1+2×an for every integer n≥1. What is a25?

Hint: Take reciprocals of the recurrence. The transformed sequence has a constant difference, so count the steps from the first term carefully.
Explanation: All terms stay positive. Taking reciprocals gives 1an+1=1an+2. Starting from 1a1=12, there are twenty-four increments before the twenty-fifth term. Hence 1a25=12+24×2=972, so a25=297.
8 Question 8 of 10
Not answered

A real-valued function f satisfies f(x)+2×f(1−x)=x2 for every real x. What is f(2)?

Hint: Substitute the requested input and then the input obtained by reflecting it around one half. This produces two equations in the same two function values.
Explanation: At x=2, the condition gives f(2)+2×f(−1)=4. At x=−1, it gives f(−1)+2×f(2)=1. Double the second equation and subtract the first to obtain 3×f(2)=−2. Thus f(2)=−23. The second substitution is essential because the function is not given by an explicit formula.
9 Question 9 of 10
Not answered

Let r and s be the two roots of x2−5×x+3=0. What is 1r2+1+1s2+1?

Hint: Use the sum and product of the roots. Combine the two reciprocal expressions before attempting to find either root explicitly.
Explanation: The root relations give r+s=5 and r×s=3. Thus r2+s2=25−6=19. The numerator of the combined fraction is 19+2=21, and its denominator is 32+19+1=29. The result is 2129. Squaring the sum of the roots without subtracting twice their product would give the wrong value.
10 Question 10 of 10
Not answered

A path on the integer grid goes from (0,0) to (4,4) using only unit steps right or up. It may touch the line y=x but may never go above it. How many such paths are possible?

Hint: Count all step orders, then remove the paths that cross above the diagonal. Reflect the initial segment up to the first crossing, or count valid paths recursively by grid point.
Explanation: Without the diagonal restriction, there are 8!4!×4!=70 paths. Reflect across the diagonal the prefix ending at an invalid path's first point above it. This gives a bijection with step orders having five right steps and three up steps, counted by 8!5!×3!=56. The valid count is 70−56=14. Simply halving the unrestricted count does not account correctly for paths touching the diagonal.

Your result

You answered 0 out of 10 questions correctly.

What this challenge quiz checks

Hard math problems reward a useful transformation

These 10 challenges use different methods: modular arithmetic, integer factor pairs, constrained digit arrangements, conditional probability, an incircle relation, optimization, a reciprocal recurrence, a functional equation, root identities, and lattice-path counting. Each has one correct answer, an optional hint, and a detailed solution.

Recognize structure

Choose a remainder, a product, a reciprocal, a symmetry, or a counting model before expanding a large calculation.

Transform without losing conditions

Retain positivity, integer restrictions, ordering, and denominator conditions throughout the solution.

Connect topics

A geometry question may reduce to a sum of lengths; a nonlinear recurrence may become an arithmetic progression.

Prove the requested result

Distinguish a bound from an attained minimum, one construction from a full count, and an unconditional probability from a conditional one.

Method selection

Ask which representation makes the conditions simpler

The most useful step is often a change of viewpoint rather than a longer calculation.

Read the constraints, choose a model, transform, solve, and verify.

Four productive first questions

Large powerDoes a small power repeat modulo the required divisor?
Reciprocal relationDoes clearing denominators or taking reciprocals reveal a simpler structure?
Function at related inputsCan a second substitution produce equations in the same unknown values?
Minimum or maximumWhat is the equality case, and does it satisfy the original conditions?
Integer equations

Completing a product can turn an equation into a finite divisor count

For positive integers satisfying 1u+1v=14, clear denominators before looking for individual values.

u×v=4×(u+v)
(u−4)×(v−4)=16
The positive factor pairs with the smaller first are (1,16), (2,8), and (4,4).
Recurrences rather than guesses

An explicit rule can reveal a simpler transformed sequence

Suppose b1=1 and bn+1=bn1+bn for positive integer indices.

Transform

Take reciprocals of the positive terms.

1bn+1=1bn+1

Track the index

The reciprocal sequence starts at one and increases by one each step.

1bn=n

Return to the original

Invert only after finding the transformed term.

bn=1n

A finite prefix alone can fit many sequence rules. The initial value and recurrence specify the sequence used here.

Geometry through relations

Use the inradius and semiperimeter as linked quantities

For a right triangle with legs 12 and 16 and hypotenuse 20, both the area and the inradius can be checked exactly.

Semiperimeter: 12+16+202=24
Inradius: 12+16−202=4
Area: 4×24=12×162=96
Bounds and counting constraints

A correct intermediate argument may still miss an original condition

Check whether equality is possible

For positive z, z+9z≥6, with equality only at z=3. If another condition requires z≥5, this equality case is excluded.

An unattainable lower bound is not an attained minimum.

Keep the leading-position restriction

Three-digit integers using distinct digits from 0,1,2,3 have three choices for the first digit, then three, then two.

3×3×2=18. Zero is available after the leading position has been filled.
Symmetric expressions

Root sums and products can replace explicit root calculations

If two roots have sum 7 and product 10, a symmetric expression can often be evaluated without finding either root separately.

For roots u and v, combine 1u+1+1v+1 over a common denominator.
The combined numerator is the root sum plus two; the denominator is the root product plus the root sum plus one.
7+210+7+1=918=12
Common challenge-problem mistakes

Use the original conditions as part of the proof

Double-counting symmetric cases

Ordered outcomes, unordered pairs, and paths subject to a boundary are different counting objects.

State when two descriptions represent the same allowed object.

Keeping the old probability space

A condition restricts which outcomes remain possible. Recompute the relevant denominator before taking a probability ratio.

Equal likelihood of the original ordered outcomes is preserved when conditioning on a subset of them.

Stopping at a bound or a transformed variable

Show that a proposed extremum is attainable, and return from any reciprocal or product substitution to the quantity requested.

A final verification should check both the answer and its equality or indexing conditions.
Use your result

Review the strategic step behind each missed problem

This is a hard mixed challenge set rather than a formal grade-level assessment.

0–4 correct

Rework the explanations slowly. Review the individual tools: remainders, divisor pairs, counting rules, root identities, and conditional probability.

5–7 correct

Focus on the transition that made each problem simpler and on the constraints that could invalidate a tempting result.

8–10 correct

Write a full justification for the counting, equality, and feasibility steps. Then try changing one condition and predicting how the method must change.

Continue from here

Build on mixed mathematical reasoning

Hard Math hub

Hard Math Quizzes

Explore more advanced algebra, geometry, patterns, probability, and mixed reasoning.

Open Hard Math section
Exam-style challenge

SAT Math Quizzes

Apply algebra, data analysis, geometry, and proportional reasoning in mixed exam-style problems.

Open SAT Math section