1936 Bulgarian State Football Championship and Euler brick: Difference between pages

From Wikipedia, the free encyclopedia
(Difference between pages)
Content deleted Content added
Correct caps in section headers or tables, Replaced: t was performed in 1 → t was contested by 1 using AWB
 
 
Line 1: Line 1:
In [[mathematics]], an '''Euler brick''', named after the famous mathematician [[Leonhard Euler]], is a [[cuboid]] with integer edges and also integer face diagonals. A '''primitive Euler brick''' is an Euler brick with its edges [[relatively prime]].
Statistics of [[Bulgarian A Professional Football Group]] in season [[1936]].


Alternatively stated, an Euler Brick is a solution to the following system of [[diophantine equation]]s:
==Overview==
It was contested by 12 teams, and [[PFC Slavia Sofia]] won the championship.


:<math>a^2 + b^2 = d^2\,</math>
==Round 1==
:<math>b^2 + c^2 = e^2\,</math>
{| class="wikitable" style="text-align: center;"
:<math>a^2 + c^2 = f^2\,</math>
|Club|| - ||Club||Score
|-
||[[Viktoria 23 Vidin]]|| - ||[[Pobeda 26 Pleven]]|| 4-2
|-
||[[Levski Ruse]]|| - ||[[Panayot Volov Shumen]]|| 3-0
|-
||[[Krakra Pernik]]|| - ||[[Hadzhi Slavchev Pavlikeni]]|| 2-1
|-
||[[Georgi Drazhev Yambol]]|| - ||[[Urli Harmanli]]|| 8-0
|}


The smallest Euler brick has edges
==Quarterfinals==
{| class="wikitable" style="text-align: center;"
|Club|| - ||Club||Score
|-
||[[Levski Ruse]]|| - ||[[Krakra Pernik]]|| 0-1
|-
||[[Georgi Drazhev Yambol]]|| - ||[[PFC Botev Plovdiv]]|| 1-0
|-
||[[Ticha Varna]]|| - ||[[Levski Burgas]]|| 1-0
|-
||[[Viktoria 23 Vidin]]|| - ||[[PFC Slavia Sofia]]|| 1-6
|}


:(''a'', ''b'', ''c'') = (240, 117, 44)
==Semifinals==
{| class="wikitable" style="text-align: center;"
|Club|| - ||Club||Score
|-
||[[PFC Slavia Sofia]]|| - ||[[Georgi Drazhev Yambol]]|| 6-0
|-
||[[Ticha Varna]]|| - ||[[Krakra Pernik]]|| 1-0
|}


and face [[polyhedron]] diagonals
==Final==
{| class="wikitable" style="text-align: center;"
|Club|| - ||Club||Score
|-
||[[PFC Slavia Sofia]]|| - ||[[Ticha Varna]]|| 2-0
|}


:267, 244, and 125.
==References==
*[http://www.rsssf.com/tablesb/bulghist.html Bulgaria - List of final tables (RSSSF)]


[[Paul Halcke]] discovered it in [[1719]].
{{fb start}}
{{Bulgarian A Professional Football Group seasons}}
{{fb end}}


Other solutions are: Given as: length (a, b, c)
[[Category:1936 domestic football (soccer) leagues]]

[[Category:1936 in football (soccer)]]
* (275, 252, 240),
[[Category:Football in Bulgaria]]
* (693, 480, 140),
* (720, 132, 85), and
* (792, 231, 160).

Euler found at least two [[parametric]] solutions to the problem, but neither give all solutions.

Given an Euler brick with edges (''a'', ''b'', ''c''), the triple (''bc'', ''ac'', ''ab'') constitutes an Euler brick as well.

== Perfect cuboid ==
{{unsolved|mathematics|Does a perfect cuboid exist?}}
A perfect cuboid (also called a perfect box) is an Euler brick whose body diagonal is also an integer.

In other words the following equation is added to the above [[Diophantine equation]]s:

:<math>a^2 + b^2 + c^2 = g^2.\,</math>

Some interesting facts about a perfect cuboid.
* 2 edges must be even and 1 edge must be odd (for a primitive perfect cuboid).
* 1 edge must be divisible by 4 and 1 edge must be divisible by 16
* 1 edge must be divisible by 3 and 1 edge must be divisible by 9
* 1 edge must be divisible by 5
* 1 edge must be divisible by 11

[[As of 2005]], no example of a perfect cuboid had been found and no one had proven that it cannot exist. Exhaustive computer searches have proven that the smallest edge of the perfect box is at least 4.3 billion. Solutions have been found where the body diagonal and two of the three face diagonals are integers, such as:
:<math>(a, b, c) = (672, 153, 104).\,</math>
Solutions are also known where all four diagonals but only two of the three edges are integers, such as:
:<math>(a, b, c) = (18720, \sqrt{211773121}, 7800)</math>
and
:<math>(a, b, c) = (520, 576, \sqrt{618849}).</math>

An alleged proof of non-existence of Euler bricks was published by [[Lasha Margishvili]] in his work ''The Diophantine Rectangular Parallelepiped (A Perfect Cuboid)''. As of July 2008, it has not received significant peer review by the math community. [http://www.archivum.info/sci.math/2006-11/msg03681.html], [http://www.mualphatheta.org/Science_Fair/images/georgian.png], [http://web.archive.org/web/20061126183733/http://www.mualphatheta.org/Science_Fair/Science_Fair_Winners.html]

== References ==
* {{cite journal | first=John | last=Leech | authorlink=John Leech (mathematician) | title=The Rational Cuboid Revisited | journal=American Mathematical Monthly | volume=84 | pages=518-533 | year=1977 }}
* {{cite book|last=Guy|first=Richard K.|authorlink=Richard K. Guy|title=[[Unsolved Problems in Number Theory]]|publisher=[[Springer-Verlag]]|date=2004|page=275-283|isbn=0-387-20860-7}}

==External links==
*{{mathworld|urlname=EulerBrick|title=Euler Brick}}
*{{mathworld|urlname=PerfectCuboid|title=Perfect Cuboid}}

[[Category:Arithmetic problems of solid geometry]]
[[Category:Diophantine equations]]
[[Category:Unsolved problems in mathematics]]

[[bn:অয়লার ইঁট]]
[[pl:Cegiełka Eulera]]
[[zh:歐拉長方體]]

Revision as of 17:17, 10 October 2008

In mathematics, an Euler brick, named after the famous mathematician Leonhard Euler, is a cuboid with integer edges and also integer face diagonals. A primitive Euler brick is an Euler brick with its edges relatively prime.

Alternatively stated, an Euler Brick is a solution to the following system of diophantine equations:

The smallest Euler brick has edges

(a, b, c) = (240, 117, 44)

and face polyhedron diagonals

267, 244, and 125.

Paul Halcke discovered it in 1719.

Other solutions are: Given as: length (a, b, c)

  • (275, 252, 240),
  • (693, 480, 140),
  • (720, 132, 85), and
  • (792, 231, 160).

Euler found at least two parametric solutions to the problem, but neither give all solutions.

Given an Euler brick with edges (a, b, c), the triple (bc, ac, ab) constitutes an Euler brick as well.

Perfect cuboid

Unsolved problem in mathematics:

Does a perfect cuboid exist?

A perfect cuboid (also called a perfect box) is an Euler brick whose body diagonal is also an integer.

In other words the following equation is added to the above Diophantine equations:

Some interesting facts about a perfect cuboid.

  • 2 edges must be even and 1 edge must be odd (for a primitive perfect cuboid).
  • 1 edge must be divisible by 4 and 1 edge must be divisible by 16
  • 1 edge must be divisible by 3 and 1 edge must be divisible by 9
  • 1 edge must be divisible by 5
  • 1 edge must be divisible by 11

As of 2005, no example of a perfect cuboid had been found and no one had proven that it cannot exist. Exhaustive computer searches have proven that the smallest edge of the perfect box is at least 4.3 billion. Solutions have been found where the body diagonal and two of the three face diagonals are integers, such as:

Solutions are also known where all four diagonals but only two of the three edges are integers, such as:

and

An alleged proof of non-existence of Euler bricks was published by Lasha Margishvili in his work The Diophantine Rectangular Parallelepiped (A Perfect Cuboid). As of July 2008, it has not received significant peer review by the math community. [1], [2], [3]

References

  • Leech, John (1977). "The Rational Cuboid Revisited". American Mathematical Monthly. 84: 518–533.
  • Guy, Richard K. (2004). Unsolved Problems in Number Theory. Springer-Verlag. p. 275-283. ISBN 0-387-20860-7.

External links