Some Exact Number Theory Computations via Probability Mechanisms

DOI10.2307/2975267MaRDI QIDQ4870057zbMATH OpenOpenAlexFDO

Authors Richard Blecksmith, Purushottam W. Laud

Publication date 13 October 1996

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2975267

zbMATH Keywords

binary representationdigit patternsMarkov process of bit selection for a random bounded numbernumber theoretic functionssummatory function of the Rudin-Shapiro sequence

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Number-theoretic algorithms; complexity (11Y16) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Distribution of the sum-of-digits function of random integers: a survey
• On the occurrences of words in the prime numbers
• SUBBLOCK OCCURRENCES IN SIGNED DIGIT REPRESENTATIONS
• Patterns in rational base number systems
• On the asymptotic behavior of density of sets defined by sum-of-digits function in base 2

Cited in

(2)

• A function related to the rumor sequence conjecture
• The Expectation of Success Using a Monte Carlo Factoring Method--Some Statistics on Quadratic Class Numbers

This page was built for publication: Some Exact Number Theory Computations via Probability Mechanisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870057)