|Aug12-12, 01:09 AM||#1|
Number theory divisibility question
Let a, b and c be positive integers such that a^(b+c) = b^c x c Prove that b is a divisor of c, and that c is of the form d^b for some positive integer d.
I'm not sure how to solve this question at all, I need some help.
|Aug12-12, 04:48 AM||#2|
Have you come across logarithmic congruence relations? Is there a way to use with the added constraint of c MOD b = 0?
|Aug12-12, 05:10 AM||#3|
No, I have not come across them before. Could you elaborate?
|Similar Threads for: Number theory divisibility question|
|Number Theory: Unclear Explanation of Divisibility Question||Calculus & Beyond Homework||1|
|Number theory/ divisibility||Calculus & Beyond Homework||1|
|Number Theory divisibility proof||Calculus & Beyond Homework||3|
|Question about primes and divisibility...abstract algebra/number theory||General Math||6|
|Number Theory - divisibility and primes||Calculus & Beyond Homework||1|