Search Results for ""

The cuban primes, named after differences between successive cubic numbers, have the form n^3-(n-1)^3. The first few are 7, 19, 37, 61, 127, 271, ... (OEIS A002407), which ...

Let Sigma(n)=sum_(i=1)^np_i (1) be the sum of the first n primes (i.e., the sum analog of the primorial function). The first few terms are 2, 5, 10, 17, 28, 41, 58, 77, ... ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

A Banach space X is called prime if each infinite-dimensional complemented subspace of X is isomorphic to X (Lindenstrauss and Tzafriri 1977). Pełczyński (1960) proved that ...

For an integer n>=2, let gpf(x) denote the greatest prime factor of n, i.e., the number p_k in the factorization n=p_1^(a_1)...p_k^(a_k), with p_i<p_j for i<j. For n=2, 3, ...

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

An irreducible algebraic integer which has the property that, if it divides the product of two algebraic integers, then it divides at least one of the factors. 1 and -1 are ...

A prime p for which 1/p has a maximal period decimal expansion of p-1 digits. Full reptend primes are sometimes also called long primes (Conway and Guy 1996, pp. 157-163 and ...

The prime zeta function P(s)=sum_(p)1/(p^s), (1) where the sum is taken over primes is a generalization of the Riemann zeta function zeta(s)=sum_(k=1)^infty1/(k^s), (2) where ...

A Smarandache-Wellin number that is prime is known as a Smarandache-Wellin prime. Concatenations of the first n=1, 2, 4, 128, 174, 342, 435, 1429 (OEIS A046035; Ibstedt 1998, ...