Ask question

Ask question

All categories

2 years ago

12

Write 0.0003532 in scientific notation. A. 3.532 × 105 B. 3.532 × 104 C. 3.532 × 10−4 D. 3.532 × 10−5

1 answer:

madreJ [45]2 years ago

6 0

So in scientific notation you have to have one non decimal followed by the rest of the number as a decimal, multiplied by a 10^( a number) that makes the number into that form. To find this number count the amount of steps the decimal point has to move to create this scenario. (in this case past the 3) So in this case the decimal moves 4 to the right so the number is -4 while if it was to the left it would be positive, so the answer is C

You might be interested in

Find the interquartile range (IQR) of the data in the dot plot below. ms orlando

erik [133]

Answer:
1.75
Step-by-step explanation:
Low- 81
Q1-82.5
Median- 83.5
Q3-84
High- 85

5 0

1 year ago

vesna_86 [32]

Answer:

13.73 in^2 because the circle's area is 50.27 in^2

5 0

2 years ago

Evaluate the algebraic expression 18 + (- 31) =

frosja888 [35]

Answer:

-13

Step-by-step explanation:

8 0

2 years ago

John want to simplify the expression (5 + 3) (With the power of 2). As a first step, he writes 5( with a power of 2) + 3( With a

professor190 [17]

5^2 + 3^2 (equals to 34) ; That's the wrong expression

It should look like this : (5+3)^2 (which equals to 64)

4 0

2 years ago

Let R be the relation on the set of ordered pairs of positive integers such that ((a, b), (c, d)) ∈ R if and only if ad = bc. Ar

Veseljchak [2.6K]

Answer:

The given relation R is equivalence relation.

Step-by-step explanation:

Given that:

$((a, b), (c, d))\in R$

Where $R$ is the relation on the set of ordered pairs of positive integers.

To prove, a relation R to be equivalence relation we need to prove that the relation is reflexive, symmetric and transitive.

1. First of all, let us check reflexive property:

Reflexive property means:

$\forall a \in A \Rightarrow (a,a) \in R$

Here we need to prove:

$\forall (a, b) \in A \Rightarrow ((a,b), (a,b)) \in R$

As per the given relation:

$((a,b), (a,b) ) \Rightarrow ab =ab$ which is true.

$\therefore$ R is reflexive.

2. Now, let us check symmetric property:

Symmetric property means:

$\forall \{a,b\} \in A\ if\ (a,b) \in R \Rightarrow (b,a) \in R$

Here we need to prove:

$\forall {(a, b),(c,d)} \in A \ if\ ((a,b),(c,d)) \in R \Rightarrow ((c,d),(a,b)) \in R$

As per the given relation:

$((a,b),(c,d)) \in R$ means $ad = bc$

$((c,d),(a,b)) \in R$ means $cb = da\ or\ ad =bc$

Hence true.

$\therefore$ R is symmetric.

3. R to be transitive, we need to prove:

$if ((a,b),(c,d)),((c,d),(e,f)) \in R \Rightarrow ((a,b),(e,f)) \in R$

$((a,b),(c,d)) \in R$ means $ad = cb$ .... (1)

$((c,d), (e,f)) \in R$ means $fc = ed$ ...... (2)

To prove:

To be $((a,b), (e,f)) \in R$ we need to prove: $fa = be$

Multiply (1) with (2):

$adcf = bcde\\\Rightarrow fa = be$

So, R is transitive as well.

Hence proved that R is an equivalence relation.

8 0

2 years ago