Skip to main content

Sur la non-dérivabilité de fonctions périodiques associées à certaines formules sommatoires

  • Chapter
  • First Online:
The Mathematics of Paul Erdős I
  • 2200 Accesses

Abstract

Les fonctions arithmétiques associées aux systèmes de représentations d’entiers, comme le développement dans une base donnée, satisfont généralement des relations de récurrence qui facilitent considérablement l’étude de leur valeur moyenne.

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

Access this chapter

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

Bibliographie

  1. J.-P. Allouche & J. Shallit, The ring of k-regular sequences, Theor. Comp. Sci. 98 (1992), 163–187.

    Google Scholar 

  2. J. Brillhart, P. Erdős & P. Morton, On sums of Rudin-Shapiro coefficients, II, Pac. J. Math. 107 (1983), 39–69.

    Google Scholar 

  3. J. Brillhart & P. Morton, Über Summen von Rudin-Shapirosehen Koeffizienten, Ill. J. Math. 22 (1978), 126–148.

    Google Scholar 

  4. L. E. Bush, An asymptotic formula for the average sums of the digits of integers, Amer. Math. Monthly 47 (1940),154–156.

    Google Scholar 

  5. E. Cateland, Suites digitales et suites k-régulières, Thèse, Université de Bordeaux 1, 1992.

    Google Scholar 

  6. P. Cheo & S. Yien, A problem on the K-adic representation of positive integers, Acta Math. Sinica 5 (1955), 433–438.

    Google Scholar 

  7. J. Coquet, A summation formula related to the binary digits, Invent. Math. 73 (1983), 107–115.

    Google Scholar 

  8. J. Coquet, Power sums of digital sums, J. Number Theory 22 (1986), 161–176.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Coquet & P. van den Bosch, A summation formula involving Fibonacci digits, J. Number Theory 22 (1986), 139–146.

    Google Scholar 

  10. H. Delange, Sur la fonction sommatoire de la fonction “somme des chiffres”, Ens. Math. 21 (1975), 31–47.

    Google Scholar 

  11. J.-M. Dumont, Formules sommatoires et systèmes de numération liés aux substitutions, Séminaire de théorie des nombres de Bordeaux (1987/88), Exposé n ∘  39.

    Google Scholar 

  12. J.-M. Dumont & A. Thomas, Systèmes de numération et fonctions fractales relatifs aux substitutions, Theor. Camp. Sci. 65 (1989), 153–169.

    Google Scholar 

  13. J.-M. Dumont & A. Thomas, Digital sum problems and substitutions on a finite alphabet, J. Number Theory 39 (1991), 351–366.

    Google Scholar 

  14. P. Flajolet & L. Ramshaw, A note on Gray code and odd-even merge, SIAM J. Comp. 9 (1980), 142–158.

    Article  MathSciNet  MATH  Google Scholar 

  15. P. Flajolet, P. Grabner, P. Kirsehenhoffer, H. Prodinger & R. Tichy, Mellin transforms and asymptotics: digital sums, Theoret. Comput. Sci. 123 (1994), no. 2, 291–314.

    Google Scholar 

  16. D. M. Foster, Estimates for a remainder term associated with the sum of digits function, Glasgow Math. J. 29 (1987), 109–129.

    Google Scholar 

  17. P. J. Grabner & R. F. Tichy, Contributions to digit expansions with respect to linear recurrences, J. Number Theory 36 (1990), 160–169.

    Google Scholar 

  18. R. Girgensohn, Digital sums and functional equations, Integers 11 (2011), #A54.

    Google Scholar 

  19. H. Harboth, Number of odd binomial coefficients, Proc. Amer. Math. Soc. 63 (1977), 19–22.

    Google Scholar 

  20. J. Honkala, On number systems with negative digits, Ann. Acad. Sci. Fenn., Series A. I. Mathematica 14 (1989), 149–156.

    Google Scholar 

  21. R. E. Kennedy & C. N. Cooper, An extension of a theorem by Cheo and Yien concerning digital sums, Fibonacci Quarterly 29 (1991), 145–149.

    Google Scholar 

  22. P. Kirschenhoffer, Subblock occurrences in the q-ary representation of n, Siam J. Alg. Disc. Meth. 4 (1983), 231–236.

    Google Scholar 

  23. P. Kirschenhoffer & H. Prodinger, Subblock occurrences in positional number systems and Gray code representation, J. Inf. Opt. Sci. 5 (1984), 29–42.

    Google Scholar 

  24. P. Kirschenhoffer & R. F. Tichy, On the distribution of digits in Cantor representations of integers, J. Number Theory 18 (1984), 121–134.

    Google Scholar 

  25. M. Krüppel, Takagi’s continuous nowhere differentiable function and binary digital sums, Rostock. Math. Kolloq. 63 (2008), 37–54.

    Google Scholar 

  26. G. Larcher & R. F. Tichy, Some number-theoretical properties of generalized sum-of-digit functions, Acta Arith. 52 (1989), 183–196.

    Google Scholar 

  27. M. D. McIlroy, The number of 1’s in binary integers: bounds and extremal properties, SIAM J. Comput. 3 (1974), 225–261.

    Google Scholar 

  28. L. Mirsky, A theorem on representations of integers in the scale of r, Scripta Math. 15 (1949), 11–12.

    Google Scholar 

  29. D. J. Newman, On the number of binary digits in a multiple of three, Proc. Amer. Math. Soc. 21 (1969), 719–721.

    Google Scholar 

  30. A. Pethö & R. F. Tichy, On digit expansions with respect to linear recurrences, J. Number Theory 33 (1989), 243–256.

    Google Scholar 

  31. H. Prodinger, Generalizing the “sum of digits” function, SIAM J. Alg. Disc. Meth. 3 (1982), 35–42.

    Google Scholar 

  32. P. Shiu & A. H. Osbaldestin, A correlated digital sum problem associated with sums of three squares, Bull. London Math. Soc. 21 (1989), 369–374.

    Google Scholar 

  33. A. H. Stein, Exponential sums related to binomial coefficient parity, Proc. Amer. Math. Soc. 80 (1980), 526–530.

    Google Scholar 

  34. A. H. Stein, Exponential sums of an iterate of the binary sum of digit function, Indiana Univ. Math. J. 31 (1982), 309–315.

    Google Scholar 

  35. A. H. Stein, Exponential sums of sum-of-digit functions, Ill.J. Math. 30 (1986), 660–675.

    Google Scholar 

  36. A. H. Stein, Exponential sums of digit counting functions, in : J.-M. De Koninck et C. LeVesque (eds.), Théorie des Nombres (Québec 5-18/7/87), 861–868, Walter de Gruyter, Berlin-New York, 1989.

    Google Scholar 

  37. K. B. Stolarsky, Digital sums and binomial coefficients, Notices Amer. Math. Soc. 22 (1975), A 669, Abstract # 728-A7.

    Google Scholar 

  38. K. B. Stolarski, Power and exponential sums related to binomial digit parity, SIAM J. Appl. Math. 32 (1977), 717–730.

    Google Scholar 

  39. T. Takagi, A simple example of the continuous function without derivative, Proceedings of the Physico-Mathematical Society of Japan, ser. II, 1 (1903), 176–177. [Collected Papers of Teiji Takagi (S. Iyanaga, ed.), Springer Verlag, New York 1990].

    Google Scholar 

  40. J. R. Trollope, Generalized bases and digital sums, Amer. Math. Monthly 74 (1967), 690–694.

    Google Scholar 

  41. J. R. Trollope, An explicit expression for binary digital sums, Math. Mag. 41 (1968), 21–25.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gérald Tenenbaum .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Tenenbaum, G. (2013). Sur la non-dérivabilité de fonctions périodiques associées à certaines formules sommatoires. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős I. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7258-2_19

Download citation

Publish with us

Policies and ethics