Open AccessThe theory of the compositions of numbers.—Part II
Publication year - 1907
Publication title -
proceedings of the royal society of london. series a, containing papers of a mathematical and physical character
Language(s) - English
Resource type - Journals
eISSN - 2053-9150
pISSN - 0950-1207
DOI - 10.1098/rspa.1907.0003
Subject(s) - heap (data structure) , mathematics , combinatorics , arithmetic , computer science , algorithm
This investigation was recently suggested to the author by Professor Simon Newcomb. A pack of cards is shuffled and then dealt out in succession, the cards being placed in one heap or pack so long as the numbers of pips on them are in ascending order (equality in the numbers of pips counting as ascending order); when there is a break in ascending order, a fresh heap or pack is commenced, and so on.