[Precalculus · Practice Lab ①] 15 Advanced Exam Problems: Function Validity, Range Mapping & Function Equality (Residue Classes, Parity & 1:1 Twin Diagnostics)

 

Precalculus · Practice Lab ①

15 Advanced Exam Problems: Function Validity, Range Mapping & Function Equality (Advanced Edition)

Residue Class Partitions, Axis Symmetry Case-Work, Cardinality of Ranges & 1:1 Twin Diagnostics for f = g

🎯 [Top-Tier Mastery] Yul's 3 Advanced Action Protocols
  • Partition by Residue Classes: For functions governed by integer rules, decompose inputs using modulos (parity, mod 3, mod 5) to reveal cyclic patterns in the range.
  • Map Range Cardinality to Symmetry: The condition n(f(X)) = k is determined by the number of symmetric pairs satisfying f(a) = f(b) and whether the vertex falls within the domain.
  • Formulate Function Equality via Roots: The real solutions of f(x) - g(x) = 0 form the pool of eligible domain elements. Carefully compute subset counts under constraints.

STAGE 1. Function Existence & Modular Logic (Types 01~05)

[Practice Type 01] Residue Class Mapping Rule Number Theory

For domain X = {1, 2, 3, ..., 50} and codomain Y = {0, 1, 2, 3, 4}, the function f: X → Y is defined as
f(x) = 'the remainder when x²⁰²⁶ + 3x is divided by 5'. Find the sum of all elements in the range of f.

💡 Yul's Pro-Tip: Use Fermat's Little Theorem (x⁴ ≡ 1 mod 5 for non-multiples of 5). Since 2026 = 4 × 506 + 2, reduce x²⁰²⁶ to x² mod 5!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 7

1) For x not divisible by 5, x⁴ ≡ 1 (mod 5) ⟹ x²⁰²⁶ ≡ x² (mod 5).
We evaluate g(x) = x² + 3x (mod 5):
• x ≡ 0: 0 + 0 ≡ 0
• x ≡ 1: 1 + 3 = 4
• x ≡ 2: 4 + 6 = 10 ≡ 0
• x ≡ 3: 9 + 9 = 18 ≡ 3
• x ≡ 4: 16 + 12 = 28 ≡ 3
2) Since X contains 10 integers for each remainder modulo 5, the range is {0, 3, 4}.
Sum of elements: 0 + 3 + 4 = 7
[1:1 Twin Diagnostic 01] For f(x) = (remainder of x³ + 2x divided by 3) with X = {1, ..., 30} and Y = {0, 1, 2}, find the number of elements in the range.
Check Answer
Answer: 1 (Solution: x³ + 2x = (x-1)x(x+1) + 3x is always divisible by 3, so Range = {0})
[Practice Type 02] Root-Counting Function of a Quadratic Equation Discriminant Boundary

For real number t, let f(t) be the number of distinct real roots of (t - 2)x² - 2tx + (t + 3) = 0 in x. Find the sum of all elements in the range of f.

💡 Yul's Pro-Tip: When the leading coefficient contains a variable, split into t = 2 (linear case) and t ≠ 2 (quadratic discriminant D/4)!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 3

1) When t = 2: -4x + 5 = 0 ⟹ 1 real root (f(2) = 1).
2) When t ≠ 2: Quadratic equation discriminant D/4 = t² - (t - 2)(t + 3) = -t + 6.
• t < 6 (t ≠ 2): D/4 > 0 ⟹ 2 real roots (f(t) = 2)
• t = 6: D/4 = 0 ⟹ 1 real root (f(6) = 1)
• t > 6: D/4 < 0 ⟹ 0 real roots (f(t) = 0)
3) Range = {0, 1, 2}. Sum of elements = 0 + 1 + 2 = 3
[1:1 Twin Diagnostic 02] For kx² + 4x + 1 = 0, let g(k) be the number of real roots. Find the range g(ℝ).
Check Answer
Answer: {0, 1, 2} (Solution: k=0 gives 1 root, k<4 gives 2 roots, k=4 gives 1 root, k>4 gives 0 roots)
[Practice Type 03] Axis-Dependent Parameter Constraints for Valid Functions Axis Placement

Given domain X = [-2, 2] and codomain Y = [-1, 7], find the number of integers a such that f(x) = x² - 2ax + 3 defines a valid function.

💡 Yul's Pro-Tip: The entire range must be contained in [-1, 7]. Evaluate endpoints: f(-2) ≤ 7 and f(2) ≤ 7 simultaneously restrict a!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 1 (a = 0)

1) For all x ∈ [-2, 2], -1 ≤ f(x) ≤ 7.
2) Endpoints:
• f(-2) = 4 + 4a + 3 = 4a + 7 ≤ 7 ⟹ a ≤ 0
• f(2) = 4 - 4a + 3 = 7 - 4a ≤ 7 ⟹ a ≥ 0
This forces a = 0.
3) Verification at a = 0: f(x) = x² + 3. On [-2, 2], minimum is 3 ≥ -1 and maximum is 7 ≤ 7. Fully satisfied.
Thus, exactly 1 integer exists (a = 0).
[1:1 Twin Diagnostic 03] For X = [-1, 1] and Y = [0, 5], find the range of k such that f(x) = x² + 2kx + 2 defines a valid function.
Check Answer
Answer: -1 ≤ k ≤ 1 (Solution: f(1) = 3 + 2k ≤ 5 and f(-1) = 3 - 2k ≤ 5 ⟹ -1 ≤ k ≤ 1)
[Practice Type 04] Prime Factor Counting Function Inductive Logic

A function f: ℕ → ℝ satisfies:
(a) f(1) = 0
(b) f(p) = 1 for any prime number p
(c) f(mn) = f(m) + f(n) for all m, n ∈ ℕ
Calculate the value of f(2025).

💡 Yul's Pro-Tip: The property f(mn) = f(m) + f(n) means f counts the total number of prime factors with multiplicity! Factorize 2025.
👉 Reveal Answer & Step-by-Step Solution
[Answer] 6

1) Prime factorization: 2025 = 45² = (3² × 5)² = 3⁴ × 5².
2) Applying rule (c): f(3⁴ × 5²) = 4f(3) + 2f(5).
3) Since 3 and 5 are primes: f(3) = 1, f(5) = 1.
4) f(2025) = 4(1) + 2(1) = 6
[1:1 Twin Diagnostic 04] Under the same rules, find the maximum two-digit integer n such that f(n) = 3.
Check Answer
Answer: 98 (Solution: Largest product of 3 primes under 100 is 2 × 7² = 98)
[Practice Type 05] Combinatorial Difference: Function vs Non-Function Relations Combinatorics

For X = {1, 2, 3} and Y = {a, b}, calculate the difference between the number of binary relations from X to Y that are NOT functions and the number of relations that ARE functions.

💡 Yul's Pro-Tip: The total number of binary relations is 2^(|X|·|Y|) = 2⁶ = 64, while functions total |Y|^|X| = 2³ = 8!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 48

1) Total relations = 2^(3 × 2) = 2⁶ = 64.
2) Valid functions = 2³ = 8.
3) Non-function relations = 64 - 8 = 56.
4) Difference = 56 - 8 = 48
[1:1 Twin Diagnostic 05] For X = {1, 2} and Y = {1, 2, 3}, find the number of non-function relations from X to Y.
Check Answer
Answer: 55 (Solution: 2⁶ - 3² = 64 - 9 = 55)

STAGE 2. Range Cardinality & Symmetry Killers (Types 06~10)

[Practice Type 06] Functions with Exact Range Cardinality n(f(X)) = 2 Surjection Principle

For X = {1, 2, 3, 4, 5} and Y = {1, 2, 3}, find the number of functions f: X → Y such that the range contains exactly 2 elements.

💡 Yul's Pro-Tip: Choose the 2 target codomain elements (₃C₂ = 3), then multiply by the number of surjective functions onto those 2 elements (2⁵ - 2)!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 90

1) Choose 2 elements from Y: ₃C₂ = 3 ways.
2) Mappings from 5 elements to 2 elements hitting both: 2⁵ - 2 = 30 ways.
3) Total = 3 × 30 = 90
[1:1 Twin Diagnostic 06] For X = {1, 2, 3, 4} and Y = {a, b, c}, find the number of functions with range size 2.
Check Answer
Answer: 42 (Solution: ₃C₂ × (2⁴ - 2) = 3 × 14 = 42)
[Practice Type 07] Conditional Parity Constraint on Range Element Sum Parity Partition

For X = {1, 2, 3} and Y = {1, 2, 3, 4}, find the number of functions f: X → Y such that the sum of all elements in the range is an even number.

💡 Yul's Pro-Tip: Partition cases by range size (1, 2, or 3 elements) whose elements sum to an even number, then count valid mappings for each subset!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 26

Odds {1, 3}, Evens {2, 4}
1) Range size 1 (single even): {2}, {4} ⟹ 2 mappings.
2) Range size 2 (even + even or odd + odd):
• {2, 4}: 2³ - 2 = 6 mappings.
• {1, 3}: 2³ - 2 = 6 mappings.
3) Range size 3 (2 odds + 1 even):
Subsets: {1, 3, 2} and {1, 3, 4} (2 subsets).
Since |X| = 3, these correspond to bijections: 2 × 3! = 12 mappings.
Total = 2 + 12 + 12 = 26
[1:1 Twin Diagnostic 07] For X = {1, 2} and Y = {1, 2, 3}, find the number of functions whose range elements multiply to an even number.
Check Answer
Answer: 5 (Solution: Total 3² = 9 minus purely odd range functions 2² = 4 gives 5)
[Practice Type 08] Quadratic Axis Symmetry and Range Size Constraints Axis Symmetry

For domain X = {-2, -1, 0, 1, 2, 3}, function f(x) = x² - 2ax + 1 produces a range with exactly 4 elements. Find the sum of all possible real values of a.

💡 Yul's Pro-Tip: The parabola is symmetric about x = a. Thus f(u) = f(v) iff (u + v)/2 = a. Exactly 2 distinct pairs must share the same midpoint a!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 1

1) Reducing 6 inputs to 4 outputs requires exactly 2 symmetric pairs.
• Midpoint a = 0.5 pairs {-1, 2}, {0, 1}, and {-2, 3} (3 pairs, yielding 3 outputs; invalid).
• Midpoint a = 0 pairs {-1, 1} and {-2, 2}, leaving 0 and 3 unpaired ⟹ 4 outputs (valid).
• Midpoint a = 1 pairs {0, 2} and {-1, 3}, leaving 1 and -2 unpaired ⟹ 4 outputs (valid).
2) Valid values: a = 0 and a = 1.
Sum = 0 + 1 = 1
[1:1 Twin Diagnostic 08] For X = {1, 2, 3, 4, 5}, find a such that f(x) = x² - 2ax produces a range with exactly 3 elements.
Check Answer
Answer: 3 (Solution: a = 3 pairs {1, 5} and {2, 4}, leaving 3 isolated: 5 - 2 = 3 outputs)
[Practice Type 09] Absolute Value Sum Curve and Global Minimum Piecewise Inflection

Determine the minimum value of g(x) = |x - 1| + |x - 4| + |2x - 6| over all real numbers.

💡 Yul's Pro-Tip: Write as |x - 1| + |x - 4| + 2|x - 3|. The minimum of a weighted sum of absolute deviations occurs at the weighted median x = 3!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 3

1) Critical corner points: x = 1, x = 3, x = 4.
2) Evaluate corner points:
• g(1) = 0 + 3 + 4 = 7
• g(3) = 2 + 1 + 0 = 3
• g(4) = 3 + 0 + 2 = 5
3) Minimum value is 3, achieved at x = 3.
[1:1 Twin Diagnostic 09] Find the minimum value of f(x) = |x + 1| + |x - 3| + |x - 5|.
Check Answer
Answer: 6 (Solution: Median is x = 3 ⟹ |4| + 0 + |-2| = 6)
[Practice Type 10] Bijective Interval Bounding and Parameter Pairs Box Mapping

For domain X = [a, b] and codomain Y = [1, 9], the linear function f(x) = 2x - 3 has its range equal to its codomain. Compute a² + b².

💡 Yul's Pro-Tip: The slope 2 > 0 is strictly increasing. The lower bound maps to 1, and the upper bound maps to 9!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 40

1) f(a) = 2a - 3 = 1 ⟹ 2a = 4 ⟹ a = 2.
2) f(b) = 2b - 3 = 9 ⟹ 2b = 12 ⟹ b = 6.
3) a² + b² = 2² + 6² = 4 + 36 = 40
[1:1 Twin Diagnostic 10] For X = [a, b] and Y = [-2, 8], f(x) = -3x + 4 fills codomain Y. Find b - a.
Check Answer
Answer: 10/3 (Solution: Decreasing function ⟹ f(a)=8 ⟹ a=-4/3; f(b)=-2 ⟹ b=2 ⟹ b-a = 10/3)

STAGE 3. Advanced Equality of Functions f = g (Types 11~15)

[Practice Type 11] Subsets with Positivity Constraints for f = g Set Constraints

For f(x) = x³ - 2x² - x and g(x) = 2x, find the number of non-empty domains X such that f = g and X contains at least one positive number.

💡 Yul's Pro-Tip: Solve f(x) - g(x) = 0, then subtract subsets consisting exclusively of non-positive roots from total non-empty subsets!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 6

1) x³ - 2x² - 3x = 0 ⟹ x(x - 3)(x + 1) = 0.
Roots: S = {-1, 0, 3}.
2) Total non-empty subsets: 2³ - 1 = 7.
3) Subsets with no positive numbers (subsets of {-1, 0}): 2² - 1 = 3.
4) Valid domains = 7 - 3 = 6
[1:1 Twin Diagnostic 11] For f(x) = x³ - 4x and g(x) = 0, find the number of domains X containing a negative element.
Check Answer
Answer: 4 (Solution: Roots are {-2, 0, 2}; fixing -2 yields 2² = 4 subsets)
[Practice Type 12] Quartic Factorization and Real-Domain Filtering Higher-Degree Equation

For f(x) = x⁴ + 2x³ and g(x) = x² + 2x, find the number of non-empty domains X consisting exclusively of real numbers such that f = g.

💡 Yul's Pro-Tip: Factor completely into linear terms. Only distinct real roots can serve as domain elements!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 15

1) x³(x + 2) - x(x + 2) = x(x + 2)(x² - 1) = x(x + 2)(x - 1)(x + 1) = 0.
2) 4 distinct real roots: {-2, -1, 0, 1}.
3) Non-empty subsets: 2⁴ - 1 = 15
[1:1 Twin Diagnostic 12] For f(x) = x⁴ and g(x) = x, find the number of real domains X such that f = g.
Check Answer
Answer: 3 (Solution: x(x - 1)(x² + x + 1) = 0 has only 2 real roots {0, 1} ⟹ 2² - 1 = 3)
[Practice Type 13] Coefficient Recovery via Repeated Roots Identity System

For domain X = {-1, 1, 2}, given f(x) = x³ + ax + b and g(x) = x² + cx + d with f = g, where the difference polynomial h(x) = f(x) - g(x) has a double root at x = 1, compute (a - c)² + (b - d)².

💡 Yul's Pro-Tip: The difference polynomial is h(x) = (x + 1)(x - 1)². Expand and match coefficients directly!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 2

1) h(x) = (x + 1)(x - 1)² = (x + 1)(x² - 2x + 1) = x³ - x² - x + 1.
2) Matching h(x) = x³ - x² + (a - c)x + (b - d):
• a - c = -1
• b - d = 1
3) (a - c)² + (b - d)² = (-1)² + 1² = 1 + 1 = 2
[1:1 Twin Diagnostic 13] For X = {-2, 1}, if f(x) = ax² + bx and g(x) = 2x + 6 satisfy f = g, find a² + b².
Check Answer
Answer: 34 (Solution: 4a - 2b = 2 and a + b = 8 ⟹ a = 3, b = 5 ⟹ 9 + 25 = 34)
[Practice Type 14] Division Quotient & Remainder Function Equality Euclidean Algorithm

Let f(n) be the quotient and g(n) be the remainder when positive integer n is divided by 4.
Find the number of two-digit integers n satisfying f(n) - g(n) = 0.

💡 Yul's Pro-Tip: Represent n = 4q + r with 0 ≤ r < 4. The equality q = r implies n = 5r!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 2

1) n = 4q + r with q ≥ 0 and r ∈ {0, 1, 2, 3}.
2) f(n) = g(n) ⟹ q = r ⟹ n = 5r.
• r = 0: n = 0 (not positive)
• r = 1: n = 5 (single digit)
• r = 2: n = 10 (two-digit)
• r = 3: n = 15 (two-digit)
3) Two valid numbers (10 and 15), so exactly 2 numbers exist.
[1:1 Twin Diagnostic 14] Find the sum of all two-digit integers n whose quotient and remainder when divided by 6 are equal.
Check Answer
Answer: 98 (Solution: n = 7r with r ∈ {2, 3, 4, 5} ⟹ 14 + 21 + 28 + 35 = 98)
[Practice Type 15] Triple Intersection Filter for Simultaneous Equality Grand Finale

For f(x) = x³ - 3x, g(x) = x² - 3, and h(x) = 3x - 5, find the number of non-empty domains X such that f = g = h holds simultaneously.

💡 Yul's Pro-Tip: Solve g(x) = h(x) first to get candidates x = 1 and x = 2, then test each in f(x) to isolate the true intersection!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 1

1) Solve g(x) = h(x): x² - 3 = 3x - 5 ⟹ (x - 1)(x - 2) = 0 ⟹ x = 1, 2.
2) Evaluate with f(x):
• x = 1: f(1) = -2, g(1) = -2, h(1) = -2 (Match!)
• x = 2: f(2) = 2, but g(2) = 1 (Mismatch).
3) Only x = 1 satisfies all three equations.
Non-empty subsets: 2¹ - 1 = 1 (Domain X = {1})
[1:1 Twin Diagnostic 15] For f(x) = x³ - x, g(x) = 2x² - 2, and h(x) = 6x - 6, find the number of non-empty domains where f = g = h.
Check Answer
Answer: 3 (Solution: Roots are x = 1 and x = 2 ⟹ 2² - 1 = 3)
🌿 Words from Yul
"Advanced functions are conquered not through algebraic complexity, but by logically compressing multiple conditions into precise intersections."

By moving beyond superficial calculations to train on residue classifications, axis placement case studies, and polynomial root filtering for function equality, you have built the high-level intuition required for Precalculus.
In our next installment, we dive into the heart of invertible functions: [Precalculus · Core Concepts ②] Injective, Surjective, Bijective, Identity, and Constant Functions & The Horizontal Line Test.

Comments

Popular posts from this blog

Authentic Reference Models Beyond Basic Rulers

[Math Column]Studying Alongside Dedicated Peers: Becoming Each Other’s Lifelong Catalyst

[High School Math] Coordinate Geometry: 15 Essential Practice Problems on Section Formulas (Internal & External Division)