期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Natural Numbers and the Strong Goldbach Conjecture
1
作者 Ramon Carbó-Dorca 《Journal of Applied Mathematics and Physics》 2024年第9期3208-3236,共29页
This study introduces the representation of natural number sets as row vectors and pretends to offer a new perspective on the strong Goldbach conjecture. The natural numbers are restructured and expanded with the incl... This study introduces the representation of natural number sets as row vectors and pretends to offer a new perspective on the strong Goldbach conjecture. The natural numbers are restructured and expanded with the inclusion of the zero element as the source of a strong Goldbach conjecture reformulation. A prime Boolean vector is defined, pinpointing the positions of prime numbers within the odd number sequence. The natural unit primality is discussed in this context and transformed into a source of quantum-like indetermination. This approach allows for rephrasing the strong Goldbach conjecture, framed within a Boolean scalar product between the prime Boolean vector and its reverse. Throughout the discussion, other intriguing topics emerge and are thoroughly analyzed. A final description of two empirical algorithms is provided to prove the strong Goldbach conjecture. 展开更多
关键词 Natural numbers prime numbers Vector Description of Natural numbers prime Boolean Vectors Primality of the Natural Unit strong Goldbach’s Conjecture Vector Reversal Pairing Conjecture Natural Matrix Squeezing
下载PDF
一种用于大整数因数分解的多相位粒子群算法 被引量:1
2
作者 张淑梅 宋维堂 宋万里 《计算机工程与应用》 CSCD 北大核心 2010年第25期105-108,共4页
如果大整数N的两个因数p与q满足p=xp×D+yp,q=xq×D+yq,D>yp×yq约束,那么该大整数N将有可能被轻易分解。因此,根据该约束及相关定理,提出了一种用于求解大整数因数分解问题(IFP)的尾数多相位粒子群搜索算法,MMPPSO。数... 如果大整数N的两个因数p与q满足p=xp×D+yp,q=xq×D+yq,D>yp×yq约束,那么该大整数N将有可能被轻易分解。因此,根据该约束及相关定理,提出了一种用于求解大整数因数分解问题(IFP)的尾数多相位粒子群搜索算法,MMPPSO。数值实验证明,MMPPSO算法对IFP具有良好的求解能力。同时,建议依赖于大整数N分解问题的密码系统做上述约束条件测试,从而保证密钥和系统的安全性。 展开更多
关键词 RSA 强素数 大整数因数分解问题(IFP) 粒子群优化算法(PSO)
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部