二项式系数与未约Farey分数的乘积
Products of binomial coefficients and unreduced Farey fractions
摘要：
本文研究了Pascal三角形第n行的二项式系数的乘积$\bar{G}_n$，它等于所有n阶约化Farey分数与未约化Farey分数乘积的倒数。它研究了它作为实数的大小（通过其对数$log(\bar{G}_n)$来衡量）以及它的素因子分解（通过被固定素数p整除的顺序来衡量），每个都被视为n的函数。它推导出三个公式的素数幂整除，$ord_p(\bar{G}_n)$，其中两个涉及到基地p基数扩展的n，并显示不同方面的行为。这些公式用于确定每个$ord_p(\bar{G}_n)$的最大增长率和这些函数的波动结构。它还为所有整数基$b$定义了类似的函数来替换素数基。最后一个主题涉及的因子分解的$\bar{G}_n$切比雪夫型素数计数估计和素数定理。
英文摘要：
This paper studies the product $\bar{G}_n$ of the binomial coefficients in the n-th row of Pascal's triangle, which equals the reciprocal of the product of all the reduced and unreduced Farey fractions of order n. It studies its size as a real number, measured by its logarithm $log(\bar{G}_n)$, and its prime factorization, measured by the order of divisibility by a fixed prime p, each viewed as a function of n. It derives three formulas for its prime power divisibility, $ord_p(\bar{G}_n)$, two of which relate it to base p radix expansions of n, and which display different facets of its behavior. These formulas are used to determine the maximal growth rate of each $ord_p(\bar{G}_n)$ and structure of the fluctuations of these functions. It also defines analogous functions for all integer bases $b$ replacing prime bases. A final topic relates the factorizations of $\bar{G}_n$ to Chebyshev-type prime-counting estimates and the prime number theorem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
