Hello,(adsbygoogle = window.adsbygoogle || []).push({});

I am supposed to prove or disprove this statement:

Let m,d,n,a be non-zero integers. If m = dn, and if m|an, then d|a.

I had a proof but I made an error. Stay tuned for my revised proof.

Ok! Here is my corrected proof:

By definition:

An integer "a", is a divisor/factor of an integer "b" if

b = ax for some integer x.

If "m" is a divisor of "an" then there must be an x such that

an = mx for some integer x.

If m = dn then

an = dnx for some integer x.

By laws of cancellation,

a = dx for some integer x.

Therefore by definition, "d" is a divisor of "a" since

a = dx for some integer x.

Is this an adequate proof? If adequate, is there anything I can do to make this proof better? Any input is appreciated. Thankyou.

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Prove Divisibility

Loading...

Similar Threads for Prove Divisibility |
---|

I Proving only 1 normalized unitary vector for normal matrix |

I Division Rings & Ring Homomorphisms ... A&W Corollary 2.4 .. |

I Proving that an operator is unbounded |

**Physics Forums | Science Articles, Homework Help, Discussion**