Skip to main content

A Dynamical Approach to Congruences: Linking Circle Maps and Aperiodic Necklaces

  • Conference paper
  • First Online:
Nonlinear Maps and their Applications

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 57))

  • 845 Accesses

Abstract

There are many possible proofs of Fermat’s little theorem. Among them we exemplify those using necklaces and dynamical systems. Both methods lead to a generalization. It is a congruence theorem that is already known from Gauss and Gegenbauer. A natural result from these proofs is a bijection between aperiodic necklaces and circle maps.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Similar content being viewed by others

References

  1. Berstel, J., Perrin, D.: The origins of combinatorics on words. Euro. J. Comb. 28, 996–1022 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dickson, L.E.: History of the Theory of Numbers: Divisibility and Primality, vol. 1. Carnegie Institution of Washington (publication no 256), Washington (1919)

    Google Scholar 

  3. Furstenberg, H.: Recurrence in Ergodic Theory and Combinatorial Number Theory. Princeton University Press, Princeton (1981)

    MATH  Google Scholar 

  4. Furstenberg, H., Katznelson, Y., Ornstein D.: The ergodic theoretical proof of Szemerédi’s theorem. Bull. Amer. Math. Soc. 7(3), 527–552 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. Iga, K.: A Dynamical Systems proof of Fermat’s little theorem. Math. Mag. 76(1), 48–51 (2003)

    Article  MathSciNet  Google Scholar 

  6. Milnor, J., Thurston, W.: On Iterated Maps of the Interval. In: Lectures Notes on Mathematics, vol. 1342, pp. 465–563. Springer, Berlin (1988)

    Google Scholar 

  7. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages: Word Language Grammar, vol. 1. Springer, New York (1997)

    Book  MATH  Google Scholar 

  8. Serpa, C., Buescu, J.: Combinatorics of piecewise expanding interval maps (submitted)

    Google Scholar 

  9. Smyth, C.J.: A coloring proof of a generalization of Fermat’s little theorem. The Amer. Math. Month. 93(6),  469–471 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgements

JB acknowledges partial support from FCT through Financiamento Base 2010-ISFL-1-209. CS acknowledges support from FCT through grant SFRH/77623/2011.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cristina Serpa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this paper

Cite this paper

Serpa, C., Buescu, J. (2014). A Dynamical Approach to Congruences: Linking Circle Maps and Aperiodic Necklaces. In: Grácio, C., Fournier-Prunaret, D., Ueta, T., Nishio, Y. (eds) Nonlinear Maps and their Applications. Springer Proceedings in Mathematics & Statistics, vol 57. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-9161-3_15

Download citation

Publish with us

Policies and ethics