Rachel is going on a trip to Japan. The table below shows the cities she hopes to visit during her stay, as well as the amount
of money she expects to spend in each one after taking into account food, shopping, transportation, and similar costs. All
costs are given in Japanese yen (¥).
City
Sendai
Nara
Sapporo
Tokyo
Hiroshima
Kyoto
Osaka
Cost (¥)
6,450
6,824
6,106
8,670
5,768
7,611
8,215
Because Rachel has only ¥36,000 to spend on this portion of her trip, she has decided that she must remove two cities from
her itinerary. Which of the following is the cheapest pair of cities she can drop and still stay within her budget?
a. Nara and Sapporo
b. Hiroshima and Kyoto
c. Osaka and Sendai
d Connora and Kuoto
Save and Evit
han

Respuesta :

The two cheapest cities she can remove from the list and she will still be able to stay within her budget of ¥36,000 are Sapporo and Kyoto.

What is a word problem?

A word problem in mathematics involves the use of mathematical understanding of variables and arithmetic operations to solve real-life scenarios.

From the given information, we have the following table:

City                  Cost(¥)

Sendai              6,450

Nara                 6,824

Sapporo           6,106  

Tokyo              8,670

Hiroshima       5,768  

Kyoto               7,611

Osaka             8,215

The total amount of all the cities are:

¥(6450 + 6824 + 6106 + 8670 + 5768 + 7611 + 8215) = ¥3600

¥49644 ≠  ¥3600

Taking the two cheapest cities out of all cities, we will choose  Sapporo and Kyoto. By doing so, we have:

¥(6450 + 6824 + 8670 + 5768 + 8215) = ¥3600

¥35927 <  ¥3600

Therefore, we can conclude that if Rachel has a total amount of ¥36,000 to spend on a trip, the two cheapest she can remove from the list and she will still be able to stay within her budget of ¥36,000 are Sapporo and Kyoto.

Learn more about solving questions related to word problems here:

https://brainly.com/question/13818690

#SPJ2

ACCESS MORE