What is 6 gram to kilograms?

2 answers:

8 0

6 GRAMS = 0.006KG
The mass m in kilograms (kg) is equal to the mass m in grams (g) divided by 1000:

dolphi86 [110]3 years ago

7 0

6 grams in kilograms is 0.006 kilograms :)

You might be interested in

A circle is centered at the point (-7, -1) and passes through the point (8, 7).

Elan Coil [88]

Radius = √(7-(-1))² + (8-(-7))² = √8²+15² = √289 = 17

Let the point be (-15,y)
(-15-(-7))² + (y-(-1))² = 17²
⇒ -8² + (y+1)² = 17²
⇒ 64 + (y+1)² = 289
⇒ (y+1)² = 289 - 64 = 225
⇒ y+1 = +15 or -15
⇒ y = +15-1 or -15-1
⇒ y = 14 or -16

Thus, the point can be either (-15,14) or (-15,-16)

3 0

4 years ago

Read 2 more answers

Let C(x) be the statement "x has a cat," let D(x) be the statement "x has a dog," and let F(x) be the statement "x has a ferret.

jek_recluse [69]

Answer:

$\mathbf{a)} \left( \exists x \in X\right) \; C(x) \; \wedge \; D(x) \; \wedge \; F(x)\\\mathbf{b)} \left( \forall x \in X\right) \; C(x) \; \vee \; D(x) \; \vee \; F(x)\\\mathbf{c)} \left( \exists x \in X\right) \; C(x) \; \wedge \; F(x) \; \wedge \left(\neg \; D(x) \right)\\\mathbf{d)} \left( \forall x \in X\right) \; \neg C(x) \; \vee \; \neg D(x) \; \vee \; \neg F(x)\\\mathbf{e)} \left((\exists x\in X)C(x) \right) \wedge \left((\exists x\in X) D(x) \right) \wedge \left((\exists x\in X) F(x) \right)$

Step-by-step explanation:

Let $X$ be a set of all students in your class. The set $X$ is the domain. Denote

$C(x) - ' \text{$x $ has a cat}'\\D(x) - ' \text{$x$ has a dog}'\\F(x) - ' \text{$x$ has a ferret}'$

$\mathbf{a)}$

Consider the statement 'A student in your class has a cat, a dog, and a ferret'. This means that $\exists x \in X$ so that all three statements C(x), D(x) and F(x) are true. We can express that in terms of C(x), D(x) and F(x) using quantifiers, and logical connectives as follows

$\left( \exists x \in X\right) \; C(x) \; \wedge \; D(x) \; \wedge \; F(x)$

$\mathbf{b)}$

Consider the statement 'All students in your class have a cat, a dog, or a ferret.' This means that $\forall x \in X$ at least one of the statements C(x), D(x) and F(x) is true. We can express that in terms of C(x), D(x) and F(x) using quantifiers, and logical connectives as follows

$\left( \forall x \in X\right) \; C(x) \; \vee \; D(x) \; \vee F(x)$

$\mathbf{c)}$

Consider the statement 'Some student in your class has a cat and a ferret, but not a dog.' This means that $\exists x \in X$ so that the statements C(x), F(x) are true and the negation of the statement D(x) . We can express that in terms of C(x), D(x) and F(x) using quantifiers, and logical connectives as follows

$\left( \exists x \in X\right) \; C(x) \; \wedge \; F(x) \; \wedge \left(\neg \; D(x) \right)$

$\mathbf{d)}$

Consider the statement 'No student in your class has a cat, a dog, and a ferret..' This means that $\forall x \in X$ none of the statements C(x), D(x) and F(x) are true. We can express that in terms of C(x), D(x) and F(x) using quantifiers, and logical connectives as a negation of the statement in the part a), as follows

$\neg \left( \left( \exists x \in X\right) \; C(x) \; \wedge \; D(x) \; \wedge \; F(x)\right) \iff \left( \forall x \in X\right) \; \neg C(x) \; \vee \; \neg D(x) \; \vee \; \neg F(x)$