本文讨论了Michael Bennett在[Bennett M,Bugeaud Y,Mignotte M.Perfect powers with few binary digits and related Diophantine problem[J].Ann Sc Norm Super Pisa Cl Sci,2013,XII:941–953.]中提出的一类丢番图方程,即五次完全幂...本文讨论了Michael Bennett在[Bennett M,Bugeaud Y,Mignotte M.Perfect powers with few binary digits and related Diophantine problem[J].Ann Sc Norm Super Pisa Cl Sci,2013,XII:941–953.]中提出的一类丢番图方程,即五次完全幂的少位数三进制展开.作者证明了丢番图方程3^(a)+3^(b)+2=n^(5),a>b>0有唯一的正整数解(a,b,n)=(3,1,2).展开更多
文摘本文讨论了Michael Bennett在[Bennett M,Bugeaud Y,Mignotte M.Perfect powers with few binary digits and related Diophantine problem[J].Ann Sc Norm Super Pisa Cl Sci,2013,XII:941–953.]中提出的一类丢番图方程,即五次完全幂的少位数三进制展开.作者证明了丢番图方程3^(a)+3^(b)+2=n^(5),a>b>0有唯一的正整数解(a,b,n)=(3,1,2).
