Study guide
3.3 Functions, Sequences & Custom Operations
GRE Quantitative Reasoning Exam
Track your progress as you read
Finished sections get a check mark.
1 GRE Quantitative Reasoning Overview & Exam Strategy
1.1 GRE Quant Format, Scoring & Computer-Adaptive Structure 1.2 Quantitative Comparison (QC) Core Strategies 1.3 Multiple-Choice & Numeric Entry Strategies
2 Chapter 2: Arithmetic & Number Properties
2.1 Integers, Divisibility & Prime Factorization 2.2 Fractions, Decimals, Percents & Ratios 2.3 Exponents, Roots & Absolute Value 2.4 Number Lines, Order of Operations & Estimation
3 Chapter 3: Algebra & Coordinate Geometry
3.1 Algebraic Expressions, Equations & Inequalities 3.2 Quadratic Equations & Systems of Equations 3.3 Functions, Sequences & Custom Operations 3.4 Coordinate Geometry 3.5 Algebraic Word Problems
4 Chapter 4: Geometry & Measurement
4.1 Lines, Angles & Polygons 4.2 Triangles & Right Triangle Geometry 4.3 Circles & Inscribed Figures 4.4 Quadrilaterals & 3-D Geometry
5 Chapter 5: Data Analysis, Statistics & Probability
5.1 Descriptive Statistics & Data Measures 5.2 Quartiles, Percentiles & Boxplots 5.3 Permutations, Combinations & Counting Principles 5.4 Probability & Independent/Dependent Events 5.5 Data Interpretation: Tables, Bar Charts & Line Graphs
3.3 Functions, Sequences & Custom Operations
Key Takeaways Explain This Topic AI
Function notation f(x) maps inputs to outputs; domain excludes division by zero and negative square root inputs.
Composite function f(g(x)) evaluates inner function g(x) first, then passes that result into outer function f.
Arithmetic sequence nth term is a_n = a_1 + (n-1)d and sum is S_n = (n/2)(a_1 + a_n).
Geometric sequence nth term is a_n = a_1 * r^(n-1) with common ratio r.
Defined symbol operations require strict template substitution of operands into the given custom formula.
Last updated: July 2026
3.3 Functions, Sequences & Custom Operations
Functions, sequences, and defined symbol operations test your ability to apply strict mathematical rules, work with input-output mappings, and recognize patterns. GRE questions often introduce unfamiliar notation; mastering the underlying principles allows you to execute these problems methodically.
1. Function Notation, Domain, and Range
A function f f f is a rule that assigns to each input element x x x in a set called the domain exactly one output element f ( x ) f(x) f ( x ) in a set called the range .
Evaluating Functions
Evaluating f ( a ) f(a) f ( a ) means substituting a a a for every occurrence of x x x in the function rule:
Numerical input: If f ( x ) = x 2 − 3 x f(x) = x^2 - 3x f ( x ) = x 2 − 3 x , then f ( 4 ) = 4 2 − 3 ( 4 ) = 16 − 12 = 4 f(4) = 4^2 - 3(4) = 16 - 12 = 4 f ( 4 ) = 4 2 − 3 ( 4 ) = 16 − 12 = 4 .
Algebraic input: If f ( x ) = x 2 − 3 x f(x) = x^2 - 3x f ( x ) = x 2 − 3 x , then f ( a + 1 ) = ( a + 1 ) 2 − 3 ( a + 1 ) = a 2 + 2 a + 1 − 3 a − 3 = a 2 − a − 2 f(a + 1) = (a + 1)^2 - 3(a + 1) = a^2 + 2a + 1 - 3a - 3 = a^2 - a - 2 f ( a + 1 ) = ( a + 1 ) 2 − 3 ( a + 1 ) = a 2 + 2 a + 1 − 3 a − 3 = a 2 − a − 2 .
Domain and Range Restrictions
On the GRE, unless otherwise specified, functions deal exclusively with real numbers .
- Restriction Cause Algebraic Condition Domain Requirement
- Division by Zero Fraction with variable denominator P ( x ) Q ( x ) \frac{P(x)}{Q(x)} Q ( x ) P ( x ) $Q(x)
- eq 0$
- Square Root of Negative Even radical g ( x ) \sqrt{g(x)} g ( x ) g ( x ) ≥ 0 g(x) \ge 0 g ( x ) ≥ 0
Combined Fraction & Radical Expression 1 g ( x ) \frac{1}{\sqrt{g(x)}} g ( x ) 1 g ( x ) > 0 g(x) > 0 g ( x ) > 0
2. Composite Functions
A composite function applies one function to the result of another. The notation f ( g ( x ) ) f(g(x)) f ( g ( x )) (read " f f f of g g g of x x x ") means:
First, evaluate the inner function g ( x ) g(x) g ( x ) .
Second, substitute the output g ( x ) g(x) g ( x ) into the outer function f f f .
Note: In general, function composition is not commutative : f ( g ( x ) ) ≠ g ( f ( x ) ) f(g(x)) \neq g(f(x)) f ( g ( x )) = g ( f ( x )) .
Worked Example 3.3.1: Composite Function Evaluation
Let f ( x ) = 3 x − 5 f(x) = 3x - 5 f ( x ) = 3 x − 5 and g ( x ) = x 2 + 2 g(x) = x^2 + 2 g ( x ) = x 2 + 2 . Evaluate f ( g ( 4 ) ) f(g(4)) f ( g ( 4 )) and g ( f ( 4 ) ) g(f(4)) g ( f ( 4 )) .
Solution:
Evaluate f ( g ( 4 ) ) f(g(4)) f ( g ( 4 )) :
Inner evaluation: g ( 4 ) = 4 2 + 2 = 16 + 2 = 18 g(4) = 4^2 + 2 = 16 + 2 = 18 g ( 4 ) = 4 2 + 2 = 16 + 2 = 18 .
Outer evaluation: f ( 18 ) = 3 ( 18 ) − 5 = 54 − 5 = 49 f(18) = 3(18) - 5 = 54 - 5 = 49 f ( 18 ) = 3 ( 18 ) − 5 = 54 − 5 = 49 .
Evaluate g ( f ( 4 ) ) g(f(4)) g ( f ( 4 )) :
Inner evaluation: f ( 4 ) = 3 ( 4 ) − 5 = 12 − 5 = 7 f(4) = 3(4) - 5 = 12 - 5 = 7 f ( 4 ) = 3 ( 4 ) − 5 = 12 − 5 = 7 .
Outer evaluation: g ( 7 ) = 7 2 + 2 = 49 + 2 = 51 g(7) = 7^2 + 2 = 49 + 2 = 51 g ( 7 ) = 7 2 + 2 = 49 + 2 = 51 .
Notice that f ( g ( 4 ) ) = 49 f(g(4)) = 49 f ( g ( 4 )) = 49 , whereas g ( f ( 4 ) ) = 51 g(f(4)) = 51 g ( f ( 4 )) = 51 .
3. Arithmetic Sequences & Series
An arithmetic sequence is a ordered list of numbers where the difference between consecutive terms is constant. This constant is called the common difference ( d d d ): d = a k + 1 − a k d = a_{k+1} - a_k d = a k + 1 − a k
- Formulas for Arithmetic Sequences
- nth Term Formula: a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n = a 1 + ( n − 1 ) d
Sum of the First n n n Terms ( S n S_n S n ): S n = n 2 ( a 1 + a n ) = n × Average of first and last terms S_n = \frac{n}{2}(a_1 + a_n) = n \times \text{Average of first and last terms} S n = 2 n ( a 1 + a n ) = n × Average of first and last terms
Worked Example 3.3.2: Arithmetic Sequence Sum
An arithmetic sequence has first term a 1 = 7 a_1 = 7 a 1 = 7 and common difference d = 4 d = 4 d = 4 . Calculate the 20th term a 20 a_{20} a 20 and the sum of the first 20 terms S 20 S_{20} S 20 .
Solution:
Compute 20th term a 20 a_{20} a 20 : a 20 = a 1 + ( 20 − 1 ) d = 7 + 19 ( 4 ) = 7 + 76 = 83 a_{20} = a_1 + (20 - 1)d = 7 + 19(4) = 7 + 76 = 83 a 20 = a 1 + ( 20 − 1 ) d = 7 + 19 ( 4 ) = 7 + 76 = 83
Compute sum S 20 S_{20} S 20 : S 20 = 20 2 ( a 1 + a 20 ) = 10 × ( 7 + 83 ) = 10 × 90 = 900 S_{20} = \frac{20}{2}(a_1 + a_{20}) = 10 \times (7 + 83) = 10 \times 90 = 900 S 20 = 2 20 ( a 1 + a 20 ) = 10 × ( 7 + 83 ) = 10 × 90 = 900
4. Geometric Sequences
A geometric sequence is a list of numbers where each term after the first is found by multiplying the previous term by a non-zero constant called the common ratio ( r r r ): r = a k + 1 a k r = \frac{a_{k+1}}{a_k} r = a k a k + 1
- Formulas for Geometric Sequences
- nth Term Formula: a n = a 1 ⋅ r n − 1 a_n = a_1 \cdot r^{n-1} a n = a 1 ⋅ r n − 1
- Worked Example 3.3.3: Finding a Term in a Geometric Sequence
A geometric sequence has first term a 1 = 5 a_1 = 5 a 1 = 5 and common ratio r = 3 r = 3 r = 3 . Which term n n n of the sequence is equal to 405 405 405 ?
Solution:
Set up equation using the nth term formula: a n = a 1 ⋅ r n − 1 ⟹ 405 = 5 ⋅ 3 n − 1 a_n = a_1 \cdot r^{n-1} \implies 405 = 5 \cdot 3^{n-1} a n = a 1 ⋅ r n − 1 ⟹ 405 = 5 ⋅ 3 n − 1 .
Divide both sides by 5 5 5 : 405 5 = 3 n − 1 ⟹ 81 = 3 n − 1 \frac{405}{5} = 3^{n-1} \implies 81 = 3^{n-1} 5 405 = 3 n − 1 ⟹ 81 = 3 n − 1 .
Express 81 81 81 as a power of 3 3 3 : 81 = 3 4 81 = 3^4 81 = 3 4 .
Equate exponents: n − 1 = 4 ⟹ n = 5 n - 1 = 4 \implies n = 5 n − 1 = 4 ⟹ n = 5 .
Therefore, 405 405 405 is the 5th term of the sequence.
5. Defined Symbol / Custom Operations
GRE questions frequently define custom operations using non-standard symbols such as ⋆ , ⋄ , ⊗ , Δ \star, \diamond, \otimes, \Delta ⋆ , ⋄ , ⊗ , Δ . These are self-contained rule definitions.
How to Solve Custom Operator Problems
Identify the Rule: Treat the symbol purely as an instruction template. For example, if x ⋆ y = 2 x − y 2 x \star y = 2x - y^2 x ⋆ y = 2 x − y 2 , the left operand is doubled, and the square of the right operand is subtracted.
Follow Standard Parentheses Order: Work from the innermost parentheses outward.
Do NOT Invent Properties: Never assume commutative ( a ⋆ b = b ⋆ a a \star b = b \star a a ⋆ b = b ⋆ a ) or associative properties unless explicitly proven for that symbol.
Worked Example 3.3.4: Nested Custom Operator Evaluation
For all real numbers a a a and b b b , let a ⋆ b = 2 a − b 2 a \star b = 2a - b^2 a ⋆ b = 2 a − b 2 . Evaluate ( 4 ⋆ 3 ) ⋆ 2 (4 \star 3) \star 2 ( 4 ⋆ 3 ) ⋆ 2 .
Solution:
Evaluate inner parentheses ( 4 ⋆ 3 ) (4 \star 3) ( 4 ⋆ 3 ) : Here a = 4 a = 4 a = 4 and b = 3 b = 3 b = 3 . 4 ⋆ 3 = 2 ( 4 ) − ( 3 ) 2 = 8 − 9 = − 1 4 \star 3 = 2(4) - (3)^2 = 8 - 9 = -1 4 ⋆ 3 = 2 ( 4 ) − ( 3 ) 2 = 8 − 9 = − 1
Substitute result into outer operation ( − 1 ) ⋆ 2 (-1) \star 2 ( − 1 ) ⋆ 2 : Here a = − 1 a = -1 a = − 1 and b = 2 b = 2 b = 2 . ( − 1 ) ⋆ 2 = 2 ( − 1 ) − ( 2 ) 2 = − 2 − 4 = − 6 (-1) \star 2 = 2(-1) - (2)^2 = -2 - 4 = -6 ( − 1 ) ⋆ 2 = 2 ( − 1 ) − ( 2 ) 2 = − 2 − 4 = − 6 The final value is − 6 -6 − 6 .
6. GRE Function Tactics & Pitfalls
Undefined Inputs Trap: When quantitative comparison options involve functions with denominators or square roots, check if variable choices create division by zero or negative square roots (making Quantity A or B undefined).
Sequence Indexing Trap: Pay attention to whether a sequence starts at n = 1 n = 1 n = 1 ( a 1 a_1 a 1 ) or n = 0 n = 0 n = 0 ( a 0 a_0 a 0 ). On the GRE, standard indexing starts at a 1 a_1 a 1 .