Solutions for problems posted on the projecteuler.net website

Website for solving problems on number-theoretic methods of cryptography

All interview question.

explore the upside down pi, the nondeterministic pi, the associative pi, the afterpi

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

A compilation of mathematical functions and algorithms

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.

Python implementation of Quadratic Sieve Algorithm.

Here i'm filling the programs from project euler.

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.

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.

Lista - Matemática Discreta

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.

everyday algorithms

A C++ rational (fraction) template class

Paper: "About the proof of the Collatz conjecture", Status: Eprint: arXiv:1303.2073, id: paper_0001