Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:如果phi(n) 不是满足 2^x mod n == 1 的最小的x

Posted by Iamjw at 2007-08-27 00:42:49 on Problem 3358
In Reply To:Re:如果phi(n) 不是满足 2^x mod n == 1 的最小的x Posted by:frkstyc at 2007-08-26 21:13:32 
2^k mod n,k=0,1,2,...的循环长度是phi(n)的约数是能证，
我是不知道是否这个约数是直接能求出来的
看来是没法直接算的吧:)
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator