---
id: intro-nt
title: "Introductory Number Theory"
author: Unknown
---

<div class="syllabus-only">
  Description: Todo
</div>

<!-- END DESCRIPTION -->

See 13 of https://www.overleaf.com/project/5e73f65cde1d010001224d8a

- Prime factorization, GCD, LCM
- Modular Arithmetic

Also see here: https://codeforces.com/blog/entry/77137

# Binary Exponentiation

<!-- END DESCRIPTION -->

 - Tutorial
   - CPH (23, Matrices)
 - Problems
   - [Currencies](https://www.hackerrank.com/contests/gs-codesprint/challenges/currencies) [](107)

COWBASIC

(old)


### 4

  * Eratosthenes' Sieve
    * Tutorial
      * CPH (21, NT)

### 5  

  * Modular Arithmetic
    * Modular Inverse
    * Chinese Remainder Theorem
    * Euler's Theorem, Phi Function
  * Discrete Logarithm