About the Project

of integers

AdvancedHelp

(0.004 seconds)

21—30 of 562 matching pages

21: 24.17 Mathematical Applications
Let 0 h 1 and a , m , and n be integers such that n > a , m > 0 , and f ( m ) ( x ) is absolutely integrable over [ a , n ] . …
24.17.1 j = a n 1 ( 1 ) j f ( j + h ) = 1 2 k = 0 m 1 E k ( h ) k ! ( ( 1 ) n 1 f ( k ) ( n ) + ( 1 ) a f ( k ) ( a ) ) + R m ( n ) ,
Let 𝒮 n denote the class of functions that have n 1 continuous derivatives on and are polynomials of degree at most n in each interval ( k , k + 1 ) , k . …
24.17.4 S n ( k ) = ( 1 ) k , k .
24.17.6 M n ( k ) = 0 , k .
22: 24.4 Basic Properties
24.4.7 k = 1 m k n = B n + 1 ( m + 1 ) B n + 1 n + 1 ,
24.4.8 k = 1 m ( 1 ) m k k n = E n ( m + 1 ) + ( 1 ) m E n ( 0 ) 2 .
24.4.9 k = 0 m 1 ( a + d k ) n = d n n + 1 ( B n + 1 ( m + a d ) B n + 1 ( a d ) ) ,
24.4.18 B n ( m x ) = m n 1 k = 0 m 1 B n ( x + k m ) .
24.4.20 E n ( m x ) = m n k = 0 m 1 ( 1 ) k E n ( x + k m ) , m = 1 , 3 , 5 , .
23: 26.11 Integer Partitions: Compositions
§26.11 Integer Partitions: Compositions
A composition is an integer partition in which order is taken into account. …The integer 0 is considered to have one composition consisting of no parts: …
26.11.4 n = 0 c m ( n ) q n = q m ( 1 q ) m .
24: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
These are given by the following equations in which a 1 , a 2 , , a n are nonnegative integers such that …
26.4.4 m = a 1 + a 2 + + a n .
λ is a partition of n :
26.4.5 λ = 1 a 1 , 2 a 2 , , n a n .
where the summation is over all nonnegative integers n 1 , n 2 , , n k such that n 1 + n 2 + + n k = n . …
25: 24.5 Recurrence Relations
24.5.1 k = 0 n 1 ( n k ) B k ( x ) = n x n 1 , n = 2 , 3 , ,
24.5.2 k = 0 n ( n k ) E k ( x ) + E n ( x ) = 2 x n , n = 1 , 2 , .
24.5.3 k = 0 n 1 ( n k ) B k = 0 , n = 2 , 3 , ,
24.5.4 k = 0 n ( 2 n 2 k ) E 2 k = 0 , n = 1 , 2 , ,
24.5.5 k = 0 n ( n k ) 2 k E n k + E n = 2 .
26: 26.2 Basic Definitions
If the set consists of the integers 1 through n , a permutation σ can be thought of as a rearrangement of these integers where the integer in position j is σ ( j ) . … If, for example, a permutation of the integers 1 through 6 is denoted by 256413 , then the cycles are ( 1 , 2 , 5 ) , ( 3 , 6 ) , and ( 4 ) . … A lattice path is a directed path on the plane integer lattice { 0 , 1 , 2 , } × { 0 , 1 , 2 , } . … A partition of a nonnegative integer n is an unordered collection of positive integers whose sum is n . … The integers whose sum is n are referred to as the parts in the partition. …
27: 34.1 Special Notation
2 j 1 , 2 j 2 , 2 j 3 , 2 l 1 , 2 l 2 , 2 l 3 nonnegative integers.
r , s , t nonnegative integers.
34.1.1 ( j 1 m 1 j 2 m 2 | j 1 j 2 j 3 m 3 ) = ( 1 ) j 1 j 2 + m 3 ( 2 j 3 + 1 ) 1 2 ( j 1 j 2 j 3 m 1 m 2 m 3 ) ;
28: 1.1 Special Notation
x , y real variables.
j , k , integers.
m , n nonnegative integers, unless specified otherwise.
29: 4.22 Infinite Products and Partial Fractions
4.22.1 sin z = z n = 1 ( 1 z 2 n 2 π 2 ) ,
4.22.2 cos z = n = 1 ( 1 4 z 2 ( 2 n 1 ) 2 π 2 ) .
When z n π , n ,
4.22.3 cot z = 1 z + 2 z n = 1 1 z 2 n 2 π 2 ,
4.22.4 csc 2 z = n = 1 ( z n π ) 2 ,
30: 4.36 Infinite Products and Partial Fractions
4.36.1 sinh z = z n = 1 ( 1 + z 2 n 2 π 2 ) ,
4.36.2 cosh z = n = 1 ( 1 + 4 z 2 ( 2 n 1 ) 2 π 2 ) .
When z n π i , n ,
4.36.3 coth z = 1 z + 2 z n = 1 1 z 2 + n 2 π 2 ,
4.36.4 csch 2 z = n = 1 ( z n π i ) 2 ,