Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

这题是怎么个思路?我只知道5还有8的偶数倍不行.....只知道枚举....

Posted by zrO_Orz at 2008-10-06 22:36:13 on Problem 3696

Followed by:

解模方程 (0) zhangdaxia 2008-10-07 09:33:13
- 我只想到转成离散对数，O(sqrt(L))的算法，所谓模方程不会是线性模方程吧？怎么归约出来的？ (0) ArXoR 2008-10-07 12:48:18
  - Re:我只想到转成离散对数，O(sqrt(L))的算法，所谓模方程不会是线性模方程吧？怎么归约出来的？ (18) DreamOfGame 2008-10-24 19:49:33
求解10^x = 1 (mod 9*L/gcd(L,8))的满足x>0的最小解就是答案_证明内详 (506) majia5 2008-10-07 12:49:19
- Re:求解10^x = 1 (mod 9*L/gcd(L,8))的满足x>0的最小解就是答案_证明内详 (556) tanyin 2009-08-07 16:29:17
  - Re:求解10^x = 1 (mod 9*L/gcd(L,8))的满足x>0的最小解就是答案_证明内详 (271) tanyin 2009-08-07 16:35:05
    - Re:求解10^x = 1 (mod 9*L/gcd(L,8))的满足x>0的最小解就是答案_证明内详 (282) tanyin 2009-08-07 16:45:03
      - Re:求解10^x = 1 (mod 9*L/gcd(L,8))的满足x>0的最小解就是答案_证明内详 (354) majia5 2010-06-04 10:29:34
    - Re:求解10^x = 1 (mod 9*L/gcd(L,8))的满足x>0的最小解就是答案_证明内详 (359) majia5 2010-06-04 10:26:51
      - Re:求解10^x = 1 (mod 9*L/gcd(L,8))的满足x>0的最小解就是答案_证明内详 (76) youxirenjian163 2012-09-26 16:31:14

Post your reply here:

Home Page Go Back To top

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