Ask question

Ask question

All categories

2 years ago

6

Estimate the quotient by rounding the expression to relate to a one-digit fact. Explain your thinking in the space below. a. 432

÷ 73 ___________ b. 1,275 ÷ 588 ___________

1 answer:

erastovalidia [21]2 years ago

8 0

Answer:

5 remainder 50 and 2 remainder 100

Step-by-step explanation:

432 /73

432=400

73=70

70/400 = 005 Remainder 50

1275=1300

588=600

1300/600=2 remainder 100

You might be interested in

PLEASE HELP BEST ANSWER ILL GIVE BRAINLIEST!!

MrRa [10]

It’s b) an =-125(-^2/5)^n

4 0

2 years ago

Look at points C and D on the graph:

anyanavicka [17]

I think C Tell me if I’m wrong

7 0

3 years ago

Read 2 more answers

Michael bought 0.44 pound of slice turkey. what is the value of the digit in the hundredths place?

jarptica [38.1K]

Answer:

4

Step-by-step explanation:

You have 0.44

0 is in the ones place

4 is in the tenths place (0.4)

And the other 4 is in the hundredths place (0.04)

8 0

2 years ago

Read 2 more answers

A basketball team has 12 players. In how many different ways can the coach select 2 players to be the captains for tonight's gam

Elza [17]

I wanna say 6 cause 12 divided by 2 is 6 :)

6 0

3 years ago

Determine formula of the nth term 2, 6, 12 20 30,42

nalin [4]

Check the forward differences of the sequence.

If $\{a_n\} = \{2,6,12,20,30,42,\ldots\}$ , then let $\{b_n\}$ be the sequence of first-order differences of $\{a_n\}$ . That is, for n ≥ 1,

$b_n = a_{n+1} - a_n$

so that $\{b_n\} = \{4, 6, 8, 10, 12, \ldots\}$ .

Let $\{c_n\}$ be the sequence of differences of $\{b_n\}$ ,

$c_n = b_{n+1} - b_n$

and we see that this is a constant sequence, $\{c_n\} = \{2, 2, 2, 2, \ldots\}$ . In other words, $\{b_n\}$ is an arithmetic sequence with common difference between terms of 2. That is,

$2 = b_{n+1} - b_n \implies b_{n+1} = b_n + 2$

and we can solve for $b_n$ in terms of $b_1=4$ :

$b_{n+1} = b_n + 2$

$b_{n+1} = (b_{n-1}+2) + 2 = b_{n-1} + 2\times2$

$b_{n+1} = (b_{n-2}+2) + 2\times2 = b_{n-2} + 3\times2$

and so on down to

$b_{n+1} = b_1 + 2n \implies b_{n+1} = 2n + 4 \implies b_n = 2(n-1)+4 = 2(n + 1)$

We solve for $a_n$ in the same way.

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

Then

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

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

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

and so on down to

$a_{n+1} = a_1 + 2 \displaystyle \sum_{k=2}^{n+1} k = 2 + 2 \times \frac{n(n+3)}2$

$\implies a_{n+1} = n^2 + 3n + 2 \implies \boxed{a_n = n^2 + n}$

6 0

1 year ago