首页 | 本学科首页   官方微博 | 高级检索  
     检索      

关于同余式2n≡7(modn)的解
引用本文:黄忠铣.关于同余式2n≡7(modn)的解[J].南平师专学报,2010,29(5):12-13.
作者姓名:黄忠铣
作者单位:武夷学院数学与计算机系,福建武夷山354300
摘    要:证明了2n≡7(modn)(n〉1)在2,105]中仅有解n=25=5·5.及当整数m〉1满足2m≡7(modm)时,有n=2m-1是2n-6≡1(modn)的解.更进一步地,若整数m〉1满足2m≡2k+1(modm),则n=2m-1是2n-2k≡1(modn)的解.

关 键 词:同余式  素数  因子

Solution on the Congruence
HUANG Zhongxian.Solution on the Congruence[J].Journal of Nanping Teachers College,2010,29(5):12-13.
Authors:HUANG Zhongxian
Institution:HUANG Zhongxian(Department of Mathematics and Computer,Wuyi University, Wuyishan,Fujian 354300)
Abstract:The author proves the congruence2n≡7(modn)only one solution n=25=5·5 in the interval 2,105]. And when m1 satisfy the congruence 2m≡7(modm) then n=2m-1is a solution of the congruence 2n-6≡1(modn) . Further more, when m1 satisfy the congruence 2m≡2k+1(modm) then n=2m-1 is a solution of the congruence 2n-2k≡1(modn).
Keywords:congruence  prime  factor
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号