Problems

Age
Difficulty
Found: 2459

Does there exist a quadrilateral which can be cut into six parts with two straight lines?

Is it possible to cut such a hole in \(10\times 10 \,\,cm^2\) piece of paper, though which you can step?

A square \(4 \times 4\) is called magic if all the numbers from 1 to 16 can be written into its cells in such a way that the sums of numbers in columns, rows and two diagonals are equal to each other. Sixth-grader Edwin began to make a magic square and written the number 1 in certain cell. His younger brother Theo decided to help him and put the numbers \(2\) and \(3\) in the cells adjacent to the number \(1\). Is it possible for Edwin to finish the magic square after such help?

Cut a square into \(3\) parts which you can use to construct a triangle with angles less than \(90^{\circ}\) and three different sides.

Find all rectangles that can be cut into \(13\) equal squares.

Cut a square into two equal:
1. Triangles.
2. Pentagons
3. Hexagons.

The meeting of the secret agents took place in the green house.
image

Considering the numbers in the windows of the green house, what should be drawn in the empty frame?
image

Today we will practice to encrypt and decipher information using some of the most common codes. Majority of the codes in use can be alphabetic and numeric, namely one may want to encode a word, a phrase, or a number, or just any string of symbols using either letters, or numbers, or both. Some of the codes, however may use various other symbols to encrypt the information. To solve some of the problems you will need the correspondence between alphabet letters and numbers

Find one way to encrypt letters of Latin alphabet as sequences of \(0\)s and \(1\)s, each letter corresponds to a sequence of five symbols.

Pinoccio keeps his Golden Key in the safe that is locked with a numerical password. For secure storage of the Key he replaced some digits in the password by letters (in such a way that different letters substitute different digits). After replacement Pinoccio got the password \(QUANTISED17\). Honest John found out that:
• the number \(QUANTISED\) is divisible by all integers less than 17, and
• the difference \(QUA-NTI\) is divisible by \(7\).
Could he find the password?