REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/6282
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorPąk, Karol-
dc.contributor.authorKorniłowicz, Artur-
dc.date.accessioned2018-02-08T08:10:31Z-
dc.date.available2018-02-08T08:10:31Z-
dc.date.issued2017-
dc.identifier.citationFormalized Mathematics, Volume 25, Issue 2, Pages 149–155-
dc.identifier.issn1426-2630-
dc.identifier.urihttp://hdl.handle.net/11320/6282-
dc.description.abstractSummaryA rigorous elementary proof of the Basel problem [6, 1] ∑n=1∞1n2=π26 is formalized in the Mizar system [3]. This theorem is item #14 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/.-
dc.language.isoen-
dc.publisherDeGruyter Open-
dc.subjectBasel problem-
dc.titleBasel Problem-
dc.typeArticle-
dc.identifier.doi10.1515/forma-2017-0014-
dc.description.AffiliationPąk Karol - Institute of Informatics, University of Białystok, Poland-
dc.description.AffiliationKorniłowicz Artur - Institute of Informatics, University of Białystok, Poland-
dc.description.referencesM. Aigner and G. M. Ziegler. Proofs from THE BOOK. Springer-Verlag, Berlin Heidelberg New York, 2004.-
dc.description.referencesGrzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990.-
dc.description.referencesGrzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi: 10.1007/978-3-319-20615-817.-
dc.description.referencesCzesław Byliński. The complex numbers. Formalized Mathematics, 1(3):507–513, 1990.-
dc.description.referencesCzesław Byliński. Some properties of restrictions of finite sequences. Formalized Mathematics, 5(2):241–245, 1996.-
dc.description.referencesAugustin Louis Cauchy. Cours d’analyse de l’Ecole royale polytechnique. de l’Imprimerie royale, 1821.-
dc.description.referencesArtur Korniłowicz and Karol Pąk. Basel problem – preliminaries. Formalized Mathematics, 25(2):141–147, 2017. doi: 10.1515/forma-2017-0013.-
dc.description.referencesAnna Justyna Milewska. The field of complex numbers. Formalized Mathematics, 9(2): 265–269, 2001.-
dc.description.referencesRobert Milewski. The ring of polynomials. Formalized Mathematics, 9(2):339–346, 2001.-
dc.description.referencesRobert Milewski. The evaluation of polynomials. Formalized Mathematics, 9(2):391–395, 2001.-
dc.description.referencesRobert Milewski. Fundamental theorem of algebra. Formalized Mathematics, 9(3):461–470, 2001.-
dc.description.referencesPiotr Rudnicki. Little Bezout theorem (factor theorem). Formalized Mathematics, 12(1): 49–58, 2004.-
dc.description.referencesChristoph Schwarzweller. The binomial theorem for algebraic structures. Formalized Mathematics, 9(3):559–564, 2001.-
dc.description.referencesAndrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329–334, 1990.-
dc.description.referencesWojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569–573, 1990.-
dc.identifier.eissn1898-9934-
dc.description.volume25-
dc.description.issue2-
dc.description.firstpage149-
dc.description.lastpage155-
dc.identifier.citation2Formalized Mathematics-
Występuje w kolekcji(ach):Artykuły naukowe (WInf)
Formalized Mathematics, 2017, Volume 25, Issue 2

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
forma-2017-0014.pdf322,47 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons