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.
How many pairs of positive integers with satisfy ?
How many four-digit positive integers can be formed from the digits without repeating a digit, if the integer must be divisible by ?
Two fair six-sided dice are rolled independently. Given that their product is even, what is the probability that their sum is odd?
A right triangle has hypotenuse . Its inscribed circle has radius . What is the area of the triangle?
Positive real numbers and satisfy . What is the minimum possible value of ?
A sequence is defined by and for every integer . What is ?
A real-valued function satisfies for every real . What is ?
Let and be the two roots of . What is ?
A path on the integer grid goes from to using only unit steps right or up. It may touch the line but may never go above it. How many such paths are possible?
Your result
You answered 0 out of 10 questions correctly.
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.
Ask which representation makes the conditions simpler
The most useful step is often a change of viewpoint rather than a longer calculation.
Four productive first questions
Completing a product can turn an equation into a finite divisor count
For positive integers satisfying , clear denominators before looking for individual values.
An explicit rule can reveal a simpler transformed sequence
Suppose and for positive integer indices.
Transform
Take reciprocals of the positive terms.
Track the index
The reciprocal sequence starts at one and increases by one each step.
Return to the original
Invert only after finding the transformed term.
A finite prefix alone can fit many sequence rules. The initial value and recurrence specify the sequence used here.
Use the inradius and semiperimeter as linked quantities
For a right triangle with legs and and hypotenuse , both the area and the inradius can be checked exactly.
A correct intermediate argument may still miss an original condition
Check whether equality is possible
For positive , , with equality only at . If another condition requires , this equality case is excluded.
Keep the leading-position restriction
Three-digit integers using distinct digits from have three choices for the first digit, then three, then two.
Root sums and products can replace explicit root calculations
If two roots have sum and product , a symmetric expression can often be evaluated without finding either root separately.
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.
Keeping the old probability space
A condition restricts which outcomes remain possible. Recompute the relevant denominator before taking a probability ratio.
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.
Review the strategic step behind each missed problem
This is a hard mixed challenge set rather than a formal grade-level assessment.
Rework the explanations slowly. Review the individual tools: remainders, divisor pairs, counting rules, root identities, and conditional probability.
Focus on the transition that made each problem simpler and on the constraints that could invalidate a tempting result.
Write a full justification for the counting, equality, and feasibility steps. Then try changing one condition and predicting how the method must change.