# Rechenkraft.net e.V.

die erste Adresse für Distributed Computing
Unterstütze Rechenkraft.net e.V.
Mit Suchkraft hier suchen:

 It is currently 27.11.2015 05:33

 All times are UTC + 1 hour [ DST ]

 Page 1 of 5 [ 56 posts ] Go to page 1, 2, 3, 4, 5  Next
 Print view Previous topic | First unread post | Next topic
Author Message
 Post subject: [sub-project] Perfect cuboidPosted: 21.03.2011 19:48
 PDA-Benutzer

Joined: 20.03.2011 22:23
Posts: 39
Perfect Cuboid

A perfect cuboid is a cuboid having integer side lengths, integer face diagonals
(1)
(2)
(3)
and an integer space diagonal
(4)
The problem of finding such a cuboid is also called the brick problem, diagonals problem, perfect box problem, perfect cuboid problem, or rational cuboid problem.
No perfect cuboids are known despite an exhaustive search for all "odd sides" up to 100 billion (10^11) (Weisstein, Eric W., "Perfect Cuboid" from MathWorld).
Solving the perfect cuboid problem is equivalent to solving the Diophantine equations
(5)
(6)
(7)
(8)
A solution with integer space diagonal and two out of three face diagonals is , and giving , , and , which was known to Euler. A solution giving integer space and face diagonals with only a single nonintegral polyhedron edge is , and , giving , , and .

via mathworld.wolfram.com

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 19:57

Joined: 10.02.2010 22:26
Posts: 725
Location: Berlin
Despite me being just a user here:

What would be the scientific gain of finding one (assuming there is one)?

_________________
MfG
MReed

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 19:59
 PDA-Benutzer

Joined: 20.03.2011 22:23
Posts: 39
Hello, guys!
I opened this topic to share with you my original idea how we would continue a searching of perfect cuboid far away from 10^11 integers space.
Our goal is to check all space diagonals up to 2^63 (9'223'372'036'854'775'808)

We need mathematicians, C/C++ programmers and CUDA/OpenCL programmers in the future.

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 20:08
 PDA-Benutzer

Joined: 20.03.2011 22:23
Posts: 39
If perfect cuboid exists, space diagonal of minimal cuboid (cuboid of minimal size) is the product of primes 4k+1. The proof of this lemma below.

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 20:11
 Vereinsvorstand

Joined: 17.12.2002 14:09
Posts: 6995
Location: Berlin
For me it sounds interesting because it is one of unsolved problems in number theory, logic, and cryptography.
http://unsolvedproblems.org/index_files ... Cuboid.htm
yoyo

_________________
HILF mit im Rechenkraft-WiKi, dies gibts zu tun.
Wiki - FAQ - Verein - Chat

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 20:13
 PDA-Benutzer

Joined: 20.03.2011 22:23
Posts: 39
Theorem 1.
Any odd number that can be represented as the sum of two squares has the form 4k+1

Proof:
Between two integers whose sum of squares is odd, one number is necessarily even and the other is odd.
The square of even number is divisible by 4 completely and the square of odd number of the division by 4 gives a remainder 1:
(2k+1)² = 4k² + 4k + 1 = 4(k² + k) + 1.

So, if some odd integer n can be represented in the form of sum of two squares: n = x^2 + y^2,
then n mod 4 = 1 or, the same, n = 4m + 1:
let x = 2k+1, y = 2l,
n = (2k+1)² + (2l)² = 4(k² + k + l²) + 1 = 4m + 1,
where m = k² + k + l²

For the same reason odd number the form 4k+3 can not be represented as the sum of two squares.

Last edited by x3mEn on 24.03.2011 15:08, edited 7 times in total.

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 20:25
 PDA-Benutzer

Joined: 20.03.2011 22:23
Posts: 39
Theorem 2.
Any prime number p form 4k+1 can be represented as a sum of squares of two integers.

The proof consists of two lemmas:
Lemma 2.
For any prime p form 4k +1 there exists an integer m, that m²+1 is multiple p
Lemma 3.
Any prime divisors p of number m²+1, where m - integer, can be represented as a sum of squares of two integers.

Proof of these lemmas can be found here (pdf, 600K, russian).

Last edited by x3mEn on 24.03.2011 15:09, edited 1 time in total.

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 20:30
 PDA-Benutzer

Joined: 20.03.2011 22:23
Posts: 39
From Theorems 1 and 2 implies that the prime number p>2 can not be represented as a sum of two squares if it has a view of 4k+3, and can be presented, if p= 4k+1

Criterion Girard.
Natural number can be represented as a sum of squares of two integers if and only if in its decomposition into simple factors any simple factor of type 4k+3 is in even powers.

Last edited by x3mEn on 25.03.2011 17:15, edited 1 time in total.

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 20:33
 PDA-Benutzer

Joined: 20.03.2011 22:23
Posts: 39
The general formula to represent the product of the sum of two squares as the sum of two squares as follows:
(a² + b²) (x² + y²) = a² * x² + a² * y² + b² * x² + b² * y²,
(a² + b²) (x² + y²) = a² * x² + 2axby + b² * y² + a² * y² - 2axby + b² * x² = (ax + by)² + (bx - ay)²
so
(a² + b²) (x² + y²) = (ax + by)² + (bx - ay)² (1)

Last edited by x3mEn on 24.03.2011 15:11, edited 1 time in total.

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 21:05
 PDA-Benutzer

Joined: 20.03.2011 22:23
Posts: 39
If in the formula (1) a and b set to 1, we obtain:
(x + y)² + (x - y)² = 2 (x² + y²)
so if n = x² + y² can be represented as a sum of squares, thus 2n is represented as a sum of squares too.

On the other hand, if even 2n is represented as a sum of squares, and then n can be represented as a sum of squares too.

Last edited by x3mEn on 24.03.2011 15:12, edited 3 times in total.

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 21:07
 PDA-Benutzer

Joined: 31.12.2006 20:20
Posts: 56
If this link is correct, you can find sourcecode here

Top

 Post subject: Re: [sub-project] Perfect cuboidPosted: 21.03.2011 21:34
 PDA-Benutzer

Joined: 20.03.2011 22:23
Posts: 39
rebirther wrote:
If this link is correct, you can find sourcecode here

Quote:
Initially, all odd numbers out to 21 billion were tried on a Pentium 4 computer. Subsequently, a Skulltrail computer was used to extend the search out to 1 trillion. (1.0E+12).
Thus, if the odd side is 1.0E+12, the even side can be as large as 5.0E+23. This has more digits than the precision that exists on Intel processors.

My goal is to check all space diagonals up to 2^63 ? 9.2E+18
And my idea differs.
If you is attentive up to the end, will understand that my algorithm is better

Top

 Display posts from previous: All posts1 day7 days2 weeks1 month3 months6 months1 year Sort by AuthorPost timeSubject AscendingDescending
 Page 1 of 5 [ 56 posts ] Go to page 1, 2, 3, 4, 5  Next

 All times are UTC + 1 hour [ DST ]

#### Who is online

Users browsing this forum: No registered users and 2 guests

 You cannot post new topics in this forumYou cannot reply to topics in this forumYou cannot edit your posts in this forumYou cannot delete your posts in this forumYou cannot post attachments in this forum

Search for:
 Jump to:  Select a forum ------------------ Regeln / rules    Forenregeln/FAQ/Hinweise Medizinische, chemische und biologische Forschung    Protein- und Nukleinsäureforschung    Medikamentensuche    Sonstige medizinische, chemische und biologische Projekte Physikalische Forschung    Meteorologie, Geologie & Geografie    Astronomie    Atom-/Elementarphysik    Nanotechnologie / Schaltungstechnik / Materialwissenschaften Mathematik und Kryptographie    Primzahlsuche    Kryptographie    Andere Mathematik-Projekte Sonstige Projekte    Animationen    Finanztheorie    Leistungstests von Webservern    Schach    Sonstiges Projekt yoyo@home    Fehler, Wünsche / Bugs, Wishes    Number crunching RNA World    RNA World Discussions (english)    RNA World Diskussionen (deutsch) Citizen Science - Bürger schaffen Wissen    Neuigkeiten    Instrumentelle Datenerfassung    Manuelle Datenanalyse    Beobachtungsprojekte    Sonstige Projekte    Gamification Allgemeines    Smalltalk    Hilfe und Support    Hardware, Software, Technik, Betriebssysteme    Mobiles Verteiltes Rechnen & ARM-Systeme    Wissenschaft    Hintergrundinfos zu Verteiltem Rechnen    English subforum    Testcenter    Statistiken    Spielewiese Team Rechenkraft.net    Challenge / Race / Wettkampf    Taskforce    Unser Cluster    Neue Mitglieder    Radio RechenCast Rechenkraft.net e.V.    Öffentliches Vereinsforum Interna    Ankündigungen und Feedback zur Webseite und dem Wiki