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.
A(an) _______ is a set of instructions that a computer follows to perform a task.Answer is Program .
I hope the answer of the question.
Answer:
input number
calculate modulus of the number and 5
compare outcome to 0
if 0 then output "divisible by 5"
else output "not divisible by 5"
Explanation:
The modulo operator is key here. It returns the remainder after integer division. So 8 mod 5 for example is 3, since 5x1+3 = 8. Only if the outcome is 0, you know the number you divided is a multiple of 5.
