Search Results for ""
211 - 220 of 1152 for Greatest Common DivisorSearch Results
There are a number of attractive polyhedron compounds consisting of six octahedra. The two illustrated above can be constructed as the duals of cube 6-compounds. These ...
There are a number of attractive polyhedron compounds consisting of seven octahedra. The compound illustrated above can be constructed as the dual of cube 7-compound. The ...
There are a number of attractive polyhedron compounds consisting of nine octahedra. The compound illustrated above can be constructed as the dual of cube 9-compound. The ...
A number of attractive 18-compounds of the regular tetrahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...
A number of attractive 50-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...
Dickson (1913, 2005) defined an amicable triple to be a triple of three numbers (l,m,n) such that s(l) = m+n (1) s(m) = l+n (2) s(n) = l+m, (3) where s(n) is the restricted ...
Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...
Highly composite numbers are numbers such that divisor function d(n)=sigma_0(n) (i.e., the number of divisors of n) is greater than for any smaller n. Superabundant numbers ...
Following Yates (1980), a prime p such that 1/p is a repeating decimal with decimal period shared with no other prime is called a unique prime. For example, 3, 11, 37, and ...
Bourque and Ligh (1992) conjectured that the least common multiple matrix on a GCD-closed set S is nonsingular. This conjecture was shown to be false by Haukkanen et al. ...
...
View search results from all Wolfram sites (8657 matches)

