Search Results for ""

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 ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_n=f(x_n). Then Woolhouse's formulas ...

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 ...

Also known as the Serret-Frenet formulas, these vector differential equations relate inherent properties of a parametrized curve. In matrix form, they can be written [T^.; ...

Let a spherical triangle have sides a, b, and c with A, B, and C the corresponding opposite angles. Then (sin[1/2(a-b)])/(sin(1/2c)) = (sin[1/2(A-B)])/(cos(1/2C)) (1) ...

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, ...

Let s_i be the sum of the products of distinct polynomial roots r_j of the polynomial equation of degree n a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the roots are taken ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...