Combinatorial Arithmetic

  • Jiří Herman
  • Radan Kučera
  • Jaromír Šimša
Chapter
Part of the CMS Books in Mathematics / Ouvrages de mathématiques de la SMC book series (CMSBM)

Abstract

This chapter is devoted to problems on numerical configurations. The rich structure associated with numbers (arithmetical operations, order relations, metrics) gives rise to a great variety and diversity of such problems, which makes it difficult to attempt a methodical or an algorithmic approach to their solutions. This is all the more so, since the individual problems are relatively independent “research problems,” widely varying in their degrees of difficulty. They range from simple to very difficult, where the solutions require a considerable amount of creative energy, resourcefulness, and also (in the case of initial failure) patience.

Keywords

Iterative Sequence Pigeonhole Principle Neighboring Field Geometric Sequence Arithmetic Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Jiří Herman
    • 1
  • Radan Kučera
    • 2
  • Jaromír Šimša
    • 3
  1. 1.Brno Grammar SchoolBrnoCzech Republic
  2. 2.Department of Mathematics, Faculty of ScienceMasaryk UniversityBrnoCzech Republic
  3. 3.Mathematical InstituteAcademy of Sciences of the Czech RepublicBrnoCzech Republic

Personalised recommendations