All categories

3 years ago

Find the sale price to the nearest cent $60 shoes; 15%

Mathematics

1 answer:

Katen [24]3 years ago

4 0

Answer: $51

60 * .15 = 9
60 - 9 = $51

You might be interested in

Which of the following functions is quadratic?

madam [21]

Answer:

f(x)=3(x-4)(x+3)

Step-by-step explanation:

Quadratic function follows the f(x) = ax^2 +bx+c pattern

f(x)=3(x-4)(x+3) after multiplying out is equal to

f(x)=(3x-12)(x+3) = (3x^2+9x-12x-36) = (3x^2-3x-36)

f(x) = (3x^2-3x-36)

where

a = 3

b = -3

c = -36

7 0

4 years ago

How do I find Mean Absolute deviation again? I forgot. URGENT!

Luba_88 [7]

Answer:

To find the mean absolute deviation of the data, start by finding the mean of the data set. Find the sum of the data values, and divide the sum by the number of data values. Find the absolute value of the difference between each data value and the mean

Step-by-step explanation:

4 0

3 years ago

PLEASE HELPPP ME! brainliest

Vikentia [17]

Whats in the drop down menu??

7 0

3 years ago

Read 2 more answers

It takes Manisha 38 seconds to climb up the stairs of her house. If she spends 504 seconds doing this, how many minutes has she

Mrac [35]

Answer:

Manisha spent 8 minutes and 24 seconds in a week climibing the stairs of her house.

Step-by-step explanation: (totally my work, not copied)

Convert seconds to minutes.

60x8=480

60x9=540

so, 8 minutes

Find the remaining seconds.

504-480=24

Add remaining seconds to minutes

24sec+8min=8min24sec

So hence, your answer is 8 Minutes and 24 Seconds

Manisha spent 8 minutes and 24 seconds in a week climbing the stair of her house.

Thanks!

Mark me brainliest!

~ $FieryAnswererGT$ ~

5 0

3 years ago

The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is

HACTEHA [7]

Answer:

False

Step-by-step explanation:

Euclidean Algorithm is the algorithm that allows us to find the greatest common divisor (gcd) of two integers by repetitive application of the division algorithm.

A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder.

Quotient and/or Remainder = $\frac{N}{D}$

8 0

3 years ago