Proof
Proof
Proof:
Let a and b be two random even numbers. Then, for some j,k in Z, a = 2j, and b = 2k.
Keep in mind that a + b = 2j + 2k = 2(j + k). Since the integers are closed when added,
and since j + k is an integer, we know that 2(j + k) is an even number. The even integers
are therefore closed under addition. It follows.
Now think about the product ab. Be aware that ab = (2j)(2k)=4jk = 2 (2jk). Because the
integers are closed under multiplication and 2jk is an integer, 2(2jk) = ab must be an even
number. Thus, when multiplied, the even integers are closed.
2. Proof:
Assume that n is an odd integer. This implies that there is some integer k such that
n = 2k+ 1.
3. Proof:
4. Proof:
let mn = 2k
since m and n are integers, k = a*b, such that mn= 2ab , m = 2a and n = b ,
or, m = a , n = 2b
where a and b are arbitrary integers
in these cases , m and/or n are even numbers.
5. Proof:
Let n be odd.
Then, n = 2k+1 for some integer k.
Then 𝑛3 + 5 = (2𝑘 + 1)3 + 5
= 8𝑘 3 + 12𝑘 2 + 6𝑘 + 6
= 2(4𝑘 3 + 6𝑘 2 + 3𝑘 + 3)
= 2𝑝
Where 𝑝 = 4𝑘 3 + 6𝑘 2 + 3𝑘 + 3
= Integer
Thus 𝑛3 + 5 is two times some integer, so it is even by the definition of an even integer.
3n+2=2m+1{where m is an integer}
==>n is odd.
7.
8. Now we have to prove that this statement by contradiction.
So let 4n + 6m ≠ 11 ∀ 𝑚, 𝑛 ∈ ℝ
1
Now we take n = 3, m = − 6 ∈ ℝ
1
So, 4n + 6m = 4 x 3 + 6 (− 6 )
= 12 – 1
4n + 6m = 11