Search Results for ""

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

1000=10^3. The word "thousand" appears in common expressions in a number of languages, for example, "a thousand pardons" in English and "tusen takk" ("a thousand thanks") in ...

The application of characteristic p methods in commutative algebra, which is a synthesis of some areas of commutative algebra and algebraic geometry.

The triangle space T is the set of triples (a,b,c) of real numbers that are side lengths of a (Euclidean) triangle, i.e., T={(a,b,c):0<a<b+c,0<b<c+a,0<c<a+b} (Kimberling ...

For a given bounded function f(x) over a partition of a given interval, the upper sum is the sum of box areas M^*Deltax_k using the supremum M of the function f(x) in each ...

One of the seven 4-polyhexes. S. Kim has observed that four worms solve the puzzle of finding a non-three-colorable map with only four congruent countries (as long as no ...

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...

Any composite number n with p|(n/p-1) for all prime divisors p of n. n is a Giuga number iff sum_(k=1)^(n-1)k^(phi(n))=-1 (mod n) (1) where phi is the totient function and ...

Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number ...