Question

В лесу на разных кустах висят 200 шнурков. Сова утверждает, что в среднем 9 шнурков из 10 ей не подходят. Ослик Иа утверждает, что в среднем 3 из 4 шнурков ему не подходят. Сколько шнурков , висящих на кустах , не подходят ни Сове, ни Иа? Найди наименьшее возможное число. Запиши решение и ответ.

Answer 1

1)200:10*9=180 (шн) - не подходят Сове
2) 200:4*3=150(шн) - не подходят Иа.
3)200-180=20(шн) - подходит сове.
4) 200-150=50(шн) - подходят Иа.
5)180-50=130(шн) - не подходят Сове и ИА.
6) 150-20=130(шн) - не подходят Сове и Иа. Наименьшее, оно же и единственное - 130 шнурков не подходит Сове и Иа одновременно.
Ответ: 130 шнурков.

Answer 2

Problem Analysis

In the forest, there are 200 strings hanging on different bushes. The owl claims that on average, 9 out of 10 strings do not fit her. The donkey Ia claims that on average, 3 out of 4 strings do not fit him. We need to find the minimum possible number of strings that do not fit either the owl or the donkey.

Solution

To find the minimum possible number of strings that do not fit either the owl or the donkey, we need to consider the worst-case scenario for both animals.

Let's start by calculating the number of strings that do not fit the owl. According to the owl, on average, 9 out of 10 strings do not fit her. We can calculate the number of strings that do not fit the owl as follows:

Number of strings that do not fit the owl = (9/10) * 200

Next, let's calculate the number of strings that do not fit the donkey. According to the donkey, on average, 3 out of 4 strings do not fit him. We can calculate the number of strings that do not fit the donkey as follows:

Number of strings that do not fit the donkey = (3/4) * 200

To find the minimum possible number of strings that do not fit either the owl or the donkey, we need to find the maximum of these two values. Therefore, the minimum possible number of strings that do not fit either the owl or the donkey is:

Minimum number of strings that do not fit either the owl or the donkey = max(Number of strings that do not fit the owl, Number of strings that do not fit the donkey)

Now, let's calculate the values:

Number of strings that do not fit the owl = (9/10) * 200 = 180

Number of strings that do not fit the donkey = (3/4) * 200 = 150

Therefore, the minimum possible number of strings that do not fit either the owl or the donkey is:

Minimum number of strings that do not fit either the owl or the donkey = max(180, 150) = 180

So, the minimum possible number of strings that do not fit either the owl or the donkey is 180.

Answer

The minimum possible number of strings that do not fit either the owl or the donkey is 180.