Scholarlink

<p>Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are infinitely many such expressions in these functions. Here, we show how to modify and adapt their construction to detect cubes of primes as well as primes in arithmetic progressions.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

MacMahonesque partition functions detect sets related to primes

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年4月2日

查看全文
  • Kevin Gomez

摘要

Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are infinitely many such expressions in these functions. Here, we show how to modify and adapt their construction to detect cubes of primes as well as primes in arithmetic progressions.