# Introduction

Chapter

## Abstract

Number theory has fascinated both the amateur and the professional for a longer time than any other branch of mathematics; so that much of it is now of considerable technical difficulty. However, there are more unsolved problems than ever before, and though many of these are unlikely to be solved in the next generation, this probably won’t deter people from trying. They are so numerous that they have already filled more than one volume so that the present book is just a personal sample.

## Keywords

Number Theory Unsolved Problem Pure Math Springer Lecture Note Michigan Math
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.

## Reference

- P. Erdös, Some unsolved problems, Michigan Math. J. 4 (1957) 291–300.MathSciNetCrossRefGoogle Scholar
- P. Erdös, On unsolved problems, Publ. Math. Inst. Hungar. Acad. Sci. 6 (1961) 221–254.MATHCrossRefGoogle Scholar
- P. Erdös, Quelques Problèmes de la Théorie des Nombres, Monographies de l’Enseignment Math. #6, Geneva, 1963, 81–135.Google Scholar
- P. Erdös, Extremal problems in number theory, Proc. Symp. Pure Math. 8, Amer. Math. Soc., Providence, 1965, 181–189.Google Scholar
- P. Erdös, Some recent advances and current problems in number theory, in Lectures on Modern Mathematics 3, Wiley, New York, 1965, 196–244.Google Scholar
- P. Erdös, Résultats et problèmes en théorie des nombres, Seminar Delange-Pisot-Poitou 24, 1972–73.Google Scholar
- P. Erdös, Problems and results in combinatorial number theory, in A Survey of Combinatorial Theory, North-Holland, 1973, 117–138.MATHGoogle Scholar
- P. Erdös, Problems and Results in Combinatorial Number Theory, Bordeaux, 1974.Google Scholar
- Paul Erdös, Problems and results in combinatorial number theory III, Springer Lecture Notes in Math. 626 (1977) 43–72; MR 57 #12442.Google Scholar
- P. Erdös, Combinatorial problems in geometry and number theory, Amer. Math. Soc. Proc. Sympos. Pure Math. 34 (1979)149–162.Google Scholar
- Paul Erdös, A survey of problems in combinatorial number theory, in
*Combinatorial Mathematics*,*Optimal Designs and their Applications*(Proc. Symp. Colo. State Univ. 1978) Ann. Discrete Math. 6 (1980) 89–115.MathSciNetMATHCrossRefGoogle Scholar - Paul Erdös, Problems and results in number theory and graph theory,
*Congressus Numerantium*XXVII (Proc. 9th Manitoba Conf. Num. Math. Comput. 1979) Utilitas Math., Winnipeg, 1980, 3–21.Google Scholar - P. Erdös and R. L. Graham,
*Old and New Problems and Results in Combinatorial Number Theory*, Monographies de l’Enseignment Math. No. 28, Geneva, 1980.Google Scholar - Pal Erdös and Andras Sarközy, Some solved and unsolved problems in combinatorial number theory,
*Math. Slovaca*, 28 (1978) 407–421;*MR*80i: 10001.Google Scholar - H. Fast and S. Swierczkowski,
*The New Scottish Book*,Wroclaw, 1946–1958.Google Scholar - Heini Halberstam, Some unsolved problems in higher arithmetic, in Ronald Duncan and Miranda Weston-Smith (eds.)
*The Encyclopaedia of Ignorance*, Pergamon, Oxford and New York, 1977, 191–203.Google Scholar - Proceedings of Number Theory Conference, Univ. of Colorado, Boulder, 1963.Google Scholar
- Report of Institute in the Theory of Numbers, Univ. of Colorado, Boulder, 1959.Google Scholar
- Daniel Shanks,
*Solved and Unsolved Problems in Number Theory*,Chelsea, New York, 2nd ed. 1978;*MR*80e:10003.Google Scholar - W. Sierpinski,
*A Selection of Problems in the Theory of Numbers*, Pergamon, 1964.Google Scholar - S. Ulam,
*A Collection of Mathematical Problems*, Interscience, New York, 1960.MATHGoogle Scholar

## Copyright information

© Springer Science+Business Media New York 1981