New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Add chapter Basic Number Theory #15

Open

TimmyChiang opened this issue Feb 1, 2023 · 4 comments

Assignees

Labels

proposal

Contributor

TimmyChiang commented Feb 1, 2023 •

edited

Loading

Binary Exponentiation

Integer version
Matrix version
Implementation
Examples

Sieve of Eratosthenes

Finding Prime Numbers
Implementation
Examples

Sieve of Euler

Yet Another Finding Prime Numbers
Implementation
Examples

Greatest Common Divisor

Properties
Bézout's identity
Extended Euclidean Algorithm
Implementation
Examples (e.g. Solving Linear Diophantine Equation)

Modular Arithmetic

Modular Inverse
Fermat's Little Theorem
Extended Euclidean algorithm
Finding the Modular Inverse for Array of Numbers Modulo any Positive Integer m
Implementation
Examples

harry900831 assigned TimmyChiang

Contributor

harry900831 commented Feb 1, 2023

Maybe spliting "Finding Prime Numbers" to two topics "Sieve of Eratosthenes" and "Sieve of Euler" is better?

Contributor Author

TimmyChiang commented Feb 1, 2023

Maybe spliting "Finding Prime Numbers" to two topics "Sieve of Eratosthenes" and "Sieve of Euler" is better?

Sounds a great idea, I'll revise it.

harry900831 added the proposal label

Contributor

harry900831 commented Jun 27, 2023

@TimmyChiang Are you still planning on adding this topic?

Contributor Author

TimmyChiang commented Jun 27, 2023

Sure, I'll finish it before the end of July.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment