Search Results for ""

The number (10^(666))!, where 666 is the beast number and n! denotes a factorial. The number has approximately 6.656×10^(668) decimal digits. The number of trailing zeros in ...

The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...

An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...

An odd alternating permutation number, more commonly called an Euler number or secant number.

There are two definitions of the Fermat number. The less common is a number of the form 2^n+1 obtained by setting x=1 in a Fermat polynomial, the first few of which are 3, 5, ...

When ac is divisible by a number b that is relatively prime to a, then c must be divisible by b.

An even alternating permutation number, more commonly called a tangent number.

The disorder number of a simple connected graph on n vertices is defined as the maximum length of a walk along the edges of the graph taken over all ordering of its vertices ...

The number of ways a set of n elements can be partitioned into nonempty subsets is called a Bell number and is denoted B_n (not to be confused with the Bernoulli number, ...

A number N=p_1p_2...p_n where the p_is are distinct primes and n>=3 such that p_i=Ap_(i-1)+B (1) for i=1, 2, ..., n, p_0 taken as 1, and with A and B some fixed integers. For ...