Search Results for ""

A strange loop is a phenomenon in which, whenever movement is made upwards or downwards through the levels of some hierarchical system, the system unexpectedly arrives back ...

The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...

Let C be a curve, let O be a fixed point (the pole), and let O^' be a second fixed point. Let P and P^' be points on a line through O meeting C at Q such that P^'Q=QP=QO^'. ...

A subset is a portion of a set. B is a subset of A (written B subset= A) iff every member of B is a member of A. If B is a proper subset of A (i.e., a subset other than the ...

A sum-product number is a number n such that the sum of n's digits times the product of n's digit is n itself, for example 135=(1+3+5)(1·3·5). (1) Obviously, such a number ...

The n-sunlet graph is the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n (ISGCI), i.e., the coronas C_n circledot K_1 (Frucht 1979). Sunlet ...

An integer n such that 3n^3 contains three consecutive 3s in its decimal representation is called a super-3 number. The first few super-3 numbers are 261, 462, 471, 481, 558, ...

A number n such that sigma^2(n)=sigma(sigma(n))=2n, where sigma(n) is the divisor function is called a superperfect number. Even superperfect numbers are just 2^(p-1), where ...

There are two definitions of the supersingular primes: one group-theoretic, and the other number-theoretic. Group-theoretically, let Gamma_0(N) be the modular group Gamma0, ...

The supremum is the least upper bound of a set S, defined as a quantity M such that no member of the set exceeds M, but if epsilon is any positive quantity, however small, ...