Answer:
Hello!
The statement is "if x and y are odd integers, then x + y is even"
and we want to prove it by contradiction.
Suppose that we have x and y odd numbers, and suppose that his addition is odd.
We know that an odd number can be writen as (2n +1) (and a even number can be written as 2n) where n is an integer number; then:
x = (2k + 1) and y = (2m + 1)
and x + y = j, where j is also a odd number, then j = (2h + 1)
then:
2k + 1 + 2m + 1 = 2h + 1
2(k + m) + 2 = 2h + 1
2(k + m) +1 = 2h
if k and m are integers, then k + m is also an integer, suppose that k + m = g
then 2g + 1 = 2h
this says that in odd number is equal to an even number, then we have a contradiction, and the addition of two odd numbers cant be an odd number.
The simplest way is to make for loop first you need to<span> generate 1,2,4,8,16,32,64,128,256....and others number in Array. Then you will check every number. Like this.</span>
<span>Decimal </span>Input 84;
64 is closest to 84.
84-64=20
<span>Write: </span>1
20-32=-12(Because It's negative you will write 0)
Write:10
20-16=4
<span>Write: </span>101
4-8=-4 (Negative)
Write:1010
4-4=0
<span>Write: </span>10101
0-2=-2
0-1=-1
<span>Write: </span><span>1010100 = 84</span>
The answer to your question is,
C. Address Block
-Mabel <3
