1. Divisibility proof

$\displaystyle a,b,c,n,m \in \mathbb{Z}$

If a|b and a|c, show that a|(bm+cn).

Proof:

I have already proved that if x|y, and y|z, then x|z.

So, if a|b, then b|bm, so a|bm.

Also, if a|c, then c|cn, so a|cn.

So I think I need to show that a|aj+ai for some integers j=bm, i=cn.

ax = aj+ai
ax = a(j+i)

Let x = (j+i), thus ax = ax. $\displaystyle \blacksquare$

Could someone let me know if this proof is correct?

2. Originally Posted by rowe
$\displaystyle a,b,c,n,m \in \mathbb{Z}$

If a|b and a|c, show that a|(bm+cn).

Proof:

I have already proved that if x|y, and y|z, then x|z.

So, if a|b, then b|bm, so a|bm.

Also, if a|c, then c|cn, so a|cn.

So I think I need to show that a|aj+ai for some integers j=bm, i=cn.

ax = aj+ai
ax = a(j+i)

Let x = (j+i), thus ax = ax. $\displaystyle \blacksquare$

Could someone let me know if this proof is correct?
proof of what? Your last statement is "thus ax= ax" which is NOT what you wanted to prove! I see no reason to change from b and c to x and y.

Since a|b, b= ap for some integer n. Since a|c, c= aq for some integer q.

Now, bm+ cn= apm+ aqn.

3. Originally Posted by rowe
$\displaystyle a,b,c,n,m \in \mathbb{Z}$

If a|b and a|c, show that a|(bm+cn).

Proof:

I have already proved that if x|y, and y|z, then x|z.

So, if a|b, then b|bm, so a|bm.

Also, if a|c, then c|cn, so a|cn.

So I think I need to show that a|aj+ai for some integers j=bm, i=cn.

ax = aj+ai
ax = a(j+i)

Let x = (j+i), thus ax = ax. $\displaystyle \blacksquare$

Could someone let me know if this proof is correct?
The part marked in red is a bit muddled. It would be better to write that: a|x and a|y => a|x+y.

Also, as was noted, you did not end up with what you wanted to prove.

If you know modular arithmetic notation, this proof is a lot shorter. We have

$\displaystyle b\equiv 0\ (\text{mod}\ a)$

$\displaystyle c\equiv 0\ (\text{mod}\ a)$

So $\displaystyle bm+cn\equiv 0\cdot m+0\cdot n\equiv 0\ (\text{mod}\ a)$

Of course this relies on the properties of the congruence relation, which would be proven separately.

Also, you misuse the word "then" marked in blue. Of course "p implies q" holds if "q" is always true, but it is misleading in your proof.

4. Hope this is an improvement:

$\displaystyle a,b,c,n,m,i,j \in \mathbb{Z}$

If a|b and a|c, show that a|(bm+cn).

Proof:

If a|b, and b|bm then a|bm, implying aj = bm.

Also, if a|c, and c|cn then a|cn, implying ai = cn.

We let x = (j+i).

ax = aj+ai
ax = bm+cn

Which implies a|(bm+cn). $\displaystyle \blacksquare$

5. Originally Posted by rowe
Hope this is an improvement:

$\displaystyle a,b,c,n,m,i,j \in \mathbb{Z}$

If a|b and a|c, show that a|(bm+cn).

Proof:

If a|b, and b|bm then a|bm, implying aj = bm.

Also, if a|c, and c|cn then a|cn, implying ai = cn.

We let x = (j+i).

ax = aj+ai
ax = bm+cn

Which implies a|(bm+cn). $\displaystyle \blacksquare$
It works, except that I would be more careful with the part I marked in red (and the analogous part right below it); I would state as either:

implying there exists j such that aj = bm.

implying aj = bm for some j.

But take a look at HallsofIvy's post for a short proof that doesn't use the congruence notation I mentioned.

6. Thanks, I "declared" j and i above as $\displaystyle i,j \in \mathbb{Z}$

7. Originally Posted by rowe
Thanks, I "declared" j and i above as $\displaystyle i,j \in \mathbb{Z}$
I'm guessing you have programming experience.

I understand your intent, but I still think it's an abuse of notation. Consider:

1: Let $\displaystyle u,v\in \mathbb{Z}$. Suppose $\displaystyle u$ is a perfect square. Then $\displaystyle u=v^2$.

and

2: Let $\displaystyle u\in \mathbb{Z}$ be a perfect square. Now let $\displaystyle v\in \mathbb{Z}$. Then $\displaystyle u=v^2$.

Note that (1) and (2) essentially are the same, but with the order of declaration changed.

You see how this wording suggests that any integer $\displaystyle v$ satisfies $\displaystyle u=v^2$, rather than some integer $\displaystyle v$?