MathDB

A 45

Source:

May 25, 2007

inductionDivisibility Theory

Problem Statement

Let

b,m,n\in\mathbb{N}

with

b>1

and

m\not=n

. Suppose that

b^{m}-1

and

b^{n}-1

have the same set of prime divisors. Show that

b+1

must be a power of

2