Search Results for ""

There are many unsolved problems in mathematics. Some prominent outstanding unsolved problems (as well as some which are not necessarily so well known) include 1. The ...

A Brauer chain is an addition chain in which each member uses the previous member as an addend. A number n for which a shortest chain exists which is a Brauer chain is called ...

A multiple of a number x is any quantity y=nx with n an integer. If x and y are integers, then x is called a factor of y. The smallest positive number m for which there exist ...

A test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.

One of the Plücker characteristics, defined by p=1/2(n-1)(n-2)-(delta+kappa)=1/2(m-1)(m-2)-(tau+iota), where m is the class, n the order, delta the number of nodes, kappa the ...

The first quadratic nonresidue mod p of a number is always less than 3(lnp)^2/2 (Wedeniwski 2001).

The identity F_n^4-F_(n-2)F_(n-1)F_(n+1)F_(n+2)=1, where F_n is a Fibonacci number.

If a real algebraic curve has no singularities except nodes and cusps, bitangents, and inflection points, then n+2tau_2^'+iota^'=m+2delta_2^'+kappa^', where n is the order, ...

Any prime number other than 2 (which is the unique even prime). Humorously, 2 is therefore the "oddest" prime.

The number of digits used to perform a given computation. The concepts of accuracy and precision are both closely related and often confused. While the accuracy of a number x ...