Show a way to count from 170 to 410 using tens and hundreds. circle at least 1 benchmark number
2 answers:
Benchmark are numbers that are used as standards to which the rest of the data is compared to. When counting numbers using a number line, the benchmark numbers are the intervals written on the axis. For benchmark numbers of 10, the number line on top of the attached picture is shown. Starting from 170, the tick marks are added by 10, such that the next numbers are 180, 190, 200, and so on and so forth. When you want to find 410, just find the benchmark number 410.
The same applies to benchmark numbers in intervals of 100. If you want to find 170, used the benchmark numbers 100 and 200. Then, you estimate at which point represents 170. For 410, you base on the benchmark numbers 400 and 500.
The same applies to benchmark numbers in intervals of 100. If you want to find 170, used the benchmark numbers 100 and 200. Then, you estimate at which point represents 170. For 410, you base on the benchmark numbers 400 and 500.
You might be interested in
The first step for finding out if the expression provided is equivalent to 
is to reduce the fraction with
.
Now reduce the fraction with y.
Finally,, reduce the fraction with 8 to get your final answer.
Let me know if you have any further questions.
:)
Now reduce the fraction with y.
Finally,, reduce the fraction with 8 to get your final answer.
Let me know if you have any further questions.
:)
Answer:
- First option of the figure:
Explanation:
Assume that the complete question includes the following description of how the pennies are placed on the chessboard:
"If a chessboard (8×8) were to have pennies placed on each square such that 1 penny was placed on the first square, 2 on the second, 4 on the third, and so on (doubling the number of pennies on each subsequent square), how many pennies would be on the chessboard when finished?"
From that you can write the first terms of the sequence that represent such description
Square number of pennies power form
1 1 1 × 2⁰
2 2 1 × 2¹
3 4 1 × 2²
4 8 1 × 2³
5 16 1 × 2⁴
n 1 × 2ⁿ⁻¹
64 1 × 2⁶³
Hence, you to have the total number of pennies you have to sum the number of pennies on every square of the chessboard, which will lead to :
1 × 2⁰ + 1 × 2¹ + 1 × 2² + 1 × 2³ + 1 × 2⁴ + ... 1 × 2ⁿ⁻¹ up to n = 64 or n - 1 = 63.
That is the sum from n = 1 to 64 - 1 of 1 × 2ⁿ⁻¹, which using summation form is the first option on the picture.