Runnable code for solving Project Euler problems in Java, Python, Mathematica, Haskell.
-
Updated
May 26, 2024 - Java
Runnable code for solving Project Euler problems in Java, Python, Mathematica, Haskell.
Collection of muliple computer science related Lab programs and projects.
☕ Java Algorithms Implementation
Functionalities for checking over 50+ types of numbers
Implementation of library dedicated for p-adic numbers computation with basic operations in java.
Discrete Mathematics Applications
A calculator that allows the user to quickly perform various algorithms used in a basic Number Theory class: construct Index(A) chart, check relative prime or prime, successive squaring, the euclidean algorithm,etc.
Functionalities for checking over 50+ types of numbers
Solutions to problems on projecteuler.net
Coding Implementation Of Algorithms By Catagory
Finds the 1st - 30 000th prime number under 1 minute using the Sieve of Eratosthenes
Practice problems of DSA from LeetCode and GeeksForGeeks platforms.
My Project Euler code, in Java
Number Theory Fun(damentals) - based on the Novel "Number Theory"(1st Dover Ed.) by George E. Andrews. Formerly Project 0 for Revature Training.
This project contains the implementation of some algorithms and results from the Number Theory course.
A simple library with diverse tools for different mathematical needs.
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."