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.
KeywordsIterative Sequence Pigeonhole Principle Neighboring Field Geometric Sequence Arithmetic Sequence
Unable to display preview. Download preview PDF.