All categories

2 years ago

Use compatible numbers to estimate the number 5,686.

Mathematics

1 answer:

Zielflug [23.3K]2 years ago

8 0

Answer:

The esitmated version of 5686 divided by 80 is 5680/80.

Step-by-step explanation:

Both numbers are compatible, and they round correctly.

Thank you hope this helped!

You might be interested in

Algebra stratigies? what are some? I need answer Fast

Natali [406]

There are many strategies that can be used it really depends on what kind of questions you're answering.

5 0

3 years ago

Read 2 more answers

Note: Enter your answer and show all the steps that you use to solve this problem in the space provided.

nika2105 [10]

Step-by-step explanation:

13 + 22 = 35 degree change. 10-3 = 7. 35/7 = 5 degrees per hour.

4 0

3 years ago

Si mi disco duro tiene una capacidad de 1.5 Terabytes ¿ cuántas llaves de 32 Gigabits caben en ese disco duro?

Art [367]

Answer:

The number of 32 Gigabit keys that can be fitted on the hard drive is 375.

Step-by-step explanation:

The question is:

If my hard drive has a capacity of 1.5 Terabytes, how many 32 Gigabit keys can fit on that hard drive?

Solution:

1 Terabyte = 8000 Gigabits

Then 1.5 Terabytes in Gigabits is:

1.5 Terabytes = (8000 × 1.5) Gigabits

= 12000 Gigabits

One key is of 32 Gigabits.

Compute the number of 32 Gigabit keys that can be fitted on the hard drive as follows:

$\text{Number of 32 Gigabit keys}=\frac{12000}{32}=375$

Thus, the number of 32 Gigabit keys that can be fitted on the hard drive is 375.

4 0

3 years ago

Please answer this for me correctly I am new to brain.ly and thanks! :)

77julia77 [94]

B. You're welcome sis

4 0

3 years ago

Read 2 more answers

A playground is being designed where children can interact with their friends in certain combinations. If there is 1 child, ther

mariarad [96]

<h2>Answer:</h2>

Recursive equation for the pattern followed is given by,

$a_{n}=a_{n-1}+(n-1)^{2}$

<h2>Step-by-step explanation:</h2>

In the question,

The number of interaction for 1 child = 0

Number of interactions for 2 children = 1

Number of interactions for 3 children = 5

Number of interaction for 4 children = 14

So,

We need to find out the pattern for the recursive equation for the given conditions.

So,

We see that,

$a_{1}=0\\a_{2}=1\\a_{3}=5\\a_{4}=14\\$

Therefore, on checking, we observe that,

$a_{n}=a_{n-1}+(n-1)^{2}$

On checking the equation at the given values of 'n' of, 1, 2, 3 and 4.

At,

n = 1

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{1}=a_{1-1}+(1-1)^{2}\\a_{1}=0+0=0\\a_{1}=0$

which is true.

At,

n = 2

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{2}=a_{2-1}+(2-1)^{2}\\a_{2}=a_{1}+1\\a_{2}=1$

Which is also true.

At,

n = 3

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{3}=a_{3-1}+(3-1)^{2}\\a_{3}=a_{2}+4\\a_{3}=5$

Which is true.

At,

n = 4

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{4}=a_{4-1}+(4-1)^{2}\\a_{4}=a_{3}+9\\a_{4}=14$

This is also true at the given value of 'n'.

Therefore, the recursive equation for the pattern followed is given by,

$a_{n}=a_{n-1}+(n-1)^{2}$

3 0

3 years ago