数学
唯一因子分解域
乘法数论
离散数学
基数(数据建模)
质数
组合数学
基本元素
领域(数学分析)
素数(序理论)
主要因素
因式分解
数学分析
算法
计算机科学
数据挖掘
作者
Haydar Göral,Hikmet Burak Özcan,Doğa Can Sertbaş
标识
DOI:10.1080/00029890.2022.2141543
摘要
We first prove an elementary analogue of the Green-Tao Theorem. The celebrated Green-Tao Theorem states that there are arbitrarily long arithmetic progressions in the set of prime numbers. In fact, we show the Green-Tao Theorem for polynomial rings over integral domains with several variables. Using the Generalized Polynomial van der Waerden Theorem, we also prove that in an infinite unique factorization domain, if the cardinality of the set of units is strictly less than that of the domain, then there are infinitely many prime elements. Moreover, we deduce the infinitude of prime numbers in the positive integers using polynomial progressions of length three. In addition, using unit equations, we provide two more proofs of the infinitude of prime numbers. Finally, we give a new proof of the divergence of the sum of reciprocals of all prime numbers.
科研通智能强力驱动
Strongly Powered by AbleSci AI