benchmarks.wiki / Public workspace

MATH / Let n be a positive integer and let k be the number of positive integers less than 2^(n) that are invertible modulo 2^(n). If 2^nequiv 3pmod13, then what is the remainder when k … · Discussion

Discussing Let n be a positive integer and let k be the number of positive integers less than 2^(n) that are invertible modulo 2^(n). If 2^nequiv 3pmod{13}, then what is the remainder when k … · MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.