RE: Elemental Subset Sum Problem

avatar
(Edited)

You are viewing a single comment's thread:

Interesting, I actually talked with @queker a little about mod 5 since I had an exam question in my mind about mod5 that I could not solve back then: Why is for every x element N x4 mod 5 = 1 or x4 mod 5 = 0

h i v e - 1 6 3 5 2 1
0
0
0.000
1 comments
avatar

Consider.

gcd(N, p) = 1 ⇒ NΦ(p) mod p = 1 by Euler's theorem

gcd(N, p) ≠ 1, N = pb ∙ a, pb ≡ 0 mod p ⇒ NΦ(p) mod p = 0

Hope this helps

0
0
0.000
Reply