REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/6276
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorKorniłowicz, Artur-
dc.contributor.authorPąk, Karol-
dc.date.accessioned2018-02-08T08:10:28Z-
dc.date.available2018-02-08T08:10:28Z-
dc.date.issued2017-
dc.identifier.citationFormalized Mathematics, Volume 25, Issue 2, Pages 87–92-
dc.identifier.issn1426-2630-
dc.identifier.urihttp://hdl.handle.net/11320/6276-
dc.description.abstractSummaryIn the article we formalized in the Mizar system [2] the Vieta formula about the sum of roots of a polynomial anxn + an−1xn−1 + ··· + a1x + a0 defined over an algebraically closed field. The formula says that x1+x2+⋯+xn−1+xn=−an−1an , where x1, x2,…, xn are (not necessarily distinct) roots of the polynomial [12]. In the article the sum is denoted by SumRoots.-
dc.language.isoen-
dc.publisherDeGruyter Open-
dc.subjectroots of polynomials-
dc.subjectVieta’s formula-
dc.titleVieta’s Formula about the Sum of Roots of Polynomials-
dc.typeArticle-
dc.identifier.doi10.1515/forma-2017-0008-
dc.description.AffiliationKorniłowicz Artur - Institute of Informatics, University of Białystok, Poland-
dc.description.AffiliationPąk Karol - Institute of Informatics, University of Białystok, Poland-
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. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529–536, 1990.-
dc.description.referencesCzesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990.-
dc.description.referencesCzesław Byliński. The sum and product of finite sequences of real numbers. Formalized Mathematics, 1(4):661–668, 1990.-
dc.description.referencesRobert Milewski. Natural numbers. Formalized Mathematics, 7(1):19–22, 1998.-
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.referencesMichał J. Trybulec. Integers. Formalized Mathematics, 1(3):501–505, 1990.-
dc.description.referencesWojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569–573, 1990.-
dc.description.referencesE. B. Vinberg. A Course in Algebra. American Mathematical Society, 2003. ISBN 0821834134.-
dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73–83, 1990.-
dc.identifier.eissn1898-9934-
dc.description.volume25-
dc.description.issue2-
dc.description.firstpage87-
dc.description.lastpage92-
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-0008.pdf305,21 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


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