Skip to main content

Zwei kombinatorische Beweise

  • Chapter
  • 59 Accesses

Zusammenfassung

In diesem Kapitel diskutieren wir zwei Sätze, die in Mathematische Edelsteine (Band 1 der Reihe) bewiesen worden sind. Die Darstellung ist aber in beiden Fällen von der dort gegebenen unabhängig.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   49.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literaturangaben

  1. D. J. Newman, A problem in graph theory, Amer. Math. Monthly, 65 (1958) 611.

    Article  MathSciNet  MATH  Google Scholar 

  2. S. W. Colomb, Combinatorial proof of Fermat’s “Little” Theorem, Amer. Math. Monthly, 63 (1956) 718.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig

About this chapter

Cite this chapter

Honsberger, R. (1982). Zwei kombinatorische Beweise. In: Mathematische Juwelen. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-87265-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-87265-4_5

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-528-08475-2

  • Online ISBN: 978-3-322-87265-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics