Number Theory and Combinatorics

Titu Andreescu and Răzvan Gelca
Additional contact information
Titu Andreescu: University of Nebraska, American Mathematics Competitions
Răzvan Gelca: University of Michigan, Department of Mathematics

Chapter Chapter 3 in Mathematical Olympiad Challenges, 2000, pp 59-85 from Springer

Abstract: Abstract This section is about a problem-solving technique that although simple, can be very powerful. As the title says, the idea is to arrange the elements in order. Here is an example.

Keywords: Positive Integer; Number Theory; Integer Solution; Minimal Solution; Great Common Divisor (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2138-8_3

Ordering information: This item can be ordered from
http://www.springer.com/9781461221388

DOI: 10.1007/978-1-4612-2138-8_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().