Abstract
AbstractIt is known that the plane partition function of n denoted $$\textrm{PL}(n)$$ PL ( n ) obeys Benford’s law in any integer base $$b\ge 2$$ b ≥ 2 . We give an upper bound for the smallest positive integer n such that $$\textrm{PL}(n)$$ PL ( n ) starts with a prescribed string f of digits in base b.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
