autopushed

journal/2024-07-12.md

@@ -1,6 +1,7 @@
 - threw [[261]]
   - leading to [[hex/10]] = [[271]]: es todo perfecto como es.
   - I realized [[hex/6]] = [[97]] is prime, the last I had yet to memorize below 100. That concludes a particular interesting sequence, I guess :) 
+  - [[primes]]:
     - The number of primes below 100 is perhaps interesting to know: 25. So a fourth of the 100 first numbers are prime! Huh.
     - Knowing up to 1000 would unlock getting a statistical feel of how quickly primes 'thin out'.
     - Of course we can also count to 10: 4 primes below 10, so about two fifths.
@@ -11,8 +12,9 @@
   - it's alpha but it works sometimes (tm)
   - #go at://anagora.bsky.social
     - is that a valid [[at protocol]] uri? I believe it sort of should be but I haven't checked :)
-- Here I am having counted the primes up to 1000: [[168]]. So down to 16.8% of numbers being prime.
-  - The [[Prime number theorem]] is what I was inching towards 
-  - https://en.wikipedia.org/wiki/Prime-counting_function#Table_of_%CF%80(x),_x/log(x),_and_li(x) is a [[great table]]
-  - The ratio of primes below number n which is exactly 1/#primes_below, can be estimated by 1/(x/log(x))
-  - Wow, had I never heard of [[logarithmic integral function]] before?
+- [[primes]]:
+  - Here I am having counted the primes up to 1000: [[168]]. So down to 16.8% of numbers being prime.
+    - The [[Prime number theorem]] is what I was inching towards 
+    - https://en.wikipedia.org/wiki/Prime-counting_function#Table_of_%CF%80(x),_x/log(x),_and_li(x) is a [[great table]]
+    - The ratio of primes below number n which is exactly 1/#primes_below, can be estimated by 1/(x/log(x))
+    - Wow, had I never heard of [[logarithmic integral function]] before?