Papex

Preprint · arXiv · 27 Oct 2026 · Mathematics · Not signed on Papex

Square-root logarithmic bounds for the arithmetic complexity of factorial multiples

Liang Zhang

AI use, as the source states it

“This work was carried out with assistance from the UniMath model, developed by UniDT (Shanghai) Co., Ltd., and OpenAI's GPT-6.1 Sol and GPT-6 Astra.”

Model: UniMath, GPT-6.1 Sol, GPT-6 Astra, as stated

Named here, or see a mistake? Write to privacy@papex.org.