ScholarQuill logoScholarQuillUniversity Notes
  • Notes
  • Past Papers
  • Blogs
  • Todo
Login
ScholarQuill logoScholarQuillUniversity Notes
Login
NotesPast PapersBlogsTodo
More
SubjectsDiscussionCGPA CalculatorGPA CalculatorStudent PortalCourse Outline
About
About usPrivacy PolicyReportContact
Notes
Past Papers
Blogs
Todo
Analytics
    Current Subject
    🧩
    Discrete Structures
    GE-167
    Progress0 / 67 topics
    Topics
    1. Mathematical Reasoning: Propositional and Predicate Logic2. Propositional Logic: Logical Operators3. Translations Between Symbolic Expressions and Formal English Expression4. Logical Equivalences5. Predicate Logic: Quantifiers6. Nested Quantification7. Equivalences in Predicate Logic8. Translations Between Symbolic Forms and Formal English9. Rules of Inference: Proof Methods and Strategies10. Direct Proof11. Proof by Contraposition12. Proof by Induction13. Proof by Implication14. Existence Proof15. Uniqueness Proofs16. Trivial Proofs17. Vacuous Proofs18. Sets: Notations and Set Operations19. Venn Diagrams20. Countable and Uncountable Sets21. Relations: Equivalence Relations and Partitions22. Partial Orderings23. Recurrence Relations24. Functions: Injective, Surjective, Bijective25. Special Types of Functions26. Function Composition27. Inverse Functions28. Recursive Functions29. Compositions30. Number Theory: Sequences and Series31. Counting: Inclusion and Exclusion Principle32. Pigeonhole Principle33. Permutations and Combinations34. Integers and Divisibility: Division Theorem35. Modular Arithmetic36. LCM and GCD37. Euclidean and Extended Euclidean Method38. Finding Solutions to Congruence39. Primes: Fundamental Theorem of Arithmetic40. Characterizations of Primes41. Mersenne Primes42. Induction: Weak Induction43. Strong Induction44. Recursion and Recurrences: Formulation of Recurrences45. Closed Formulas46. Counting: Product Rule and Sum Rule47. Principle of Inclusion-Exclusion48. Binomial Coefficients49. Pascal's Identity and Pascal’s Triangle50. Binomial Theorem51. Relations: Reflexive, Symmetric, Transitive, and Antisymmetric52. Equivalence Relations and Equivalence Classes53. Partial Orders54. Graph Theory: Terminologies55. Elements of Graph Theory56. Planar Graphs57. Graph Coloring58. Euler Graph59. Hamiltonian Path60. Rooted Trees61. Graph Traversals62. Handshaking Lemma and Corollary63. Special Families of Graphs64. Graph Isomorphism65. Planarity in Graphs66. Eulerian and Hamiltonian Graphs67. Trees in Graph Theory
    GE-167›Number Theory: Sequences and Series
    Discrete StructuresTopic 30 of 67

    Number Theory: Sequences and Series

    12 minread
    2,035words
    Intermediatelevel

    Number Theory: Sequences and Series

    Number theory is a branch of mathematics focused on the properties and relationships of numbers, particularly integers. Within this field, sequences and series are important concepts that help in understanding the structure and patterns of numbers.

    • A sequence is an ordered list of numbers that follow a particular pattern or rule.
    • A series is the sum of the terms in a sequence.

    This section will provide an overview of sequences and series in the context of number theory, including arithmetic sequences, geometric sequences, and important series that arise in number theory.


    1. Sequences

    A sequence is a list of numbers arranged in a specific order. Each number in the sequence is called a term. Sequences can be finite or infinite, and the numbers in the sequence typically follow a particular rule.

    a. Types of Sequences

    1. Arithmetic Sequence (or Arithmetic Progression)

    An arithmetic sequence is a sequence of numbers where the difference between consecutive terms is constant. This difference is called the common difference and is denoted by ddd. The general form of an arithmetic sequence is:

    a,a+d,a+2d,a+3d,…a, a+d, a+2d, a+3d, \dotsa,a+d,a+2d,a+3d,…

    where:

    • aaa is the first term,
    • ddd is the common difference.

    The nnn-th term of an arithmetic sequence, denoted by ana_nan​, is given by the formula:

    an=a+(n−1)⋅da_n = a + (n-1) \cdot dan​=a+(n−1)⋅d

    where ana_nan​ is the nnn-th term, aaa is the first term, and ddd is the common difference.

    Example: The sequence 3,7,11,15,…3, 7, 11, 15, \dots3,7,11,15,… is an arithmetic sequence with:

    • First term a=3a = 3a=3,
    • Common difference d=4d = 4d=4.

    To find the 5th term:

    a5=3+(5−1)⋅4=3+16=19a_5 = 3 + (5-1) \cdot 4 = 3 + 16 = 19a5​=3+(5−1)⋅4=3+16=19
    1. Geometric Sequence (or Geometric Progression)

    A geometric sequence is a sequence where each term is found by multiplying the previous term by a constant called the common ratio rrr. The general form of a geometric sequence is:

    a,a⋅r,a⋅r2,a⋅r3,…a, a \cdot r, a \cdot r^2, a \cdot r^3, \dotsa,a⋅r,a⋅r2,a⋅r3,…

    where:

    • aaa is the first term,
    • rrr is the common ratio.

    The nnn-th term of a geometric sequence, denoted by gng_ngn​, is given by the formula:

    gn=a⋅rn−1g_n = a \cdot r^{n-1}gn​=a⋅rn−1

    where gng_ngn​ is the nnn-th term, aaa is the first term, and rrr is the common ratio.

    Example: The sequence 2,6,18,54,…2, 6, 18, 54, \dots2,6,18,54,… is a geometric sequence with:

    • First term a=2a = 2a=2,
    • Common ratio r=3r = 3r=3.

    To find the 5th term:

    g5=2⋅35−1=2⋅81=162g_5 = 2 \cdot 3^{5-1} = 2 \cdot 81 = 162g5​=2⋅35−1=2⋅81=162
    1. Fibonacci Sequence

    The Fibonacci sequence is a special recursive sequence where each term is the sum of the two preceding ones. The sequence starts as:

    0,1,1,2,3,5,8,13,21,…0, 1, 1, 2, 3, 5, 8, 13, 21, \dots0,1,1,2,3,5,8,13,21,…

    This sequence is defined by the recurrence relation:

    F(0)=0,F(1)=1,F(n)=F(n−1)+F(n−2)for n≥2.F(0) = 0, \quad F(1) = 1, \quad F(n) = F(n-1) + F(n-2) \quad \text{for } n \geq 2.F(0)=0,F(1)=1,F(n)=F(n−1)+F(n−2)for n≥2.

    Example: The first few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, etc.


    2. Series

    A series is the sum of the terms of a sequence. When we sum up the terms of a sequence, we get a series. Series can be finite or infinite, depending on the number of terms involved.

    a. Arithmetic Series

    An arithmetic series is the sum of the terms of an arithmetic sequence. The sum of the first nnn terms of an arithmetic series, denoted by SnS_nSn​, is given by the formula:

    Sn=n2(2a+(n−1)⋅d)S_n = \frac{n}{2} \left( 2a + (n-1) \cdot d \right)Sn​=2n​(2a+(n−1)⋅d)

    where:

    • aaa is the first term,
    • ddd is the common difference,
    • nnn is the number of terms.

    Alternatively, if we know the first term aaa and the last term lll, the sum can also be expressed as:

    Sn=n2⋅(a+l)S_n = \frac{n}{2} \cdot (a + l)Sn​=2n​⋅(a+l)

    Example: Find the sum of the first 5 terms of the arithmetic sequence 2,5,8,11,…2, 5, 8, 11, \dots2,5,8,11,… (with a=2a = 2a=2 and d=3d = 3d=3).

    Using the formula:

    S5=52(2⋅2+(5−1)⋅3)=52(4+12)=52⋅16=40S_5 = \frac{5}{2} \left( 2 \cdot 2 + (5-1) \cdot 3 \right) = \frac{5}{2} \left( 4 + 12 \right) = \frac{5}{2} \cdot 16 = 40S5​=25​(2⋅2+(5−1)⋅3)=25​(4+12)=25​⋅16=40

    So, the sum of the first 5 terms is 404040.

    b. Geometric Series

    A geometric series is the sum of the terms of a geometric sequence. The sum of the first nnn terms of a geometric series is given by:

    Sn=a⋅(1−rn)1−r,if r≠1S_n = \frac{a \cdot (1 - r^n)}{1 - r}, \quad \text{if } r \neq 1Sn​=1−ra⋅(1−rn)​,if r=1

    where:

    • aaa is the first term,
    • rrr is the common ratio,
    • nnn is the number of terms.

    If the geometric series is infinite and ∣r∣<1|r| < 1∣r∣<1, the sum of the series is given by:

    S∞=a1−rS_\infty = \frac{a}{1 - r}S∞​=1−ra​

    Example: Find the sum of the first 4 terms of the geometric series 3,6,12,24,…3, 6, 12, 24, \dots3,6,12,24,… (with a=3a = 3a=3 and r=2r = 2r=2).

    Using the formula:

    S4=3⋅(1−24)1−2=3⋅(1−16)−1=3⋅(−15)−1=45S_4 = \frac{3 \cdot (1 - 2^4)}{1 - 2} = \frac{3 \cdot (1 - 16)}{-1} = \frac{3 \cdot (-15)}{-1} = 45S4​=1−23⋅(1−24)​=−13⋅(1−16)​=−13⋅(−15)​=45

    So, the sum of the first 4 terms is 454545.

    c. Harmonic Series

    The harmonic series is a specific infinite series that is the sum of the reciprocals of the positive integers:

    Hn=1+12+13+14+⋯+1nH_n = 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \dots + \frac{1}{n}Hn​=1+21​+31​+41​+⋯+n1​

    The harmonic series diverges, meaning that the sum grows without bound as nnn increases, but it does so very slowly.


    3. Special Series in Number Theory

    In number theory, several important series and sums arise, including:

    • The sum of divisors: The sum of divisors of an integer nnn, denoted by σ(n)\sigma(n)σ(n), is an important function in number theory. For example: σ(6)=1+2+3+6=12.\sigma(6) = 1 + 2 + 3 + 6 = 12.σ(6)=1+2+3+6=12.
    • Arithmetic sums: These are sums of numbers with a particular arithmetic progression, often studied in number-theoretic contexts, such as summing prime numbers up to a certain limit.
    • Euler's formula: Euler discovered many important series, such as the formula for the sum of the reciprocals of the squares of natural numbers, which converges to a specific constant: ∑n=1∞1n2=π26.\sum_{n=1}^{\infty} \frac{1}{n^2} = \frac{\pi^2}{6}.n=1∑∞​n21​=6π2​.

    4. Applications of Sequences and Series in Number Theory

    • Prime number theorem: Sequences and series are used in approximating the distribution of prime numbers.
    • Fermat's little theorem: Sequences and series help in the formulation of number-theoretic conjectures and proofs.
    • Sum of divisors and multiplicative functions: Many functions in number theory are multiplicative, and sequences of divisors and their sums help in studying these properties.

    Conclusion

    Sequences and series are foundational topics in number theory. Sequences are used to describe ordered sets of numbers, and series are used to describe the sum of terms from sequences. Arithmetic sequences, geometric sequences, and special series like the harmonic series play a central role in number theory and have broad applications in various areas of mathematics. Understanding the properties of these sequences and series provides powerful tools for solving problems and exploring deeper number-theoretic concepts.

    Previous topic 29
    Compositions
    Next topic 31
    Counting: Inclusion and Exclusion Principle

    Past Papers

    Open this section to load past papers

    Click on Show Past Papers to see past papers.
    On This Page
      Reading Stats
      Est. reading time12 min
      Word count2,035
      Code examples0
      DifficultyIntermediate