The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 26972593−1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2p−1, have been found which contain more digits. However, in 2004 there was found a …
A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before. For example, 44 → 32 → 13 → 10 → 1 → 1 85 → 89 → 145 → 42 → 20 → 4 → 16 → 37 …
A googol (10100) is a massive number: one followed by one-hundred zeros; 100100 is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1. Considering natural numbers of the form, ab, where a, b < 100, what is the maximum digital sum? …
This program generates 25 polynomials of increasing degree randomly using a Mersenne twister, solves them via Horner’s rule and records runtime. /////////////////////////////////////////////////////////////////////////////// #include <iostream> #include <vector> #include <random> #include <iomanip> #include <chrono> /////////////////////////////////////////////////////////////////////////////// std::vector<int> randIntGen(int count); float randRealGen(void); void polyPrint(float x, std::vector<int> polyVals); void hornersRuleTime(float x, int n, std::vector<int> polyVals); …