Search Results for ""

A prime partition of a positive integer n>=2 is a set of primes p_i which sum to n. For example, there are three prime partitions of 7 since 7=7=2+5=2+2+3. The number of ...

Find two distinct sets of integers {a_1,...,a_n} and {b_1,...,b_n}, such that for k=1, ..., m, sum_(i=1)^na_i^k=sum_(i=1)^nb_i^k. (1) The Prouhet-Tarry-Escott problem is ...

A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...

The word quadrature has (at least) three incompatible meanings. Integration by quadrature either means solving an integral analytically (i.e., symbolically in terms of known ...

Quantifier elimination is the removal of all quantifiers (the universal quantifier forall and existential quantifier exists ) from a quantified system. A first-order theory ...

In 1913, Ramanujan asked if the Diophantine equation of second order 2^n-7=x^2, sometimes called the Ramanujan-Nagell equation, has any solutions other than n=3, 4, 5, 7, and ...

The word "rank" refers to several related concepts in mathematics involving graphs, groups, matrices, quadratic forms, sequences, set theory, statistics, and tensors. In ...

A repeating decimal, also called a recurring decimal, is a number whose decimal representation eventually becomes periodic (i.e., the same sequence of digits repeats ...

The Riemann-Siegel formula is a formula discovered (but not published) by Riemann for computing an asymptotic formula for the Riemann-Siegel function theta(t). The formula ...

A self-complementary graph is a graph which is isomorphic to its graph complement. The numbers of simple self-complementary graphs on n=1, 2, ... nodes are 1, 0, 0, 1, 2, 0, ...