Search Results for ""

Hoffman (1998, p. 90) calls the sum of the exponents in the prime factorization of a number its roundness. The first few values for n=1, 2, ... are 0, 1, 1, 2, 1, 2, 1, 3, 2, ...

The exponent of the largest power of 2 which divides a given number 2n. The values of the ruler function for n=1, 2, ..., are 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, ... (OEIS A001511).

In statistics, sampling is the selection and implementation of statistical observations in order to estimate properties of an underlying population. Sampling is a vital part ...

A partial solution to the Erdős squarefree conjecture which states that the binomial coefficient (2n; n) is never squarefree for all sufficiently large n>=n_0. Sárkőzy (1985) ...

A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...

There exists a positive integer s such that every sufficiently large integer is the sum of at most s primes. It follows that there exists a positive integer s_0>=s such that ...

Let the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...

An algorithm for determining the order of an elliptic curve E/F_p over the finite field F_p.

The score function u(theta) is the partial derivativeof the log-likelihood function F(theta)=lnL(theta), where L(theta) is the standard likelihood function. Defining the ...

11 21 8 61 22 58 241 52 328 444 1201 114 1452 4400 3708 7201 240 5610 32120 58140 33984 5040 (1) The second-order Eulerian triangle (OEIS A008517) is the number triangle ...