Search Results for ""

The golden triangle, sometimes also called the sublime triangle, is an isosceles triangle such that the ratio of the hypotenuse a to base b is equal to the golden ratio, ...

The Gram series is an approximation to the prime counting function given by G(x)=1+sum_(k=1)^infty((lnx)^k)/(kk!zeta(k+1)), (1) where zeta(z) is the Riemann zeta function ...

Any method which solves a problem by generating suitable random numbers and observing that fraction of the numbers obeying some property or properties. The method is useful ...

A set n distinct numbers taken from the interval [1,n^2] form a magic series if their sum is the nth magic constant M_n=1/2n(n^2+1) (Kraitchik 1942, p. 143). If the sum of ...

The base 8 notational system for representing real numbers. The digits used are 0, 1, 2, 3, 4, 5, 6, and 7, so that 8_(10) (8 in base 10) is represented as 10_8 ...

For every positive integer n, there is a unique finite sequence of distinct nonconsecutive (not necessarily positive) integers k_1, ..., k_m such that ...

Let Sigma(n)=sum_(i=1)^np_i (1) be the sum of the first n primes (i.e., the sum analog of the primorial function). The first few terms are 2, 5, 10, 17, 28, 41, 58, 77, ... ...

A prime triplet is a prime constellation of the form (p, p+2, p+6), (p, p+4, p+6), etc. Hardy and Wright (1979, p. 5) conjecture, and it seems almost certain to be true, that ...

Quasi-Monte Carlo integration is a method of numerical integration that operates in the same way as Monte Carlo integration, but instead uses sequences of quasirandom numbers ...

The rational distance problem asks to find a geometric configuration satisfying given properties such that all distances along specific edges are rational numbers. (This is ...