However, the entries in Pascal’s triangle also follow some more obvious patterns: the diagonals of the triangle, which run parallel to the outer rows of the one, list the natural numbers, for example. The reason for this is that the numbers in the next row are always made up of the sum of the two values above: because there is always one number on the outer edge, the sequence increases by one each step.

The diagonals immediately adjacent to the values 1, 3, 6, 10, 15, etc. are also interesting. These are triangular numbers: the number of stones you need to be able to put an equilateral triangle out of. This episode appears because *n*The third triangle number for the sum of 1 + 2 + … + *n* equivalent. This can be done according to Gaussian sum formula Through *n*(*n*Calculate +1) / 2 – and that’s just about the value *B*(*n*+1, 2), i.e. getting into *n*+ first row and second column of Pascal’s triangle.

Another property related to triangles can be seen by coloring the odd and even entries of Pascal’s triangle differently. As François-Edouard Anatole Lucas proved in 1890, this creates a pattern that may sound familiar to some: it’s a fractal called the Sierpinski Triangle. This can be constructed by dividing an equilateral triangle into four smaller congruent triangles and removing the middle triangle. Repeating this process over and over with the three remaining smaller triangles creates a fractal pattern that can also be observed in Pascal’s triangle.

Other notable representatives of mathematics can also be found in Pascal’s triangle: for example the Fibonacci sequence. This infinitely long sequence of natural numbers is constructed by starting with the number 1, followed by another 1 and then making up the sum of the two previous elements of the sequence: 1, 1, 2 (= 1 + 1), 3 (= 1 + 2), 5 (= 2 + 3), 8 (= 3 + 5), 13 (= 5 + 8), 21 (= 8 + 13) and so on. This sequence also arises because of the cumulative structure of Pascal’s triangle: each number in a row results from the addition of the two numbers above it.

Part of the reason the Fibonacci sequence is so popular is that the growth it describes in many people Nature’s processes can be observedFor example, the arrangement of the nuclei in a sunflower follows the Fibonacci series. In Pascal’s triangle you can find the individual terms of the sequence if you add up the inputs for all the short diagonals, as shown in the figure below:

Still not enough? Pascal’s triangle has many other interesting properties. For example, one also finds Mersenne primes in it. These are numbers in the form of 2^{n}1 which has no divisors other than 1 and themselves, for example: 2^{2}−1 = 3, 2^{3}−1 = 7, 2^{5}−1 = 31, 2^{7}−1 = 127 and so on. The largest Mersenne head currently known is valuable *n* = 82589933 given. were through a Collaborative research project Found where volunteers donate their computing power to research Mersenne primes. And indeed, all the numbers that are in picture 2 appear^{n}−1 also appears in Pascal’s triangle: for this you just have to search for all entries up to a particular row *n* Add. If you are about 2^{5}If you want to calculate −1, you have to add all the entries up to the fifth row. Since the sum of each row is the corresponding power of two, the result is: 2^{}+2^{1}+2^{2}+2^{3}+2^{4} = 31, which is Mersenne’s prime *n* = 5 corresponds.

“Alcohol buff. Troublemaker. Introvert. Student. Social media lover. Web ninja. Bacon fan. Reader.”