What is the negation of the following statement: "n is divisible by 6 or n is divisible by both 2 and 3."
a. n is not divisible by 6 or n is divisible by both 2 and 3.
b. n is not divisible by 6 and n is divisible by both 2 and 3.
c. n is divisible by 6 or 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. n is divisible by 6 and n is divisible by both 2 and 3.
f. n is not divisible by 6 or n is not divisible by both 2 and 3.
g. n is divisible by 6 or n is not divisible by both 2 and 3.
h. n is not divisible by 6 and n is not divisible by both 2 and 3.

H.''n is not divisible by 6 and n is not divisible by both 2 and 3.

Step-by-step explanation:

We are given that  a statement ''n is divisible by 6 or n is divisible by both 2 and 3.''

We have to write the negation of the  given statement.

Negation: If  a statement p is true then its negations is  p is false.

n is divisible by 6 then negation is n is not divisible by 6.

n is divided by both 2 and 3 then negation is n is not divisible  by both 2 and 3.

Therefore, negation of given statement

''n is not divisible by 6 and n is not divisible by both 2 and 3.

Hence, option H is true.

the solution of the equation is 2.23 ⇒ answer b

step-by-step explanation:

* lets revise the meaning of exponential function

- the form of the exponential function is y = ab^x, where a ≠ 0, b > 0 ,  

  b ≠ 1, and x is any real number

- it has a constant base b

- it has a variable exponent x

- to solve an exponential equation, take the log or ln of both sides,  

  and solve for the variable

* lets solve the problem

∵

- the base is 7 and the exponent is x

- insert ㏑ in both sides

∴

- use the rule

∴ x ㏑(7) = ㏑(77)

- to find x divide both sides by ㏑(7)

∴

* the solution of the equation is 2.23 to the nearest 2 decimal places

just pick what you think i need more time let me know if this

step-by-step explanation: