Exploratory work inspired by Numberphile video on multiplicative persistence
-
Updated
Dec 20, 2020 - Python
Exploratory work inspired by Numberphile video on multiplicative persistence
A library of various algorithms used in number theory and group theory
Sieving primes and counting primes
Prime number computations and exploratory analysis
Code for the Number theory course at OU
🔥Progress over Projet Euler.
This project explores and implements various techniques and protocols using SageMath. It covers topics such as Elliptic Curve Diffie-Hellman (ECDH) key exchange, homomorphic encryption, secure multi-party computation (MPC), queueing theory analysis, and RSA cryptanalysis.
This project tackles the RSA Factoring Challenge, which aims to identify two prime factors 'p' and 'q' of a given number 'n' efficiently and quickly.
Solution to HackerRank "littlepandapower" problem in mathematics/Number Theory section
Programmes calculant des séries de nombres.
A collection of cryptographic algorithms
A Python implementation of the Helfgott-Thompson algorithm for computing the Mertens function.
Time and trigonometric based Pseudo-Random Number Generator using Python.
I'm exploring odd perfect roots and algorithms for their efficient computation.
An implementation of some mathematics of "Class group of Positive-definite Binary Quadratic Forms" in Python 3
Add a description, image, and links to the number-theory topic page so that developers can more easily learn about it.
To associate your repository with the number-theory topic, visit your repo's landing page and select "manage topics."