Search Results for ""

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...

The Moscow-Soicher graph is a weakly regular graph on 672 vertices with parameters (nu,k,lambda,mu)=(672,110,28,(0,18)). It is distance-regular but not distance-transitive ...

The multinomial coefficients (n_1,n_2,...,n_k)!=((n_1+n_2+...+n_k)!)/(n_1!n_2!...n_k!) (1) are the terms in the multinomial series expansion. In other words, the number of ...

An n-digit number that is the sum of the nth powers of its digits is called an n-narcissistic number. It is also sometimes known as an Armstrong number, perfect digital ...

The functions theta_s(u) = (H(u))/(H^'(0)) (1) theta_d(u) = (Theta(u+K))/(Theta(k)) (2) theta_c(u) = (H(u))/(H(K)) (3) theta_n(u) = (Theta(u))/(Theta(0)), (4) where H(u) and ...

Samuel Pepys wrote Isaac Newton a long letter asking him to determine the probabilities for a set of dice rolls related to a wager he planned to make. Pepys asked which was ...

A nialpdrome is a number whose hexadecimal digits are in nonincreasing order. The first few are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 32, 33, 34, 48, 49, ...

A generalization of the polylogarithm function defined by S_(n,p)(z)=((-1)^(n+p-1))/((n-1)!p!)int_0^1((lnt)^(n-1)[ln(1-zt)]^p)/tdt. The function reduces to the usual ...

A notation is a set of well-defined rules for representing quantities and operations with symbols.

nu(x) = int_0^infty(x^tdt)/(Gamma(t+1)) (1) nu(x,alpha) = int_0^infty(x^(alpha+t)dt)/(Gamma(alpha+t+1)), (2) where Gamma(z) is the gamma function (Erdélyi et al. 1981, p. ...