This is my collection of various algorithms and data structures that I feel that are needed frequently in competitive programming .
-
Updated
Oct 14, 2019 - C++
This is my collection of various algorithms and data structures that I feel that are needed frequently in competitive programming .
Exercises in Python notebook to implement the RSA encryption algorithm, and figure out if huge numbers are primes via Fermat test. Explanation provided via comments in Japanese.
Algorithms Implementations
This repository contains the materials, python codes for the quiz and some codes implemented using jupyter notebook related to the specialization ( Introduction to Discrete Mathematics In Computer Science)
Analysis notebook on prime numbers
Playing with numbers and their properties 📓 ✏️ 💮 (credit - http://www.numbergossip.com/)
This repository contains the Python code to efficiently generate a list of prime numbers with explanation of the mathematical background
Magma Jupyter notebook to compute the 2-torsion Brauer group of the elliptic surface described in Wittenberg 2004.
This Javafx application is a Java implementation along with Jupyter Notebook of various methods needed for the RSA Cryptography using NUMBER THEORY algorithms
≝ This is my official start to catalog useful non-standard Mathematica utility functions that I find myself repeatedly copy-pasting from notebook session to nb session. By no means exhaustive listing to facilitate number theory and working with generating functions along with other gems I should have organized years ago. ≡
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."