Power sums of digital sums (Q1066170): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-314x(86)90067-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043799855 / rank
 
Normal rank

Latest revision as of 08:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Power sums of digital sums
scientific article

    Statements

    Power sums of digital sums (English)
    0 references
    0 references
    1986
    0 references
    Let \(e_ r(n)\), \(r\geq 0\), be the dyadic digits of the integer n. Set \(s(n)=\sum_{r}e_ r(n)\), and \(S_ d(N)=\sum_{n\leq N}s^ d(n)\). The author obtains asymptotic formulas, with error terms, for \(S_ d(N)\) as \(N\to +\infty\).
    0 references
    sum of binary digits
    0 references
    power sum
    0 references
    number of ones in binary
    0 references
    expansion
    0 references
    dyadic expansion
    0 references
    dyadic digits
    0 references
    asymptotic formulas
    0 references
    error terms
    0 references

    Identifiers