Search Results for ""

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

An Abelian planar difference set of order n exists only for n a prime power. Gordon (1994) has verified it to be true for n<2000000.

1 and -1 are the only integers which divide every integer. They are therefore called the prime units.

The set of prime numbers, sometimes denoted P (Derbyshire 2004, p. 163), and implemented in the Wolfram Language as Primes. In the Wolfram Language, a quantity can be tested ...

A polytope in n-dimensional Euclidean space R^n whose vertices are integer lattice points but which does not contain any other lattice points in its interior or on its ...

A sequence in which no term divides any other. Let S_n be the set {1,...,n}, then the number of primitive subsets of S_n are 2, 3, 5, 7, 13, 17, 33, 45, 73, 103, 205, 253, ...

In accounting, the principal is the original amount borrowed or lent on which interest is then paid or given. The word "principal" is also used in many areas of mathematics ...

The directions in which the principal curvatures occur.

If a function f has a pole at z_0, then the negative power part sum_(j=-k)^(-1)a_j(z-z_0)^j (1) of the Laurent series of f about z_0 sum_(j=-k)^inftya_j(z-z_0)^j (2) is ...

At each point on a given a two-dimensional surface, there are two "principal" radii of curvature. The larger is denoted R_1, and the smaller R_2. The "principal directions" ...