Skip to content
Home
About CP
Overview
Editorial Office
News & Announcements
Journals
Ars Combinatoria
Utilitas Mathematica
Journal of Combinatorial Mathematics and Combinatorial Computing
Congressus Numerantium
Information
Guide for Authors
Guide for Reviewers
Guide for Editors
Editorial Workflow
Publication Ethics
Open Access Policy
Copyright Policy
Order Article Reprints
Guide for Subscribers
Guide for Conference Organizers
Special Issue Guidelines
Authors Services
CP Books
Contact Us
Menu
Home
About CP
Overview
Editorial Office
News & Announcements
Journals
Ars Combinatoria
Utilitas Mathematica
Journal of Combinatorial Mathematics and Combinatorial Computing
Congressus Numerantium
Information
Guide for Authors
Guide for Reviewers
Guide for Editors
Editorial Workflow
Publication Ethics
Open Access Policy
Copyright Policy
Order Article Reprints
Guide for Subscribers
Guide for Conference Organizers
Special Issue Guidelines
Authors Services
CP Books
Contact Us
Search
Search
Close this search box.
Contents
Abstract
References
Journal of Combinatorial Mathematics and Combinatorial Computing
Volume 013
Pages: 57-64
Research article
A Short Proof of Polya’s Theorem
W. H. Holzmann
1
1
Department of Mathematical Sciences University of Lethbridge 4401 University Drive Lethbridge, Alberta Canada, T1K 3M4
Published: 30/04/1993
Download PDF
Citation
Copyright Link
License
Abstract
Using multisets, a short proof of Polya’s theorem is given.
Citation
W. H. Holzmann. A Short Proof of Polya’s Theorem[J],
Journal of Combinatorial Mathematics and Combinatorial Computing
, Volume 013. 57-64. DOI: .
