Search Results for ""

A Fermat prime is a Fermat number F_n=2^(2^n)+1 that is prime. Fermat primes are therefore near-square primes. Fermat conjectured in 1650 that every Fermat number is prime ...

Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...

An Euler number prime is an Euler number E_n such that the absolute value |E_n| is prime (the absolute value is needed since E_n takes on alternating positive and negative ...

A noble number nu is defined as an irrational number having a continued fraction that becomes an infinite sequence of 1s at some point, nu=[0,a_1,a_2,...,a_n,1^_]. The ...

The nth cubic number n^3 is a sum of n consecutive odd numbers, for example 1^3 = 1 (1) 2^3 = 3+5 (2) 3^3 = 7+9+11 (3) 4^3 = 13+15+17+19, (4) etc. This identity follows from ...

Consider the length of the diagonal of a unit square as approximated by piecewise linear steps that may only be taken in the right and up directions. Obviously, the length so ...

A power series sum^(infty)c_kx^k will converge only for certain values of x. For instance, sum_(k=0)^(infty)x^k converges for -1<x<1. In general, there is always an interval ...

In machine learning theory, the Vapnik-Chervonenkis dimension or VC-dimension of a concept class C is the cardinality of the largest set S which can be shattered by C. If ...

For an integer n>=2, let gpf(x) denote the greatest prime factor of n, i.e., the number p_k in the factorization n=p_1^(a_1)...p_k^(a_k), with p_i<p_j for i<j. For n=2, 3, ...

Let a number n be written in binary as n=(epsilon_kepsilon_(k-1)...epsilon_1epsilon_0)_2, (1) and define b_n=sum_(i=0)^(k-1)epsilon_iepsilon_(i+1) (2) as the number of digits ...