REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/4873
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorPąk, Karolpl
dc.date.accessioned2016-12-15T13:01:50Z-
dc.date.available2016-12-15T13:01:50Z-
dc.date.issued2015pl
dc.identifier.citationFormalized Mathematics, Volume 23, Issue 2, 93–99pl
dc.identifier.issn1426-2630pl
dc.identifier.issn1898-9934pl
dc.identifier.urihttp://hdl.handle.net/11320/4873-
dc.description.abstractAbstractIn this article we prove the Euler’s Partition Theorem which states that the number of integer partitions with odd parts equals the number of partitions with distinct parts. The formalization follows H.S. Wilf’s lecture notes [28] (see also [1]). Euler’s Partition Theorem is listed as item #45 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/ [27].pl
dc.language.isoenpl
dc.publisherDe Gruyter Openpl
dc.subjectpartition theorempl
dc.titleEuler’s Partition Theorempl
dc.typeArticlepl
dc.identifier.doi10.1515/forma-2015-0009pl
dc.description.AffiliationInstitute of Informatics, University of Białystok, Ciołkowskiego 1M, 15-245 Białystok, Polandpl
dc.description.referencesGeorge E. Andrews and Kimmo Eriksson. Integer Partitions. ISBN 9780521600903.pl
dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.pl
dc.description.referencesGrzegorz Bancerek. König’s theorem. Formalized Mathematics, 1(3):589-593, 1990.pl
dc.description.referencesGrzegorz Bancerek. Countable sets and Hessenberg’s theorem. Formalized Mathematics, 2(1):65-69, 1991.pl
dc.description.referencesGrzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.pl
dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.pl
dc.description.referencesGrzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.pl
dc.description.referencesCzesław Bylinski. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.pl
dc.description.referencesCzesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990.pl
dc.description.referencesCzesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.pl
dc.description.referencesCzesław Bylinski. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.pl
dc.description.referencesCzesław Bylinski. The sum and product of finite sequences of real numbers. Formalized Mathematics, 1(4):661-668, 1990.pl
dc.description.referencesCzesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.pl
dc.description.referencesMarco B. Caminati. Preliminaries to classical first order model theory. Formalized Mathematics, 19(3):155-167, 2011. doi:10.2478/v10037-011-0025-2. [Crossref]pl
dc.description.referencesMarco B. Caminati. First order languages: Further syntax and semantics. Formalized Mathematics, 19(3):179-192, 2011. doi:10.2478/v10037-011-0027-0. [Crossref]pl
dc.description.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.pl
dc.description.referencesMagdalena Jastrzȩbska and Adam Grabowski. Some properties of Fibonacci numbers. Formalized Mathematics, 12(3):307-313, 2004.pl
dc.description.referencesRafał Kwiatek. Factorial and Newton coefficients. Formalized Mathematics, 1(5):887-890, 1990.pl
dc.description.referencesKarol Pak. Flexary operations. Formalized Mathematics, 23(2):81-92, 2015. doi:10.1515 /forma-2015-0008. [Crossref]pl
dc.description.referencesKarol Pak. The Nagata-Smirnov theorem. Part II. Formalized Mathematics, 12(3):385-389, 2004.pl
dc.description.referencesKarol Pak. Stirling numbers of the second kind. Formalized Mathematics, 13(2):337-345, 2005.pl
dc.description.referencesPiotr Rudnicki and Andrzej Trybulec. Abian’s fixed point theorem. Formalized Mathematics, 6(3):335-338, 1997.pl
dc.description.referencesAndrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329-334, 1990.pl
dc.description.referencesMichał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.pl
dc.description.referencesWojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569-573, 1990.pl
dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.pl
dc.description.referencesFreek Wiedijk. Formalizing 100 theorems.pl
dc.description.referencesHerbert S. Wilf. Lectures on integer partitions.pl
dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990.pl
dc.description.referencesBo Zhang and Yatsuka Nakamura. The definition of finite sequences and matrices of probability, and addition of matrices of real elements. Formalized Mathematics, 14(3): 101-108, 2006. doi:10.2478/v10037-006-0012-1. [Crossref]pl
Występuje w kolekcji(ach):Artykuły naukowe (WInf)
Formalized Mathematics, 2015, Volume 23, Issue 2

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
forma-2015-0009.pdf266,56 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


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