Problem #PRU-73597

Problems Number Theory Divisibility Division with remainders. Arithmetic of remainders Division with remainder Euler's theorem

Problem

Prove that for any odd natural number, \(a\), there exists a natural number, \(b\), such that \(2^b - 1\) is divisible by \(a\).