Tag: number theory
The math constant e can be computed using the following series (also see this, this and this post): i.e. If we combine every two iterations, we will get something like, If …
December 30, 2012
algorithms, brute force, implementation, javascript, math, programming languages, python, string, tools / utilities, tricks, vbscript
In , the base 62 number conversion to base 10 is implemented. To extend the conversion to arbitrary bases, we can use base 10 as the intermediate base, i.e. …
Base62, like Base10 (decimal), Base16 (hexadecimal), is a number system. Base62 uses 62 possible ASCII letters, 0 – 9, a – z and A – Z, therefore it is often …
The problem is from codeforces: http://www.codeforces.com/problemset/problem/260/A This problem looks difficult at the first glance because of the input ranges are large for the given three integers. Using bruteforce to print …
Fermat Prime Test Algorithm is to check whether a number is prime. It is a probabilistic approach that based on the following observation. . This is also known as …