Search Results for ""

Aleph-1 is the set theory symbol aleph_1 for the smallest infinite set larger than aleph_0 (Aleph-0), which in turn is equal to the cardinal number of the set of countable ...

Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...

The essential supremum is the proper generalization to measurable functions of the maximum. The technical difference is that the values of a function on a set of measure zero ...

A friendly number is a number that is a member of a friendly pair or a higher-order friendly n-tuple. Numbers that are not friendly are said to be solitary. There are some ...

Successive points dividing a golden rectangle into squares lie on a logarithmic spiral (Wells 1991, p. 39; Livio 2002, p. 119) which is sometimes known as the golden spiral. ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

An ordinal number is called an initial ordinal if every smaller ordinal has a smaller cardinal number (Moore 1982, p. 248; Rubin 1967, p. 271). The omega_alphas ordinal ...

A semiprime which English economist and logician William Stanley Jevons incorrectly believed no one else would be able to factor. According to Jevons (1874, p. 123), "Can the ...

Let theta be an irrational number, define S(theta)={c+dtheta:c,d in N}, and let c_n(theta)+thetad_n(theta) be the sequence obtained by arranging the elements of S(theta) in ...

Infinite series of various simple functions of the logarithm include sum_(k=1)^^^inftylnk = 1/2ln(2pi) (1) sum_(k=1)^^^infty(-1)^klnk = 1/2ln(1/2pi) (2) ...