Let n 2 and k be any positive integer. Prove that if and only if . I've tried considering but it still got me no where.

I'm looking more for a hint than an actual answer as I do want to figure this out mostly on my own.

Printable View

- Dec 8th 2011, 05:23 PMwsldamDivisibility problem
Let n 2 and k be any positive integer. Prove that if and only if . I've tried considering but it still got me no where.

I'm looking more for a hint than an actual answer as I do want to figure this out mostly on my own. - Dec 8th 2011, 07:20 PMI-ThinkRe: Divisibility problem
Use the factorization

So it reduces to

then use the fact that

P.S. Remember the multiplication of congruences - Dec 8th 2011, 07:24 PMMonroeYoderRe: Divisibility problem
you can factor into