@MISC{FLEXARY1.MIZ,
  AUTHOR = {P\k{a}k, Karol},
  TITLE = {Flexary Operations},
  NOTE = {This work has been financed by the
    resources of the Polish National Science Centre granted by decision
    no. DEC-2012/07/N/ST6/02147.},
  SECTION1 = {Auxiliary Facts about Finite Sequences Concatenation},
  SECTION2 = {Flexary Plus},
  SECTION3 = {Power Function},
  SECTION4 = {Value-based Function (Re)Organization},
  DAY = {26},
  MONTH = {March},
  YEAR = {2015},
  ADDRESS1 = {Institute of Informatics\\University of Bia{\l}ystok\\Konstantego Cio{\l}kowskiego 1M, 15-245 Bia{\l}ystok\\Poland},
  SUMMARY = {In this article we introduce necessary notation
  and definitions to prove the Euler's Partition Theorem
  according to H.S. Wilf's lecture notes \cite{HSWift}.
  Our aim is to create an environment which
  allows to formalize the theorem in a way that is as similar as possible
  to the original informal proof. \par
  {E}uler's {P}artition {T}heorem is listed as \#45 at Freek Wiedijk's
             list of ``Top 100 mathematical
             theorems" \cite{Freek-100-theorems}.}}


@ARTICLE{HSWift,
  AUTHOR =       {Herbert S. Wilf},
  TITLE =        {Lectures on Integer Partitions},
  organization = {University of Pennsylvania},
  source = {http://www.math.upenn.edu/~wilf/PIMS/PIMSLectures.pdf}
}

