A simple solution of Simon Newcomb's problem

DOI10.1016/0097-3165(75)90014-XzbMath0305.05006OpenAlexW2016772192MaRDI QIDQ1217127

Morton Abramson

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(75)90014-x

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (5)

Enumeration of permutations by descents, idescents, imajor index, and basic components ⋮ Eulerian numbers, Newcomb's problem and representations of symmetric groups ⋮ Generating permutations with given ups and downs ⋮ A generalization for the expected value of the earth mover's distance ⋮ The (qr)-Simon Newcomb problem

Cites Work

• Extended Bernoulli and Eulerian numbers
• Simon Newcomb’s Problem
• Certain Distributions of Unlike Objects into Cells
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple solution of Simon Newcomb's problem