Search Results for ""

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...

A statistic defined to improve the Kolmogorov-Smirnov test in the tails.

The probability of getting a positive result for a given test which should produce a positive result.

The positive predictive value is the probability that a test gives a true result for a true statistic. The negative predictive value is the probability that a test gives a ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

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

The divisibility test that an integer is divisible by 9 iff the sum of its digits is divisible by 9.

A sequence of functions {f_n}, n=1, 2, 3, ... is said to be uniformly convergent to f for a set E of values of x if, for each epsilon>0, an integer N can be found such that ...

The determination of a test for the equality of means for two normal distributions with different variances given samples from each. There exists an exact test which, ...