All categories

4 years ago

What is the smallest number that is divisible by 1,2,3,4,5,6,7,8,9 and 10?

1 answer:

8 0

writing each one in prime factors:_
1
2
3
2 * 2
5
2 * 3
7
2* 2 * 2
3 * 3
2 * 5

so the smallest number ( the L.C.M) = 1*2*2*2*3*3*5*7 = 2520

The answer is 2520.

You might be interested in

What's the radius of a circle with an area of 64 square feet?

umka21 [38]

The answer is A. 4.51 ft. Hope this helps! :)

6 0

3 years ago

Read 2 more answers

What are the measures of Angles a, b, and c?<br><br> Show your work and explain your answers.

jolli1 [7]

Answer:

∡a has a vertical angle sibling of 40°, and vertical angles are always congruent.

∡b is the 3rd angle in a triangle, the other two are 40° and 90°, recall all interior angles in a triangle add up to 180°.

∡c is a linear angle, namely an angle on the same flat-line as another, and linear angles always add up to 180°.

Step-by-step explanation:

6 0

3 years ago

The leg of a right triangle is 2 units and the hypotenuse is 4 units. What is the length, in units, of the other leg of the tria

inysia [295]

The other leg of the units is 2

6 0

3 years ago

Read 2 more answers

Patricia had less than $9 to spend at the grocery store. she bought 1 pound of tomatoes and wanted to spend the rest of her mone

shepuryov [24]

2.40+2.20=4.60

9-4.60=4.40

Patricia has $4.40 left to spend (or save)

3 0

3 years ago

Read 2 more answers

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

3 years ago