Python implementation of Quadratic Sieve Algorithm.

A compilation of mathematical functions and algorithms

All interview question.

This Repository contains all the works done in the activities and the competitions of competitive programming cell.

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.

Google Extensions Compilation (Crypto, Recon, Encryption, Discovery)

Programa feito em Python para exibir quantos e quais são os números primos entre 1 e um número n dado.

This contains basic codes related to various data structures likes graphs ,trees etc.

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 ev…

Lista - Matemática Discreta

My Codeforces handle is hobe_naki_hobe_na. Max Rating is 1647

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.

A C++ rational (fraction) template class

Solutions for problems posted on the projecteuler.net website

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

A collection of number-theoretic algorithms in Haskell. It features an optimised sieve of Eratosthenes that relies on coprime embeddings.

everyday algorithms

Math, algorithm, and data structure problems and solutions (http://codeforces.com/)