12.1 Logarithms (Logaritma), Complex Numbers & Arithmetic/Geometric Sequences (Diziler)
Key Takeaways
A logarithm y = log_a(f(x)) is defined on the real numbers if and only if three strict conditions hold simultaneously: f(x) > 0, a > 0, and a != 1.
The change-of-base formula log_a(b) = log_c(b) / log_c(a) implies log_a(b) = 1 / log_b(a) and collapses telescoping products: log_a(b) * log_b(c) * log_c(d) = log_a(d).
Powers of the imaginary unit i (i² = -1) repeat in a period-4 cycle (1, i, -1, -i), any 4 consecutive powers sum to 0, and high-speed identities include (1 + i)^2 = 2i, (1 - i)^2 = -2i, and (1 + i)/(1 - i) = i.
In an arithmetic sequence (Aritmetik Dizi), a_n = a_p + (n - p)d and equidistant terms satisfy a_k = (a_{k-m} + a_{k+m}) / 2; in a geometric sequence (Geometrik Dizi), a_n = a_p * r^{n-p} for nonzero terms and ratio and a_k^2 = a_{k-m} * a_{k+m}.
Whenever a sequence's partial sum formula S_n is given, individual terms are recovered via a_1 = S_1 and a_n = S_n - S_{n-1} for n >= 2.
12.1 Logarithms (Logaritma), Complex Numbers () & Sequences (Diziler)
This section extends independent mathematics practice with logarithms and complex numbers, then develops arithmetic and geometric sequences. The current official guide does not enumerate these as guaranteed subtopics. Use the extensions after the basic arithmetic, algebra and released-question work rather than assigning them an invented item frequency.
1. Logarithms (Logaritma)
Definition & Strict Domain Conditions (Tanım Kümesi)
The logarithm is the inverse operation of exponentiation. For a base and argument :
Whenever a TR-YÖS problem asks for the largest domain (en geniş tanım kümesi) of , or when you solve logarithmic equations and inequalities, you must enforce three strict conditions:
- Positive argument:
- Positive base:
- Base not equal to 1:
Two standard shorthand notations appear constantly:
- Common logarithm (
Bayağı Logaritma): (base ) - Natural logarithm (
Doğal Logaritma): (base )
Core Logarithmic Identities (Logaritma Özellikleri)
Assuming and :
- Unit & Zero Rules:
- Product & Quotient Rules (
Çarpım ve Bölüm Kuralları):
(Warning: ! Sums inside a logarithm cannot be split.)
- Power Extraction Rule (
Kuvvet Kuralı):
For example, , and .
- Exponent-Swap & Cancellation Rules:
For instance, and (for ).
Change of Base & Telescoping Chain Product (Taban Değiştirme)
To convert a logarithm from base to any convenient new base (where ):
Two useful change-of-base corollaries are:
- Reciprocal Base-Argument Flip:
When an equation contains both and , substitute and to turn the equation into a quadratic in . 2. Telescoping Chain Product:
Logarithmic Inequalities (Logaritmik Eşitsizlikler)
When solving (or ):
- Case 1 (, increasing function): Preserve the inequality direction: .
- Case 2 (, decreasing function): Reverse the inequality direction, and never forget the positivity requirement : .
2. Complex Numbers (Karmaşık Sayılar — )
The imaginary unit is defined by , so . Every complex number is written in standard form as (), where is the real part (gerçel kısım) and is the imaginary part (sanal kısım). Two complex numbers are equal if and only if both their real parts and their imaginary parts match.
Period-4 Cycle of Powers of
Because , integer powers of repeat every steps according to the remainder of the exponent modulo :
For negative exponents, add a multiple of until the exponent is positive (e.g., ). Crucially, any four consecutive powers of sum to zero:
High-Speed Binomial & Quotient Identities
Instead of expanding large powers of by hand, memorize these four instant shortcuts:
Thus, to compute , rewrite it as .
Conjugate (Eşlenik) & Modulus (Modül / Mutlak Değer)
For , its complex conjugate is (only the sign of changes!), and its modulus is its distance from the origin in the complex plane:
Modulus respects multiplication, division, and powers: , , and .
3. Arithmetic & Geometric Sequences (Aritmetik ve Geometrik Diziler)
A sequence (dizi) is a function whose domain is the positive integers .
Arithmetic Sequence (Aritmetik Dizi)
Consecutive terms differ by a constant common difference (ortak fark) :
- General Term Relationship: , and more generally between any two terms and :
- Equidistant Symmetry (
Ortanca Terim Özelliği): Every term is the arithmetic mean of terms equidistant from it:
- Sum of First Terms (
İlk n Terim Toplamı):
Geometric Sequence (Geometrik Dizi)
Consecutive terms have a constant common ratio (ortak çarpan) :
- General Term Relationship: , and between any two indices and :
- Equidistant Symmetry: The square of any term equals the product of terms equidistant from it:
- Finite & Infinite Geometric Sums:
Recovering from Partial Sums
For any sequence (whether arithmetic, geometric, or neither), since , you can immediately extract the -th term by subtracting consecutive partial sums:
Summary Reference Table
| Topic | Core Formula / Rule | Fast TR-YÖS Shortcut |
|---|---|---|
| Logarithm Domain | Check base before counting integers! | |
| Power & Base Change | , | |
| Complex Unit | and | |
| Modulus & Conjugate | Use instead of expanding! | |
| Arithmetic Sequence | ||
| Geometric Sequence | and for |
Worked Examples
Worked Example 1: Telescoping Logarithms & Fractional Base Inequalities
Problem:
- Evaluate .
- Find the number of integers satisfying .
Step-by-Step Solution:
- In the product , the intermediate bases and arguments cancel via the change-of-base chain rule:
For the second term, apply the exponent-swap identity (or rewrite ):
Therefore, . 2. For the inequality :
- Step A (Domain): The argument must be strictly positive: .
- Step B (Unwrap base ): Since , removing reverses the inequality sign:
- Combining and gives , which contains the integers — a total of integers.
Worked Example 2: Complex Powers & Sequence Partial Sums
Problem:
- Simplify .
- In a sequence , the sum of the first terms is . Find .
Step-by-Step Solution:
- Use the high-speed complex identities:
- Since , the first term is . Because , we have .
- Since , we have .
- Combining both terms yields .
- Rather than finding and separately, use the partial sum difference identity directly at :
Constant and Zero-Ratio Sequences Need Separate Checks
The constant sequence 3, 3, 3 is arithmetic with difference zero and geometric with ratio one. Its first terms sum to ; a geometric sum formula written with denominator cannot be used at . Recognizing the constant case avoids turning a simple sum into an undefined fraction. A classification question must therefore allow overlap unless its wording excludes one of these cases.
The sequence 5, 0, 0, 0 is geometric under the recurrence with . However, dividing the third term by the second gives , so that ratio calculation cannot determine . Use the first transition, where the preceding term is nonzero, and state the first term separately. Every later term is zero and every nonempty partial sum is 5. Likewise, an all-zero sequence satisfies this recurrence for any ratio; its terms alone do not identify a unique ratio. These examples show why recurrence definitions and domain checks are more reliable than automatically dividing consecutive terms.
Review the Method
Whenever a sequence's partial sum formula S_n is given, individual terms are recovered via a_1 = S_1 and a_n = S_n - S_{n-1} for n >= 2.
How many integers x belong to the largest real domain (en geniş tanım kümesi) of the function f(x) = log_{x - 2}(16 - x^2)?
1
2
0
3
If log_2(3) = a and log_3(5) = b, what is log_15(24) in terms of a and b?
(a + 3) / (a(b + 1))
(3a + 1) / (a + b)
(a + 3) / (ab + 1)
(3 + ab) / (a(b + 1))
Given the complex number z = ((1 + i)^8 * (3 - 4i)) / (4 + 3i), what is the modulus |z|?
4
8
20
16
In a positive-term geometric sequence (a_n), if a_3 * a_5 * a_7 = 27 and a_2 * a_10 = 144, what is the common ratio r?
4/3
4
3
3/2
Sections you finish are checked off in the contents.