Study guide

4.4 Functions, Defined Operational Symbols, and Sequences

GMAT Exam Focus Edition

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: GMAT Exam Architecture & Strategic Foundations

1.1 GMAT Structure, Section Order, and the 205–805 Score Scale 1.2 Question Bookmarking and the Review & Edit Feature Mechanics 1.3 Test-Day Logistics, Pacing Architecture, and Score Reporting Policies

2 Chapter 2: Quantitative Reasoning — Arithmetic & Number Properties

2.1 Integers, Divisibility Rules, Prime Factorization, and LCM/GCD 2.2 Remainders, Even/Odd Parity, and Positive/Negative Sign Analysis 2.3 Exponents, Radicals, Roots, and Scientific Notation 2.4 Absolute Value, Number Line Properties, and Estimation Techniques

3 Chapter 3: Quantitative Reasoning — Fractions, Decimals, Ratios & Percentages

3.1 Fractions, Decimals, and Real-Number Operations 3.2 Ratios, Proportions, and Scaling Relationships 3.3 Percent Change, Successive Percent Changes, and Multipliers 3.4 Commercial Math: Profit/Loss, Markups, Discounts, and Simple/Compound Interest

4 Chapter 4: Quantitative Reasoning — Algebra, Equations & Inequalities

4.1 Linear Equations and Systems of Simultaneous Equations 4.2 Quadratic Equations, Factoring Patterns, and Roots 4.3 Linear Inequalities, Compound Inequalities, and Absolute Value Inequalities 4.4 Functions, Defined Operational Symbols, and Sequences

5 Chapter 5: Quantitative Reasoning — Word Problems & Modeling

5.1 Rate, Time, and Distance: Uniform Motion, Relative Speed, and Average Speed 5.2 Work Rates: Combined Rates, Sequential Tasks, and Opposing Rates 5.3 Mixture Problems and Weighted Averages 5.4 Overlapping Sets, Venn Diagrams, and the Double-Set Matrix Method

6 Chapter 6: Quantitative Reasoning — Counting, Probability & Statistics

6.1 Fundamental Counting Principle, Permutations, and Combinations 6.2 Probability Rules: Independent, Dependent, Mutually Exclusive, and Complementary Events 6.3 Descriptive Statistics: Mean, Median, Mode, Range, and Weighted Mean 6.4 Standard Deviation, Variance, and Data Dispersion

7 Chapter 7: Verbal Reasoning — Critical Reasoning: Argument Structure & Assumptions

7.1 Anatomy of an Argument: Conclusions, Premises, Assumptions, and Background Context 7.2 Assumption Questions: Necessary vs. Sufficient Assumptions and the Negation Test 7.3 Strengthen Questions: Supporting Premises, Causality, and New Evidence 7.4 Weaken Questions: Identifying Flaws, Alternate Causes, and Counter-Evidence

8 Chapter 8: Verbal Reasoning — Critical Reasoning: Advanced Arguments

8.1 Evaluate the Argument: The Variance Test and Decisive Information 8.2 Resolve the Paradox: Reconciling Conflicting Facts and Surprising Outcomes 8.3 Boldface and Method of Reasoning: Identifying the Role of Statements 8.4 Flaw in the Reasoning: Spotting Formal and Informal Logical Fallacies

9 Chapter 9: Verbal Reasoning — Reading Comprehension: Core Analysis

9.1 Passage Structures, Main Idea, and Author's Primary Purpose 9.2 Supporting Ideas, Explicit Details, and Targeted Information Retrieval 9.3 Inference Questions: Deriving Unstated Claims and Valid Deductions

10 Chapter 10: Verbal Reasoning — Reading Comprehension: Advanced Strategies

10.1 Author's Tone, Attitude, and Epistemic Stance 10.2 Logical Structure, Paragraph Function, and Rhetorical Organization 10.3 Application, Contextual Analogy, and Cross-Disciplinary Synthesis

11 Chapter 11: Data Insights — Data Sufficiency Foundations & Algebra

11.1 Data Sufficiency Architecture: The 5 Answer Choices (AD/BCE) and Yes/No vs. Value Logic 11.2 Golden Rules of DS: Preventing Statement 2 Contamination and Sufficiency Verification 11.3 DS Applied to Arithmetic, Number Properties, and Signs 11.4 DS Applied to Algebraic Equations, Systems, and Inequalities

12 Chapter 12: Data Insights — Data Sufficiency Applied Modeling

12.1 DS Applied to Rates, Ratios, and Work Problems 12.2 DS Applied to Statistics, Averages, and Data Sets 12.3 DS Applied to Overlapping Sets, Venn Diagrams, and Probability

13 Chapter 13: Data Insights — Multi-Source Reasoning & Table Analysis

13.1 Multi-Source Reasoning: Tab Navigation, Synthesizing Text, Data, and Emails 13.2 MSR Question Formats: Multiple Choice and Three-Part Dichotomous Questions 13.3 Table Analysis: Interactive Sorting, Filtering, and Trend Identification 13.4 Table Analysis: Evaluating Binary Statements (True/False, Yes/No)

14 Chapter 14: Data Insights — Graphics Interpretation & Two-Part Analysis

14.1 Graphics Interpretation: Bar Charts, Line Graphs, and Scatterplots 14.2 Graphics Interpretation: Bubble Charts, Dual-Axis Graphs, and Pie Charts 14.3 Two-Part Analysis: Quantitative and Mathematical Word Problems 14.4 Two-Part Analysis: Verbal, Logic-Based, and Strategic Decision Problems

4.4 Functions, Defined Operational Symbols, and Sequences

Key Takeaways Explain This Topic AI

Function evaluation requires strict inside-out execution; in composite functions f(g(x)), evaluate the innermost input g(x) completely before supplying that numerical value as the argument for f.

Custom defined operational symbols (e.g., a ★ b = 2a - b²) are algebraic templates; substitute inputs into the template exactly as defined and never assume properties like commutativity or associativity without explicit proof.

In arithmetic sequences with constant difference d, the n-th term is aₙ = a₁ + (n - 1)d, the term count is n = (Last - First)/d + 1, and the series sum is Sₙ = n/2 · (a₁ + aₙ) = Count × Average.

In geometric sequences with constant ratio r, the n-th term is aₙ = a₁ · rⁿ⁻¹; an alternating sign pattern (+, -, +, -) conclusively identifies a negative common ratio r < 0.

High-index terms of recursive sequences (such as a₁₀₀) should be evaluated by computing the first 4 to 6 terms to identify a repeating periodic cycle (aₙ = aₙ₊ₖ), allowing modular reduction of the index.

Last updated: September 2026

4.4 Functions, Defined Operational Symbols, and Sequences

Quick Summary: Functions, custom operators, and sequences test your algorithmic discipline and pattern-recognition skills. Success requires adhering to strict inside-out evaluation rules for composite functions, treating custom symbols as literal algebraic templates, and mastering the core closed-form formulas for arithmetic and geometric progressions.

The GMAT Focus Edition Quantitative Reasoning section frequently assesses how reliably you can apply novel rules, decode iterative relationships, and project sequences into large index values without manual enumeration. Whether encountering an invented operator symbol or a recursive sequence defined across multiple steps, your approach must remain structured, precise, and fast.

Algebraic Functions and Composite Mappings

In standard mathematics, a function f f f is a rule that assigns to each input value x x x in its domain exactly one output value f ( x ) f(x) f ( x ) in its range.

Domain Restrictions on the GMAT

Because the GMAT operates exclusively within the real number system, domain restrictions arise from two primary mathematical boundaries:

Denominators Cannot Equal Zero: In f ( x ) = 2 x + 1 x − 3 f(x) = \frac{2x + 1}{x - 3} f ( x ) = x − 3 2 x + 1 ​ , the domain includes all real numbers except x = 3 x = 3 x = 3 .

Even Radicands Must Be Non-Negative: In g ( x ) = 2 x − 8 g(x) = \sqrt{2x - 8} g ( x ) = 2 x − 8 ​ , the expression under the square root must satisfy 2 x − 8 ≥ 0 ⟹ x ≥ 4 2x - 8 \ge 0 \implies x \ge 4 2 x − 8 ≥ 0 ⟹ x ≥ 4 .

Composite Functions: The Inside-Out Evaluation Rule

A composite function represents the application of one function to the result of another, written as f ( g ( x ) ) f(g(x)) f ( g ( x )) or ( f ∘ g ) ( x ) (f \circ g)(x) ( f ∘ g ) ( x ) .

The Inside-Out Rule: Always compute the value of the innermost function first, then pass that output as the input to the outer function.

Example: Let f ( x ) = 2 x 2 − 3 x + 1 f(x) = 2x^2 - 3x + 1 f ( x ) = 2 x 2 − 3 x + 1 and g ( x ) = x + 4 g(x) = x + 4 g ( x ) = x + 4 . Find f ( g ( − 2 ) ) f(g(-2)) f ( g ( − 2 )) .

Inner Function: Calculate g ( − 2 ) g(-2) g ( − 2 ) : g ( − 2 ) = − 2 + 4 = 2 g(-2) = -2 + 4 = 2 g ( − 2 ) = − 2 + 4 = 2

Outer Function: Substitute 2 2 2 into f ( x ) f(x) f ( x ) : f ( 2 ) = 2 ( 2 2 ) − 3 ( 2 ) + 1 = 2 ( 4 ) − 6 + 1 = 8 − 6 + 1 = 3 f(2) = 2(2^2) - 3(2) + 1 = 2(4) - 6 + 1 = 8 - 6 + 1 = 3 f ( 2 ) = 2 ( 2 2 ) − 3 ( 2 ) + 1 = 2 ( 4 ) − 6 + 1 = 8 − 6 + 1 = 3 Therefore, f ( g ( − 2 ) ) = 3 f(g(-2)) = 3 f ( g ( − 2 )) = 3 .

Important Non-Commutativity Note: In general, f ( g ( x ) ) ≠ g ( f ( x ) ) f(g(x)) \neq g(f(x)) f ( g ( x ))  = g ( f ( x )) . Evaluating g ( f ( − 2 ) ) g(f(-2)) g ( f ( − 2 )) for the functions above yields: f ( − 2 ) = 2 ( − 2 ) 2 − 3 ( − 2 ) + 1 = 8 + 6 + 1 = 15 ⟹ g ( 15 ) = 15 + 4 = 19 ≠ 3 f(-2) = 2(-2)^2 - 3(-2) + 1 = 8 + 6 + 1 = 15 \implies g(15) = 15 + 4 = 19 \neq 3 f ( − 2 ) = 2 ( − 2 ) 2 − 3 ( − 2 ) + 1 = 8 + 6 + 1 = 15 ⟹ g ( 15 ) = 15 + 4 = 19  = 3

Defined Operational Symbols ("Strange Symbols")

The GMAT frequently invents novel mathematical symbols—such as ⋆ , # , ⋄ , ⊙ , ⊕ , Δ , \star, \#, \diamond, \odot, \oplus, \Delta, ⋆ , # , ⋄ , ⊙ , ⊕ , Δ , or & \& & —to evaluate your capacity to follow defined operations without preconceived assumptions.

The Template Substitution Strategy

Never allow an unfamiliar symbol to intimidate you. Treat the definition as a structural placeholder template . Replace the variables with empty boxes: If a ⋆ b = 2 a − b 2 , think: [ First ] ⋆ [ Second ] = 2 [ First ] − [ Second ] 2 \text{If } a \star b = 2a - b^2, \quad \text{think: } [\text{First}] \star [\text{Second}] = 2[\text{First}] - [\text{Second}]^2 If a ⋆ b = 2 a − b 2 , think: [ First ] ⋆ [ Second ] = 2 [ First ] − [ Second ] 2

Nested Custom Operators

When multiple custom operators are chained together, adhere strictly to parentheses hierarchy (evaluating innermost parentheses first):

Example: Let x ⊙ y = x y x + y x \odot y = \frac{xy}{x + y} x ⊙ y = x + y x y ​ . Evaluate ( 4 ⊙ 4 ) ⊙ 2 (4 \odot 4) \odot 2 ( 4 ⊙ 4 ) ⊙ 2 .

Evaluate Parentheses First: 4 ⊙ 4 = 4 × 4 4 + 4 = 16 8 = 2 4 \odot 4 = \frac{4 \times 4}{4 + 4} = \frac{16}{8} = 2 4 ⊙ 4 = 4 + 4 4 × 4 ​ = 8 16 ​ = 2

Evaluate the Outer Operation: 2 ⊙ 2 = 2 × 2 2 + 2 = 4 4 = 1 2 \odot 2 = \frac{2 \times 2}{2 + 2} = \frac{4}{4} = 1 2 ⊙ 2 = 2 + 2 2 × 2 ​ = 4 4 ​ = 1 The result is 1.

Testing Algebraic Properties of Custom Operators

GMAT questions may ask whether a custom operator obeys standard algebraic laws:

Commutative Property: Does a ⋆ b = b ⋆ a a \star b = b \star a a ⋆ b = b ⋆ a ? (Does changing the order of operands preserve the result?)

For a ⋆ b = a + b + a b a \star b = a + b + ab a ⋆ b = a + b + ab : b ⋆ a = b + a + b a = a + b + a b b \star a = b + a + ba = a + b + ab b ⋆ a = b + a + ba = a + b + ab . Commutative!

For a ⋆ b = 2 a − b a \star b = 2a - b a ⋆ b = 2 a − b : b ⋆ a = 2 b − a ≠ 2 a − b b \star a = 2b - a \neq 2a - b b ⋆ a = 2 b − a  = 2 a − b . Not commutative!

Associative Property: Does ( a ⋆ b ) ⋆ c = a ⋆ ( b ⋆ c ) (a \star b) \star c = a \star (b \star c) ( a ⋆ b ) ⋆ c = a ⋆ ( b ⋆ c ) ?

Must test explicitly; most custom operations involving powers or subtractions fail associativity.

Arithmetic Sequences and Series

An arithmetic sequence (or arithmetic progression) is a sequence of numbers in which the difference between consecutive terms is constant. This constant is called the common difference ( d d d ): d = a n − a n − 1 d = a_n - a_{n-1} d = a n ​ − a n − 1 ​

The Three Essential Arithmetic Sequence Formulas

Formula Name Mathematical Statement Variables & Definitions

n n n -th Term Formula a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n ​ = a 1 ​ + ( n − 1 ) d a 1 a_1 a 1 ​ = first term, d d d = common difference, n n n = term index

Term Count Formula (Fencepost) n = Last − First d + 1 n = \frac{\text{Last} - \text{First}}{d} + 1 n = d Last − First ​ + 1 Calculates total number of inclusive terms in an arithmetic set

Series Sum Formula S n = n 2 ( a 1 + a n ) = n × Average S_n = \frac{n}{2}(a_1 + a_n) = n \times \text{Average} S n ​ = 2 n ​ ( a 1 ​ + a n ​ ) = n × Average Sum of the first n n n terms; equals Count times Mean

The Average and Median of Evenly Spaced Sets

In any arithmetic sequence (an evenly spaced set):

The mean (average) equals the median .

The mean is simply the average of the first and last terms: Mean = a 1 + a n 2 \text{Mean} = \frac{a_1 + a_n}{2} Mean = 2 a 1 ​ + a n ​ ​ .

The Sum of the terms is always: Sum = Number of Terms × Mean \text{Sum} = \text{Number of Terms} \times \text{Mean} Sum = Number of Terms × Mean .

Worked Walkthrough: Divisibility Series Sum

Find the sum of all three-digit positive integers that are multiples of 7.

First Term ( a 1 a_1 a 1 ​ ): Smallest 3-digit multiple of 7. 100 / 7 ≈ 14.28 ⟹ 7 × 15 = 105 100 / 7 \approx 14.28 \implies 7 \times 15 = 105 100/7 ≈ 14.28 ⟹ 7 × 15 = 105 .

Last Term ( a n a_n a n ​ ): Largest 3-digit multiple of 7. 999 / 7 ≈ 142.71 ⟹ 7 × 142 = 994 999 / 7 \approx 142.71 \implies 7 \times 142 = 994 999/7 ≈ 142.71 ⟹ 7 × 142 = 994 .

Common Difference ( d d d ): d = 7 d = 7 d = 7 .

Number of Terms ( n n n ): n = 994 − 105 7 + 1 = 889 7 + 1 = 127 + 1 = 128 n = \frac{994 - 105}{7} + 1 = \frac{889}{7} + 1 = 127 + 1 = 128 n = 7 994 − 105 ​ + 1 = 7 889 ​ + 1 = 127 + 1 = 128

Sum ( S 128 S_{128} S 128 ​ ): S 128 = 128 2 × ( 105 + 994 ) = 64 × 1 , 099 = 64 × ( 1 , 100 − 1 ) = 70 , 400 − 64 = 70 , 336 S_{128} = \frac{128}{2} \times (105 + 994) = 64 \times 1,099 = 64 \times (1,100 - 1) = 70,400 - 64 = 70,336 S 128 ​ = 2 128 ​ × ( 105 + 994 ) = 64 × 1 , 099 = 64 × ( 1 , 100 − 1 ) = 70 , 400 − 64 = 70 , 336

Geometric Sequences and Series

A geometric sequence is a sequence in which each term after the first is found by multiplying the preceding term by a non-zero constant called the common ratio ( r r r ): r = a n a n − 1 r = \frac{a_n}{a_{n-1}} r = a n − 1 ​ a n ​ ​

  • The Core Geometric Sequence Formulas
  • n n n -th Term Formula: a n = a 1 ⋅ r n − 1 a_n = a_1 \cdot r^{n-1} a n ​ = a 1 ​ ⋅ r n − 1

Sum of the First n n n Terms ( S n S_n S n ​ for r ≠ 1 r \neq 1 r  = 1 ): S n = a 1 ( 1 − r n 1 − r ) = a 1 ( r n − 1 r − 1 ) S_n = a_1 \left(\frac{1 - r^n}{1 - r}\right) = a_1 \left(\frac{r^n - 1}{r - 1}\right) S n ​ = a 1 ​ ( 1 − r 1 − r n ​ ) = a 1 ​ ( r − 1 r n − 1 ​ )

Alternating Geometric Sequences

If the common ratio is negative ( r < 0 r < 0 r < 0 ), the sequence oscillates in sign: If a 1 = 3 and r = − 2 : 3 , − 6 , 12 , − 24 , 48 , − 96 , … \text{If } a_1 = 3 \text{ and } r = -2: \quad 3, -6, 12, -24, 48, -96, \dots If a 1 ​ = 3 and r = − 2 : 3 , − 6 , 12 , − 24 , 48 , − 96 , …

All odd-indexed terms ( a 1 , a 3 , a 5 , … a_1, a_3, a_5, \dots a 1 ​ , a 3 ​ , a 5 ​ , … ) have the same sign as a 1 a_1 a 1 ​ (positive).

All even-indexed terms ( a 2 , a 4 , a 6 , … a_2, a_4, a_6, \dots a 2 ​ , a 4 ​ , a 6 ​ , … ) have the opposite sign (negative).

Recursive Sequences and Pattern Detection

A recursive sequence defines each term as a function of one or more preceding terms (e.g., a n = 2 a n − 1 + 3 a_n = 2a_{n-1} + 3 a n ​ = 2 a n − 1 ​ + 3 , or the Fibonacci sequence F n = F n − 1 + F n − 2 F_n = F_{n-1} + F_{n-2} F n ​ = F n − 1 ​ + F n − 2 ​ ).

When a GMAT question asks for a distant term in a recursive sequence (such as a 75 a_{75} a 75 ​ or a 100 a_{100} a 100 ​ ), GMAC never expects you to perform 100 manual calculations. A repeating pattern or cycle is guaranteed to exist.

The Periodicity Protocol

Calculate the first 4 to 6 terms manually.

Identify the cycle length k k k (the period after which values repeat).

Express the requested index N N N in terms of the period using division with remainder: N = q k + R N = qk + R N = q k + R .

The N N N -th term matches the R R R -th term in the cycle ( a N = a R a_N = a_R a N ​ = a R ​ ). If the remainder R = 0 R = 0 R = 0 , a N a_N a N ​ is the final term of the cycle ( a k a_k a k ​ ).

  • Step-by-Step Worked Problem Solving Examples
  • Example 1: Function Composition and Inversion

Problem: Let f ( x ) = x + 2 x − 1 f(x) = \frac{x + 2}{x - 1} f ( x ) = x − 1 x + 2 ​ for all real x ≠ 1 x \neq 1 x  = 1 . What is the value of f ( f ( 3 ) ) f(f(3)) f ( f ( 3 )) ?

Step-by-Step Solution:

Evaluate the Inner Function f ( 3 ) f(3) f ( 3 ) : f ( 3 ) = 3 + 2 3 − 1 = 5 2 = 2.5 f(3) = \frac{3 + 2}{3 - 1} = \frac{5}{2} = 2.5 f ( 3 ) = 3 − 1 3 + 2 ​ = 2 5 ​ = 2.5

Pass Result to the Outer Function f ( 2.5 ) f(2.5) f ( 2.5 ) : f ( 5 2 ) = 5 2 + 2 5 2 − 1 f\left(\frac{5}{2}\right) = \frac{\frac{5}{2} + 2}{\frac{5}{2} - 1} f ( 2 5 ​ ) = 2 5 ​ − 1 2 5 ​ + 2 ​

Simplify the Complex Fraction: Numerator: 5 2 + 4 2 = 9 2 \text{Numerator: } \frac{5}{2} + \frac{4}{2} = \frac{9}{2} Numerator: 2 5 ​ + 2 4 ​ = 2 9 ​ Denominator: 5 2 − 2 2 = 3 2 \text{Denominator: } \frac{5}{2} - \frac{2}{2} = \frac{3}{2} Denominator: 2 5 ​ − 2 2 ​ = 2 3 ​ f ( 5 2 ) = 9 / 2 3 / 2 = 9 3 = 3 f\left(\frac{5}{2}\right) = \frac{9/2}{3/2} = \frac{9}{3} = 3 f ( 2 5 ​ ) = 3/2 9/2 ​ = 3 9 ​ = 3

Conclusion: f ( f ( 3 ) ) = 3 f(f(3)) = 3 f ( f ( 3 )) = 3 . (Notice that f ( x ) f(x) f ( x ) is an involution, meaning f ( f ( x ) ) = x f(f(x)) = x f ( f ( x )) = x for all x x x in its domain!).

Example 2: Arithmetic Sequence Sum with Unknown Bound

Problem: The first term of an arithmetic sequence is 7, and the 20th term is 83. What is the sum of the first 20 terms of this sequence?

Step-by-Step Solution:

Identify Given Data: First term a 1 = 7 a_1 = 7 a 1 ​ = 7 , 20th term a 20 = 83 a_{20} = 83 a 20 ​ = 83 , number of terms n = 20 n = 20 n = 20 .

Select the Direct Sum Formula: Since the first and last terms are already known, deploy S n = n 2 ( a 1 + a n ) S_n = \frac{n}{2}(a_1 + a_n) S n ​ = 2 n ​ ( a 1 ​ + a n ​ ) without needing to compute the common difference d d d : S 20 = 20 2 ( a 1 + a 20 ) S_{20} = \frac{20}{2}(a_1 + a_{20}) S 20 ​ = 2 20 ​ ( a 1 ​ + a 20 ​ )

Execute the Arithmetic: S 20 = 10 × ( 7 + 83 ) = 10 × 90 = 900 S_{20} = 10 \times (7 + 83) = 10 \times 90 = 900 S 20 ​ = 10 × ( 7 + 83 ) = 10 × 90 = 900

Check via Common Difference (Verification): a 20 = a 1 + 19 d ⟹ 83 = 7 + 19 d ⟹ 19 d = 76 ⟹ d = 4 a_{20} = a_1 + 19d \implies 83 = 7 + 19d \implies 19d = 76 \implies d = 4 a 20 ​ = a 1 ​ + 19 d ⟹ 83 = 7 + 19 d ⟹ 19 d = 76 ⟹ d = 4 S 20 = 20 2 [ 2 ( 7 ) + 19 ( 4 ) ] = 10 [ 14 + 76 ] = 10 ( 90 ) = 900 S_{20} = \frac{20}{2}[2(7) + 19(4)] = 10[14 + 76] = 10(90) = 900 S 20 ​ = 2 20 ​ [ 2 ( 7 ) + 19 ( 4 )] = 10 [ 14 + 76 ] = 10 ( 90 ) = 900 . Confirmed!

Example 3: Periodic Recursive Sequence

Problem: A sequence is defined by a 1 = 3 a_1 = 3 a 1 ​ = 3 and a n + 1 = a n − 1 a n + 1 a_{n+1} = \frac{a_n - 1}{a_n + 1} a n + 1 ​ = a n ​ + 1 a n ​ − 1 ​ for all integers n ≥ 1 n \ge 1 n ≥ 1 . What is the value of a 75 a_{75} a 75 ​ ?

Step-by-Step Solution:

Generate the First Few Terms to Detect Periodicity:

a 1 = 3 a_1 = 3 a 1 ​ = 3

a 2 = 3 − 1 3 + 1 = 2 4 = 1 2 a_2 = \frac{3 - 1}{3 + 1} = \frac{2}{4} = \frac{1}{2} a 2 ​ = 3 + 1 3 − 1 ​ = 4 2 ​ = 2 1 ​

a 3 = 1 / 2 − 1 1 / 2 + 1 = − 1 / 2 3 / 2 = − 1 3 a_3 = \frac{1/2 - 1}{1/2 + 1} = \frac{-1/2}{3/2} = -\frac{1}{3} a 3 ​ = 1/2 + 1 1/2 − 1 ​ = 3/2 − 1/2 ​ = − 3 1 ​

a 4 = − 1 / 3 − 1 − 1 / 3 + 1 = − 4 / 3 2 / 3 = − 2 a_4 = \frac{-1/3 - 1}{-1/3 + 1} = \frac{-4/3}{2/3} = -2 a 4 ​ = − 1/3 + 1 − 1/3 − 1 ​ = 2/3 − 4/3 ​ = − 2

a 5 = − 2 − 1 − 2 + 1 = − 3 − 1 = 3 a_5 = \frac{-2 - 1}{-2 + 1} = \frac{-3}{-1} = 3 a 5 ​ = − 2 + 1 − 2 − 1 ​ = − 1 − 3 ​ = 3

Identify the Cycle Length: Since a 5 = a 1 = 3 a_5 = a_1 = 3 a 5 ​ = a 1 ​ = 3 , the sequence repeats every 4 terms: Cycle: { 3 , 1 2 , − 1 3 , − 2 } ⟹ Period k = 4 \text{Cycle: } \left\{3, \frac{1}{2}, -\frac{1}{3}, -2\right\} \quad \implies \quad \text{Period } k = 4 Cycle: { 3 , 2 1 ​ , − 3 1 ​ , − 2 } ⟹ Period k = 4

Apply Modular Arithmetic to Index 75: 75 ÷ 4 = 18 with a remainder of 3 ( 75 = 18 × 4 + 3 ) 75 \div 4 = 18 \quad \text{with a remainder of } 3 \quad (75 = 18 \times 4 + 3) 75 ÷ 4 = 18 with a remainder of 3 ( 75 = 18 × 4 + 3 )

  • Retrieve Corresponding Cycle Term: a 75 = a 3 = − 1 3 a_{75} = a_3 = -\frac{1}{3} a 75 ​ = a 3 ​ = − 3 1 ​
  • High-Frequency GMAT Traps & Pacing Strategies

Trap 1: The Off-by-One Fencepost Error. Forgetting to add 1 when counting terms in an arithmetic progression. The number of terms between 10 and 50 inclusive is ( 50 − 10 ) + 1 = 41 (50 - 10) + 1 = 41 ( 50 − 10 ) + 1 = 41 , not 40.

Trap 2: Assuming Custom Operators are Commutative. In a ⋆ b = 2 a − b a \star b = 2a - b a ⋆ b = 2 a − b , switching the inputs gives b ⋆ a = 2 b − a b \star a = 2b - a b ⋆ a = 2 b − a . Never rearrange operands around an unfamiliar symbol.

Trap 3: Evaluating Composites Outside-In. Attempting to evaluate f ( g ( x ) ) f(g(x)) f ( g ( x )) by substituting f f f into g g g or multiplying f ( x ) f(x) f ( x ) by g ( x ) g(x) g ( x ) . Always calculate the inner argument g ( x ) g(x) g ( x ) first.

Trap 4: Missing Alternating Signs in Geometric Sequences. Forgetting that if r < 0 r < 0 r < 0 , terms oscillate between positive and negative values, meaning the sum or term values cannot be analyzed assuming monotonic growth.

Loading diagram... Sequence Classification and Formula Roadmap