Ask question

Ask question

All categories

1 year ago

6

The scale of a map is 1in:15miles. How many miles is it from Philadelphia, Pa to Boston, Ma if they are 20.4 inches apart on the

map?

1 answer:

cupoosta [38]1 year ago

4 0

Answer:

if 1in=15miles

then20.4in=? miles

1in by ? miles and 20.4in by 15miles

1in ? miles= 306in miles

divide both sides by 1in

? miles= 306 miles

therefore 20.4in = 306miles

You might be interested in

At a sale this week, a desk is being sold for 128.80. This is a 72% discount from the original price. What is the original price

wel

Answer:

$460

Step-by-step explanation:

If the 128.80 is the price of the desk after a 72% discount, it means that 128.80 is 100-72=28% of the original price.

From here, we can divide 128.80 by 28 to find what 1% of the price is then multiply the value by 100 to find 100%, or the original price.

128.80/28 = 4.6

4.6 x 100 = 460

Original price = $460

Hope this helped!

6 0

2 years ago

HELPP ME ITS BEEN SO LONG HELP PLEASEEE HELP PLEASEE HELPP Stevie needed twine for the gifts she was wrapping for a family party

Tamiku [17]

Answer:

Your answer would be:

57.75 or 57 3/4

(I will show how many of each length of twine that is on the graph)

Point 2 1/4:

2

Point 2 3/4:

4

Point 3:

1

Point 3 1/2:

2

Point 3 3/4:

3

Point 4:

1

Point 4 1/4:

4

We can show how much length in total Stevie used with the following equation:

(2 1/4 x 2) + (2 3/4 x 4) + ( 3 x 1 ) + ( 3 1/2 x 2 ) + (3 3/4 x 3 ) + (4 x 1 ) + (4 1/4 x 4)

Each smaller equation in paraphrases shows how much of each length of twine at each point with x's on the number line. Altogether it would equal 57.75 or 57 3/4.

Step-by-step explanation:

Have a great rest of your day

#TheWizzer

3 0

1 year ago

Using the bijection rule to count binary strings with even parity.

AleksandrR [38]

Answer:

Lets denote c the concatenation of strings. For a binary string <em>a</em> in B9, we define the element f(a) in E10 this way:

f(a) = a c {1} if a has an odd number of 1's
f(a) = a c {0} if a has an even number of 1's

Step-by-step explanation:

To show that the function f defined above is a bijective function, we need to prove that f is well defined, injective and surjective.

f is well defined:

To see this, we need to show that f sends elements fromo b9 to elements of E10. first note that f(a) has 1 more binary integer than a, thus, it has 10. if a has an even number of 1's, then f(a) also has an even number because a 0 was added. On the other hand, if a has an odd number of 1's, then f(a) has one more 1, as a consecuence it will have an even number of 1's. This shows that, independently of the case, f(a) is an element of E10. Thus, f is well defined.

f is injective (or one on one):

If a and b are 2 different binary strings, then f(a) and f(b) will also be different because the first 9 elements of f(a) form a and the first elements of f(b) form b, thus f(a) is different from f(b). This proves that f in injective.

f is surjective:

Let y be an element of E10, Let x be the first 9 elements of y, then f(x) = y:

If x has an even number of 1's, then the last digit of y has to be 0, and f(x) = x c {0} = y
If x has an odd number of 1's, then the last digit of y has to be a 1, otherwise it wont be an element of E10, and f(x) = x c {1} = y

This shows that f is well defined from B9 to E10, injective, and surjective, thus it is a bijection.

3 0

3 years ago

Help pls and thxxxxxxx

tangare [24]

Answer:

B

Step-by-step explanation:

7 0

2 years ago

Read 2 more answers

My bad i accidentally made a psot

snow_tiger [21]

Noice that means points for me lol

8 0

3 years ago