Show that:

and

Printable View

- Dec 20th 2008, 09:39 AMSeaDivisibility 13
Show that:

and - Dec 20th 2008, 10:14 AMMoo
- Dec 23rd 2008, 02:24 PMJaneBennet
Are you trying to prove the converse, namely

- Dec 23rd 2008, 03:08 PMSea

I don't know...:(...

But good question...:)...

(Why?) ...write...

http://www.mathhelpforum.com/math-help/number-theory/65693-divisibility-14-a.html

I think...Maybe use binomial theorem... - Dec 23rd 2008, 03:20 PMJaneBennet
I would suggest maybe using prime factorization.

- Dec 23rd 2008, 05:23 PMSeaQuote:

I would suggest maybe using prime factorization.

I think;

and

and

I think...? - Jan 16th 2009, 03:53 AMInvisibleMan
If your'e trying to prove that a^k|b^k => a|b then

a^k=nb^k

(a/b)^k=n

a/b=n^1/k

Now a|b iff n=m^k for some integer m, the problem is to show that it is so.

You can assume by contradiction that a!|b which means there exists p and r such that:

a=pb+r r<=b

Now write a^k=(pb+r)^k and see that it contradicts our assumption.