Nathan McNew
@agreatnate.bsky.social
Associate professor of mathematics, Towson University, DEN -> LEB -> BWI
Number theory, combinatorics, coffee
Number theory, combinatorics, coffee
Try 5calls.org? They have scripts prepared for a variety of timely issues and will give you phone numbers directly for your representatives after you set your location.
February 11, 2025 at 4:13 PM
Try 5calls.org? They have scripts prepared for a variety of timely issues and will give you phone numbers directly for your representatives after you set your location.
Welcome! Excited to have you join us!
December 20, 2024 at 3:15 PM
Welcome! Excited to have you join us!
Yeah walking to the 7800 building today wasn't so fun... but at least it wasn't that cold!
December 11, 2024 at 10:47 PM
Yeah walking to the 7800 building today wasn't so fun... but at least it wasn't that cold!
I feel like φ the golden ratio has a pretty good case as the actual "loneliest number" since its rational approximations converge so slowly!
December 4, 2024 at 11:15 PM
I feel like φ the golden ratio has a pretty good case as the actual "loneliest number" since its rational approximations converge so slowly!
Whitney's 1972 paper shows that if you use a different way of measuring density (called logarithmic density) that then the primes obey Benford's law in that sense.
December 4, 2024 at 10:42 PM
Whitney's 1972 paper shows that if you use a different way of measuring density (called logarithmic density) that then the primes obey Benford's law in that sense.
Almost! The sequence of prime numbers fails to be Benford for the same reason that the sequence of all integers does - there's just too many of them! Lots of interesting subsequences of primes follow Benford's law though, as do prime-valued statistics about integers like doi.org/10.1007/s006...
Intermediate prime factors in specified subsets - Monatshefte für Mathematik
Let $$\mathcal {P}$$ P be a fixed set of primes possessing a limiting frequency $$\nu $$ ν , as detected by the weight 1/p. We show that for any fixed $$\alpha \in (0,1)$$ α ∈ ( 0 , 1 ) , the $$\lceil...
doi.org
December 4, 2024 at 10:39 PM
Almost! The sequence of prime numbers fails to be Benford for the same reason that the sequence of all integers does - there's just too many of them! Lots of interesting subsequences of primes follow Benford's law though, as do prime-valued statistics about integers like doi.org/10.1007/s006...
A subset of numbers that start with an initial string of digits S is those numbers whose first "digit" is S in a sufficiently high base. (e.g. if you want numbers that start with 73, you can take numbers whose first digit is 73 in base 100.) The idea of jstor.org/stable/2316536 works in any base.
Initial Digits for the Sequence of Primes on JSTOR
R. E. Whitney, Initial Digits for the Sequence of Primes, The American Mathematical Monthly, Vol. 79, No. 2 (Feb., 1972), pp. 150-152
jstor.org
December 3, 2024 at 3:26 PM
A subset of numbers that start with an initial string of digits S is those numbers whose first "digit" is S in a sufficiently high base. (e.g. if you want numbers that start with 73, you can take numbers whose first digit is 73 in base 100.) The idea of jstor.org/stable/2316536 works in any base.
Hi! I'd love to join too!
December 2, 2024 at 7:11 AM
Hi! I'd love to join too!
Make the cranberry sauce! And peel the pearl onions of course.
November 30, 2024 at 8:28 PM
Make the cranberry sauce! And peel the pearl onions of course.