“大互联网梅森素数寻求(GIMPS)”研究计划进展  

Research Development of "Great Internet Mersenne Primes Search" Project

作　　者：高全泉[1] 

机构地区：[1]中国科学院数学与系统科学研究院,北京100080

出　　处：《数学的实践与认识》2005年第10期166-171,共6页Mathematics in Practice and Theory

基　　金：国家自然科学基金资助(60072006)

摘　　要：梅森素数是一种特殊的素数,它的研究与寻求一直是数论研究的代表性问题之一.寻求梅森素数之路艰辛曲折,其计算复杂性对现代计算能力极具挑战.计算机网络技术的发展,特别是能使虚拟组织共享计算资源的全球分布计算技术,使得寻求速度大大加快.本文综述寻求梅森素数的最新进展及历史进程,并介绍寻求梅森数所用的分布计算技术.Mersenne Primes belong to a special kind of primes, studing and searching them are most relevant to number theory. The road of searching Mersenne Primes is difficulty and tortuous, because the computing complexity of this searching is a challenge to morden computing power. Searching Mersenne Primes has made great progress with the development of Internet, special the world distributed computing technoligies which enable virtual orgnazations to share coputing resources. In this paper, we＇ll introduce the recent progress of Mersenne prime search, give an overview of its history, and some distributed computing knowlege used for this project are presented.

关 键 词：梅森素数 素数 分布计算 素数寻求 互联网 分布计算技术 计算机网络技术 计算复杂性 计算能力 计算资源 

分 类 号：O156[理学—数学]