Skip to main content
SpringerLink
Log in

On the number of odd binomial coefficients

  • Published:
Acta Mathematica Hungarica Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. C. Caratheodory, Vorlesungen über reelle Funktionen, Third Edition, Chelsea (New York, 1968).

    Google Scholar 

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

    Google Scholar 

  3. Ph. Flajolet, P. Grabner, P. Kirschenhofer, H. Prodinger and R. F. Tichy, Mellin transforms and asymptotics: digital sums, Theoretical Comp. Science, 123 (1994), 291–314.

    Google Scholar 

  4. H. Harborth, Number of odd binomial coefficients, Proc. Amer. Math. Soc., 62 (1977), 19–22.

    Google Scholar 

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

    Google Scholar 

  6. K. B. Stolarsky, Power and exponential sums of digital sums related to binomial coefficient parity, SIAM J. Appl. Math., 32 (1977), 717–730.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Für Mathematik, Universität Salzburg, Hellbrunnerstraße 34, A-5020, Salzburg, Austria

    G. Larcher

Authors
  1. G. Larcher
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Larcher, G. On the number of odd binomial coefficients. Acta Math Hung 71, 183–203 (1996). https://doi.org/10.1007/BF00052108

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation