11.29.2022

Pythagorean Theorem, in three dimensions

 

It occurred to me: is the Pythagorean Theorem or a similar statement valid in space (but modestly remaining in 3-dimensional space in the first step)?

Of course, a plane exists in any number of dimensional spaces, and the Pythagorean Theorem can be interpreted and valid in that plane. But if we are already in space, let's break the planar triangle. Which isn't that hard. What else would a spatial "triangle" be if not a tetrahedron? And what else would the spatial "right triangle" be. On the other hand, it is necessary to clarify what we consider a right-angled tetrahedron, because there can be several interpretations. We accept the definition that a right-angled tetrahedron is a tetrahedron whose three angles belonging to one of its (right-angled) vertices are all right angles. Such a tetrahedron is part of a cube.)

Another tricky question seemed to be what to apply the result of the claim. The original Pythagorean Theorem applies to the sides of a triangle, which are one-dimensional figures. In addition, if the subject has been transferred from the two-dimensional space to the three-dimensional one, it seems reasonable to transfer the elements of the result, i.e. instead of one-dimensional (straight sections) they should be two-dimensional (plane triangles). It is interesting that we use the word side for both, but the sides of the latter sides are the edges of the tetrahedron.

Another pressing issue was the interpretation of squaring. The square of the sides of a triangle is a simple, "natural" square. But what is the square of a plane figure? And there would be no reason to expect a cubic lift instead of a square lift.

The specific study quickly gave the surprisingly simple and "familiar" result:

 

Theorem of the right-angled tetrahedron: The sum of the squares of the areas of the three right-angled sides is equal to the square of the area of ​​the fourth side.

 

The proof is relatively simple, but can be done with work requiring attention and patience. I rather convinced myself of the truth of the theorem by programming a general model (the power of habit).

What a denial, confirmation of the result was a great pleasure for me. There are two possibilities: either this result is already known, or no one has done it yet. My joy does not depend on it.

It is a bit absurd, but this is how we are today in science, technology, and creation: it takes more time and energy to prove that you are the first than to achieve the result itself. Unfortunately, life is too short to waste it proving superiority. In this, we should rather count on those who find their dubious joy in being able to refute the primacy of others.

 

 


* * *

 

11.01.2022

Square of prime numbers

 

Unity makes strength! However, what to unite and what to achieve?

Could we add prime numbers to get a square? But still have some order and try to join (collect) consecutive prime numbers.

Naturally, we start with 2, which is clearly not a square, so we add 3 to it. We get 5, which is still not a square. We have no right to discourage, we have only just begun!

2+3+5=10 It’s not a square…

2+3+5+7=17 It’s not a square…

2+3+5+7+11=28 It’s not a square…

2+3+5+7+11+13=41 It’s not a square…

2+3+5+7+11+13+17=58 It’s not a square…

2+3+5+7+11+13+17+19=77 It’s not a square…

Maybe it's time to give up? Let's have another try!

2+3+5+7+11+13+17+19+23=100 Unbelievable! Square! Victory.

 

Sure, it was a harmless skit for fun when we're dealing with math, but here in math, things don't end with surrender after a few failed attempts. A true mathematician, if he finds no proof of the impossibility of solving the problem, searches for the solution all his life.

The important thing is that we reached the solution relatively quickly in this task. More precisely, to the first solution of countless many. Because now we have to see if we can find a square if we start not from 2 but from 3.

Now we will be shorter, because the same game this time would be quite boring: 26 consecutive prime numbers must be added to get a square.

It is interesting and encouraging that starting with the beautiful, what a beautiful, wonderful number 5, with only four numbers we get a square:

5+7+11+13=36 Magnificent!

But after this wonderful case, a real horror began. After a while I began to doubt that starting with 7 we would even be able to get to a square! But imagine (and believe me) that collecting

1862 (one thousand eight hundred and sixty two)

consecutive primes (starting with 7), you get a square!

After this frenzied trial I felt confident in formulating (probably for the first time) the epoch-making hypothesis that for every prime there exists a corresponding number such that the sequence of primes beginning with the prime in question and having a number equal to the corresponding number. Simply put, the above problem always has a solution.

This hypothesis was supported (but not proven) by a small program (in Python). The following table shows the "corresponding" number for the first 24 prime numbers. (Over time it will be supplemented, but at the moment the program is stuck on one new "week".)

 

2 – 9

3 – 23

5 – 4

7 – 1862

11 – 14

13 – 3

17 – 2

19 – 211

23 – 331

29 – 163

31 – 366

37 – 3

41 – 124

43 – 48

47 – 2

53 – 449

59 – 8403

61 – 121

67 – 35

71 – 2

73 – 4

79 – 105

83 – 77

89 – 43

 

Which is extremely interesting: how "strangely" the corresponding numbers jump. There is apparently incredible chaos with these prime numbers.

Another interesting thing, I would even say: it is surprising that in quite a few cases it is enough to add the next one to the prime number and the square is ready (corresponding number 2)! This feature intrigued me, and the same loop-backed program quickly produced an impressive list of such half-square primes:

 

17, 47, 71, 283, 881, 1151, 1913, 2591, 3527, 4049, 6047, 7193, 7433, 15137, 20807, 21617, 24197, 26903, 28793, 34847, 46817, 53129, 56443, 69191, 74489, 83231, 84047, 98563, 103049, 103967, 109507, 110441, 112337, 136237, 149057, 151247, 176417, 179999, 198439, 204797, 206081, 235289, 273797, 281249, 290317, 293357, 310463, 321593, 362951, 383683, 388961, 423191, 438047, 470447, 472391, 478241

 

 


* * *

 

10.08.2022

The 666 EDP triples

 

Have a solution the equation

a2 + b2 = c2

Obviously, the answer depends on where we look for the solution. For example, there is no solution among the odd natural numbers.

In other cases, solutions are known or findable, but then questions arise: whether one or many solutions exist, and how they can be found.

Yes, in some cases it may be true that there is only one solution, for example if we are looking for it among single-digit natural numbers.

The situation is quite well known if solutions are among the natural numbers. Far from being the first the illustrious Pythagoras also dealt with this interesting and almost entertaining topic and therefore grateful posterity calls the solutions of the above equation consisting of natural numbers Pythagorean triples.

It must be agreed here that, in search of a solution, it is no necessery to find three numbers. To find the solution, it is enough to find any two of the three numbers (a, b, c). The third can be simply calculated from the two. This gives rise to various special task types in this topic, such as asking whether the square of a given "interesting" number can be written as the sum of two squares, or in how many ways.

But let's finally see what brought us together today!

The question is, is there a solution to the above equation in Egyptian fractions? (Egyptian fractions are the inverses of the natural numbers, the 1/n type numbers.) That is, we are interested in the solutions of the following equation:

1/a2 + 1/b2 = 1/c2

We immediately see that the "classic" Pythagorean triple, 3, 4, 5, does not offer a solution here in any configuration, and they do not lead to a result either individually.

We get a hard Diophantus equation. "At first glance" it can be guessed that there is a solution, but beyond a few connections, to which I will return, I could not find a solution formula, so in my impatience I left the sacred mathematics and went to the no less sacred programming. A little python program collected for me the solutions where “a” and “b” are less than 10,000 in minutes.

It just became 666. Interesting. I hope no one is superstitious.

Here is the claimant to the throne, which replaces Pythagoras' "classic" 32+42=52:

1/152 + 1/202 = 1/122

Another interesting thing is that among the 666 solutions, 42 pairs of solutions have different "b" values for the same "a" value. For example:

195, 260, 156

195, 468, 180

In the case of "b" (i.e., the larger value), there are already 50 pairs of solutions with the same "b" value, and a trio of solutions where the situation is the same:

2275, 7800, 2184

3250, 7800, 3000

5850, 7800 , 680

In the case of the "c" value, the situation is quite "dramatic". There are 164 pairs of solutions, 25 cases with three solutions, 15 cases with four solutions, one case with five solutions, two cases with six solutions and one case with seven solutions. This can also be said that the square of a certain Egyptian fraction (in the case 2520) can be set up in seven different ways as the sum of the squares of two Egyptian fractions:

2625, 9000, 2520

2664, 7770, 2520

2730, 6552, 2520

2856, 5355, 2520

2968, 4770, 2520

3150, 4200, 2520

3480, 3654, 2520

(I just note quietly: 2520 = 7x360. The shroud covering the secrets of Osiris is falling apart.)

Another point of interest: just at the border of the research area, python found two solutions where there are two adjacent numbers:

2020, 9999, 1980

7500, 10000, 6000

The examined solutions obviously cannot be called Pythagorean triples, I would rather suggest the name EDP triples, where the letters mean: Egyptian, Diophantine, Pythagorean.

 

 


* * *

 

4.01.2022

A sensational app

 

The British The Guordian spotted this new sensational app in the Google store.

The AI technology program takes advantage of an unexpected consequence of the even more famous proof of the famous Fermat theorem and the Poincaré method, thus predicting weekly lottery numbers with 99% accuracy.

The revolutionary FIXFUX app is now available for free download.

 


* * *