Ask question

Ask question

All categories

3 years ago

7

In a parking lot, 15% of the cars are blue. There are 12 blue cars in the parking lot. How many total cars are there? How many c

ars in the parking lot are not blue?

1 answer:

vagabundo [1.1K]3 years ago

3 0

There are eighty cars in the parking lot and sixty eight are not blue.

You might be interested in

The scale on a map shows that 1 inch = 30 miles. If there are 4.5 inches between your present location and the place you want to

anastassius [24]

Scale : 1 inch = 30 miles

So, the ratio between the distance on the map and the real distance is 1:30

When a quantity increase/decrease in a ratio, the other one increase/decrease respectively.

Call the miles we have to go : x

1:30 = 4.5:x

(1x4.5):(30x4.5) = 4.5 : x

4.5 : 135 = 4.5 : x

So, x = 135 => We have to go 135 miles to get to the place we want to go.

6 0

2 years ago

Michael is using a number line to evaluate the expression –8 – 3. A number line going from negative 12 to positive 12. A point i

Nata [24]

Answer:

move to the left 3 more spaces

Step-by-step explanation:

you are at -8 already. Therefore, you (-3) more spaces, so you go to the left three more spaces. Use the saying keep change change to help with this.

Keep the first number sign, change the next sign, and the next sign.

6 0

3 years ago

The pet store has 18 dogs toys for sale. 10 toys are frisbees and the rest are bones. What is the ratio of bones to frisbees in

tangare [24]

Answer:

4 : 5

Step-by-step explanation:

18 - 10 = 8 (Bones)

Bones to frisbees

8 : 10

Simplest form which is divided by 2 for each number:

4 : 5

5 0

3 years ago

Read 2 more answers

Pls help me i only have 5 minutes

Sauron [17]

Answer:

it is A because slouch means stand or move in a Lazy way

8 0

3 years ago

Find the smallest positive $n$ such that \begin{align*} n &\equiv 3 \pmod{4}, \\ n &\equiv 2 \pmod{5}, \\ n &\equiv

Alex777 [14]

4, 5, and 7 are mutually coprime, so you can use the Chinese remainder theorem right away.

We construct a number $x$ such that taking it mod 4, 5, and 7 leaves the desired remainders:

$x=3\cdot5\cdot7+4\cdot2\cdot7+4\cdot5\cdot6$

Taken mod 4, the last two terms vanish and we have

$x\equiv3\cdot5\cdot7\equiv105\equiv1\pmod4$

so we multiply the first term by 3.

Taken mod 5, the first and last terms vanish and we have

$x\equiv4\cdot2\cdot7\equiv51\equiv1\pmod5$

so we multiply the second term by 2.

Taken mod 7, the first two terms vanish and we have

$x\equiv4\cdot5\cdot6\equiv120\equiv1\pmod7$

so we multiply the last term by 7.

Now,

$x=3^2\cdot5\cdot7+4\cdot2^2\cdot7+4\cdot5\cdot6^2=1147$

By the CRT, the system of congruences has a general solution

$n\equiv1147\pmod{4\cdot5\cdot7}\implies\boxed{n\equiv27\pmod{140}}$

or all integers $27+140k$ , $k\in\mathbb Z$ , the least (and positive) of which is 27.

3 0

3 years ago