numbertheory
There are 1 repository under numbertheory topic.
NachiketUN / Quadratic-Sieve-Algorithm
Python implementation of Quadratic Sieve Algorithm.
Language:Python 16- Language:C++ 8
farruhha / codeforces
Math, algorithm, and data structure problems and solutions (http://codeforces.com/)
Language:Java 3igorvanloo / mathslib
A compilation of mathematical functions and algorithms
Language:Python 2- Language:C++ 2
- Language:C++ 2
gulshanyadav01 / DataStructures-Algorithms
All interview question.
Language:C++ 1777388 / Pitheory
explore the upside down pi, the nondeterministic pi, the associative pi, the afterpi
Language:Python 0- Language:JavaScript 0
anupamasridhar / Mersenne
This program uses Java in order to check if a number is a Mersenne Prime. A Mersenne Prime is defined as a number that can be written as M(n) = 2n − 1 for an integer n.
0- Language:JavaScript 0
hpavelar / NumerosPrimos_Python
Programa feito em Python para exibir quantos e quais são os números primos entre 1 e um número n dado.
Language:Python 0iamsouhail / TrainingSessions
This Repository contains all the works done in the activities and the competitions of competitive programming cell.
Language:C++ 0kvn13github / Emirp-Prime-Number-3D-Plotter
Emirp prime numbers are primes that can are primes in both directions you read the digits, for example 13 and 31. This script asks a range between two numbers, and then depending on the versions prints a list, a 2D plot, or a multithread rendered 3D plot.
Language:Python 0Mahibulhassan / Algorithms
Implementation All Kind of Algorithm .. Such as..... Back-traking,Dinamic Progra, FBS,DFS,Number theory,Search Algorithm,Diakastra,Floyed Warshal,Hamiltonpath,KMP,Longest Common Subsequence,Robin Cup Pattern Maching,Selection Sort
Language:C++ 0MNNIT-CC / 2017-2018
This Repository will contain all questions and codes pertaining to CC 2017-2018 classes
0mserbedzija / gauss
A collection of number-theoretic algorithms in Haskell. It features an optimised sieve of Eratosthenes that relies on coprime embeddings.
Language:Haskell 0phos-dev / numbertheory
Lista - Matemática Discreta
Language:C 0Pratyush-Gupta / Data-Structures-Algorithms-Sample
This contains basic codes related to various data structures likes graphs ,trees etc.
Language:C 0ps78 / ProjectEuler
Solutions for problems posted on the projecteuler.net website
Language:C# 0Raghuram07 / Project-Euler-Programs
Here i'm filling the programs from project euler.
0- Language:C++ 0
zihanabedin1999 / Codeforces-Problems-Solution
My Codeforces handle is hobe_naki_hobe_na. Max Rating is 1647
Language:C++ 0anuragsarkar97 / hailey
everyday algorithms
Language:PythonHarshavardhanK / Collatz-Conjecture
The conjecture can be summarized as follows. Take any positive integer n. If n is even, divide it by 2 to get n / 2. If n is odd, multiply it by 3 and add 1 to obtain 3n + 1. Repeat the process (which has been called "Half Or Triple Plus One", or HOTPO) indefinitely. The conjecture is that no matter what number you start with, you will always eventually reach 1.
Language:C++- Language:C
Samdney / paper-collatz
Paper: "About the proof of the Collatz conjecture", Status: Eprint: arXiv:1303.2073, id: paper_0001
Language:TeX
