Alice finally decided to do some arithmetic. She took four different integer numbers, calculated their pairwise sums and products, and the results ( the pairwise sums and products) wrote down in her wonderful book. What could be the smallest number of different numbers Alice wrote in her book?
Alice wants to write down the numbers from 1 to 16 in such a way that the sum of two neighbouring numbers will be a square number. The Hatter tells Alice that he can write down the numbers with this property in a line, but he believes that it is absolutely impossible to write the numbers with this property in a circle. Show that he is right.
Show that \(\frac{x}{y} + {\frac{y}{z}} + {\frac{z}{x}} = 1\) is not solvable in natural numbers.
There are six cities in Wonderland. Her Majesty’s principal secretary of state for transport has a plan of building six new railways. The only condition for these railways is that each of them joins some pair of cities having other four cities equally distributed on both sides of a line containing the segment of the railway. Is it possible to implement such a plan for some configuration of cities?
Each pair of cities in Wonderland is connected by a flight operated by "Wonderland Airlines". How many cities are there in the country if there are \(105\) different flights? We count a flight from city \(A\) to city \(B\) as the same as city \(B\) to city \(A\) - i.e. the pair \(A\) to \(B\) and \(B\) to \(A\) counts as one flight.
(a) In a regular 10-gon we draw all possible diagonals. How many line segments are drawn? How many diagonals?
(b) Same questions for a regular 100-gon.
(c) Same questions for an arbitrary convex 100-gon.
Draw \(6\) points on a plane and join some of them with edges so that every point is joined with exactly \(4\) other points.
There are \(15\) cities in Wonderland, a foreigner was told that every city is connected with at least seven others by a road. Is this enough information to guarantee that he can travel from any city to any other city by going down one or maybe two roads?
Solve the equation \(\lfloor x^3\rfloor + \lfloor x^2\rfloor + \lfloor x\rfloor = \{x\} - 1\).
Can there exist two functions \(f\) and \(g\) that take only integer values such that for any integer \(x\) the following relations hold:
a) \(f (f (x)) = x\), \(g (g (x)) = x\), \(f (g (x)) > x\), \(g (f (x)) > x\)?
b) \(f (f (x)) < x\), \(g (g (x)) < x\), \(f (g (x)) > x\), \(g (f (x)) > x\)?