Annals of Combinatorics.
ISSN/ISBN: Not available at this time. DOI: 10.1007/s00026-024-00728-9
Abstract: It is known that the plane partition function of n denoted PL(n) obeys Benford’s law in any integer base b ≥ 2. We give an upper bound for the smallest positive integer n such that PL(n) starts with a prescribed string f of digits in base b.
Bibtex:
@article{,
author = {Florian Luca},
title = {On a Problem of Douglass and Ono for the Plane Partition Function},
year = {2024},
journal = {Annals of Combinatorics},
doi = {10.1007/s00026-024-00728-9},
url = {https://link.springer.com/article/10.1007/s00026-024-00728-9},
}
Reference Type: Journal Article
Subject Area(s): Number Theory, Numerical Analysis