Problems
In a parallelogram \(ABCD\), point \(E\) belongs to the side \(CD\) and point \(F\) belongs to the side \(BC\). Show that the total red area is the same as the total blue area:
The figure below is a regular pentagram. What is larger, the black area or the blue area?
This week we’re looking at Fibonacci numbers, and other sequences of numbers.
We say that the ‘zeroth’ Fibonacci number is \(0\) and the first Fibonacci number is \(1\). Then, from that point, every Fibonacci number is found by adding the two previous Fibonacci numbers. This means that the sequence begins \(0,1,1,2,3,5,8,13,21,34,55,89,144,...\)
The Fibonacci numbers hide lots of patterns which we’ll explore today, for example snail’s spiral.
Prime numbers are like atoms that build every integer number. That is, a prime decomposition of a number is unique and then we can use it to find the number’s factors. Today we will explore this idea a bit more.
We will introduce a couple of new terms. First, a common divisor of two numbers is simply a number that both of these numbers can be divided by. Two numbers which have no common divisors (except from 1) are called relatively prime. We can establish if two numbers are relatively prime by looking at their prime factorizations - if they share no common primes, then they cannot share a common divisor!
Out of all the common divisors two numbers have, one must be the largest. This is an important number and is called the Greatest Common Divisor (GCD). You can find it by looking at the prime factorizations of the two numbers. For every prime number appearing in both factorizations, we take the smaller power. Then we multiply all our choices together. If we divide both numbers by their GCD, the resulting numbers will have no common divisors left and so will be relatively prime.
Similar to the notion of a common divisor is the one of common multiple. It is simply a number that is divisible by both numbers. Among the common multiples, one must be the smallest – this is called the Least Common Multiple (LCM). Again, the LCM can be found by looking at the prime factorizations of the two numbers. For every prime number appearing in any of the two factorizations, we take the larger power. Then we multiply all our choices together.
[Needs editing]
Previously, we have explored how to tile the plane using rectangles, but a much more fascinating topic is plane tilings with more intricate shapes such as quadrilaterals, pentagons, and even more unconventional shapes like chickens.
In this exercise sheet, we define a plane tiling as a covering of the entire plane, without any gaps or overlaps, using identical geometric shapes that can be rotated and symmetrical to each other. Usually, it is sufficient to cover a small portion of the plane with a particular pattern that can be extended to cover the entire plane.
While living on the uninhabited island, Robinson Crusoe missed terribly having a proper floor in his hut. He wanted his floor to not be some simple hard floor, but a proper tile floor he used to have in his house. He missed his house with the tile floor so much, that finally he decided to make one by himself.
He made a huge number of \(1\times2\) tiles, and studied how he could tile a floor in a rectan- gular room if no tile can overlap the other. It was easy for him to tile the floor in a \(6\times8\) room.
He also noticed that if floor in a room of size \(p\times q\) is tiled with his \(1\times2\) tiles then \(pq\) is even (can you explain why?). The reverse is also true, i.e. if \(pq\) is even, then the floor can be tiled with \(1\times2\) tiles in a similar way to the picture above.
This tiling can be cut from one side to another by a grid line without splitting any tiles. Such constructions are impractical, this type of floor can easily become uneven. That’s why in practise irreducible tilings are used.
A tiling of a rectangle by small identical rectangles (tiles) is called irreducible, if any straight cut from one side of the big rectangle to another goes across at least one of the tiles. Robinson decided to use irreducible tilings. Help him to figure out how to tile a rectan- gular floor.
Among the first \(20\) Fibonacci numbers: \(F_0 = 0,F_1 = 1,F_2 = 1, F_3 = 2, F_4 = 3,..., F_{20} = 6765\) find all the numbers, which have sum of digits equal to their index. For example \(F_1=1\) fits the description, however \(F_{20} = 6765\) does not, since \(6+7+6+5 \neq 20\).
Among the first \(20\) Fibonacci numbers: \(F_0 = 0,F_1 = 1,F_2 = 1, F_3 = 2, F_4 = 3,..., F_{20} = 6765\) check whether the numbers with prime index are prime.
Consider the Pascal’s triangle: it starts with \(1\), then each entry in the triangle is the sum of the two numbers above it. Prove that the diagonals of the Pascal’s triangle sum up to Fibonacci numbers.
