Search Results for ""

Place a point somewhere on a line segment. Now place a second point and number it 2 so that each of the points is in a different half of the line segment. Continue, placing ...

The smallest positive composite number and the first even perfect square. Four is the smallest even number appearing in a Pythagorean triple: 3, 4, 5. In the numerology of ...

The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...

The smallest composite squarefree number (2·3), and the third triangular number (3(3+1)/2). It is the also smallest perfect number, since 6=1+2+3. The number 6 arises in ...

65537 is the largest known Fermat prime, and the 65537-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. The 65537-gon has so many ...

An infinite sequence of positive integers a_i satisfying 1<=a_1<a_2<a_3<... (1) is an A-sequence if no a_k is the sum of two or more distinct earlier terms (Guy 1994). Such ...

The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...

The following integral transform relationship, known as the Abel transform, exists between two functions f(x) and g(t) for 0<alpha<1, f(x) = int_0^x(g(t)dt)/((x-t)^alpha) (1) ...

An abstract vector space of dimension n over a field k is the set of all formal expressions a_1v_1+a_2v_2+...+a_nv_n, (1) where {v_1,v_2,...,v_n} is a given set of n objects ...

The abundance of a number n, sometimes also called the abundancy (a term which in this work, is reserved for a different but related quantity), is the quantity ...