TOPICS
Search

Search Results for ""


1301 - 1310 of 5453 for Numbered Equation 10Search Results
Due to Euler's prolific output, there are a great number of theorems that are know by the name "Euler's theorem." A sampling of these are Euler's displacement theorem for ...
A continuous real function L(x,y) defined on the tangent bundle T(M) of an n-dimensional smooth manifold M is said to be a Finsler metric if 1. L(x,y) is differentiable at ...
Let F(n,sigma) denote the number of permutations on the symmetric group S_n which avoid sigma in S_k as a subpattern, where "tau contains sigma as a subpattern" is ...
A riffle shuffle, also called the Faro shuffle, is a shuffle in which a deck of 2n cards is divided into two halves. The top half of the deck is placed in the left hand, and ...
The forward difference is a finite difference defined by Deltaa_n=a_(n+1)-a_n. (1) Higher order differences are obtained by repeated operations of the forward difference ...
A number of attractive cube 10-compounds can be constructed. The first can be obtained by beginning with an initial cube and rotating it by an angle theta=sin^(-1)(sqrt(3/8)) ...
The base-12 number system composed of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B. Such a system has been advocated by no less than Herbert Spencer, John Quincy Adams, and ...
There are a number of tilings of various shapes by all the 12 order n=6 polyiamonds, summarized in the following table. Several of these (starred in the table below) are also ...
Given a sequence of values {a_k}_(k=1)^n, the high-water marks are the values at which the running maximum increases. For example, given a sequence (3,5,7,8,8,5,7,9,2,5) with ...
The odd divisor function sigma_k^((o))(n)=sum_(d|n; d odd)d^k (1) is the sum of kth powers of the odd divisors of a number n. It is the analog of the divisor function for odd ...
1 ... 128|129|130|131|132|133|134 ... 546 Previous Next

...