Ask question

Ask question

All categories

3 years ago

10

Walden’s family is shopping for a reclining chair. The chair the family decided on has a retail price of $800 plus 5% sales tax

at four stores. Each store is offering a different promotion.

2 answers:

dusya [7]3 years ago

8 0

You haven't asked a question here, but $800 + 5% tax is 800* 1.05 which is equal to $840.
The chairs regular price is $840. I have no Idea what it is with any of the promotions though, because you didn't say what they are.

natta225 [31]3 years ago

4 0

Answer:

it's store B :)

Step-by-step explanation:

You might be interested in

Which fraction represents the decimal 0.8888...?

suter [353]

Answer: The decimal 0.88888.... represented by the fraction $\dfrac{8}{9}$

Step-by-step explanation:

Since we have given that

0.888888....

So, Let x = 0.88888....= $0.\bar{8}$ -----(1)

Now, multiply by 10 on both sides, we get that

$10x=8.8888.....=8.\bar{8}----------(2)$

Now, Subtracting (1) from (2), we get that

$10x-x=8.\bar{8}-0.\bar{8}\\\\9x=8\\\\x=\dfrac{8}{9}$

Hence, the decimal 0.88888.... represented by the fraction $\dfrac{8}{9}$

8 0

3 years ago

Read 2 more answers

-2/3 divided by (-15)

Travka [436]

2 over 45 just so that you know

6 0

3 years ago

(4.2 X 10 Power of four) X (2 x 10 Power of three)

SashulF [63]

Answer:

(4.2 X 10,000) X (2 X 1,000)

42,000 X 2,000= 84,000,000

Step-by-step explanation:

Hope this helps

3 0

3 years ago

Read 2 more answers

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

Is RATIONAL , IRRATIONAL,NON REAL NUMBERS <br><img src="https://tex.z-dn.net/?f=%20%5Csqrt%7B27" id="TexFormula1" title=" \sqrt{

Tanya [424]

Answer:

It's irrational

Step-by-step explanation:

the square root of 27 is equal to:

$\sqrt{27} = \sqrt{3\cdot3\cdot3} = 3\sqrt{3}$

We know that $\sqrt{3}$ is an irrational number (but a real number), so $3\sqrt{3}$ is the same.

In case we need to prove that $\sqrt{3}$ is irrational, please leave a comment.

8 0

3 years ago

Read 2 more answers