arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.03752math.NTmath.CO
收藏

Catalan数的分解

Factoring Catalan numbers

Gennady Eremin

摘要:

本文描述了Catalan数的一种素因子分解。奇素因子按照勒让德公式分层分布。每一层的内容是一个区间网络,即切比雪夫分段。Segment的素数不进行计算,而是根据其边界进行选择。层包含非重复素数。当素数在不同的层之间重复时,就形成了重复因子。本文也从线段的边界出发,对Kummer的素因子选择定理作了一些修改。总之,读者提供了一个软件服务的因式分解的加泰罗尼亚数与索引高达$10^8$

英文摘要:

The paper describes a prime factorization of the Catalan numbers. Odd prime factors are distributed in layers in accordance with Legendre's formula. The content of each layer is a network of the intervals, Chebyshev's Segments. The primes of Segment are not calculated and are selected on the basis of its bounds. Layers contain non-repeated primes. Repeated factors are formed when primes are duplicated among different layers. The paper slightly modifies Kummer's theorem for the selection of individual prime factors, also starting from the boundaries of Segments. In conclusion, the reader is offered a software service for factorization of the Catalan number with index up to $10^8$

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑