Search Results for ""
1201 - 1210 of 1364 for Pi DigitsSearch Results
Hadamard matrices H_n can be constructed using finite field GF(p^m) when p=4l-1 and m is odd. Pick a representation r relatively prime to p. Then by coloring white ...
A Pierpont prime is a prime number of the form p=2^k·3^l+1. The first few Pierpont primes are 2, 3, 5, 7, 13, 17, 19, 37, 73, 97, 109, 163, 193, 257, 433, 487, 577, 769, ... ...
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 ...
As first shown by Meyer and Ritchie (1967), do-loops (which have a fixed iteration limit) are a special case of while-loops. A function that can be implemented using only ...
The wave equation in prolate spheroidal coordinates is del ...
The reversal of a positive integer abc...z is z...cba. The reversal of a positive integer n is implemented in the Wolfram Language as IntegerReverse[n]. A positive integer ...
A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...
A round number is a number that is the product of a considerable number of comparatively small factors (Hardy 1999, p. 48). Round numbers are very rare. As Hardy (1999, p. ...
The sample variance m_2 (commonly written s^2 or sometimes s_N^2) is the second sample central moment and is defined by m_2=1/Nsum_(i=1)^N(x_i-m)^2, (1) where m=x^_ the ...
A number (usually base 10 unless specified otherwise) which has no digitaddition generator. Such numbers were originally called Colombian numbers (S. 1974). There are ...
...
View search results from all Wolfram sites (264593 matches)

