Skip to content
This repository was archived by the owner on Aug 30, 2024. It is now read-only.

This repository provides essential Number Theory tools for competitive programming, covering integers, primes, divisibility, and modular arithmetic. By mastering these concepts, you'll be able to design optimized algorithms and tackle a wide range of computational challenges efficiently, making this an invaluable resource for competitive coding.

Notifications You must be signed in to change notification settings

NhanPhamThanh-IT/Number-Theory-In-Competitive-Programming

Repository files navigation

Introduction

Number Theory is important for competitive programming because it provides essential mathematical tools to efficiently solve problems related to integers, primes, divisibility, and modular arithmetic. It enables programmers to optimize algorithms, handle mathematical operations with integers, and design efficient solutions for a wide range of computational problems.

Table Of Contents

Following is a list of important topics relevant to Number Theory:

  1. Binary Exponentiation
  2. Modular Arithmetic
  3. Modular Inverse
  4. Euclidean: GCD
  5. Euclidean: LCM
  6. Sieve of Eratosthenes
  7. Prime Factorization
  8. Linear Diophantine Equation with Two Variables
  9. Chinese Remainder Theorem
  10. Fermat Theorem

About

This repository provides essential Number Theory tools for competitive programming, covering integers, primes, divisibility, and modular arithmetic. By mastering these concepts, you'll be able to design optimized algorithms and tackle a wide range of computational challenges efficiently, making this an invaluable resource for competitive coding.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published