What is the negation of the following: "if n is divisible by 6 then n is divisible by both 2 and 3."
a. n is divisible by 6 or n is divisible by both 2 and 3.
b. if n is divisible by both 2 and 3 then n is divisible by 6.
c. if n is divisible by 6 then n is divisible by both 2 and 3.
d. n is divisible by 6 and n is not divisible by both 2 and 3.
e. if n is not divisible by 6 then n is not divisible by both 2 and 3.
f. n is not divisible by 6 or n is divisible by both 2 and 3.
g. n is divisible by 6 and n is divisible by both 2 and 3.
h. n is not divisible by 6 and n is divisible by both 2 and 3.
i. if n is not divisible by 6 then n is divisible by both 2 and 3.
j. if n is not divisible by both 2 and 3 then n is not divisible by 6.
k. n is divisible by 6 or n is not divisible by both 2 and 3.

D. n is divisible by 6 and n is NOT divisible by both 2 and 3.

Step-by-step explanation:

The statement we want to negate is:

"IF n is divisible by 6 THEN n is divisible by both 2 and 3"

you should think of it as having one single antecedent (the sentence that follows after the IF) and one single consequent (the sentence that follows after THEN), as:

"IF ( n is divisible by 6 )THEN ( n is divisible by both 2 and 3 )"

This kind of statements are negated by saying that the antecedent is true, but the consequent isn't true (which is kind of saying that the antecedent being true doesn't necessarily make the consequent also true).

So the negation of the original statement is just:

"(n is divisible by 6) and NOT (n is divisible by both 2 and 3)"

which in common english is just

"n is divisible by 6 and n is NOT divisible by both 2 and 3."

hippioo

Step-by-step explanation:

hippi hipppokmkmkouse

is there answer choices?

if a = 1,   and b = 2, then the answer is 47.99999999. if you round that to the nearest whole number, the answer is 48.