首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The expected number of parts in a partition ofn
Authors:Prof I Kessler  Prof M Livingston
Institution:(1) Southern Illinois University, 62026 Edwardsville, IL, USA
Abstract:Forn a positive integer letp(n) denote the number of partitions ofn into positive integers and letp(n,k) denote the number of partitions ofn into exactlyk parts. Let 
$$P(n) = \sum\limits_{k = 1}^\infty  {kp(n,k)} $$
, thenP(n) represents the total number of parts in all the partitions ofn. In this paper we obtain the following asymptotic formula for 
$${{P(n)} \mathord{\left/ {\vphantom {{P(n)} {p(n)}}} \right. \kern-\nulldelimiterspace} {p(n)}}:{{P(n)} \mathord{\left/ {\vphantom {{P(n)} {p(n)}}} \right. \kern-\nulldelimiterspace} {p(n)}} = \sqrt {{{3n} \mathord{\left/ {\vphantom {{3n} {2\pi }}} \right. \kern-\nulldelimiterspace} {2\pi }}} (\log n + 2\gamma  - \log {\pi  \mathord{\left/ {\vphantom {\pi  6}} \right. \kern-\nulldelimiterspace} 6}) + 0(\log ^3 n).$$
.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号