Jump to content

Is it possible under such conditions of the problem, to answer the proposed question?


devami

Recommended Posts

Имеем бесконечное количество яблок. Распространение их на бесконечное множество ofidentical число groups.In каждой группы 5 apples.Now от eachgroup вывезти 2 яблока. Осталось 3.

 

Theremainder множества разбит на бесконечное множество groups.In eachgroup и 7 яблок. Теперь возьмите за 2 яблока. Остается 5apples.

 

Theremainder множества разбит на бесконечное множество groups.In eachgroup, и 11 яблок. Теперь возьмите за 2 яблока. Остается 9apples.

 

 

 

 

Andso на неопределенный срок. Захват 2/n. Сохранить N-2/N) . N-простых чисел в order.Question: как manyapples останется? Конечного или бесконечного?

Edited by devami
Link to comment
Share on other sites

As I read it (google translator iyf): we start with an infinite set of apples - partitioned into subsets of 5. From each of those, two are taken and the set is repartitioned into sets of 7 and two apples are again removed from each subset. This is repeated indefinitely, with partitions into subsets of prime sizes.

 

As I understood that: We start with apples {1,2,3,4,5,6,...} and in the first iteration we remove {5,6} U {10,11} U {15,16}... in the second iteration we remove {7,8} U {14,15} U {21,22}... in the third iteration we remove {11,12} U {22,23} U {33,44}...

 

The question is simple enough to understand, after infinite iterations, what has been allowed through this sieve?

 

The answer, I don't know - but some experimenting seems to show that a large amount of numbers do get through - so I'd be tempted to say that it's infinite.

 

I'm sure this can be solved though - so the answer to the question poised in the topic - is yes.

Link to comment
Share on other sites

[Цитата имя = 'Дата DJBruce' = '22 августа 2010 - 3:49 вечера 'метка = '1282484953' пост = '561153 ']

У вас может быть, на английском языке на вопрос, или на каком языке это так мы можем перевести это?

[/] Цитатой

 

Please!Original in Russian!Thank you in advance.

Zagadka.pdf

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.