Divisibility and primality in random walks
Pith reviewed 2026-05-24 06:17 UTC · model grok-4.3
The pith
Divisibility results for the Bernoulli random walk extend to wide classes of iid and independent non-iid walks, with new primality statements for the Rademacher walk and comparable divisor estimates in the Cramér model.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We improve or extend some of our divisibility results to wide classes of iid or independent non iid random walks. We also obtain new primality results for the Rademacher random walk. We study the value distribution of divisors of the random walk in the Cramér model, and obtain a general estimate of a similar kind to that of the Bernouilli model. Earlier results on divisors and quasi-prime numbers in the Bernoulli model are recorded, as well as some other recent for the Cramér random model, based on an estimate due to Selberg.
What carries the argument
Independence conditions on the increments of the random walk, together with the Cramér probabilistic model and Selberg-type estimates applied to divisor and primality counts.
If this is right
- Divisibility by small integers occurs with positive density that can be estimated uniformly across the extended classes of walks.
- Quasi-prime values of the walk appear with frequencies controlled by the same type of estimates used in the Bernoulli setting.
- The distribution of divisors of walk positions in the Cramér model follows a general form parallel to the Bernoulli model.
- Primality statements for the Rademacher walk give explicit conditions under which walk positions are prime.
Where Pith is reading between the lines
- If the extensions hold, divisibility counts might be used to classify or compare the arithmetic behavior of different random walk models on the integers.
- The same independence-based arguments could be tested on walks with steps drawn from continuous distributions to see whether similar divisor patterns persist.
- Connections between these random-walk results and classical questions on prime factors in integer sequences generated by dependent increments become worth exploring numerically.
Load-bearing premise
The random walk steps satisfy independence (iid or independent non-iid) so that the divisibility and distribution results transfer from the Bernoulli case.
What would settle it
A concrete counterexample would be an independent non-iid random walk for which the density of positions divisible by a small fixed integer, such as 3, deviates from the density predicted by the Bernoulli analysis.
read the original abstract
In this paper we study the divisibility and primality properties of the Bernoulli random walk. We improve or extend some of our divisibility results to wide classes of iid or independent non iid random walks. We also obtain new primality results for the Rademacher random walk. We study the value distribution of divisors of the random walk in the Cram\'er model, and obtain a general estimate of a similar kind to that of the Bernouilli model. Earlier results on divisors and quasi-prime numbers in the Bernoulli model are recorded, as well as some other recent for the Cram\'er random model, based on an estimate due to Selberg.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript examines divisibility and primality properties of the Bernoulli random walk. It extends or improves prior divisibility results to wide classes of iid and independent non-iid random walks, derives new primality results for the Rademacher random walk, and studies the value distribution of divisors in the Cramér model to obtain a general estimate paralleling the Bernoulli case (via Selberg estimates). Earlier results on divisors and quasi-primes in the Bernoulli model are recorded.
Significance. If the derivations hold, the work broadens the scope of divisibility and primality analysis for random walks under explicit independence hypotheses and supplies a model-comparison estimate that may be useful in probabilistic number theory.
minor comments (1)
- [Abstract] Abstract: 'Bernouilli' is misspelled; correct to 'Bernoulli'.
Simulated Author's Rebuttal
We thank the referee for their positive summary of the manuscript, recognition of its significance, and recommendation of minor revision. No specific major comments were listed in the report.
Circularity Check
No significant circularity detected
full rationale
The paper extends the author's prior divisibility results to broader classes of random walks under explicit iid or independent non-iid conditions and derives new primality statements for the Rademacher walk. The Cramér-model divisor estimate is presented as analogous to the Bernoulli case via an external Selberg estimate, with earlier Bernoulli-model results recorded only as background. No derivation step reduces by construction to a fitted parameter, self-defined quantity, or load-bearing self-citation chain; the central claims rest on the stated independence hypotheses and model transfer rather than on any internal renaming or ansatz smuggling. The analysis is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We study the divisibility and primality properties of the Bernoulli random walk... obtain a general estimate of a similar kind to that of the Bernouilli model... based on an estimate due to Selberg.
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
P{d|Bn} = 1/d + 2/d ∑ cos(π n j/d) (cos π j/d)^n ... uniform estimate sup |P{d|Bn} − Θ(d,n)/d| = O((log n)^{5/2} n^{-3/2})
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
T. M. Apostol, Introduction to analytic number theory . Springer-Verlag, New York-Heidelberg, (1976), Undergraduate Texts in Mathematics
work page 1976
-
[2]
T. M. Apostol, Modular Functions and Dirichlet series in number theory , Second Edition. Springer-Verlag, New York-Heidelberg, (1990), Graduate Texts in Mathematic s
work page 1990
-
[3]
Bellman, A brief introduction to Theta functions , (1961), Holt, Rinehart and Winston, New-York
R. Bellman, A brief introduction to Theta functions , (1961), Holt, Rinehart and Winston, New-York
work page 1961
-
[4]
K. A. Broughan, (2002) Restricted divisors sums. Acta arithmetica 101.2, 105–114
work page 2002
-
[5]
J. Bureaux and N. Enriquez, The probability that two rand om integers are coprime, Math. Nachr. 291 (2018) no. 1, 24–27. DIVISIBILITY AND PRIMALITY IN RANDOM W ALKS 51
work page 2018
-
[6]
P. Billingsley, Convergence of probability measures , (1968) John Wiley & Sons, Inc., New York-London- Sydney
work page 1968
-
[7]
G. S. Call and D. J. Velleman, Pascal’s matrices, Amer. Math. Monthly 100, (1993) 372–376
work page 1993
-
[8]
J. Cilleruelo, J. L. Fern´ andez and P. Fern´ andez, Visib le points in random walks, Eur. J. Combin. 75 (2019), 92–112
work page 2019
-
[9]
H. Cram´ er, (1936) On the order of magnitude of the differe nce between consecutive primes, Acta Arith- metica 2, 23-46
work page 1936
-
[10]
H. Daboussi and J. Rivat, (2000) Explicit upper bounds f or exponential sums over primes, Mathematics of computation 70, Number 233, 431–447
work page 2000
-
[11]
P. Diaconis and Ch. Stein, Some tauberian theorems rela ted to coin tossing, Ann. Prob. , 6 No3 (1978) 483-490
work page 1978
-
[12]
P. D. Elliott, (1980) Probabilistic number theory II , Springer, New York
work page 1980
-
[13]
P. Erd¨ os and A. R´ enyi, Additive properties of random sequences of positive integers, Acta Math. 6, (1960), 83–110
work page 1960
-
[14]
P. Erd¨ os and S. K. Zaremba, (1972) The arithmetical fun ction ∑ d|n log d d , Demonstratio Math. 6, Part. 2, 575–579
work page 1972
-
[15]
Feller, (1968) An Introduction to Probability Theory and its Applications , 1, 3rd ed
W. Feller, (1968) An Introduction to Probability Theory and its Applications , 1, 3rd ed. Wiley, New York
work page 1968
-
[16]
J. L. Fernandez and P. Fernandez, Divisibilities prope rties of random samples of integers, RACSAM (2021), 115: 26
work page 2021
- [17]
-
[18]
M. N. Huxley, On the differences between consecutive pri mes, Invent. Math. 15 (1972), 164–170
work page 1972
-
[19]
Granville, Harald Cram´ er and the Distribution of Pr ime Numbers, Scand
A. Granville, Harald Cram´ er and the Distribution of Pr ime Numbers, Scand. Actuarial J. No. 1, (1995) 12–28
work page 1995
-
[20]
Hardy Divergent series , (1963), Oxford at the Clarendon Press
G.H. Hardy Divergent series , (1963), Oxford at the Clarendon Press
work page 1963
-
[21]
Hardy, An inequality for Hausdorff means, J
G.H. Hardy, An inequality for Hausdorff means, J. London Math. Soc. 18 (1943), 46–50
work page 1943
-
[22]
G. H. Hardy and E. M. Wright, An introduction to the theory of numbers , fifth edition, Oxford at the Clarendon Press, Oxford, (1979)
work page 1979
-
[23]
D. R. Heath-Brown, The number of primes in a short interv al, J. reine angew. Math. 389 (1988), 22–63
work page 1988
-
[24]
A. Hildebrand and G. Tenenbaum, Integers without large factors, J. Th´ eorie des nombres, Bordeaux 5 (1993), 1–74
work page 1993
-
[25]
Hooley, (1963) On the number of divisors of quadratic polynomials
C. Hooley, (1963) On the number of divisors of quadratic polynomials. Acta Mathematica 110, 97–114
work page 1963
-
[26]
McKee, (1999) The average number of divisors of an irr educible quadratic polynomial, Math
J. McKee, (1999) The average number of divisors of an irr educible quadratic polynomial, Math. Proc. Cambridge Philos. Soc. 126, 17–22
work page 1999
-
[27]
J. McKee, (1996) A note on the number of divisors of quadr atic polynomials, in Sieve Methods, Exponential Sums, and their Applications in Number Theory , edited by Greaves, Harman and Huxley, CUP 1996, 275– 287
work page 1996
-
[28]
E. J. Scourfield, (1961) The divisors of a quadratic poly nomial, Proc. Glasgow Math. Soc. 5, 8–20
work page 1961
-
[29]
W.B. Jurkat, Ein funktionentheoretischer Beweis f¨ ur O-Taubers¨ atze bei den Verfahren non Borel und Euler-Knopp, Arch. Math. 7 (1956), 278–283
work page 1956
-
[30]
Kallenberg, Foundations of modern probability theory , (1997) Springer Verlag New-York
O. Kallenberg, Foundations of modern probability theory , (1997) Springer Verlag New-York
work page 1997
-
[31]
Landreau, ´Etude probabiliste des sommes de puissances s-i` emes, Compositio 99 n01 (1995), 1–31
B. Landreau, ´Etude probabiliste des sommes de puissances s-i` emes, Compositio 99 n01 (1995), 1–31
work page 1995
-
[32]
W. J. Leahey, and J. E. Nymann, On the probability that an integer chosen according to the binomial distribution be k-free, The Rocky Mountain J. of Math. 7, No 4 (1977) 769–774
work page 1977
-
[33]
P. J. McCarthy, Introduction to Arithmetical Functions, (Universitext), (1986), Springer-Verlag New-York Inc
work page 1986
-
[34]
MacDiarmid, C., (1998). Concentration, Prob. Methods for Algorithmic Discrete Math. , 195–248, Algo- rithms Combin. 16, Springer, Berlin
work page 1998
-
[35]
D. MacDonald, A local limit theorem for large deviation s of sums of independent, non-identically dis- tributed random variables, Annals of Prob. 7 (1979) no. 3, 526–531
work page 1979
-
[36]
K. Matom¨ aki and J. Ter¨ av¨ ainen, A note on zero densityresults implying large value estimates for Dirichlet polynomials, arXiv:2403.13157v1, (2024)
-
[37]
T. T. Moh, On a general Tauberian theorem, Proc. Amer. Math. Soc. 36, No 1 (1972) 167–172
work page 1972
-
[38]
H. L. Montgomery, R. C. Vaughan (2007) Multiplicative Number Theory I. Classical Theory , Cambridge studies in advanced math, Cambridge University Press, 52 MICHEL J. G. WEBER
work page 2007
-
[39]
H. L. Montgomery, K. Soundararajan, Primes in Short Int ervals Commun. Math. Phys. 252, 589–617, (2004)
work page 2004
-
[40]
V. V. Petrov, Sums of Independent Random Variables , Ergebnisse der Math. und ihre Grenzgebiete 82, (1975) Springer
work page 1975
-
[41]
J. Pintz, Cram´ er vs. Cram´ er, On Cram´ er’s probabilistic model for primes, Funct. Approx. Comment. Math. 37, part 2, (2007) 361–376
work page 2007
-
[42]
A. G. Postnikov, Introduction to analytic number theory , AMS Translation of mathematical monographs
- [43]
-
[44]
R´ enyi,Foundations of probability , (1970) Holden-Day series in probability and statistics
A. R´ enyi,Foundations of probability , (1970) Holden-Day series in probability and statistics
work page 1970
-
[45]
J. B. Rosser, L. Schoenfeld, (1962) Approximate formul as for some functions of prime numbers, Illinois J. Math. 6(1), 64–94
work page 1962
-
[46]
Y. A. Rozanov, On a local limit theorem for lattice distr ibutions, Theor. Prob. Appl. , 2 (1957), no. 2, 260–265
work page 1957
-
[47]
S´ ark˝ ozy A., (1978) On difference sets of sequence of integers, Acta Math
A. S´ ark˝ ozy A., (1978) On difference sets of sequence of integers, Acta Math. Acad. Sci. Hungar. 31 (1-2),
work page 1978
-
[48]
A. Selberg, On the normal density of primes in small inte rvals, and the difference between consecutive primes. Arch. Math. Naturvid. , 47 (1943), 87–105
work page 1943
-
[49]
Siebert, (1976) Montgomery’s weighted sieve for dim ension two, Monatsh
H. Siebert, (1976) Montgomery’s weighted sieve for dim ension two, Monatsh. Math. 82, 327–336
work page 1976
- [50]
- [51]
-
[52]
V. G. Sprindˇ zuk, (1979) Metric theory of Diophantine approximations , Translated from the Russian and edited by Richard A. Silverman. With a foreword by Donald J. N ewman. Scripta Series in Mathematics. V. H. Winston & Sons, Washington, D.C.; AHalsted Press Book, John Wiley & Sons, New York-Toronto, Ont.-London. xiii+156 pp
work page 1979
-
[53]
Szewczak, Z. and Weber M., Classical and Almost Sure Loc al Limit Theorems, Dissertationes Math , No 589, (2023), 97 pp
work page 2023
-
[54]
Tenenbaum, Introduction ` a la th´ eorie analytique et probabiliste des nombres, (2008), Coll
G. Tenenbaum, Introduction ` a la th´ eorie analytique et probabiliste des nombres, (2008), Coll. ´Echelles Ed. Belin Paris
work page 2008
-
[55]
G. Tenenbaum, Crible d’Eratosth` ene et mod` ele de Kubi lius, in: Gy´ ory, Iwaniec, Urbanowicz (Eds), Number Theory in Progress, Proceedings of the Conference in honor of Andrzej Schinzel , Zakopane, Poland 1997, W. de Gruyter, Berlin-New-York (1999), 1099–1129
work page 1997
-
[56]
T´ oth, A survey on Gcd-Sums functions, Journal of Integer Sequences , Vol
L. T´ oth, A survey on Gcd-Sums functions, Journal of Integer Sequences , Vol. 13 (2010), Article 10.8.1
work page 2010
-
[57]
Walfisz, Weylsche Exponentialsummen in der neueren Zahlentherie
A. Walfisz, Weylsche Exponentialsummen in der neueren Zahlentherie. , Mathematische Forschungs- berichte, XV, V E B Deutscher Verlag der Wissenschaften (1963), Berlin
work page 1963
-
[58]
Weber, Random walks in analytic number theory, (2024 )
M. Weber, Random walks in analytic number theory, (2024 )
work page 2024
-
[59]
Weber, Correlation Properties of Divisors in the Ber noulli random walk, (2023)
M. Weber, Correlation Properties of Divisors in the Ber noulli random walk, (2023)
work page 2023
-
[60]
Weber, On infinite M¨ obius inversion, Publ
M. Weber, On infinite M¨ obius inversion, Publ. Math. Debrecen Ref. no.: 9260, (2023), 1–12
work page 2023
-
[61]
M. Weber, On Farey sequence and quadratic Farey sums, Research in Number Theory , 8, Article number 14, (2022) (25 p.)
work page 2022
-
[62]
Weber An extension of a result of Erd¨ os-Zaremba, Glasgow Math
M. Weber An extension of a result of Erd¨ os-Zaremba, Glasgow Math. J. , 63 (1), (2021), 193–222
work page 2021
-
[63]
Weber, On Rozanov’s theorem and strenghtened asympt otic uniform distribution, Probab
M. Weber, On Rozanov’s theorem and strenghtened asympt otic uniform distribution, Probab. Math. Statist., (2024), to appear
work page 2024
-
[64]
Weber, A uniform semi-local limit theorem along sets of multiples for sums of i.i.d
M. Weber, A uniform semi-local limit theorem along sets of multiples for sums of i.i.d. random variables, Funct. Approx. Comment. Math. , (2024), to appear
work page 2024
-
[65]
M. Weber, Critical probabilistic characteristics of t he Cram´ er model for primes and arithmetical proper- ties, Indian J. of Pure and Applied Math , (2024), to appear
work page 2024
-
[66]
M. Weber, (2013) Instants of small amplitude of the Brow nian motion and application to the Kubilius model, Periodica Math. Hung. 67 (1), 95–113
work page 2013
-
[67]
Weber, (2022) A Fourier analysis of quadratic Rieman n sums and local integrals of ζ(s), submitted
M. Weber, (2022) A Fourier analysis of quadratic Rieman n sums and local integrals of ζ(s), submitted
work page 2022
-
[68]
M. Weber, Dynamical Systems and Processes , (2009) European Mathematical Society Publishing House, IRMA Lectures in Mathematics and Theoretical Physics 14 xiii+761p
work page 2009
-
[69]
Weber, (2008) Sampling the integers with a complete r andom walk (27 p.), Unpublished
M. Weber, (2008) Sampling the integers with a complete r andom walk (27 p.), Unpublished
work page 2008
-
[70]
Weber, (2008) Sur la probabilit´ e P{Sn est premier } (15 p.), Unpublished
M. Weber, (2008) Sur la probabilit´ e P{Sn est premier } (15 p.), Unpublished
work page 2008
-
[71]
Weber, Small divisors of Bernoulli sums, Indag
M. Weber, Small divisors of Bernoulli sums, Indag. Math. 18 No2 (2007), 281–293
work page 2007
-
[72]
Weber, (2007) Divisors of Bernoulli sums, Results de r Math
M. Weber, (2007) Divisors of Bernoulli sums, Results de r Math. 51, 141-179. DIVISIBILITY AND PRIMALITY IN RANDOM W ALKS 53
work page 2007
-
[73]
Weber (2006) On the order of magnitude of the divisor f unction, Acta Math
M. Weber (2006) On the order of magnitude of the divisor f unction, Acta Math. Sinica 22, No2, 377-382
work page 2006
-
[74]
M. Weber, (2005) Divisors, spin sums and the functional equation of the Zeta-Riemann function, Periodica Math. Hungar. 51 (1) 119-131
work page 2005
-
[75]
Weber, (2004) An arithmetical property of Rademache r sums, Indag
M. Weber, (2004) An arithmetical property of Rademache r sums, Indag. Math. (N.S.) 15, 133–150. IRMA, UMR 7501, Universit ´e Louis-P asteur et C.N.R.S., 7 rue Ren ´e Descartes, 67084 Stras- bourg Cedex, France. E-mail: michel.weber@math.unistra.fr
work page 2004
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.