Pure maths, physics, logic (braingames.ru): non-trade-related brain games - page 92
You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
The occupiers are subtle. They can stick it any way they like. And a megamosque has to survive either way.
And megamozk must survive in any case.
Not necessarily.
The question is about can Megamogs always be saved by choosing the right starting point?
I mean, it's accepted that it might not save itself.
The problem is to find the maximum sum of distances, so that it is not less than 6 km.
I haven't yet encountered a problem where a megamosk can't survive.
(4) There are 2 blue, 2 red and 2 green balloons. In each colour, one of the balloons is heavier than the other. All the lighter balls have the same weight and all the heavier ones have the same weight. There are also scales with two cups without weights. How many weighings are minimally needed to guarantee that the heavy balls are determined?
I may be wrong but I think 3 ! First we measure two balls of the same colour to identify the heavy one! Then we take the heavy ball and measure with any ball of another colour - if the other ball is balanced then it is heavy if it yields then it is light !
If three, why bother :))) measure each colour in pairs. that's exactly three times.
I've yet to see a task in which a megamosk could not survive.
The occupiers are subtle. They can stick it any way they like. And the megamosque has to survive whatever it takes.