Search Results for ""
441 - 450 of 918 for product allowanceSearch Results
Let P be the set of primes, and let Q_p and Z_p(t) be the fields of p-adic numbers and formal power series over Z_p=(0,1,...,p-1). Further, suppose that D is a "nonprincipal ...
product_(k=1)^(infty)(1-x^k) = sum_(k=-infty)^(infty)(-1)^kx^(k(3k+1)/2) (1) = 1+sum_(k=1)^(infty)(-1)^k[x^(k(3k-1)/2)+x^(k(3k+1)/2)] (2) = (x)_infty (3) = ...
Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...
The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...
Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative ...
The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...
A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...
The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...
A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...
The Engel expansion, also called the Egyptian product, of a positive real number x is the unique increasing sequence {a_1,a_2,...} of positive integers a_i such that ...
...
View search results from all Wolfram sites (161096 matches)

