Skip to main content

Problemes d’optimisation en nombres entiers et approximations diophantiennes

  • 235 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 475)

Résumé

Cet article expose sur 3 exemples quelques interférences entre les problèmes d’optimisation en nombres entiers et la théorie de l’approximation diophantienne.

Keywords

  • London Math
  • Composite Number
  • Nest Pair

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ERDOS P, NICOLAS J. L.: Répartition des nombres superabondants, Bull. Soc. Math. France, à paraftre, (1974).

    Google Scholar 

  2. HARDY G. H. WRIGHT E. M.: An introduction to the theory of numbers, Oxford at the Clarendon Press, 4ème edition, (1960).

    Google Scholar 

  3. LANG S.: Introduction to Diophantine approximations, New-York, Addison Wesley, Series in Mathematics, (1966).

    MATH  Google Scholar 

  4. NICOLAS, J. L.: Répartition des nombres hautement composés de Ramanujan, Can. J. Maths, vol. XXIII, p. 116–130, (1971).

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. NICOLAS J. L.: Sur un problème d’optimisation en nombres entiers de T. L. Saaty, R.A.I.R.O., à paraftre.

    Google Scholar 

  6. NIVEN I, ZUCKERMANN S.: An introduction to the theory of numbers, New-York, 3ème édition, John Wiley and sons, (1972).

    Google Scholar 

  7. PERRON O.: Die Lehre von den Kettenbrüchen, New-York, Chelsea.

    Google Scholar 

  8. RAMANUJAN S.: Highly composite numbers, Proc. London Math. Soc., Ser. 14, p. 347–400, Collected papers p. 78–128, (1915).

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Nicolas, J.L. (1975). Problemes d’optimisation en nombres entiers et approximations diophantiennes. In: Rauzy, G. (eds) Répartition Modulo 1. Lecture Notes in Mathematics, vol 475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0074261

Download citation

  • DOI: https://doi.org/10.1007/BFb0074261

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07388-8

  • Online ISBN: 978-3-540-37579-1

  • eBook Packages: Springer Book Archive