Ask question

Ask question

All categories

2 years ago

12

Please help me ASAP!!! Will give brainlist:))

1 answer:

trasher [3.6K]2 years ago

5 0

Answer:

I think it is D

Step-by-step explanation:

I am guessing because the stem should be 5 for sure but I am not so sure about my answer it leaves you with one of the choices with the number 5 in them.

I hoped I kinda helped if I didn't I am so sorry :(

You might be interested in

Arun took a taxi from his house to the airport. The taxi company charged a pick-up fee of $4 plus $4.25 per mile. The total fare

Natasha2012 [34]

Here we must write and solve a linear equation to find the number of miles that Arun traveled in the taxi. We will find that Eva traveled 11 miles.

So we know that the taxi charges a fee of $4.10 and then a plus of $0.50 per mile.

So if you travel for m miles, the cost equation is:

C(m) = $4.10 + $0.50*m

Now, we know that for Eva the total fare (total cost) was $9.60, then we need to solve:

$9.60 = C(m) = $4.10 + $0.50*m

$9.60 = $4.10 + $0.50*m

$9.60 - $4.10 = $0.50*m

$5.50 = $0.50*m

$5.50/$0.50 = m = 11

This means that Arun traveled 11 miles in the taxi.

5 0

1 year 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

2 years ago

10. Melissa has $20 to buy bagels and juice for her class. box of bagels bottle of juice 56.13, including tax $2.08, including t

adelina 88 [10]

The inequality for the maximum number of bottles of juice she can buy

6.13+ 2.08b <20.00

Option B

Given

Melissa has $20 to buy bagels and juice for her class

Box of bagels : 6.13 including tax

Bottle of juice: 2.08 including tax

She will buy only one box of bagels that is for 6.13

Let 'b' be the number of bottles of juice she can buy

Total cost should be less than 20 dollars

6.13(one bagels) +2.08(bottles of juices)<20

So the inequality becomes

$6.13+2.08b$

Learn more : brainly.com/question/1836165

4 0

1 year ago

Please help me on these two questions

irina [24]

Answer:A for the first one and C for the second one

Step-by-step explanation:

3 0

3 years ago

Read 2 more answers

1.) If I am selling a dozen at $3, how much would each egg cost?

riadik2000 [5.3K]

Answer:

1.$3÷12=0.25

each egg would cost 25 cents

2.12×18=216

216×25=5,400

6 0

2 years ago