Billingsley’s theorem states that the normalized logarithms of the prime factors of a uniform random integer in converge to the Poisson–Dirichlet law , while weighting an integer by the generalized divisor function gives . We ask what remains of this picture when the integer is also rewarded according to its largest prime factor . For fixed and , we sample with probability proportional to , where for , while and for . Two phase transitions occur. At the partition survives, whereas every fixed forces one prime to carry asymptotically all logarithmic mass. The second transition, at , concerns the cofactor . With , its law is asymptotic in total variation to . Thus, for , has a limit, with shape and rate one, and the normalized logarithmic prime factors of have an independent limit; at , has a nondegenerate discrete limit; and for , with high probability. We also determine the joint limits involving and the normalizing constants, which include the classical Alladi–Erdős asymptotic as a special case.

生成讲解博客的中文版本

生成AI智能校验的中文版本