Search Results for ""

Define a Bouniakowsky polynomial as an irreducible polynomial f(x) with integer coefficients, degree >1, and GCD(f(1),f(2),...)=1. The Bouniakowsky conjecture states that ...

A prime number p is called circular if it remains prime after any cyclic permutation of its digits. An example in base-10 is 1,193 because 1,931, 9,311, and 3,119 are all ...

A pair of elements (p_i,p_j) is called an inversion in a permutation p if i>j and p_i<p_j (Skiena 1990, p. 27; Pemmaraju and Skiena 2003, p. 69). For example, in the ...

In Moralia, the Greek biographer and philosopher Plutarch states "Chrysippus says that the number of compound propositions that can be made from only ten simple propositions ...

A prime power is a prime or integer power of a prime. A test for a number n being a prime is implemented in the Wolfram Language as PrimePowerQ[n]. The first few prime powers ...

The transformation S[{a_n}_(n=0)^N] of a sequence {a_n}_(n=0)^N into a sequence {b_n}_(n=0)^N by the formula b_n=sum_(k=0)^NS(n,k)a_k, (1) where S(n,k) is a Stirling number ...

The number obtained by adding the reciprocals of the odd twin primes, B=(1/3+1/5)+(1/5+1/7)+(1/(11)+1/(13))+(1/(17)+1/(19))+.... (1) By Brun's theorem, the series converges ...

The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...

The Hadwiger-Nelson problem asks for the chromatic number of the plane, i.e., the minimum number of colors needed to color the plane if no two points at unit distance one ...

Abstract algebra is the set of advanced topics of algebra that deal with abstract algebraic structures rather than the usual number systems. The most important of these ...