Skip to content

Posts from Quiz Auto-translated

5.0 (1 rating)
User Avatar
#929
Auto-translated
Yes, Yashur is right. Calculation: The Earth's radius is approximately 6371 km, the length of the railway from Omsk to Moscow is about 2676 km, and the distance between the upper and lower bunks is about a meter. Let's assume the railway is a perfect arc (and we won't be too far off). 2676/6371 * (1/6371 - 1/6371.001) = 42 centimeters. Those who are not lazy can calculate with all the errors, and in general, they say that the distance between the bunks is not a meter, but 923 mm.
User Avatar
#930
Auto-translated
A “lying” rectangle is divided in half by a horizontal line segment. The lower half is, in turn, divided in half by a vertical line segment, and the upper half is divided into 3 equal parts by two more vertical line segments. You need to draw a curve without lifting the pencil from the paper, crossing all the line segments of the resulting figure (two or more line segments lying on the same line are not counted as one line segment; intersection means "inside the line segment") exactly once. How?

P.S. A well-reasoned "It's impossible" is also an answer.

Ничто не возникает из ничего и ничто не пропадает бесследно.
Если где-то чего-то убудет, то в другом месте добавится.

(Закон сохранения).

In reply to Злобный Ящур
User Avatar
#931
Auto-translated
Злобный Ящур
Well, well... This solution doesn't seem to match the "examples" given in the question. It says that if 2 and 3 have the same color, then 1 must name exactly that color. But according to the "algorithm," if the colors are white, then 1 must name... blue.
Those weren't examples, but solutions for the cases of saving half and 2/3 of the sages; and a solution for the case of guaranteed rescue of 99 sages does not necessarily have to correspond to them.
Злобный Ящур
Based on which Criminal Code article theorem, axiom, etc., is this conclusion made? ;)
I don't know. Probably also based on the fact that 2+2=4 and 4-2=2. In my opinion, it's clear even without any proofs.

Added after 4 minutes
If it really isn't clear, I will try to explain using an example with 10 sages. Set the colors of their hats then, and we'll count together.
Всё не так плохо как Вы думаете. Всё намного хуже!
User Avatar
#932
Auto-translated
It's impossible because you can't draw a rectangle with intersecting diagonals without lifting the pencil from the paper or retracing a line.
Смысла нет, но вы держитесь там. Удачи, здоровья, хорошего настроения!
И пока в кармане пачка милкиуэйев - значит все не так уж плохо на сегодняшний день



In reply to Злобный Ящур
User Avatar
#933
Auto-translated
Evil Lizard
A "lying" rectangle is divided in half by a horizontal line. The lower half is in turn divided in half by a vertical line, and the upper half is divided into 3 equal parts by two vertical lines. You need to draw a curve without lifting the pencil from the paper, crossing all the lines of the resulting figure (two or more lines lying on the same line are not counted as one line; intersection means "inside the line") exactly once. How?

P.S. An argued "No way" is also an answer.

Looks like there's no way! And I have an idea how to prove it!!! Paths on a graph!!!
Всё не так плохо как Вы думаете. Всё намного хуже!
In reply to Hermit
User Avatar
#934
Auto-translated
Hermit
Looks like there's no way! And I have an idea how to prove it!!! Paths on the graph!!!
I'm all ears!:smile04:

Ничто не возникает из ничего и ничто не пропадает бесследно.
Если где-то чего-то убудет, то в другом месте добавится.

(Закон сохранения).

User Avatar
#935
Auto-translated
A connected graph is Eulerian if and only if the degree of each of its vertices is even.
Всё не так плохо как Вы думаете. Всё намного хуже!
User Avatar
#937
Auto-translated
A cycle in a graph is called Eulerian if it contains all the edges of the graph. A connected graph that has an Eulerian cycle is called an Eulerian graph. Such a graph can be drawn without lifting the pencil from the paper and without repeating any lines.
Всё не так плохо как Вы думаете. Всё намного хуже!
In reply to Hermit
User Avatar
#938
Auto-translated
Hermit
A connected graph is Eulerian if and only if the degree of each of its vertices is even.
And what does the aforementioned dissected rectangle have to do with it?

Added 2 minutes later
Yuuhei
I officially declare that I don't like this topic.
But do you like this one and others by the same author?:mad:

Ничто не возникает из ничего и ничто не пропадает бесследно.
Если где-то чего-то убудет, то в другом месте добавится.

(Закон сохранения).

User Avatar
#939
Auto-translated
Ashet created Reveng and the mafia, so...
А, вот почему.

🏹🎪+⛓️♿=💕
User Avatar
#940
Auto-translated


The degrees of vertices B and D are not odd!!! Therefore, it is impossible to construct an Eulerian cycle!!!
Всё не так плохо как Вы думаете. Всё намного хуже!
In reply to Драккошка
User Avatar
#941
Auto-translated
Draccoshka
Ashet created Rhubarb and the mafias, so...
Ok, I'll clarify.
And do you like this one and others by the same author in this section?:mad:

Ничто не возникает из ничего и ничто не пропадает бесследно.
Если где-то чего-то убудет, то в другом месте добавится.

(Закон сохранения).

User Avatar
#942
Auto-translated
Do you also like this one and other works by the same author?
This author is on my list of favorites; I even have a huge portrait of him in my room – I stuck it over the mirror.

Стартовый пост - Квенты - Разное - Список НПС -
Резара - Аксель - Орвальд - ЭмилияСтэфания - Амвросий - ЛестерАльсираАлария

User Avatar
#943
Auto-translated
Compared to the thread about politics, this one is a solid 10/10.
А, вот почему.

🏹🎪+⛓️♿=💕