Search Results for ""
1351 - 1360 of 13135 for random number generatorSearch Results
There exists an absolute constant C such that for any positive integer m, the discrepancy of any sequence {alpha_n} satisfies ...
Integer division is division in which the fractional part (remainder) is discarded is called integer division and is sometimes denoted \. Integer division can be defined as ...
As Gauss showed in 1812, the hyperbolic tangent can be written using a continued fraction as tanhx=x/(1+(x^2)/(3+(x^2)/(5+...))) (Wall 1948, p. 349; Olds 1963, p. 138).
A number n with prime factorization n=product_(i=1)^rp_i^(a_i) is called k-almost prime if it has a sum of exponents sum_(i=1)^(r)a_i=k, i.e., when the prime factor ...
The prime number theorem shows that the nth prime number p_n has the asymptotic value p_n∼nlnn (1) as n->infty (Havil 2003, p. 182). Rosser's theorem makes this a rigorous ...
A Smarandache prime is a prime Smarandache number, i.e., a prime number of the form 1234...n. Surprisingly, no Smarandache primes are known as of Nov. 2015. Upper limits on ...
The difference between the measured or inferred value of a quantity x_0 and its actual value x, given by Deltax=x_0-x (sometimes with the absolute value taken) is called the ...
A formal mathematical theory which introduces "components at infinity" by defining a new type of divisor class group of integers of a number field. The divisor class group is ...
In general, an arrangement of objects is simply a grouping of them. The number of "arrangements" of n items is given either by a combination (order is ignored) or permutation ...
The number of ways in which a group of n with weights sum_(i=1)^(n)w_i=1 can change a losing coalition (one with sumw_i<1/2) to a winning one, or vice versa. It was proposed ...
...
View search results from all Wolfram sites (185340 matches)

