EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

The Frobenius exchange problem on competitions and in classroom

Géza Kiss

Teaching Mathematics and Computer Science · 01.12.2003 · 1 (2) · 203-218

DOI: 10.5485/tmcs.2003.0024 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Teaching Mathematics and Computer Science, online erschienen am 01.12.2003. Verfasst von Géza Kiss. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let a_1, ..., a_n be relatively prime positive integers. The still unsolved Frobenius problem asks for the largest integer which cannot be represented as Σ x_i a_i with non-negative integers xi, and also for the number of non-representable positive integers. These and several related questions have been investigated by many prominent mathematicians, including Paul Erdős, and a wide range of partial results were obtained by various interesting methods differing both in character and difficulty. In this paper we give a self-contained introduction to this field through problems and comments suitable also for treatment in a class of talented students.

Zitieren

APA

Kiss, G. (2003). The Frobenius exchange problem on competitions and in classroom. Teaching Mathematics and Computer Science, 1(2), 203-218. https://doi.org/10.5485/tmcs.2003.0024

Vancouver

Kiss G. The Frobenius exchange problem on competitions and in classroom. Teaching Mathematics and Computer Science. 2003;1(2):203-218. doi:10.5485/tmcs.2003.0024

BibTeX
@article{Kiss2003,
  author = {Kiss, Géza},
  title = {The Frobenius exchange problem on competitions and in classroom},
  journal = {Teaching Mathematics and Computer Science},
  year = {2003},
  volume = {1},
  number = {2},
  pages = {203--218},
  doi = {10.5485/tmcs.2003.0024}
}
Kostenlos starten →