Hello,
Quote:
Originally Posted by jrh1337 If you could check my 2 proofs and help me start on one please.
1a) If  is a multiple of 2, then  is a multiple of 2. Domain of n is all integers.
My proof:
An integer n is even if there exists an integer k such that n = 2k.
n = 2k,  is an integer therefore  is even, thus making it a multiple of 2.
By the definition of n = 2k, n is also a multiple of 2. |
Huh

But here you proved that if n is even, then n^3 is even... while you're asked to prove the converse.
Actually, it's more complicated, you proved that if

is in a form 2k, with k a
very special number, then n is even. Hehe that was unfair
So...what you can do is to prove the contrapositive :
"if n is odd, then n^3 is odd"
Let

.
So
It's your method, you keep it because it's okay !
Quote:
Now the one I am having a hard time with is
2) Prove or disprove the following proposition: If x and y are positive integers such that x > y + 1, then is not prime.
|
Difference of two squares ^^
x²-y²=(x-y)(x+y)
(note that x-y < x+y since x and y are positive integers)
The only way for it to be a prime is that x-y=1 and x+y is a prime number.
But... It is said that x > y+1; that is to say x-y>1
Got it ?
Blop.
__________________
Everything is possible. The impossible just takes longer.
To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.
shinhidora production
To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.
- I hate, I can't stand, I abhor, I dislike, I disdain, I detest, I loathe, I despise and I am repelled by tousled birds of pray.