Euler's partition theorem and the combinatorics of -sequences
Euler's partition theorem and the combinatorics of -sequences
Euler's partition theorem and the combinatorics of -sequences
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
The insertion step<br />
To insert a k + a k−1 into (λ 1 , λ 2 , λ 3 , λ 4 , . . .) ei<strong>the</strong>r do<br />
(i) (λ 1 + a k , λ 2 + a k−1 , λ 3 , λ 4 , . . .)<br />
or<br />
(ii) (λ 1 + (a k − a k−1 ), λ 2 + (a k−1 − a k−2 ),<br />
insert (a k−1 + a k−2 )into(λ 3 , λ 4 , . . .))<br />
How to decide?<br />
Do (ii) if <strong>the</strong> ratio <strong>of</strong> first two parts is okay, o<strong>the</strong>rwise do (i).