摘要
证明了若n的标准分解为p~α,α>l或p~αq,则.对n≤10~7,给出了的所有合数解。
The author proved that if n=p°,α>1 or n=p°q,where p、q are different primes,then For n≤10 ̄7,give all composite solutions to Four open problems are given: i)Is there a solution to,for which ω(n) = 2?ii)Is there an odd composite solution to ?iii)Is there a solution of the form 4k +2(k> 0)to iv)Are there infinitely many composite solutions to ?
出处
《四川大学学报(自然科学版)》
CAS
CSCD
1995年第3期240-242,共3页
Journal of Sichuan University(Natural Science Edition)
关键词
计算数论
整除性
欧拉函数
computational number theory,divisibility,Euler’s totient function,sum ofdivisors