flancian/garden
0
0
Fork 0
mirror of https://github.com/flancian/garden.git synced 2026-08-07 15:06:19 +00:00
Code Issues Packages Projects Releases Wiki Activity

autopushed

Browse Source
This commit is contained in:
Flancian
2024-07-12 01:55:56 +02:00
parent 22b10c6e22
commit 2efed3654d
1 changed files with 7 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
journal/2024-07-12.md
+7 -5
View File
@@ -1,6 +1,7 @@
- threw [[261]] - threw [[261]]
- leading to [[hex/10]] = [[271]]: es todo perfecto como es. - 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 :) - 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. - 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'. - 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. - 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) - it's alpha but it works sometimes (tm)
- #go at://anagora.bsky.social - #go at://anagora.bsky.social
- is that a valid [[at protocol]] uri? I believe it sort of should be but I haven't checked :) - 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. - [[primes]]:
- The [[Prime number theorem]] is what I was inching towards - Here I am having counted the primes up to 1000: [[168]]. So down to 16.8% of numbers being prime.
- https://en.wikipedia.org/wiki/Prime-counting_function#Table_of_%CF%80(x),_x/log(x),_and_li(x) is a [[great table]] - The [[Prime number theorem]] is what I was inching towards
- The ratio of primes below number n which is exactly 1/#primes_below, can be estimated by 1/(x/log(x)) - https://en.wikipedia.org/wiki/Prime-counting_function#Table_of_%CF%80(x),_x/log(x),_and_li(x) is a [[great table]]
- Wow, had I never heard of [[logarithmic integral function]] before? - 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?