Search Results for ""
1221 - 1230 of 4154 for Divide whole numbers and integersSearch Results
11 21 3 41 4 7 81 5 11 15 161 6 16 26 31 32 (1) The number triangle illustrated above (OEIS A008949) composed of the partial sums of binomial coefficients, a_(nk) = ...
Clark's triangle is a number triangle created by setting the vertex equal to 0, filling one diagonal with 1s, the other diagonal with multiples of an integer f, and filling ...
Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...
A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...
The Erdős-Borwein constant E, sometimes also denoted alpha, is the sum of the reciprocals of the Mersenne numbers, E = sum_(n=1)^(infty)1/(2^n-1) (1) = ...
Given the Lucas sequence U_n(b,-1) and V_n(b,-1), define Delta=b^2+4. Then an extra strong Lucas pseudoprime to the base b is a composite number n=2^rs+(Delta/n), where s is ...
The expected number of real zeros E_n of a random polynomial of degree n if the coefficients are independent and distributed normally is given by E_n = ...
Let [a_0;a_1,a_2,...] be the simple continued fraction of a "generic" real number, where the numbers a_i are the partial quotients. Then the Khinchin (or Khintchine) harmonic ...
A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...
A set of 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). The numbers ...
...
View search results from all Wolfram sites (72000 matches)

