检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Masatoshi Nakano
机构地区:[1]Kesennuma College of Technology,1-174 Ohtougeyama Kesennuma-shi,Miyagi 988-0812,Japan
出 处:《Journal of Mathematics and System Science》2020年第2期13-22,共10页数学和系统科学(英文版)
摘 要:We propose the following conjecture on(σ)n the sum-of-divisors function:log(e'nlog logn-σ(n))/log(e'nlog log n)will increase strictly and converge to1 when n runs from the colossally abundant numbers to infinity This conjecture is a sufficient condition for the and converge to1 when n nuns from the colossally abundant numbers to infinity.This conjecture is a sufficient condition for the Ricemann hypothesis by Robin's theorem,and it is confirmed for n from10^(4 )up to 10^(103078) Further,we present two additional Riemann hypothesis by Robin's theorem,and it is confirmed forn from 10^(4) up to 10^(103078) Further,we present two additional conjectures that are related to Robin's theorem.
关 键 词:Riemann hypothesis Robin’s theorem colossally abundant number divisor function.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.250.255