Search Results for ""

A sequence of numbers V={nu_n} is said to be weakly complete if every positive integer n beyond a certain point N is the sum of some subsequence of V (Honsberger 1985). ...

Every nonempty set of positive integers contains a smallest member.

Constants gamma such that [int_Omega|f|^qdx]^(1/q)<=gamma[int_Omegasum_(i=1)^N|(partialf)/(partialx_i)|^pdx]^(1/p), where f is a real-valued smooth function on a region Omega ...

Pre-Calculus

An infinite sequence of positive integers 1<=b_1<b_2<b_3<..., (1) also called a Sidon sequence, such that all pairwise sums b_i+b_j (2) for i<=j are distinct (Guy 1994). An ...

The Bernoulli distribution is a discrete distribution having two possible outcomes labelled by n=0 and n=1 in which n=1 ("success") occurs with probability p and n=0 ...

The simple continued fraction representations for Catalan's constant K is [0, 1, 10, 1, 8, 1, 88, 4, 1, 1, ...] (OEIS A014538). A plot of the first 256 terms of the continued ...

The circle map is a one-dimensional map which maps a circle onto itself theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n), (1) where theta_(n+1) is computed mod 1 and K is a ...

A sequence of primes q_1<q_2<...<q_k is a Cunningham chain of the first kind (second kind) of length k if q_(i+1)=2q_i+1 (q_(i+1)=2q_i-1) for i=1, ..., k-1. Cunningham primes ...

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...