Frobenius exchange problem on competitions and in classroom

A tétel rövid nézete
dc.contributor.authorKiss, Géza
dc.date.accessioned2024-09-04T09:44:43Z
dc.date.available2024-09-04T09:44:43Z
dc.date.issued2003-12-01
dc.description.abstractLet 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.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 1 No. 2 (2003) , 203-218
dc.identifier.doihttps://doi.org/10.5485/TMCS.2003.0024
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issue2
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379505
dc.identifier.volume1
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14695
dc.rights.accessOpen Access
dc.rights.ownerGéza Kiss
dc.subjectFrobenius problemen
dc.subjectdiophantine equationen
dc.subjectmathematical competitionsen
dc.titleFrobenius exchange problem on competitions and in classroomen
dc.typefolyóiratcikkhu
dc.typearticleen
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
PDF
Méret:
191.19 KB
Formátum:
Adobe Portable Document Format
Letöltés
Gyűjtemények
Teaching Mathematics and Computer Science (DE-journals)