康MM, please rank this problem based on the difficulty

如果 p 是能整除 2^q - 1 的最大素数
q 是正整数

证明 p-1 能被 q 整除

所有跟帖： 

• Someone disproved it. Here is his reason -yma16- ♂ (99 bytes) () 07/23/2007 postreply 16:57:29

• Verified？ -乱弹- ♂ (0 bytes) () 07/23/2007 postreply 19:00:25

• 回复：Verified？ -也和话- ♂ (191 bytes) () 07/23/2007 postreply 20:58:46

• In that case the problem is not valid. Generally, -康MM- ♀ (371 bytes) () 07/24/2007 postreply 07:29:35

• 回复：In that case the problem is not valid. Generally, -yma16- ♂ (230 bytes) () 07/24/2007 postreply 08:01:34

• 回复：康MM, please rank this problem based on the difficulty -QFT- ♂ (39 bytes) () 07/24/2007 postreply 08:55:13

• Then this problem is probably 2.5 stars. -乱弹- ♂ (0 bytes) () 07/24/2007 postreply 11:42:52