#Proving p+r is only divisible by q when q is a factor of r (given q divides p)

59 messages · Page 1 of 1 (latest)

neon wagonBOT
glad kindle
#

This is my proof currently, It’s the first formal proof i’ve written so I would just like to know if it is correct, well written and rigorous.

proven kayak
#

This is a pretty good first attempt. Importantly, it's enough that you can work on it to make it better.

Your proposition is written as a biconditional. Is that how it's supposed to be? Because you only even tried to prove one of the directions.

#

Your proposition talks about q/r, but your conclusion talks about r/q.

#

When you are proving a statement about all p in Z, the first line of your proof needs to be:
Let p be in Z.

#

(Your first line is also a bit muddied because you have a "for all" symbol, but it's not clear what that's being applied to.)

glad kindle
#

i was trying to say that q|p+r if and only if r/q is in the set of integers

#

since the form for q|p
is p = kq where k is in the set of integers
and from this i got the form for q|p+r
to p=q(t - r/q), i thought it was ok to say since t is in the set of integers
t - r/q is in the set of integers and therefore r/q must be in the set of integers for the equality to hold

#

and thus the if and only if

#

is that sufficient or no?

glad kindle
proven kayak
#

You're still getting a bit confused between the general and the specific.

#

You shouldn't be writing general statements like this in the middle of your proof

#

Proof:
Let p, q, and r be integers.

For the => direction:
Suppose that q|p and q|p+r.
Then ...

#

(Come to think of it, this isn't true in the opposite direction.)

glad kindle
proven kayak
#

Right, but you don't need to be stating it like that in the middle of your proof

#

Also, as written, it's a little unclear whether you're even stating it.

#

When you say "P => Q", are you claiming P?

#

You shouldn't be quantifying q here

#

That's the point of declaring q in the first line.

glad kindle
#

i see

glad kindle
proven kayak
#

yeah, you can just put "by definition"

glad kindle
#

alright

proven kayak
#

Hold on. I don't think your second last line is true.

#

4 = 6(2/3) does not mean that 2/3 is an integer

glad kindle
#

this only holds true for q that divides p

proven kayak
#

But you have to say that

#

Better! you should also let r be an integer too.

glad kindle
#

do I just write “assume q|p+r is true” or is there a better way of writing that

glad kindle
glad kindle
#

okok

#

wait how should i add that we’re also assuming q|p

proven kayak
#

just say it while you're making the other assumption

glad kindle
#

okok

proven kayak
#

overall, this is much better, and I hope you can see why

#

you're still missing the step where you actually use that q|p

#

in order to isolate t-r/q, I'd divide both sides by q

#

then you can use the assumption to make a claim about the left side

glad kindle
#

wait why do I have to divide both sides by q?
since we’re given the definition for q|p i was just subbing p+r into p for the definition

proven kayak
#

Okay, you don't have to. I just thought it was easier. You have to do something.

proven kayak
#

This is still unjustified.

glad kindle
#

I think so, I found one of my prof's examples

proven kayak
#

Why did you write this here?

#

You should make some reference to k near the end

#

You could argue that the reader can understand the last line, but you could equally argue that the entire thing is obvious and that you shouldn't have to write anything.

#

The point is to explain something, and the second last line is still unexplained.

#

It's good that you're persisting though. This is how you learn to write proofs.

glad kindle
glad kindle
proven kayak
#

In the line that introduces k, I'd add that k=p/q

#

then p/q = t-r/q, and since p/q in Z, t-r/q in Z