Study guide
11.2 Functions (Fonksiyonlar): Domain/Range, Composition, Inverses & Functional Equations
TR-YÖS 2026 — Türkiye Yurt Dışından Öğrenci Kabul Sınavı Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: TR-YÖS Overview, Eligibility & Admissions Strategy
1.1 Current TR-YÖS Identity, Two-Test Blueprint and Admissions 1.2 Candidate Eligibility, Blue Card (Mavi Kart), Dual Citizenship & Registration 1.3 ÖSYM Scoring Mathematics, the 0.5 Raw-Point Rule, 1/4 Penalty & 100-Minute Pacing
2 Chapter 2: Sayısal Yetenek — Number Series, Sequences & Cryptarithmetic
2.1 Linear, Polynomial, Alternating & Recursive Number Series (Sayı Dizileri) 2.2 Number Matrices, Row-Column Operations & Functional Input-Output Tables 2.3 Cryptarithmetic (Harfli İşlemler), Letter-Digit Coding (Şifreler) & Symbolic Operators
3 Chapter 3: Sayısal Yetenek — Visual Series, Analogies & Odd-One-Out
3.1 Figural Series, Angular Rotations, Translations & Element-Counting Rules 3.2 Visual Analogies, Geometric Transformations & Proportion Mapping 3.3 Visual Classification, Topological Invariants & Odd-One-Out (Farklı Olanı Bulma)
4 Chapter 4: Sayısal Yetenek — Visual Matrices, Pattern Completion & Grid Logic
4.1 3x3 Visual Matrices: Superposition, Boolean XOR & Attribute Permutations 4.2 Pattern & Grid Completion (Şekil Tamamlama), Quarter-Tile Symmetry & Tessellations 4.3 Magic Squares, Latin Grids, Sudoku Variants & Relational Matrix Tables
5 Chapter 5: Sayısal Yetenek — 3D Spatial Reasoning: Cubes, Folding & Reflections
5.1 3D Block Stacks, Hidden Cube Counting & Painted Cube Formulas (Küp Sayma) 5.2 Cube Nets (Küp Açılımları), Opposite-Face Parities & 3D Die Rotations 5.3 Paper Folding & Hole Punching (Kağıt Katlama-Kesme), Mirror & Water Reflections
6 Chapter 6: Sayısal Yetenek — Balance Scales, Gears, Clocks & Calendar Logic
6.1 Balance Scales (Teraziler), Symbolic Weight Substitution & Inequality Scales 6.2 Meshed Gears (Çarklar), Concentric Pulleys, Belt Directions & Turn Ratios 6.3 Clock Hand Angles (Saat Problemleri), Modular Calendar Arithmetic & Compass Bearings
7 Chapter 7: Sayısal Yetenek — Data Interpretation, Grid Counting & Deductive Logic
7.1 Bar, Line and Pie Charts & Multi-Table Data Interpretation (Tablo ve Grafikler) 7.2 Grid Perimeter, Shaded Area, Sub-Shape Counting & Shortest Lattice Paths 7.3 Deductive Logic, Linear/Circular Seating Arrangements & Truth-Value Puzzles
8 Chapter 8: Temel Matematik — Number Systems, Base Arithmetic, Divisibility & Rationals
8.1 Number Sets, Parity, Consecutive Sums, Factorials & Base-n Arithmetic (Taban Aritmetiği) 8.2 Division Algorithm, Divisibility Rules, Prime Factorization, Divisors, EBOB (GCD) & EKOK (LCM) 8.3 Rational Numbers, Infinite/Telescoping Fractions & Repeating Decimals (Devirli Ondalık Sayılar)
9 Chapter 9: Temel Matematik — Exponents, Radicals, Factoring, Equations & Inequalities
9.1 Exponential Equations (Üslü Sayılar), Nested Radicals & Rationalizing Denominators 9.2 Algebraic Identities (Çarpanlara Ayırma), Sums and Differences of Cubes & Reciprocal Sums 9.3 First-Degree Linear Systems, Simple Inequalities (Basit Eşitsizlikler) & Absolute Value (Mutlak Değer)
10 Chapter 10: Temel Matematik — Ratios, Proportions & Classic Word Problems
10.1 Ratios, Direct/Inverse/Compound Proportions (Oran-Orantı) & Means 10.2 Number, Fraction, Age (Yaş) & Work/Pipe (İşçi-Havuz) Word Problems 10.3 Percentage, Profit-Loss (Kâr-Zarar), Mixture (Karışım) & Motion (Hareket) Problems
11 Chapter 11: Temel Matematik — Sets, Modular Operations, Functions, Polynomials & Quadratics
11.1 Sets (Kümeler), Cartesian Products, Binary Operations (İşlem) & Modular Arithmetic (Modüler Aritmetik) 11.2 Functions (Fonksiyonlar): Domain/Range, Composition, Inverses & Functional Equations 11.3 Polynomials (Polinomlar), Quadratic Equations, Vieta's Formulas & Parabolas
12 Chapter 12: Temel Matematik — Logarithms, Complex Numbers, Combinatorics, Trigonometry & Calculus
12.1 Logarithms (Logaritma), Complex Numbers & Arithmetic/Geometric Sequences (Diziler) 12.2 Permutations, Combinations, Binomial Expansion & Probability (Olasılık) 12.3 Trigonometry and Optional Calculus Enrichment
13 Chapter 13: Temel Matematik (Geometri) — Angles, Triangles, Similarity, Area & Polygons
13.1 Parallel-Line Angle Rules (Z, U, M, Kalem Ucu), Triangle Angles & Triangle Inequality 13.2 Right Triangles, Euclid's Altitude Laws, Angle Bisectors, Medians, Similarity & Area 13.3 Regular Polygons, Quadrilaterals, Parallelograms, Trapezoids, Rhombuses, Rectangles & Squares
14 Chapter 14: Temel Matematik (Geometri) — Circles, 3D Solids & Analytic Geometry
14.1 Circle Angles, Chords, Tangents, Power of a Point (Kuvvet) & Sector/Annulus Area 14.2 3D Solid Geometry (Katı Cisimler): Prisms, Cylinders, Pyramids, Cones & Spheres 14.3 Analytic Geometry (Analitik Geometri): Points, Lines, Slopes, Point-to-Line Distance & Circles
11.2 Functions (Fonksiyonlar): Domain/Range, Composition, Inverses & Functional Equations
Key Takeaways Explain This Topic AI
A function is invertible between its stated domain and codomain exactly when it is bijective. Möbius inversion requires a nonzero determinant; constant rational functions need separate treatment.
Even functions satisfy f(-x) = f(x) (y-axis symmetry, only even powers of x in polynomials), while odd functions satisfy f(-x) = -f(x) (origin symmetry, only odd powers of x, and f(0) = 0 when 0 is in the domain).
Never derive the general formula for f^(-1)(x) when evaluating a single value: use f(a) = b ⟺ f^(-1)(b) = a to equate the output expression to the target number and substitute the resulting x into the input expression.
For composite functions (f ∘ g)(x) = f(g(x)), the inverse reverses the order of composition: (f ∘ g)^(-1)(x) = (g^(-1) ∘ f^(-1))(x).
Telescoping functional equations of the form f(x + 1) - f(x) = g(x) are solved by column-wise addition across consecutive inputs, while f(x + 1) = h(x) · f(x) is solved by column-wise multiplication.
Last updated: October 2026
Functions ( Fonksiyonlar ): Types, Composition, Inverses & Functional Equations
Function practice connects algebraic expressions to mappings and graphs. Compare domain and codomain, then use a targeted substitution when asked for one value. Computing a full inverse remains useful when the question asks for its formula or domain.
1. Domain, Codomain & Function Types ( Fonksiyon Türleri )
A function f : A → B f: A \to B f : A → B maps every element of the domain ( tanım kümesi ) A A A to exactly one element of the codomain ( değer kümesi ) B B B . For real-valued functions f : D → R f: D \to \mathbb{R} f : D → R , the maximal domain D D D requires:
Denominators to be nonzero: P ( x ) Q ( x ) ⟹ Q ( x ) ≠ 0 \frac{P(x)}{Q(x)} \implies Q(x) \ne 0 Q ( x ) P ( x ) ⟹ Q ( x ) = 0 .
Even-index radicals to have non-negative radicands: g ( x ) 2 n ⟹ g ( x ) ≥ 0 \sqrt[2n]{g(x)} \implies g(x) \ge 0 2 n g ( x ) ⟹ g ( x ) ≥ 0 .
If s ( A ) = m s(A) = m s ( A ) = m and s ( B ) = n s(B) = n s ( B ) = n , the total number of functions from A A A to B B B is n m n^m n m , and the number of one-to-one functions (for m ≤ n m \le n m ≤ n ) is P ( n , m ) = n ! ( n − m ) ! P(n, m) = \frac{n!}{(n-m)!} P ( n , m ) = ( n − m )! n ! .
Special Function Classifications
Injective / One-to-One ( Birebir Fonksiyon ): x 1 ≠ x 2 ⟹ f ( x 1 ) ≠ f ( x 2 ) x_1 \ne x_2 \implies f(x_1) \ne f(x_2) x 1 = x 2 ⟹ f ( x 1 ) = f ( x 2 ) (every horizontal line intersects the graph at most once).
Surjective / Onto ( Örten Fonksiyon ): f ( A ) = B f(A) = B f ( A ) = B , meaning no element in B B B is left unmapped.
Bijective ( Birebir ve Örten ): Both injective and surjective. A function f : A → B f: A \to B f : A → B has an inverse function f − 1 : B → A f^{-1}: B \to A f − 1 : B → A if and only if f f f is bijective.
Identity Function ( Birim Fonksiyon I I I ): Maps every input to itself: I ( x ) = x I(x) = x I ( x ) = x , and more generally I ( anything ) = anything I(\text{anything}) = \text{anything} I ( anything ) = anything . If f ( x ) = ( a − 2 ) x 2 + ( b + 1 ) x + c − 3 f(x) = (a - 2)x^2 + (b + 1)x + c - 3 f ( x ) = ( a − 2 ) x 2 + ( b + 1 ) x + c − 3 is the identity function, then the coefficient of x x x is 1 1 1 ( b + 1 = 1 ⟹ b = 0 b + 1 = 1 \implies b = 0 b + 1 = 1 ⟹ b = 0 ) and all other coefficients are 0 0 0 ( a = 2 , c = 3 a = 2, c = 3 a = 2 , c = 3 ).
Constant Function ( Sabit Fonksiyon ): f ( x ) = c f(x) = c f ( x ) = c for all x x x . For a fractional linear expression: f ( x ) = a x + b c x + d is constant ⟺ a d − b c = 0 f(x) = \frac{ax + b}{cx + d} \text{ is constant} \iff ad-bc=0 f ( x ) = c x + d a x + b is constant ⟺ a d − b c = 0
Linear Function ( Doğrusal Fonksiyon ): f ( x ) = a x + b f(x) = ax + b f ( x ) = a x + b . If f f f is stated to be linear and you see a relation like f ( x + 1 ) + f ( x − 2 ) = 6 x + 4 f(x + 1) + f(x - 2) = 6x + 4 f ( x + 1 ) + f ( x − 2 ) = 6 x + 4 , substitute f ( x ) = a x + b f(x) = ax + b f ( x ) = a x + b and equate coefficients.
Even & Odd Functions ( Çift ve Tek Fonksiyonlar ):
Even ( Çift ): f ( − x ) = f ( x ) f(-x) = f(x) f ( − x ) = f ( x ) for all x ∈ D x \in D x ∈ D . Its graph is symmetric with respect to the y y y -axis ( $y$ eksenine göre simetrik ). A polynomial is even if and only if all odd-power coefficients are 0 0 0 .
Odd ( Tek ): f ( − x ) = − f ( x ) f(-x) = -f(x) f ( − x ) = − f ( x ) for all x ∈ D x \in D x ∈ D . Its graph is symmetric with respect to the origin ( orijine göre simetrik ). A polynomial is odd if and only if all even-power coefficients (including the constant term) are 0 0 0 ; moreover, if 0 ∈ D 0 \in D 0 ∈ D , then f ( 0 ) = 0 f(0) = 0 f ( 0 ) = 0 .
2. Composition ( Bileşke ) & Inverse Functions ( Ters Fonksiyon )
The composition ( f ∘ g ) ( x ) = f ( g ( x ) ) (f \circ g)(x) = f(g(x)) ( f ∘ g ) ( x ) = f ( g ( x )) applies g g g first, then feeds its output into f f f . Composition is associative, f ∘ ( g ∘ h ) = ( f ∘ g ) ∘ h f \circ (g \circ h) = (f \circ g) \circ h f ∘ ( g ∘ h ) = ( f ∘ g ) ∘ h , but generally not commutative ( f ∘ g ≠ g ∘ f f \circ g \ne g \circ f f ∘ g = g ∘ f ).
The Input-Output Swap Shortcut
Because f f f and f − 1 f^{-1} f − 1 reverse inputs and outputs: f ( a ) = b ⟺ f − 1 ( b ) = a f(a) = b \iff f^{-1}(b) = a f ( a ) = b ⟺ f − 1 ( b ) = a
Tip
Never solve for f − 1 ( x ) f^{-1}(x) f − 1 ( x ) when asked for a single number! If f ( 3 x − 2 ) = 5 x + 4 f(3x - 2) = 5x + 4 f ( 3 x − 2 ) = 5 x + 4 and the problem asks for f − 1 ( 19 ) f^{-1}(19) f − 1 ( 19 ) , apply the swap immediately: f − 1 ( 5 x + 4 ) = 3 x − 2 f^{-1}(5x + 4) = 3x - 2 f − 1 ( 5 x + 4 ) = 3 x − 2 . Set the output expression equal to 19 19 19 : 5 x + 4 = 19 ⟹ x = 3 5x + 4 = 19 \implies x = 3 5 x + 4 = 19 ⟹ x = 3 . Plug x = 3 x = 3 x = 3 into the input expression: 3 ( 3 ) − 2 = 7 3(3) - 2 = 7 3 ( 3 ) − 2 = 7 . Thus f ( 7 ) = 19 f(7) = 19 f ( 7 ) = 19 , which means f − 1 ( 19 ) = 7 f^{-1}(19) = 7 f − 1 ( 19 ) = 7 !
Linear & Fractional Linear (Möbius) Inverse Shortcuts
When you do need the algebraic formula for f − 1 ( x ) f^{-1}(x) f − 1 ( x ) , memorize these two instant rules:
Linear Function: For f ( x ) = a x + b f(x) = ax + b f ( x ) = a x + b ( a ≠ 0 a \ne 0 a = 0 ): f − 1 ( x ) = x − b a f^{-1}(x) = \frac{x - b}{a} f − 1 ( x ) = a x − b
Fractional Linear (Möbius) Function: For f : R ∖ { − d c } → R ∖ { a c } f: \mathbb{R} \setminus \{-\frac{d}{c}\} \to \mathbb{R} \setminus \{\frac{a}{c}\} f : R ∖ { − c d } → R ∖ { c a } defined by: f ( x ) = a x + b c x + d ⟹ f − 1 ( x ) = − d x + b c x − a f(x) = \frac{ax + b}{cx + d} \implies f^{-1}(x) = \frac{-dx + b}{cx - a} f ( x ) = c x + d a x + b ⟹ f − 1 ( x ) = c x − a − d x + b
Simply swap and negate the top-left coefficient a a a and the bottom-right constant d d d , while leaving b b b and c c c untouched! Notice also why the excluded domain value − d c -\frac{d}{c} − c d makes the denominator of f f f zero, while the excluded codomain value a c \frac{a}{c} c a makes the denominator of f − 1 f^{-1} f − 1 zero.
Inverse of a Composition ( Bileşkenin Tersi )
Taking the inverse of a composition reverses the order of the functions (just like taking off shoes and socks): ( f ∘ g ) − 1 ( x ) = ( g − 1 ∘ f − 1 ) ( x ) = g − 1 ( f − 1 ( x ) ) (f \circ g)^{-1}(x) = (g^{-1} \circ f^{-1})(x) = g^{-1}(f^{-1}(x)) ( f ∘ g ) − 1 ( x ) = ( g − 1 ∘ f − 1 ) ( x ) = g − 1 ( f − 1 ( x ))
Because f ∘ f − 1 = f − 1 ∘ f = I f \circ f^{-1} = f^{-1} \circ f = I f ∘ f − 1 = f − 1 ∘ f = I , you can isolate an unknown function inside a composition by composing both sides on the appropriate side with an inverse. For example, if ( f ∘ g ) ( x ) = h ( x ) (f \circ g)(x) = h(x) ( f ∘ g ) ( x ) = h ( x ) , then:
f ( x ) = ( h ∘ g − 1 ) ( x ) = h ( g − 1 ( x ) ) f(x) = (h \circ g^{-1})(x) = h(g^{-1}(x)) f ( x ) = ( h ∘ g − 1 ) ( x ) = h ( g − 1 ( x )) (compose on the right with g − 1 g^{-1} g − 1 )
g ( x ) = ( f − 1 ∘ h ) ( x ) = f − 1 ( h ( x ) ) g(x) = (f^{-1} \circ h)(x) = f^{-1}(h(x)) g ( x ) = ( f − 1 ∘ h ) ( x ) = f − 1 ( h ( x )) (compose on the left with f − 1 f^{-1} f − 1 )
3. Telescoping Functional Equations ( İndirgemeli Fonksiyonlar )
When a functional equation relates f ( x + 1 ) f(x + 1) f ( x + 1 ) (or f ( x + k ) f(x + k) f ( x + k ) ) to f ( x ) f(x) f ( x ) and asks for f ( b ) f(b) f ( b ) given f ( a ) f(a) f ( a ) , write out the equation step-by-step from x = a x = a x = a to x = b − 1 x = b - 1 x = b − 1 and telescope:
Additive Recurrence ( f ( x + 1 ) − f ( x ) = g ( x ) f(x + 1) - f(x) = g(x) f ( x + 1 ) − f ( x ) = g ( x ) ): Write the equations vertically for x = a , a + 1 , … , b − 1 x = a, a + 1, \dots, b - 1 x = a , a + 1 , … , b − 1 and add column-wise . All intermediate terms + f ( k ) +f(k) + f ( k ) and − f ( k ) -f(k) − f ( k ) cancel, leaving: f ( b ) − f ( a ) = ∑ x = a b − 1 g ( x ) f(b) - f(a) = \sum_{x=a}^{b-1} g(x) f ( b ) − f ( a ) = x = a ∑ b − 1 g ( x )
Multiplicative Recurrence ( f ( x + 1 ) f ( x ) = h ( x ) \frac{f(x + 1)}{f(x)} = h(x) f ( x ) f ( x + 1 ) = h ( x ) or f ( x + 1 ) = h ( x ) ⋅ f ( x ) f(x + 1) = h(x) \cdot f(x) f ( x + 1 ) = h ( x ) ⋅ f ( x ) ): Write the equations for x = a , a + 1 , … , b − 1 x = a, a + 1, \dots, b - 1 x = a , a + 1 , … , b − 1 and multiply column-wise . All intermediate factors cancel on opposite sides, leaving: f ( b ) f ( a ) = ∏ x = a b − 1 h ( x ) \frac{f(b)}{f(a)} = \prod_{x=a}^{b-1} h(x) f ( a ) f ( b ) = x = a ∏ b − 1 h ( x )
Summary Reference Table
Function Pattern Algebraic Rule / Formula Key Exam Condition
Identity ( I I I ) I ( x ) = x I(x) = x I ( x ) = x , I ( u ) = u I(u) = u I ( u ) = u Coeff of x 1 x^1 x 1 is 1 1 1 ; all other powers equal 0 0 0
Constant Rational f ( x ) = a x + b c x + d = k f(x) = \frac{ax+b}{cx+d} = k f ( x ) = c x + d a x + b = k Ratio of x x x -coeffs equals ratio of constants: a d − b c = 0 ad-bc=0 a d − b c = 0
Even vs. Odd Even: f ( − x ) = f ( x ) f(-x) = f(x) f ( − x ) = f ( x ) ; Odd: f ( − x ) = − f ( x ) f(-x) = -f(x) f ( − x ) = − f ( x ) Even = y y y -axis symmetry; Odd = origin symmetry, f ( 0 ) = 0 f(0)=0 f ( 0 ) = 0
Möbius Inverse f ( x ) = a x + b c x + d ⟹ f − 1 ( x ) = − d x + b c x − a f(x) = \frac{ax+b}{cx+d} \implies f^{-1}(x) = \frac{-dx+b}{cx-a} f ( x ) = c x + d a x + b ⟹ f − 1 ( x ) = c x − a − d x + b Domain excludes − d c -\frac{d}{c} − c d ; codomain excludes a c \frac{a}{c} c a
Additive Telescope f ( x + 1 ) − f ( x ) = g ( x ) f(x+1) - f(x) = g(x) f ( x + 1 ) − f ( x ) = g ( x ) Add for x = a … b − 1 x = a \dots b-1 x = a … b − 1 : f ( b ) − f ( a ) = ∑ g ( x ) f(b) - f(a) = \sum g(x) f ( b ) − f ( a ) = ∑ g ( x )
Multiplicative Telescope f ( x + 1 ) = h ( x ) ⋅ f ( x ) f(x+1) = h(x) \cdot f(x) f ( x + 1 ) = h ( x ) ⋅ f ( x ) Multiply for x = a … b − 1 x = a \dots b-1 x = a … b − 1 : f ( b ) = f ( a ) ∏ h ( x ) f(b) = f(a) \prod h(x) f ( b ) = f ( a ) ∏ h ( x )
- Worked Examples
- Worked Example 1: Constant Rational Condition & Möbius Inverse
Problem: The function g ( x ) = ( m − 2 ) x + 6 2 x − 3 g(x) = \frac{(m - 2)x + 6}{2x - 3} g ( x ) = 2 x − 3 ( m − 2 ) x + 6 is a constant function on its domain. Using this value of m m m , let h ( x ) = m x + 1 2 x − 5 h(x) = \frac{mx + 1}{2x - 5} h ( x ) = 2 x − 5 m x + 1 . Find h − 1 ( 3 ) h^{-1}(3) h − 1 ( 3 ) .
Solution: Since g ( x ) g(x) g ( x ) is constant, the ratio of the x x x -coefficients equals the ratio of the constant terms: m − 2 2 = 6 − 3 = − 2 ⟹ m − 2 = − 4 ⟹ m = − 2 \frac{m - 2}{2} = \frac{6}{-3} = -2 \implies m - 2 = -4 \implies m = -2 2 m − 2 = − 3 6 = − 2 ⟹ m − 2 = − 4 ⟹ m = − 2
Substituting m = − 2 m = -2 m = − 2 into h ( x ) h(x) h ( x ) gives h ( x ) = − 2 x + 1 2 x − 5 h(x) = \frac{-2x + 1}{2x - 5} h ( x ) = 2 x − 5 − 2 x + 1 . Applying the Möbius inverse rule (swap and negate a = − 2 a = -2 a = − 2 and d = − 5 d = -5 d = − 5 ), we get: h − 1 ( x ) = 5 x + 1 2 x + 2 ⟹ h − 1 ( 3 ) = 5 ( 3 ) + 1 2 ( 3 ) + 2 = 16 8 = 2 h^{-1}(x) = \frac{5x + 1}{2x + 2} \implies h^{-1}(3) = \frac{5(3) + 1}{2(3) + 2} = \frac{16}{8} = \mathbf{2} h − 1 ( x ) = 2 x + 2 5 x + 1 ⟹ h − 1 ( 3 ) = 2 ( 3 ) + 2 5 ( 3 ) + 1 = 8 16 = 2
(Alternatively, set − 2 x + 1 2 x − 5 = 3 ⟹ − 2 x + 1 = 6 x − 15 ⟹ 8 x = 16 ⟹ x = 2 \frac{-2x + 1}{2x - 5} = 3 \implies -2x + 1 = 6x - 15 \implies 8x = 16 \implies x = 2 2 x − 5 − 2 x + 1 = 3 ⟹ − 2 x + 1 = 6 x − 15 ⟹ 8 x = 16 ⟹ x = 2 .)
Worked Example 2: Additive & Multiplicative Telescoping Recurrences
Problem:
Given f ( x + 1 ) − f ( x ) = 2 x + 3 f(x + 1) - f(x) = 2x + 3 f ( x + 1 ) − f ( x ) = 2 x + 3 for all integers x x x and f ( 1 ) = 4 f(1) = 4 f ( 1 ) = 4 , find f ( 15 ) f(15) f ( 15 ) .
Given g ( x + 1 ) = x + 2 x ⋅ g ( x ) g(x + 1) = \frac{x + 2}{x} \cdot g(x) g ( x + 1 ) = x x + 2 ⋅ g ( x ) for integers x ≥ 1 x \ge 1 x ≥ 1 and g ( 1 ) = 3 g(1) = 3 g ( 1 ) = 3 , find g ( 10 ) g(10) g ( 10 ) .
Solution:
Summing f ( x + 1 ) − f ( x ) = 2 x + 3 f(x + 1) - f(x) = 2x + 3 f ( x + 1 ) − f ( x ) = 2 x + 3 from x = 1 x = 1 x = 1 to x = 14 x = 14 x = 14 telescopes the left side to f ( 15 ) − f ( 1 ) f(15) - f(1) f ( 15 ) − f ( 1 ) : f ( 15 ) − 4 = ∑ x = 1 14 ( 2 x + 3 ) = 2 ( 14 ⋅ 15 2 ) + 3 ( 14 ) = 210 + 42 = 252 ⟹ f ( 15 ) = 256 f(15) - 4 = \sum_{x=1}^{14} (2x + 3) = 2\left(\frac{14 \cdot 15}{2}\right) + 3(14) = 210 + 42 = 252 \implies f(15) = \mathbf{256} f ( 15 ) − 4 = x = 1 ∑ 14 ( 2 x + 3 ) = 2 ( 2 14 ⋅ 15 ) + 3 ( 14 ) = 210 + 42 = 252 ⟹ f ( 15 ) = 256
Multiplying g ( x + 1 ) g ( x ) = x + 2 x \frac{g(x+1)}{g(x)} = \frac{x+2}{x} g ( x ) g ( x + 1 ) = x x + 2 for x = 1 , 2 , … , 9 x = 1, 2, \dots, 9 x = 1 , 2 , … , 9 gives: g ( 10 ) g ( 1 ) = 3 1 ⋅ 4 2 ⋅ 5 3 ⋅ 6 4 ⋯ 11 9 = 10 ⋅ 11 1 ⋅ 2 = 55 ⟹ g ( 10 ) = 3 ⋅ 55 = 165 \frac{g(10)}{g(1)} = \frac{3}{1} \cdot \frac{4}{2} \cdot \frac{5}{3} \cdot \frac{6}{4} \cdots \frac{11}{9} = \frac{10 \cdot 11}{1 \cdot 2} = 55 \implies g(10) = 3 \cdot 55 = \mathbf{165} g ( 1 ) g ( 10 ) = 1 3 ⋅ 2 4 ⋅ 3 5 ⋅ 4 6 ⋯ 9 11 = 1 ⋅ 2 10 ⋅ 11 = 55 ⟹ g ( 10 ) = 3 ⋅ 55 = 165
The Möbius inverse and its displayed excluded values require c ≠ 0 c\ne0 c = 0 and a d − b c ≠ 0 ad-bc\ne0 a d − b c = 0 . If c = 0 c=0 c = 0 , handle the linear or constant case separately. Even/odd function definitions require a domain symmetric about zero. Multiplicative telescoping by ratios requires nonzero terms; the product recurrence f ( b ) = f ( a ) ∏ h ( x ) f(b)=f(a)\prod h(x) f ( b ) = f ( a ) ∏ h ( x ) avoids dividing by f ( a ) f(a) f ( a ) .
Review the Method
Telescoping functional equations of the form f(x + 1) - f(x) = g(x) are solved by column-wise addition across consecutive inputs, while f(x + 1) = h(x) · f(x) is solved by column-wise multiplication.