The segment
There is a system of equations
There are two sets of numbers made up of 1s and
Two people play a game with the following rules: one of them guesses a set of integers
Given
A system of points connected by segments is called “connected” if from each point one can go to any other one along these segments. Is it possible to connect five points to a connected system so that when erasing any segment, exactly two connected points systems are formed that are not related to each other? (We assume that in the intersection of the segments, the transition from one of them to another is impossible).
Two players play on a square field of size
At what value of
Airlines connect pairs of cities. How can you connect 50 cities with the fewest number of airlines so that from every city you can get to any other city by taking at most two flights?
Two lines on the plane intersect at an angle