Search Results for ""

Given integers a and b with close to 2n bits each, the half-GCD of a and b is a 2×2 matrix [u v; u^' v^'] with determinant equal to -1 or 1 such that ua+vb=r and ...

A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

A qubit (or quantum bit) is the analog of a bit for quantum computation. Unlike an ordinary bit, which may only assume two possible values (usually called 0 and 1), a qubit ...

A variation of the method of false position for finding roots which fits the function in question with an exponential.

A square matrix with nonzero elements only on the diagonal and slots horizontally or vertically adjacent the diagonal (i.e., along the subdiagonal and superdiagonal), [a_(11) ...

The Mertens function is the summary function M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function (Mertens 1897; Havil 2003, p. 208). The first few values are 1, 0, ...

The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a ...

Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...

A statistic defined to improve the Kolmogorov-Smirnov test in the tail of a distribution.