Search Results for ""

For an integer n>=2, let lpf(n) denote the least prime factor of n. A pair of integers (x,y) is called a twin peak if 1. x<y, 2. lpf(x)=lpf(y), 3. For all z, x<z<y implies ...

A Wagstaff prime is a prime number of the form (2^p+1)/3 for p a prime number. The first few are given by p=3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

Zeno's paradoxes are a set of four paradoxes dealing with counterintuitive aspects of continuous space and time. 1. Dichotomy paradox: Before an object can travel a given ...

The abc conjecture is a conjecture due to Oesterlé and Masser in 1985. It states that, for any infinitesimal epsilon>0, there exists a constant C_epsilon such that for any ...

An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

One form of van der Waerden's theorem states that for all positive integers k and r, there exists a constant n(r,k) such that if n_0>=n(r,k) and {1,2,...,n_0} subset C_1 ...

Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...

Given a group of n men arranged in a circle under the edict that every mth man will be executed going around the circle until only one remains, find the position L(n,m) in ...