which kind of proof requires you to prove that all but one of a set of possible alternatives are false? a. direct proof. b. elem
2 answers:
You might be interested in
Answer:
'5n' is the correct answer.
Step-by-step explanation:
Let 'n' be any integer i.e. a number from the set {....., -3,-2,-1,0,1,2,3, ..... }
so 'n' can be termed as the variable here because its value can change and can be any value from the above set.
A number 'q' that can be divided by a a given number 'p' can be written as:
When divided by 'p' :
So, The number 'q' is completely divisible by 'p' leaving 'n' as the quotient.
Using this concept, let us solve the questions:
a) Using 'n' as the variable, a number that is divisible by 5 can be written as:
Read more on Brainly.com - brainly.com/question/16919676#readmore