All categories

4 years ago

A computer was on sale for 2/3 of the original price.If the original price was 900 dollars what was the sale price

Mathematics

1 answer:

Alexxx [7]4 years ago

6 0

Answer: The sale price is $600.

Explanation:

Since we have given that

The original price of a computer = 900 dollars

According to question, we have given that the sale price was $\frac{2}{3}$ of the original price,

So,

Sale price is given by

$\frac{2}3}\times 900\\\\=2\times 300\\\\=\$600$

Hence, the sale price is $600.

You might be interested in

Please help. I've been trying to figure this out for an hour and I still don't understand how it's 72. I feel really stupid beca

rosijanka [135]

Answer:

C. $72\pi$

Step-by-step explanation:

The radius of the circle is 24 units, then the area of the whole circle is

$\pi r^2=\pi \cdot 24^2=576\pi \ un^2.$

The shaded circle is limited by 45° angle, so its area is

$\dfrac{45}{360}=\dfrac{1}{8}$

of the area of the whole circle.

The area of the shaded circle is

$\dfrac{1}{8}\cdot 576\pi =72\pi \ un^2.$

3 0

4 years ago

Directions: Using the digits 1 to 9, at most one time each, fill in the boxes to find the largest or smallest possible values fo

12345 [234]

9514 1404 393

Answer:

smallest: 8x -3 = 4; 1y +9 = 2. total = -49/8

largest: 1x -9 = 8; 2y +3 = 7. total = 19

Step-by-step explanation:

If we use variables to represent the box contents, we can write ...

ax -b = c
dy +e = f

Then the values of x and y are ...

x = (c +b)/a

y = (f -e)/d

For positive integer values of the variables, x will always be positive, and y may or may not be negative.

<h3>Smallest sum</h3>

For the sum to be the smallest, we must have x be as small as possible and the ratio (f-e)/d be as negative as possible.

x will be small for large 'a' and for (c+b) small. For y to be as negative as possible, we want 'd' and 'f' small and 'e' large. Best results are obtained for

8x -3 = 4 ⇒ x = 7/8
1y +9 = 2 ⇒ y = -7

For these coefficients, the sum is -6 1/8 = -49/8.

(note that the values of 'b' and 'c' can be swapped with no net effect)

<h3>Largest sum</h3>

For the sum to be the largest, we must have x as large as possible: (b+c) large and 'a' small. At the same time we must have y be positive and as large as possible: (f-e) positive and large, 'd' small. Best results are obtained for