University Study Notes: Functions, Sequences, and Series

Fundamental Tasks and Problems Involving Functions

  • Evaluation: Given a value x0x_0, determine the value of the function at that point, f(x0)f(x_0). This involves challenges when dealing with irrational exponents or roots, such as evaluating f(x)=x1/2f(x) = x^{1/2}, f(x)=x2/3f(x) = x^{2/3}, or f(x)=10xf(x) = 10^x for all real xx.
    • Examples of complex evaluation include finding the exact value of 2\sqrt{\sqrt{2}} or 10210^{\sqrt{2}}.
  • Plotting and Continuity: This involves graphing f(x)f(x) versus xx. Key considerations include:
    • How to join discrete points to form a continuous curve.
    • Maintaining a "smooth" curve and the physical justification for doing so.
    • Situations where smoothness is expected include physical quantities like heat, temperature, pressure, current, voltage, and magnetic or electric fields.
    • Non-smooth examples, such as the absolute value function y=xy = |x|, which has a sharp corner at the origin.
  • Inversion: Given a value y0y_0, find the corresponding xx such that y=f(x0)y = f(x_0).
  • Growth, Fall, and Critical Points:
    • Increasing Behavior: The function increases in the intervals x<x1x < x_1, x2<x<x3x_2 < x < x_3, and x>x4x > x_4.
    • Decreasing Behavior: The function decreases in the intervals x1<x<x2x_1 < x < x_2 and x3<x<x4x_3 < x < x_4.
    • Critical Points: These are points xRx ∈ \mathbb{R} where the graph of f(x)f(x) attains a maximum or minimum value. At these points, the function hits a peak or trough and changes its growth/fall behavior.
    • Asymptotics: Observing the behavior as xx reaches extreme values. For large positive xx, the function may tend toward a non-zero value; for large negative xx, it may tend toward zero.

Sequences: Definitions and Examples

  • Formal Definition: A sequence of real numbers is a function defined from the set of non-negative integers {0,1,2,...}\{0, 1, 2, ...\} to the set of real numbers R\mathbb{R}.
    • Domain/Codomain Notation: f:N{0}Rf: \mathbb{N} \cup \{0\} \rightarrow \mathbb{R} or f:NRf: \mathbb{N} \rightarrow \mathbb{R}.
  • Basic Sequence Examples:
    • an=na_n = n: Generates the sequence 0,1,2,3,...0, 1, 2, 3, ...
    • an=(1)na_n = (-1)^n: Generates the sequence 1,1,1,1,...1, -1, 1, -1, ...
    • an=1n+1a_n = \frac{1}{n+1}: Generates the sequence 1,12,13,14,...1, \frac{1}{2}, \frac{1}{3}, \frac{1}{4}, ...
  • Recursive Sequences:
    • Fibonacci Sequence: Defined by a0=0a_0 = 0, a1=1a_1 = 1, and an+1=an+an1a_{n+1} = a_n + a_{n-1} for n1n \ge 1. The sequence progresses as 0,1,1,2,3,5,8,13,21,...0, 1, 1, 2, 3, 5, 8, 13, 21, ...
    • Arithmetic Progression (AP): Defined by an+1=an+da_{n+1} = a_n + d for n0n \ge 0, where dd is the common difference. The nn-th term is an=a0+nda_n = a_0 + nd.
    • Geometric Progression (GP): Defined by an+1=anra_{n+1} = a_n r for n0n \ge 0, where rr is the common ratio. The nn-th term is an=a0rna_n = a_0 r^n.
  • The 2\sqrt{2} Sequence (Newton-Raphson approach):
    • Formula: a0=2a_0 = 2, an+1=an2+1ana_{n+1} = \frac{a_n}{2} + \frac{1}{a_n} for n0n \ge 0.
    • Calculated terms:
      • a0=2a_0 = 2
      • a1=1.5a_1 = 1.5
      • a2=1.416666...a_2 = 1.416666...
      • a3=577408=1.414215686...a_3 = \frac{577}{408} = 1.414215686...
    • Target value (2\sqrt{2}): 1.4142135623730951...1.4142135623730951...
    • Significance: While 2\sqrt{2} is irrational and cannot be expressed as a fraction pq\frac{p}{q}, individual terms in this sequence (ana_n) are rational and can be computed precisely to approximate 2\sqrt{2} as nn increases.
  • Visualizing Sequences: Sequences are often visualized using stem plots to show discrete values for each integer nn. Different sequence types exhibit distinct patterns: increasing, alternating, and decreasing.

Series: Sequences Defined as Summations

  • Definition: Given a sequence {an}\{a_n\}, a summation sequence {sn}\{s_n\} is defined where each term represents the "partial sum" of the sequence up to that point.
    • s1=a1s_1 = a_1
    • sn+1=sn+an+1s_{n+1} = s_n + a_{n+1}
    • General form: sn=a1+a2+...+an=k=1naks_n = a_1 + a_2 + ... + a_n = \sum_{k=1}^{n} a_k
  • Key Series Examples:
    • Sum of Natural Numbers: For an=na_n = n, the partial sum is sn=n(n+1)2s_n = \frac{n(n+1)}{2}. The sequence of partial sums is 1,3,6,10,15,21,28,36,45,55,...1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
    • Harmonic Series (HnH_n): Hn=1+12+13+...+1n=k=1n1kH_n = 1 + \frac{1}{2} + \frac{1}{3} + ... + \frac{1}{n} = \sum_{k=1}^{n} \frac{1}{k}.
    • Generalized Harmonic Series (Hn(2)H_n^{(2)}): Hn(2)=1+122+132+...+1n2=k=1n1k2H_n^{(2)} = 1 + \frac{1}{2^2} + \frac{1}{3^2} + ... + \frac{1}{n^2} = \sum_{k=1}^{n} \frac{1}{k^2}.
    • Alternating Harmonic Series: sn=112+1314+...+(1)n1n=k=1n(1)k1ks_n = 1 - \frac{1}{2} + \frac{1}{3} - \frac{1}{4} + ... + \frac{(-1)^{n-1}}{n} = \sum_{k=1}^{n} \frac{(-1)^{k-1}}{k}.
    • Madhava-Leibniz π/4\pi/4 Series: sn=113+1517+...+(1)n12n1=k=1n(1)k12k1s_n = 1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + ... + \frac{(-1)^{n-1}}{2n-1} = \sum_{k=1}^{n} \frac{(-1)^{k-1}}{2k-1}.

Boundedness of Sequences

  • Bounded Above: A sequence {an}\{a_n\} is bounded above if there exists a constant MM such that anMa_n \le M for all nn.
  • Bounded Below: A sequence {an}\{a_n\} is bounded below if there exists a constant mm such that anma_n \ge m for all nn.
  • Analysis of Examples:
    • an=na_n = n: Lower bound is 00, no upper bound (unbounded above).
    • an=(1)na_n = (-1)^n: Lower bound is 1-1, upper bound is 11.
    • an=1n+1a_n = \frac{1}{n+1}: Lower bound is 00, upper bound is 11.
    • an=2na_n = -2^n: No lower bound, upper bound is 1-1.
    • an=(2)na_n = (-2)^n: No lower bound, no upper bound (unbounded).
    • Arithmetic Progression (an=a0+nda_n = a_0 + nd):
      • If d>0d > 0: Lower bound is a0a_0, unbounded above.
      • If d<0d < 0: Unbounded below, upper bound is a0a_0.
    • Geometric Progression (an=2rna_n = 2r^n):
      • If r>1r > 1: Lower bound is 22, unbounded above.
      • If 0<r<10 < r < 1: Lower bound is 00, upper bound is 22.
    • 2\sqrt{2} sequence (a0=2a_0 = 2): Lower bound is 11, upper bound is 22.

Monotonicity of Sequences and Series

  • Increasing: an+1>ana_{n+1} > a_n for all nn.
  • Non-decreasing: an+1ana_{n+1} \ge a_n for all nn.
  • Decreasing: an+1<ana_{n+1} < a_n for all nn.
  • Non-increasing: an+1ana_{n+1} \le a_n for all nn.
  • Monotonicity Specifics:
    • Arithmetic Progression (d>0d > 0): Increasing.
    • Arithmetic Progression (d<0d < 0): Decreasing.
    • Geometric Progression (r>1r > 1): Increasing.
    • Geometric Progression (0<r<10 < r < 1): Decreasing.
    • 2\sqrt{2} sequence: Decreasing (flattening toward 2\sqrt{2}).
    • sn=1+2+...+ns_n = 1 + 2 + ... + n: Increasing.
    • Harmonic Series (HnH_n) and variants (Hn(2)H_n^{(2)}): Increasing.
    • Alternating Series (Harmonic and Madhava-Leibniz): Neither strictly increasing nor strictly decreasing (non-monotonic).

Concepts of Limits

  • Formal Definition (Epsilon-N): A sequence {an}\{a_n\} tends to a limit LL if for any ̵ > 0, there exists an integer NN such that for all n>Nn > N, the term lies within the range L - ̵ \le a_n \le L + ̵.
    • Notation: limnan=L\lim_{n \to \infty} a_n = L
  • Convergence and Divergence Definitions:
    • Convergent: The sequence has a finite limit.
    • Diverges to \infty: The sequence grows unbounded and remains positive.
    • Diverges to -\infty: The sequence grows unbounded in the negative direction.
    • No Limit: The sequence does not stabilize at a finite value and does not grow unbounded in a single direction (e.g., oscillating sequences).
  • Examples of Limits (nn \to \infty):
    • an=1a_n = 1 \rightarrow Limit is 11.
    • an=1na_n = \frac{1}{n} \rightarrow Limit is 00.
    • an=na_n = n \rightarrow Diverges to \infty.
    • an=2na_n = -2^n \rightarrow Diverges to -\infty.
    • an=(1)na_n = (-1)^n \rightarrow No limit (oscillates between 1-1 and 11).
    • an=(2)na_n = (-2)^n \rightarrow No limit (oscillates with increasing magnitude).

Questions & Discussion

  • Question (Sequence Identification): Which of the following functions represents a sequence?

    • f1:RRf_1: \mathbb{R} \rightarrow \mathbb{R}
    • f2:N0Rf_2: \mathbb{N}_0 \rightarrow \mathbb{R}
    • f3:RRf_3: \mathbb{R}^- \rightarrow \mathbb{R}
    • f4:R+Rf_4: \mathbb{R}^+ \rightarrow \mathbb{R}
    • f5:N0Zf_5: \mathbb{N}_0 \rightarrow \mathbb{Z}
    • Answer: By definition, functions whose domain is the set of natural numbers (including 0), such as f2f_2 and f5f_5, qualify as sequences.
  • Question (Arithmetic Progression): What is the common difference in the arithmetic progression 5,14,23,32,41,50,...5, 14, 23, 32, 41, 50, ...?

    • Answer Calculation: 145=914 - 5 = 9. The common difference d=9d = 9.
  • Question (Recursion Identification): Consider the sequence 2,212,21212,2121212,...2, 2 - \frac{1}{2}, 2 - \frac{1}{2 - \frac{1}{2}}, 2 - \frac{1}{2 - \frac{1}{2 - \frac{1}{2}}}, .... What is the recursion formula?

    • Analysis:
      • a0=2a_0 = 2
      • a1=21a0=212=1.5a_1 = 2 - \frac{1}{a_0} = 2 - \frac{1}{2} = 1.5
      • a2=21a1a_2 = 2 - \frac{1}{a_1}
      • The correct recursion is an+1=21ana_{n+1} = 2 - \frac{1}{a_n}.
  • Question (Partial Sum Analysis): Consider a series S=n=11(2n+1)3nS = \sum_{n=1}^{\infty} \frac{1}{(2n+1)3^n}. Which option describes the partial sum SnS_n?

    • Answer: Sn=133+1532+1733+...+1(2n+1)3nS_n = \frac{1}{3 \cdot 3} + \frac{1}{5 \cdot 3^2} + \frac{1}{7 \cdot 3^3} + ... + \frac{1}{(2n+1)3^n}. Specifically, for the first term when n=1n=1, we have 1(2(1)+1)31=133=19\frac{1}{(2(1)+1)3^1} = \frac{1}{3 \cdot 3} = \frac{1}{9}. The correct representation corresponds to Option D in the provided choices: Sn=133+1532+1733+...+1(2n+1)3nS_n = \frac{1}{3 \cdot 3} + \frac{1}{5 \cdot 3^2} + \frac{1}{7 \cdot 3^3} + ... + \frac{1}{(2n+1)3^n}.
  • Question (Monotonicity Check): Which of the following is correct?

    • Statement: The sequence an=1na_n = -\frac{1}{n} is an increasing sequence.
    • Verification: As nn\rightarrow\infty, 1n\frac{1}{n} decreases, making its negative counterpart 1n-\frac{1}{n} increase towards zero. Thus, the statement is correct.