Number Theory Fundamentals

Revision sheet excerpt

Course Outline

  1. Division Algorithm
  2. Divisibility and Linear Combinations
  3. Quotients and Remainders
  4. Modular Arithmetic
  5. Prime Factorization
  6. Prime Numbers and Theorems
  7. Greatest Common Divisor
  8. Euclid's Algorithm
  9. Extended Euclidean Algorithm
  10. Multiplicative Inverse

1. Division Algorithm

Key Concepts & Definitions

  • Division Algorithm:
    The theorem stating that for any integer aa and positive integer dd, there exist unique integers qq (quotient) and rr (remainder) such that:
    a=dq+rwith0r<da = dq + r \quad \text{with} \quad 0 \leq r < d
    This guarantees the existence and uniqueness of the quotient and remainder when dividing integers.

  • Quotients and Remainders:
    The results of division, where the quotient qq is the integer part of the division, and the remainder rr is what is left over, satisfying 0r<d0 \leq r < d.

  • Integer Division Definitions:
    In the context of the Division Algorithm, the quotient qq and remainder rr are defined such that:
    a=dq+ra = dq + r with the specified bounds on rr. The quotient and remainder are uniquely determined by this relation.

  • Procedural Version of the Division Algorithm:
    A step-by-step method to compute qq and rr for given integers aa and positive integer dd. It involves iterative subtraction or division steps to find the unique qq and rr satisfying the relation, ensuring 0r<d0 \leq r < d.

Essential Points

Read the full sheet →

Quiz preview

1. What is the primary role of the division algorithm in number theory?

2. Who is credited with formulating the theorem that if a number divides two integers, then it divides any linear combination of those integers?

3. How do the quotient and remainder of a division fundamentally differ from each other?

Take the quiz (10 questions) →

Flashcards preview

Division Algorithm — statement?

Unique $q, r$ with $a = dq + r$, $0 \\leq r < d$.

Divisibility — relation?

Exists $k$ with $b = ak$.

Linear combination — form?

$ax + by$, with integers $x, y$.

Quotients and Remainders — result?

From division: $a = bq + r$, with $0 \\leq r < b$.

Modular arithmetic — relation?

$a \\equiv b \\ ( ext{mod } m)$ if $m$ divides $a - b$.

Prime number — definition?

Divisible only by 1 and itself.

See all 20 flashcards →

Frequently asked questions

What does the revision sheet on Number Theory Fundamentals cover?

The revision sheet covers the essential concepts of Number Theory Fundamentals. It is organized by topic to facilitate learning and memorization, with key definitions, explanations and summaries.

Read the full sheet →

How many questions are in the Number Theory Fundamentals quiz?

The quiz contains 10 multiple-choice questions with detailed corrections and explanations for each answer. Ideal for testing your knowledge and identifying gaps.

Take the quiz (10 questions) →

How to study Number Theory Fundamentals with flashcards?

Revizly offers 20 interactive flashcards on Number Theory Fundamentals. Each card presents a question on the front and the answer on the back, enabling active and effective revision based on spaced repetition.

See all 20 flashcards →

Similar courses

Create your own sheets from your courses

Import your PDF or paste your course, AI generates sheets, quizzes and flashcards in 30 seconds.