A fast modulo primes algorithm for searching perfect cuboids and its implementation

A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space diagonal are of integer lengths. None of perfect cuboids is known thus far. Their non-existence is also not proved. This is an old unsolved mathe...

Full description

Saved in:
Bibliographic Details
Main Authors Gallyamov, R. R, Kadyrov, I. R, Kashelevskiy, D. D, Kutlugallyamov, N. G, Sharipov, R. A
Format Journal Article
LanguageEnglish
Published 04.01.2016
Subjects
Mathematics - Number Theory
Online AccessGet full text

Cover

Abstract A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space diagonal are of integer lengths. None of perfect cuboids is known thus far. Their non-existence is also not proved. This is an old unsolved mathematical problem. Three mathematical propositions have been recently associated with the cuboid problem. They are known as three cuboid conjectures. These three conjectures specify three special subcases in the search for perfect cuboids. The case of the second conjecture is associated with solutions of a tenth degree Diophantine equation. In the present paper a fast algorithm for searching solutions of this Diophantine equation using modulo primes seive is suggested and its implementation on 32-bit Windows platform with Intel-compatible processors is presented.
AbstractList A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space diagonal are of integer lengths. None of perfect cuboids is known thus far. Their non-existence is also not proved. This is an old unsolved mathematical problem. Three mathematical propositions have been recently associated with the cuboid problem. They are known as three cuboid conjectures. These three conjectures specify three special subcases in the search for perfect cuboids. The case of the second conjecture is associated with solutions of a tenth degree Diophantine equation. In the present paper a fast algorithm for searching solutions of this Diophantine equation using modulo primes seive is suggested and its implementation on 32-bit Windows platform with Intel-compatible processors is presented.
Author Kashelevskiy, D. D
Kutlugallyamov, N. G
Kadyrov, I. R
Gallyamov, R. R
Sharipov, R. A
Author_xml – sequence: 1
  givenname: R. R
  surname: Gallyamov
  fullname: Gallyamov, R. R
– sequence: 2
  givenname: I. R
  surname: Kadyrov
  fullname: Kadyrov, I. R
– sequence: 3
  givenname: D. D
  surname: Kashelevskiy
  fullname: Kashelevskiy, D. D
– sequence: 4
  givenname: N. G
  surname: Kutlugallyamov
  fullname: Kutlugallyamov, N. G
– sequence: 5
  givenname: R. A
  surname: Sharipov
  fullname: Sharipov, R. A
BackLink https://doi.org/10.48550/arXiv.1601.00636$$DView paper in arXiv
BookMark eNotj7tOwzAYRj3AAIUHYMIvkODk9yUZq4qbVImB7tEfX1pLsR05LoK3py1M33L06ZxbchVTtIQ8NKzmnRDsCfO3_6obyZqaMQnyhnyuqcOl0JDMcUp0zj7YheK0T9mXQ6AuZbpYzPrg457ONjurC9XHMXlz4qKhvizUh3mywcaCxad4R64dTou9_98V2b087zZv1fbj9X2z3lYolawkcDCKd04obDrB5Umo7UWrFWu5Y3y0PYwj6E4BcAXSiZ4pxQRqoQ06Divy-Hd7qRrO6ph_hnPdcKmDX-2pS7E
ContentType Journal Article
Copyright http://arxiv.org/licenses/nonexclusive-distrib/1.0
Copyright_xml – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0
DBID AKZ
GOX
DOI 10.48550/arxiv.1601.00636
DatabaseName arXiv Mathematics
arXiv.org
DatabaseTitleList
Database_xml – sequence: 1
  dbid: GOX
  name: arXiv.org
  url: http://arxiv.org/find
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID 1601_00636
GroupedDBID AKZ
GOX
ID FETCH-LOGICAL-a676-6343d748f57a185460632952c7024f04be93bb3c87334736f5907705ac5cdaf43
IEDL.DBID GOX
IngestDate Mon Jan 08 05:48:04 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a676-6343d748f57a185460632952c7024f04be93bb3c87334736f5907705ac5cdaf43
OpenAccessLink https://arxiv.org/abs/1601.00636
ParticipantIDs arxiv_primary_1601_00636
PublicationCentury 2000
PublicationDate 2016-01-04
PublicationDateYYYYMMDD 2016-01-04
PublicationDate_xml – month: 01
  year: 2016
  text: 2016-01-04
  day: 04
PublicationDecade 2010
PublicationYear 2016
Score 1.6233178
SecondaryResourceType preprint
Snippet A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space...
SourceID arxiv
SourceType Open Access Repository
SubjectTerms Mathematics - Number Theory
Title A fast modulo primes algorithm for searching perfect cuboids and its implementation
URI https://arxiv.org/abs/1601.00636
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV09T8MwED21nVgQCFD5lAfWiDb-zFghCkICBorUrfJnidQmVZMifj7nJBUsrPZNz7LfvfP5GeAWDzjcB7Ft0GiVMKZ5ojNvEh9MQIYRmRnHx8kvr-Lpgz3P-bwHZP8WRm-_86_WH9hUd2MRLTWRRUUf-mkaW7Ye3-bt5WRjxdXF_8ZhjtkM_SGJ6REcdtkdmbTLcQw9X5zA-4QEXdVkXbrdqiSbaKhfEb1alijMP9cE00bSVfSLJdn4beywIHZnytxhXOFIXlckX-87vSOUpzCbPszun5LuL4NECykSQRl1kqnApUaGZCgbaJrx1ErkyDBixmfUGGqVpJRJKgJH0SpHXFtunQ6MnsGgKAs_BIKCgFvhMid0xqwZq5AygbqFKmVQe6lzGDYILDatXcUigrNowLn4f-oSDjAVaIsL7AoG9Xbnr5Fua3PTYP4DrRF-0w
link.rule.ids 228,230,783,888
linkProvider Cornell University
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+fast+modulo+primes+algorithm+for+searching+perfect+cuboids+and+its+implementation&rft.au=Gallyamov%2C+R.+R&rft.au=Kadyrov%2C+I.+R&rft.au=Kashelevskiy%2C+D.+D&rft.au=Kutlugallyamov%2C+N.+G&rft.date=2016-01-04&rft_id=info:doi/10.48550%2Farxiv.1601.00636&rft.externalDocID=1601_00636