Ask question

Ask question

All categories

4 years ago

11

tara needs 216 blocks. each box had 10 bags. each bag has 10blocks how many boxes bags and single blocks does she need to make 2

16 blocks

2 answers:

horsena [70]4 years ago

6 0

Answer: She needs 2 boxes,1 bag,6 blocks to make 216 blocks.

Explanation:-

Number of bags contained by each box =10

Number of blocks contained by each bag =10

Thus, Number of blocks contained by each box =10×10=100

Tara needs 216 blocks=200+10+6 [write in expanded form]

Here , hundreds place = number of boxes=2

ten place=number of bags=1

ones place=number of blocks=6

∴She needs 2 boxes,1 bag,6 blocks to make 216 blocks.

Fed [463]4 years ago

4 0

2 boxes, 1 bag, and 6 blocks

You might be interested in

Answer this question

IgorLugansk [536]

Answer:

id.k but i need points sorry

Step-by-step explanation:

5 0

3 years ago

Read 2 more answers

Explain how you would graph 3x+9y= -18 without converting to slope-intercept form

Zolol [24]

Answer:

you would solve using x and y intercepts.

Step-by-step explanation:

for the X intercept, Y=0

3x=-18. you divide by three on both sides

x=-6. (-6,0)

the for the y intercept, X=0

+9y=-18. you divide 9 on both sides.

y=-2. (0,-2)

then you graph both and connect the points on the x and y axis.

Brainiest always accepted!!!!1

8 0

4 years ago

16x²-102X=-36<br> How to write this in Vertex form

boyakko [2]

Answer:

x

Step-by-step explanation:

5 0

3 years ago

Use the Euclidean Algorithm to compute the greatest common divisors indicated. (a) gcd(20, 12) (b) gcd(100, 36) (c) gcd(207, 496

coldgirl [10]

Answer:

(a) $gcd(20, 12)=4$

(b) $gcd(100, 36)=4$

(c) $gcd(496,207 )=1$

Step-by-step explanation:

The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.

The Euclidean algorithm solves the problem:

<em> Given integers </em> $a, b$ <em>, find </em> $d=gcd(a,b)$ <em />

Here is an outline of the steps:

Let $a=x$ , $b=y$ .
Given $x, y$ , use the division algorithm to write $x=yq+r$ .
If $r=0$ , stop and output $y$ ; this is the gcd of $a, b$ .
If $r\neq 0$ , replace $(x,y)$ by $(y,r)$ . Go to step 2.

The division algorithm is an algorithm in which given 2 integers N and D, it computes their quotient Q and remainder R.

Let's say we have to divide N (dividend) by D (divisor). We will take the following steps:

Step 1: Subtract D from N repeatedly.

Step 2: The resulting number is known as the remainder R, and the number of times that D is subtracted is called the quotient Q.

(a) To find $gcd(20, 12)$ we apply the Euclidean algorithm:

$20 = 12\cdot 1 + 8\\ 12 = 8\cdot 1 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(20, 12)=4$ .

(b) To find $gcd(100, 36)$ we apply the Euclidean algorithm:

$100 = 36\cdot 2 + 28\\ 36 = 28\cdot1 + 8\\ 28 = 8\cdot 3 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(100, 36)=4$ .

(c) To find $gcd(496,207 )$ we apply the Euclidean algorithm:

$496 = 207\cdot 2 + 82\\ 207 = 82\cdot 2 + 43\\ 82 = 43\cdot 1 + 39\\ 43 = 39\cdot 1 + 4\\ 39 = 4\cdot 9 + 3\\ 4 = 3\cdot 1 + 1\\ 3 = 1\cdot 3 + 0$

The process stops since we reached 0, and we obtain $gcd(496,207 )=1$ .

3 0

3 years ago

An abstract sculpture in the form of a triangle has a base 21 meters and a height of 12 meters. Find the are of the triangle.

charle [14.2K]

The area of a triangle could be determined using the following formula
$\boxed{a= \frac{1}{2} \times b \times h}$

plug in the numbers
$a = \frac{1}{2} \times 21 \times 12$
$a = \frac{1}{2} \times 252$
$a= \frac{252}{2}$
a = 126

The area of the triangle is 126 square meters

8 0

3 years ago