Update
This commit is contained in:
parent
c6e3d45699
commit
46a27e1930
13 changed files with 2019 additions and 1975 deletions
|
|
@ -30,5 +30,5 @@ Examples of beautiful things include:
|
|||
- the game of [go](go.md)
|
||||
- elementary [musical](music.md) intervals such as an octave or perfect fifth
|
||||
- examples of visual beauty may include [fractals](fractal.md), [attractors](attractor.md) or [golden ratio](golden_ratio.md)
|
||||
- certain [numbers](number.md), for example 12: it lies between two [prime numbers](prime.md) while itself being highly composite with 5 (!!!) divisors, it can be halved, trisected and quartered, it equals the sum of its divisors less than self (1 + 2 + 3 + 6), it is the number of sides of one of the five platonic solids, edges of a cube, semitones in an octave etc.
|
||||
- certain [numbers](number.md), for example 12: it lies between two [prime numbers](prime.md) while itself being highly composite with 5 (!!!) divisors, it can be halved, trisected and quartered, it equals the sum of its divisors less than self (1 + 2 + 3 + 6), it is the number of sides of one of the five platonic solids, edges of a cube, semitones in an octave etc. (This is also probably why the number has a special place in trade, so much that it got its own name: a dozen.)
|
||||
- ...
|
||||
8
chess.md
8
chess.md
|
|
@ -184,9 +184,9 @@ Chess stats are pretty [interesting](interesting.md). Thanks a lot e.g. to Liche
|
|||
|
||||
{ Some chess world records are here: https://timkr.home.xs4all.nl/records/records.htm. ~drummyfish }
|
||||
|
||||
**Number of possible games** is not known exactly, Shannon estimated it at 10^120 (lower bound, known as *Shannon number*). Number of possible games by plies played is 20 after 1, 400 after 2, 8902 after 3, 197281 after 4, 4865609 after 5, and 2015099950053364471960 after 15.
|
||||
**Number of possible games** is not known exactly, Shannon estimated it at 10^120 (lower bound, known as *Shannon number*). Number of possible games by plies played is 20 after 1, 400 after 2, 8902 after 3, 197281 after 4, 4865609 after 5, and 2015099950053364471960 after 15 ([OEIS A048987](https://oeis.org/A048987)).
|
||||
|
||||
Similarly the **number of possibly reachable positions** (position for which so called *proof game* exists) is not known exactly, some upper estimates have been made, lower bounds are much harder to set. The estimates are placed around 10^40 or 10^50 at most. [Here](https://tromp.github.io/chess/chess.html) is a site that gives a proven upper estimate of 45193640626062205213735739171550309047984050718 (2^155), also providing a more precise one of 7728772977965919677164873487685453137329736522 (~10^45.888, ~2^152) which was however proven with a program that's a bit obscure and less trustworthy. Numbers of possible positions by plies are 20 after 1, 400 after 2, 5362 after 3, 72078 after 4, 822518 after 5, and 726155461002 after 11.
|
||||
Similarly the **number of possibly reachable positions** (position for which so called *proof game* exists) is not known exactly, some upper estimates have been made, lower bounds are much harder to set. The estimates are placed around 10^40 or 10^50 at most. [Here](https://tromp.github.io/chess/chess.html) is a site that gives a proven upper estimate of 45193640626062205213735739171550309047984050718 (2^155), also providing a more precise one of 7728772977965919677164873487685453137329736522 (~10^45.888, ~2^152) which was however proven with a program that's a bit obscure and less trustworthy. Numbers of possible positions by plies are 20 after 1, 400 after 2, 5362 after 3, 72078 after 4, 822518 after 5, and 726155461002 after 11 ([OEIS A083276](https://oeis.org/A083276)).
|
||||
|
||||
**Shortest possible checkmate** is by black on ply number 4 (so called *fool's mate*); in fact there are 8 different games that can end like this. As of 2022 the **longest known forced checkmate** is in 549 moves -- it has been discovered when computing the Lomonosov Tablebases. EDIT: now it seems there is one in 584 moves. Please note this: there most likely exist much longer forced mates, these are just the KNOWN ones. Consider e.g. that if black blunders a queen in the opening, the game is very likely a theoretical win for white since then, i.e. a forced mate, and with perfect play black can probably resist for very long. However such situations are too complex to explore fully.
|
||||
|
||||
|
|
@ -394,7 +394,9 @@ Again, Lichess only analyzed the first 150 moves and here it marked practically
|
|||
|
||||
What is **the rarest move**? Some [YouTube](youtube.md) video tried to investigate this with the help of Lichess database. Things that immediately come to mind like en passant checkmates and checkmates by promoting to a knight are rare but not insanely rare. A crazily rare kind of move, which only appeared ONCE in the whole database, was a doubly disambiguatated (i.e. with the necessary specification of both rank and file of the bishop) checkmate by a bishop (specifically Bf1g2#, occurring in a 2022 game) -- this is rare because to need a double disambiguation for a bishop move it is necessary to underpromote two pawns to a bishop and then place them correctly. Yet rarer moves, which NEVER appeared in the database, were a doubly disambiguated knight checkmate with capture and doubly disambiguated bishop checkmate with capture, latter of which was judged less likely and therefore probably the rarest move ever.
|
||||
|
||||
Anyway, you can try to derive your own stats, there are huge free game databases such as the Lichess [CC0](cc0.md) database of billions of games from their server.
|
||||
The maximum number of **black and white queen pairs placed on an empty board so that none is attacked** is 12 (that is 12 white queens and 12 black ones). This number as a [function](function.md) of board size is the [OEIS sequence A250000](https://oeis.org/A250000) and starts like this: 0, 0, 1, 2, 4, 5, 7, 9, 12, 14, 17, 21, 24, 28, 32, ...
|
||||
|
||||
Anyway, you can try to derive your own stats, there are huge free game databases such as the Lichess [CC0](cc0.md) database of billions of games from their server, as well as powerful [free software](free_software.md) engines allowing you to arrange and automatically play out hundreds of thousands of games. Why not take the chance?
|
||||
|
||||
{ TODO: Derive stats about the best move, i.e. for example "best move is usually by queen by three squares" or something like that. Could this actually help the play somehow? Maybe could be used for move ordering in alpha-beta. ~drummyfish }
|
||||
|
||||
|
|
|
|||
|
|
@ -6,6 +6,8 @@ The term *low poly* (also low-poly or lowpoly) is used for polygonal [3D models]
|
|||
|
||||
The exact threshold on polygon count from which we call a model low poly can't be objectively set because firstly there's a subjective judgment at play and secondly such threshold depends on the ideal shape we're approximating. This means that not every model with low polygon count is low poly: if a shape, for example a [cube](cube.md), can simply be created with low number of polygons without it causing a distortion of the shape, it shouldn't be called low poly. And similarly a model with high polygon count can still be classified as low poly if even the high number of polygons still causes a significant distortion of the shape. However let's say that if it has more than 300 triangles it's quite likely not low poly.
|
||||
|
||||
Someone on the [Internet](internet.md) once suggested the "rule of 256" as a good rule of the thumb: a low-poly model should consist of at most 256 vertices, 256 triangles and should use only one texture with resolution 256x256 and 256 [colors](color.md).
|
||||
|
||||
The original purpose of creating low poly models was to improve performance, or rather to make it even possible to render something in the era of early [computer graphics](graphics.md). Low poly models take less space in memory and on good, non-capitalist computers render faster. As computers became able to render more and more polygons, low poly models became more and more unnecessary and eventually ended up just as a form of **"retro" art style** -- many people still have nostalgia for [PS1](ps1.md) graphics with very low poly models and new games sometimes try to mimic this look. In the world of capitalist consoomer computing/[gayming](game.md) nowadays no one really cares about saving polygons on models because "[modern](modern.md)" [GPUs](gpu.md) aren't really affected by polygon count anymore, everyone just uses models with billions of polygons even for things that no one ever sees, soydevs don't care anymore about the art of carefully crafting models on a low polygon budget. However in the context of [good, non-capitalist technology](lrs.md) low poly models are still very important.
|
||||
|
||||
Low poly models are intended to be used in interactive/[real-time](real_time.md) [graphics](graphics.md) while high poly ones are for the use in offline (non-realtime) rendering. Sometimes (typically in games) a model is made in both a low poly and high poly version: the low poly version is used during gameplay, the high poly version is used in cutscenes. Sometimes even more than two versions of models are made, see [level of detail](lod.md).
|
||||
|
|
|
|||
|
|
@ -56,6 +56,7 @@
|
|||
| Immanuel Kant | Immanuel Cunt, Immanuel Can't (sorry, just too obvious :D) |
|
||||
| influencer | manipulator |
|
||||
| [Intel](intel.md) | [Incel](incel.md) |
|
||||
| [interactive](interactivity.md) | hyperactive |
|
||||
| [Internet Explorer](internet_explorer.md) | Internet Exploder, Internet Exploiter |
|
||||
| [Internet of things](iot.md) | Internet of stinks/stings |
|
||||
| [iPad](ipda.md) | iBad |
|
||||
|
|
|
|||
3
main.md
3
main.md
File diff suppressed because one or more lines are too long
|
|
@ -1,10 +1,38 @@
|
|||
# Netstalking
|
||||
|
||||
Netstalking means searching for obscure, hard-to-find and somehow valuable (even if only by its entertaining nature) information buried in the depths of the [Internet](internet.md) (and similar networks), for example searching for funny photos on Google Streetview (https://9-eyes.com/), unindexed [deepweb](deepweb.md) sites or secret documents on [FTP](ftp.md) servers. Netstalking is relatively unknown in the English-speaking world but is pretty popular in Russian communities.
|
||||
Netstalking means searching for obscure, hard-to-find and somehow valuable (even if only by its entertaining nature) [information](information.md)/media buried in the depths of the [Internet](internet.md) (and similar networks), for example searching for funny photos on Google Streetview (https://9-eyes.com/), unindexed [deepweb](deepweb.md) sites or secret documents on [FTP](ftp.md) servers. Netstalking is relatively unknown in the [English](english.md)-speaking world but is pretty popular in Russian communities, although since the beginning of 2020s the general interest in obscure and esoteric material on the Internet seems to have been steadily rising among all inhabitants of the world wide network, perhaps due to other phenomena such as increasing [censorship](censorship.md) (and the desire to bypass it), the "web 1.0 revival" movement etc.
|
||||
|
||||
Netstalking can be divided into two categories:
|
||||
|
||||
- **deli-search** (deliberate search): trying to find a specific information, e.g. a specific video that got lost.
|
||||
- **net-random**: randomly searching for interesting information in places where it is likely to be found.
|
||||
|
||||
Techniques of netstalking include port scanning, randomly generating web domains, using advanced search queries and different [search engines](search_engine.md), searching caches and archives and obscure networks such as [darknet](darknet.md) or [gopher](gopher.md).
|
||||
Techniques of netstalking include port scanning, randomly generating web domains, using advanced search queries and different [search engines](search_engine.md), searching caches and archives and obscure networks such as [darknet](darknet.md) or [gopher](gopher.md).
|
||||
|
||||
## Pro Tips On Finding Obscure Stuff
|
||||
|
||||
- **Use many different search engines.** Make a list of as many engines as you can collect. Mainstream ones ([Google](google.md), Duckduckgo, Bing, Yahoo, Yandex, ...) have huge indices and together cover a large portion of the web, but they're also very [censored](censorship.md), biased and crippled by [SEO](seo.md) competition and AI noise. Meta search engines, like Searx, may help with using many engines at once as well as with discovering new engines (take a look at their settings). Good thing is that engines located in different countries likely censor different stuff, so Google won't find pro-Russian propaganda and Yandex won't find anti-Russian one, so combining them effectively removes this kind of censorship. Without a question you also HAVE TO use smaller, non-commercial and more specialized engines such as [wiby](wiby.md), Marginalia, [Yacy](yacy.md), right dao etc. These are typically less censored (little incentive and/or resources to invest into highly sophisticated censorship), less SEO-infested, usually focused more on the type of material you're after (underground, non-commercial, [small web](smol_internet.md)) and often even offer more advanced features (backlinks, advanced filtering, sometimes even downloading the whole index). Also use specialized search engines, e.g. FTP search engines, PDF search engines, reverse image search engines (Google, tineye, ...) etc. Curated lists of websites, such as Curlie, are also worth giving a try.
|
||||
- **Know and use advanced search engine options and [hacks](hacking.md).** Ordinarily even mainstream engines support special key phrases that can be inserted into the search query to narrow down the search -- these are crucial for finding real hidden stuff. Sometimes engines even have undocumented options, try to find them (guessing, finding unofficial documentation). Options that typically work in search engines include:
|
||||
- `"exact phrase"`: Searches only for a verbatim string, very useful e.g. for searching exact filenames and exploiting tricks such as for example searching a long phrase from a publicly inaccessible book to find websites that in fact have such books publicly accessible. Another trick is to search for something like `"powered by gitea"` (or whatever framework) or `"index of"` (common heading of plain file lists) -- this can find small and unadvertised sites running on popular [frameworks](framework.md).
|
||||
- `before:year`: Limits the search to sites/files published before given year. This is amazingly useful as nowadays everything is just flooded by [AI](ai.md) garbage and commercial, censored [noise](noise.md). Adding `before:2010` just takes you back to the old world where Internet actually contained useful information, where schools for instance weren't afraid to list names of all pupils in each class along with photos, names of their teachers and so on.
|
||||
- `filetype:type`: Searches only for files of given type. Again, this is very abusable -- you may for example search for Excel spreadsheets (`filetype:xls`), [JSON](json.md) or [CSV](csv.md) databases and so on -- there are tons and tons of sheets with personal information of company employees, taxes and various other sensitive stuff. Searching for MS Word or PowerPoint documents finds files created by people who aren't very skilled with computers and will very likely post some crazy [shit](shit.md) :-) If you're feeling lucky, try to search databases of passwords in plain text.
|
||||
- **Search non-web networks.** Web is very much controlled and polices now, but other networks are either designed to be uncontrollable and/or are so underground that no one cares to "[moderate](moderation.md)" it. These networks include for example [Tor](tor.md), [I2P](i2p.md), [Freenet](freenet.md), [gopher](gopher.md), [gemini](gemini.md), [WAP](wap.md), [FTP](ftp.md), [Usenet](usenet.md), Guifi (and other wifi networks), [torrents](torrent.md), etc. Also try to search [IRC](irc.md) chat logs and whatever.
|
||||
- **Search ban lists ("blacklists", "blocklists", "isolation lists", ...).** A trick to finding censored material is to look for a list of the censored stuff -- [FOSS](foss.md) projects (like [Fediverse](fediverse.md)) typically have such lists publicly available as part of their "openness and collaboration".
|
||||
- **Look for OSINT tools.** OSINT means "open source intelligence", basically digging out info from publicly available sources. This leads to finding amazing tools, for example there exists an AI-powered face search engine that takes a photo of a face and returns images from all over the Internet where that face appears. Works like a charm.
|
||||
- **Reverse search for obscure/shady/topic related material.** Another cool trick to finding weird sites, or ones related to a very specific topic, is to look for sites that link to already known weird/banned/obscure/topic related stuff. For example searching for sites that link to [Encyclopedia Dramatica](dramatica.md) brings up a promising list of places to check out when looking for uncensored, [SJW](sjw.md)-free places. Similarly you can search for sites that use forbidden words ([nigger](nigger.md), [faggot](faggot.md), ...), images (goatse, gore, FACES of CP stars, ...), very niche terms (e.g. [bitreich](bitreich.md)), "legally problematic" stuff (leaked photos, shooter manifestos, ...) etc.
|
||||
- **Search in other [languages](human_language.md).** If you're not a native English speaker, you probably know that your country's web contains some cool stuff that's missing from the English web. Due to many factors such as [cultural](culture.md) differences and different political interests (i.e. kinds of censorship and propaganda) some tidbit of trivia will only be found on non-English sites -- Russian, Spanish, Chinese and Japanese websites are a whole new world. Machine translate of the sites is often more than enough to understand the text.
|
||||
- **Search archives.** The Internet Archive is the giant among archives that must always be checked, but don't forget smaller ones either, like archive.li, [Usenet](usenet.md) archives, [4chan](4chan.md) archives etc. You'll be able to find stuff that's now gone from the Internet and/or got hidden.
|
||||
- **Guess randomly.** It can even be an entertaining pastime to play a lottery, randomly digging and seeing what you find. For example you can type random domains or IP addresses in your URL bar: `nigger.com`, `hitler.il`, `weirdporn.xyz` or whatever. One can even quite effortlessly bash together a script to automatically check millions of such domains. This has a chance of discovering something that would be otherwise unfindable because it's not linked to from anywhere on the indexed web.
|
||||
- **Manually search unindexable material**. A lot of information is out there but search engines don't know about it because it's not in plaintext format or it's hiding behind a login or captcha wall or whatever. Plenty of stuff is hidden in scanned PDF books, videos, compressed archives, spoken audio etc. Hence when you're searching manually, try to go to places where search engines are less likely to get.
|
||||
- **Write own tools.** Today you no longer have to possess a [PhD](phd.md) (or even brain) to write a simple web scraping script. Custom tools can take you beyond what search engines can (and are willing to) do for you -- for example search engines typically can't search for [regular expressions](regexp.md), but your own crawler can. Your own tool is 100% tailored to your needs, it can behave in exact ways you want (ignore robots.txt, use your credentials to bypass login walls, follow very specific trails, you can even use [OCR](ocr.md) to extract text from images etc.). Like said above, a simple tool is for example one that randomly checks various combinations of words and TLDs to discover curious domain names. Writing a simple crawler is also pretty easy, provided you [keep it very simple](kiss.md) -- exploit existing tools like wget or curl to download pages and extract everything that looks like URL, no need to parse [HTML](html.md) or whatever, literally treat everything as plain text. Then you can extract only documents that are somehow "[interesting](interesting.md)", for example containing specific keywords, not containing JavaScript tags etc.
|
||||
- **Find lists of obscure sites and other people who search for them.** A sizable number of small sites now like to post links to other interesting sites, it's enough to find one and then you just start following the links, you find more links etc. This can never end. Some communities like to share lulzy links, e.g. [4chan](4chan.md), kiwifarms, ... Don't forget to contribute back and publish the list of your findings too ;)
|
||||
- **Analyze data.** There are tons of publicly accessible, but yet undigested data about the web -- for example Internet Archive's crawl data, [WikiData](wikidata.md), the Yacy index and so on. You may try your luck sniffing here.
|
||||
- **Be reasonably careful.** Normies get scared shitless to even peek on the darkweb, which is completely ridiculous, just looking and searching publicly available data is practically always 100% legal and even if it wasn't, literally no one gives a single shit. However you might get into trouble if you'd for example reverse search literal child porn, as you're uploading the stuff to someone's server and thus technically distributing CP, putting the server owner in trouble. Still not much would happen probably, maybe you'd get blocked, but you're gonna get yourself on the FBI list. Just use your brain. As long as you're not stepping on someone's toe (doxxing, DDOSing, spamming, ...), no one cares what you're doing.
|
||||
- ...
|
||||
|
||||
## See Also
|
||||
|
||||
- [www](www.md)
|
||||
- [Internet](internet.md)
|
||||
- [smol internet](smol_internet.md)
|
||||
|
||||
|
|
|
|||
91
number.md
91
number.md
|
|
@ -228,73 +228,83 @@ Here is a table of some numbers and "number like objects" worthy of mention, mos
|
|||
| one half | 0.5 | 2^-1 | |
|
||||
| one over square root of two | 0.707106... | 1/sqrt(2), sin(pi/4), cos(pi/4), 2^(-1/2)| |
|
||||
| [one](one.md) | 1 |2^0, 0!, 0.999..., sqrt(1), I, 0b1, cos(0)| NOT a prime, unit, multiplicative identity |
|
||||
| [square root](sqrt.md) of two | 1.414213... | sqrt(2), 2^(1/2) | irrational, diagonal of unit square, important in geom. |
|
||||
| [square root](sqrt.md) of two | 1.414213... | sqrt(2), 2^(1/2), 0b1.0110101 | irrational, diagonal of unit square, important in geom. |
|
||||
| supergolden ratio | 1.465571... | solve(x^3 - x^2 - 1 = 0) | similar to golden ratio, bit more difficult to compute |
|
||||
|phi ([golden ratio](golden_ratio.md))| 1.618033... | (1 + sqrt(5)) / 2, solve(x^2 - x - 1 = 0)| irrational, visually pleasant ratio, divine proportion |
|
||||
| square root of three | 1.732050... | sqrt(3), 3^(1/2) | irrational |
|
||||
| square root of three | 1.732050... | sqrt(3), 3^(1/2), 0b1.1011101 | irrational |
|
||||
| [two](two.md) | 2 | 2^1, 2!, 2!!, 0b000010, II, 0b10 | (only even) prime, base of [binary](binary.md) system |
|
||||
| [silver ratio](silver_ratio.md) | 2.414213... | 1 + sqrt(2), solve(x^2 - 2 * x - 1 = 0) | similar to golden ratio |
|
||||
| [e](e.md) (Euler's number) | 2.718281... | | base of natural [logarithm](log.md) |
|
||||
| [three](three.md) | 3 | 2^2 - 1, III, Ob11 | prime, max. number on 2 bits, regular plane tilings |
|
||||
| [pi](pi.md) | 3.141592... | 2 * asin(1) | circle circumference to its diameter, irrational |
|
||||
| [e](e.md) (Euler's number) | 2.718281... | 0b10.1011011 | base of natural [logarithm](log.md) |
|
||||
| [three](three.md) | 3 | 2^2 - 1, III, Ob11, 2^1.584... | prime, max. number on 2 bits, regular plane tilings |
|
||||
| [pi](pi.md) | 3.141592... | 2 * asin(1), 0b11.0010010 | circle circumference to its diameter, irrational |
|
||||
| [four](four.md) | 4 | 2^2, 0b000100, IV, 0b100 |first composite number, min. needed to color planar graph|
|
||||
| [five](five.md) | 5 | 3^2 - 2^2, V, 0b101 | (twin) prime, number of platonic solids |
|
||||
| [five](five.md) | 5 | 3^2 - 2^2, V, 0b101, fib(5) | (twin, triplet) prime, number of platonic solids, Fib. |
|
||||
| [six](six.md) | 6 | 3!, 1 * 2 * 3, 1 + 2 + 3, VI, 0b110 | highly composite number, perfect number |
|
||||
| [tau](tau.md) | 6.283185... | 2 * pi | radians in full circle, defined mostly for convenience |
|
||||
| [tau](tau.md) | 6.283185... | 2 * pi, 360 degrees | radians in full circle, defined mostly for convenience |
|
||||
| [thrembo](thrembo.md) | ??? | | the hidden number |
|
||||
| [seven](seven.md) | 7 | 2^3 - 1, VII, 0b111 |(twin) prime, days in week, max. unsigned n. with 3 bits |
|
||||
| [eight](eight.md) | 8 | 2^3, 0b001000, VIII, 0b1000 | base of [octal](oct.md) system |
|
||||
| [eight](eight.md) | 8 | 2^3, 0b001000, VIII, 0b1000, fib(6) | base of [octal](oct.md) system, 7th Fibonacci number |
|
||||
| [nine](nine.md) | 9 | 3^3, 1^3 + 2^3, sqrt(81), IX, 0b1001 | |
|
||||
| [ten](ten.md) | 10 | 10^1, 1 + 2 + 3 + 4, X, 0b1010 | your IQ? :D base of our decimal system |
|
||||
| eleven | 11 | XI, 0b1011 | palindromic prime |
|
||||
| [ten](ten.md) | 10 |10^1, 1 + 2 + 3 + 4, X, 0b1010, 2^3.321...| your IQ? :D base of our decimal system |
|
||||
| eleven | 11 | XI, 0b1011 | palindromic twin prime |
|
||||
| twelve, dozen | 12 | 2 * 2 * 3, XII, 0b1100 | highly composite number |
|
||||
| thirteen | 13 | fib(7), XIII, 0b1101 | prime considered unlucky (in west and China), Fib. num. |
|
||||
| fourteen | 14 | XIV, 0b1110 | |
|
||||
| fifteen | 15 | 2^4 - 1, 0b1111, 0x0f, 1 + 2 + 3 + 4 + 5 | maximum unsigned number storable with 4 bits |
|
||||
| [sixteen](sixteen.md) | 16 | 2^4, 2^2^2, 0b010000, 0x10, XVI | base of [hexadecimal](hex.md) system |
|
||||
| twenty one | 21 | BB(3), XXI | maximum number of 1s produced by 3 state Turing Machine |
|
||||
| [sixteen](sixteen.md) | 16 | 2^4, 4^2, 2^2^2, 0b010000, 0x10, XVI | base of [hexadecimal](hex.md) system |
|
||||
| seventeen | 17 | 0b10001, 0x11, XVII | twin&sexy prime, binary palindrome |
|
||||
| eighteen | 18 | 0b10010, 0x12, XVIII | |
|
||||
| nineteen | 19 | 0b10011, 0x13, XIX | twin&sexy prime |
|
||||
| twenty | 20 | 0b10100, 0x14, XX | |
|
||||
| twenty one | 21 | 0b10101, 0x15, BB(3), fib(8), 0x15, XXI | maximum number of 1s produced by 3 state Turing Machine |
|
||||
| twenty four | 24 | 2 * 2 * 2 * 3, 4!, XXIV |highly composite number, possible ways to order 4 objects|
|
||||
| twenty five | 25 | 5^2, sqrt(625), XXV | |
|
||||
| thirty one | 31 | 2^5 - 1, 0b11111, 0x1f, XXXI |max. unsigned number storable with 5 bits, Mersenne prime|
|
||||
| [thirty two](thirty_two.md) | 32 | 2^5, 0b100000, 0x20, XXXII | number of possible values storable with 5 bits |
|
||||
| thirty three | 33 | 1! + 2! + 3! + 4!, XXXIII | |
|
||||
| thirty four | 34 | fib(9), 0x22, XXXIV | Fibonacci number |
|
||||
| thirty six | 36 | 2 * 2 * 3 * 3, XXXVI | highly composite number |
|
||||
| thirty seven | 37 | XXXVII | most commonly chosen 1 to 100 "random" number |
|
||||
| [forty two](42.md) | 42 | XLII | cringe number, answer to some stuff |
|
||||
| thirty seven | 37 | 0b100101, 0x25, XXXVII | most commonly picked 1 to 100 "random", permutable prime|
|
||||
| [forty two](42.md) | 42 | XLII | cringe number, answer to some stuff, unlucky in Japan |
|
||||
| forty eight | 48 |2^5 + 2^4, 2 * 2 * 2 * 2 * 3, XLVIII, 0x30| highly composite number |
|
||||
| forty nine | 49 | 7^2 | |
|
||||
| fifty | 50 | L | |
|
||||
| fifty five | 55 | 1 + 2 + ... + 10, LV | sum of numbers up to 10 |
|
||||
| fifty five | 55 | fib(10), 1 + 2 + ... + 10, LV | sum of numbers up to 10, 11th Fibonacci number |
|
||||
| sixty | 60 | 0x3c, LX | highly composite number, used in time measuring |
|
||||
| sixty three | 63 | 2^6 - 1, LXIII | maximum unsigned number storable with 6 bits |
|
||||
| [sixty four](sixty_four.md) | 64 | 2^6, LXIV, 0x40 | number of squares on a chess board |
|
||||
| [sixty nine](69.md) | 69 | LXIX | sexual position |
|
||||
| eighty one | 81 | 3^4, 9*9, XXCI | |
|
||||
| eighty nine | 89 | fib(11), 0x59, LXXXIX | Fibonacci number |
|
||||
| ninety six | 96 | 2^5 + 2^6, 5! - 4!, 0x60 | alternative sexual position |
|
||||
| one hundred | 100 | 10^2, 0x64, C | |
|
||||
| one hundred seven | 107 | BB(4) | maximum number of 1s produced by 4 state Turing machine |
|
||||
| one hundred twenty | 120 | 5!, C(10,3), CXX | possible ways to order 5 objects |
|
||||
| one hundred | 100 | 10^2, 0x64, C, 2^6.643... | |
|
||||
| one hundred seven | 107 | BB(4), CVII | maximum number of 1s produced by 4 state Turing machine |
|
||||
| one hundred twenty | 120 | 5!, C(10,3), CXX | possible ways to order 5 objects, highly composite |
|
||||
| one hundred twenty one | 121 | 11^2, CXXI | [palindromic](palindrome.md) |
|
||||
| one hundred twenty five | 125 | 5^3, CXXV | |
|
||||
| one hundred twenty seven | 127 | 2^7 - 1, 0x7f, 0b01111111, CXXVII | maximum value of signed byte, Mersenne prime |
|
||||
| one hundred twenty eight | 128 | 2^7, 0x80, 0b10000000, CXXVIII | |
|
||||
| one hundred forty four | 144 | 12^2, CXLIV | |
|
||||
| one hundred twenty eight | 128 | 2^7, 0x80, CXXVIII, 10^2.107... | |
|
||||
| one hundred forty four | 144 | 12^2, fib(12), CXLIV | 13th Fibonacci number |
|
||||
| one hundred sixty eight | 168 | 24 * 7, CLXVIII | hours in week |
|
||||
| two hundred forty three | 243 | 3^5, CCXLIII | |
|
||||
| two hundred fifty five | 255 | 2^8 - 1, 0xff, 0b11111111, CCLV | maximum value of unsigned [byte](byte.md) |
|
||||
| two hundred fifty six | 256 | 2^8, 16^2, 0x100, ((2^2)^2)^2, CCLVI | number of values that can be stored in one byte |
|
||||
| three hundred forty three | 343 | 7^3, CCCXLIII | |
|
||||
| two hundred forty three | 243 | 3^5, 0xf3, CCXLIII | |
|
||||
| two hundred fifty five | 255 | 2^8 - 1, 0xff, 0b11111111, CCLV |maximum value of unsigned [byte](byte.md), hex palindrome|
|
||||
| two hundred fifty six | 256 | 2^8, 4^4, 16^2, 0x100, ((2^2)^2)^2, CCLVI| number of values that can be stored in one byte |
|
||||
| three hundred forty three | 343 | 7^3, CCCXLIII | palindrome |
|
||||
| three hundred sixty | 360 | 2 * 2 * 2 * 3 * 3 * 5, CCCLX | highly composite number, degrees in full circle |
|
||||
| three hundred sixty five | 365 | CCCLXV | days in a year |
|
||||
| four hundred twenty | 420 | CDXX | stoner shit (they smoke it at 4:20), divisible by 1 to 7|
|
||||
| three hundred sixty five | 365 | 0x16d, CCCLXV | days in a year, binary palindrome |
|
||||
| four hundred twenty | 420 | 0x1a4, CDXX | stoner shit (they smoke it at 4:20), divisible by 1 to 7|
|
||||
| five hundred eleven | 511 | 2^9 - 1, DXI | largest number storable with 9 bits |
|
||||
| five hundred twelve | 512 | 2^9, 2^(3^2), DXII | number of values storable with 9 bits |
|
||||
| six hundred twenty five | 625 | 25^2, 5^4, DCXXV | |
|
||||
| six hundred and sixty six | 666 | DCLXVI | number of the beast, palindromic |
|
||||
| seven hundred twenty | 720 | 6!, 3!!, DCCXX | possible ways to order 6 objects |
|
||||
| six hundred and sixty six | 666 | 0x29a, DCLXVI | number of the beast, palindromic |
|
||||
| seven hundred twenty | 720 | 6!, 3!!, DCCXX | possible ways to order 6 objects, highly composite |
|
||||
| seven hundred twenty nine | 729 | 3^6, (3^2)^3, DCCXXIX | |
|
||||
| one thousand | 1000 | 10^3, M, 0x3e8 | |
|
||||
| one thousand | 1000 | 10^3, M, 0x3e8, 2^9.965... | |
|
||||
| one thousand twenty three | 1023 | 2^10 - 1, 0x3ff, MXXIII | largest number storable with 10 bits |
|
||||
| one thousand twenty four | 1024 | 2^10, 0x400, MXXIV | number of values storable with 10 bits |
|
||||
| one thousand twenty four | 1024 | 2^10, 4^5, 0x400, MXXIV, 10^3.010... | number of values storable with 10 bits |
|
||||
| one thousand six hundred eighty | 1680 | 0x690, MDCLXXX | highly composite, often used as horizontal resolution |
|
||||
| two thousand forty eight | 2048 | 2^11, 0x800, MMXLVIII | number of values storable with 11 bits |
|
||||
|two thousand one hundred eighty seven| 2187 | 3^7, MMCXXCVII | |
|
||||
|two thousand one hundred eighty seven| 2187 | 3^7, 0x88b, MMCLXXXVII | |
|
||||
| two thousand four hundred one | 2401 | 7^4, MMCDI | |
|
||||
| three thousand one hundred ... | 3125 | 5^5, MMMCXXV | |
|
||||
| three thousand nine hundred ... | 3999 | MMMCMXCIX | largest number that can be written with Roman numerals |
|
||||
|
|
@ -302,23 +312,24 @@ Here is a table of some numbers and "number like objects" worthy of mention, mos
|
|||
| five thousand forty | 5040 | 7!, 1 * 2 * ... * 7 | possible ways to order 7 objects |
|
||||
| five thousand fifty | 5050 | 1 + 2 + ... + 100 | sum of numbers up to 100 |
|
||||
| six thousand five hundred sixty one | 6561 | 3^8, 3^(2^3) | |
|
||||
| ten thousand | 10000 | 10^4, 100^2 | |
|
||||
| fifteen thousand six hundred ... | 15625 | 5^6 | |
|
||||
| sixteen thousand eight hundred ... | 16807 | 7^5 | |
|
||||
| nineteen thousand six hundred ... | 19683 | 3^9, 3^(3^3) | |
|
||||
|six thousand seven hundred sixty five| 6765 | fib(20), 0x1a6d | Fibonacci number |
|
||||
| ten thousand | 10000 | 10^4, 100^2, 2^13.287... | |
|
||||
| fifteen thousand six hundred ... | 15625 | 5^6, 0x3d09 | |
|
||||
| sixteen thousand eight hundred ... | 16807 | 7^5, 0x41a7 | |
|
||||
| nineteen thousand six hundred ... | 19683 | 3^9, 3^(3^3), 0x4ce3 | |
|
||||
|thirty two thousand seven hundred ...| 32767 | 2^16 / 2 - 1, 0x7fff | maximum two's complement signed 16 bit number |
|
||||
| forty thousand three hundred twenty | 40320 | 8!, 1 * 2 * ... * 8 | possible ways to order 8 objects |
|
||||
| ... (enough lol) | 59049 | 3^10 | |
|
||||
| forty thousand three hundred twenty | 40320 | 8!, 1 * 2 * ... * 8, 0x9d80 | possible ways to order 8 objects |
|
||||
| ... (enough lol) | 59049 | 3^10, 0xe6a9 | |
|
||||
| | 65504 | | largest number storable in IEEE-754 16 bit float |
|
||||
| | 65535 | 2^16 - 1, 0xffff | maximum unsigned number storable with 16 bits |
|
||||
| | 65536 | 2^16, 256^2, 0x10000, 2^(2^(2^2)) | number of values storable with 16 bits |
|
||||
| | 72078 | | number of possible chess positions after 4 half moves |
|
||||
| | 80085 | | looks like BOOBS |
|
||||
| | 86400 | 60 * 60 * 24 | seconds in a day |
|
||||
| hundred thousand | 100000 | 10^5 | |
|
||||
| hundred thousand | 100000 | 10^5, 2^16.609... | |
|
||||
| | 362880 | 9!, 1 * 2 * ... * 9 | possible ways to order 9 objects |
|
||||
| | 500500 | 1 + 2 + ... + 1000 | sum of numbers up to 1000 |
|
||||
| one [million](million.md) | 1000000 | 10^6 | |
|
||||
| one [million](million.md) | 1000000 | 10^6, 0xf4240, 2^19.931... | |
|
||||
| | 3197281 | | number of possible chess games after 4 half moves |
|
||||
| | 3628800 | 10!, 1 * 2 * ... * 10 | possible ways to order 10 objects |
|
||||
| | 16777216 | 2^24, 16^6, 0xffffff | number of distinct 24 bit values (e.g. RGB24 colors) |
|
||||
|
|
@ -327,7 +338,7 @@ Here is a table of some numbers and "number like objects" worthy of mention, mos
|
|||
| | 31556926 | | seconds in a year |
|
||||
| | 39916800 | 11!, 1 * 2 * ... * 11 | possible ways to order 11 objects |
|
||||
| | 479001600 | 12!, 1 * 2 * ... * 12 | possible ways to order 12 objects |
|
||||
| one [billion](billion.md) | 1000000000 | 10^9, milliard | |
|
||||
| one [billion](billion.md) | 1000000000 | 10^9, milliard, 0x3b9aca00, 2^29.897... | |
|
||||
| | 2147483647 | 2^32 / 2 - 1 | maximum two's complement signed 32 bit number |
|
||||
| | 3735928559 | 0xdeadbeef | one of famous hexadeciaml constants, spells out DEADBEEF|
|
||||
| | 4294967295 | 2^32 - 1, 0xffffffff | maximum unsigned number storable with 32 bits |
|
||||
|
|
|
|||
2
prime.md
2
prime.md
|
|
@ -18,7 +18,7 @@ The unique factorization can also nicely be used to encode [multisets](multiset.
|
|||
|
||||
When in 1974 the Arecibo radio message was sent to space to carry a message for [aliens](alien.md), the resolution of the bitmap image it carried was chosen to be 73 x 23 pixels -- two primes. This was cleverly done so that when aliens receive the 1679 sequential values, there are only two possible ways to interpret them as a 2D bitmap image: 23 x 73 (incorrect) and 73 x 23 (correct). This increased the probability of correct interpretation against the case of sending an arbitrary resolution image.
|
||||
|
||||
**There are infinitely many prime numbers**. The proof is quite elementary (shown below), however it's pretty fascinating that it has still not been proven whether there are infinitely many **[twin primes](twin_prime.md) (primes that differ by 2)**, which, despite its similarity to the former problem, shows to be an incomparably more difficult question to answer. Another simple but unproven conjecture related to prime numbers is [Goldbach's conjecture](goldbachs_conjecture.md) stating that every even number greater than 2 can be written as a sum of two primes.
|
||||
**There are infinitely many prime numbers**. The proof is quite elementary (shown below), however it's pretty fascinating that it has still not been proven whether there are infinitely many **[twin primes](twin_prime.md) (primes that differ by 2)**, which, despite its similarity to the former problem, shows to be an incomparably more difficult question to answer. The concept of twin primes can be extended to prime triplets (3 primes having a gap of 2 and 4, in either order), prime cousins (primes spaced by 4), sexy primes (primes spaced by 6) and eventually generalized to so called prime *k-tuples*: tuples describing prime patterns with offsets, e.g. [0, 2, 6] specifies one possible form of a prime triplet etc. Another simple but unproven conjecture related to prime numbers is [Goldbach's conjecture](goldbachs_conjecture.md) stating that every even number greater than 2 can be written as a sum of two primes.
|
||||
|
||||
Euklid's [proof](proof.md) shows there are infinitely many primes, it is conducted by contradiction and goes as follows: suppose there are finitely many primes *p1*, *p2*, ... *pn*. Now let's consider a number *s* = *p1* * *p2* * ... * *pn* + 1. This means *s* - 1 is divisible by each prime *p1*, *p2*, ... *pn*, but *s* itself is not divisible by any of them (as it is just 1 greater than *s* and multiples of some number *q* greater than 1 have to be spaced by *q*, i.e. more than 1). If *s* isn't divisible by any of the considered primes, it itself has to be a prime. However that is in contradiction with the original assumption that *p1*, *p2*, ... *pn* are all existing primes. Therefore a finite list of primes cannot exist, there have to be infinitely many of them.
|
||||
|
||||
|
|
|
|||
3764
random_page.md
3764
random_page.md
File diff suppressed because it is too large
Load diff
|
|
@ -10,6 +10,7 @@ What EXACTLY constitutes the Smol Internet? Of course we don't really have exact
|
|||
|
||||
- [web 1.0](web_10.md)
|
||||
- [web 0.5](web_05.md)
|
||||
- [netstalking](netstalking.md)
|
||||
- [Fediverse](fediverse.md)
|
||||
- [tildeverse](tildeverse.md)
|
||||
- [Usenet](usenet.md)
|
||||
|
|
|
|||
File diff suppressed because one or more lines are too long
|
|
@ -3,9 +3,9 @@
|
|||
This is an autogenerated article holding stats about this wiki.
|
||||
|
||||
- number of articles: 638
|
||||
- number of commits: 1012
|
||||
- total size of all texts in bytes: 5398270
|
||||
- total number of lines of article texts: 39031
|
||||
- number of commits: 1013
|
||||
- total size of all texts in bytes: 5414718
|
||||
- total number of lines of article texts: 39117
|
||||
- number of script lines: 324
|
||||
- occurrences of the word "person": 10
|
||||
- occurrences of the word "nigger": 139
|
||||
|
|
@ -19,12 +19,12 @@ longest articles:
|
|||
- [capitalism](capitalism.md): 76K
|
||||
- [faq](faq.md): 76K
|
||||
- [less_retarded_society](less_retarded_society.md): 72K
|
||||
- [number](number.md): 68K
|
||||
- [3d_rendering](3d_rendering.md): 56K
|
||||
- [number](number.md): 52K
|
||||
- [woman](woman.md): 48K
|
||||
- [main](main.md): 48K
|
||||
- [programming_language](programming_language.md): 48K
|
||||
- [c](c.md): 44K
|
||||
- [programming_language](programming_language.md): 44K
|
||||
- [human_language](human_language.md): 44K
|
||||
- [3d_model](3d_model.md): 44K
|
||||
- [internet](internet.md): 44K
|
||||
|
|
@ -35,60 +35,72 @@ longest articles:
|
|||
|
||||
top 50 5+ letter words:
|
||||
|
||||
- which (2936)
|
||||
- there (2306)
|
||||
- people (2201)
|
||||
- example (1876)
|
||||
- other (1669)
|
||||
- which (2937)
|
||||
- there (2307)
|
||||
- people (2203)
|
||||
- example (1877)
|
||||
- other (1672)
|
||||
- about (1502)
|
||||
- number (1365)
|
||||
- number (1404)
|
||||
- software (1315)
|
||||
- because (1231)
|
||||
- their (1158)
|
||||
- would (1115)
|
||||
- something (1112)
|
||||
- being (1093)
|
||||
- program (1075)
|
||||
- language (1016)
|
||||
- called (991)
|
||||
- program (1078)
|
||||
- language (1018)
|
||||
- called (990)
|
||||
- things (948)
|
||||
- without (913)
|
||||
- without (914)
|
||||
- simple (889)
|
||||
- function (881)
|
||||
- computer (862)
|
||||
- numbers (851)
|
||||
- computer (863)
|
||||
- numbers (856)
|
||||
- different (832)
|
||||
- these (802)
|
||||
- programming (800)
|
||||
- however (798)
|
||||
- these (803)
|
||||
- programming (803)
|
||||
- however (799)
|
||||
- world (795)
|
||||
- should (774)
|
||||
- system (766)
|
||||
- system (771)
|
||||
- still (756)
|
||||
- doesn (746)
|
||||
- games (724)
|
||||
- games (728)
|
||||
- possible (712)
|
||||
- drummyfish (703)
|
||||
- point (698)
|
||||
- always (692)
|
||||
- while (691)
|
||||
- society (690)
|
||||
- possible (686)
|
||||
- probably (678)
|
||||
- simply (673)
|
||||
- using (659)
|
||||
- https (640)
|
||||
- https (642)
|
||||
- course (635)
|
||||
- similar (624)
|
||||
- similar (625)
|
||||
- actually (622)
|
||||
- someone (613)
|
||||
- first (599)
|
||||
- value (597)
|
||||
- value (601)
|
||||
- first (601)
|
||||
- though (595)
|
||||
- really (583)
|
||||
|
||||
latest changes:
|
||||
|
||||
```
|
||||
Date: Wed Apr 30 00:58:00 2025 +0200
|
||||
exercises.md
|
||||
less_retarded_society.md
|
||||
main.md
|
||||
number.md
|
||||
often_confused.md
|
||||
palette.md
|
||||
programming_language.md
|
||||
random_page.md
|
||||
science.md
|
||||
wiki_pages.md
|
||||
wiki_stats.md
|
||||
Date: Sun Apr 27 03:32:20 2025 +0200
|
||||
acronym.md
|
||||
anarchism.md
|
||||
|
|
@ -113,21 +125,6 @@ Date: Sun Apr 27 03:32:20 2025 +0200
|
|||
wiki_stats.md
|
||||
wikidata.md
|
||||
woman.md
|
||||
Date: Tue Apr 22 21:55:26 2025 +0200
|
||||
abstraction.md
|
||||
acronym.md
|
||||
anarch.md
|
||||
approximation.md
|
||||
avpd.md
|
||||
compsci.md
|
||||
computer.md
|
||||
doom.md
|
||||
drummyfish.md
|
||||
duke3d.md
|
||||
e.md
|
||||
earth.md
|
||||
egoism.md
|
||||
encryption.md
|
||||
```
|
||||
|
||||
most wanted pages:
|
||||
|
|
@ -138,9 +135,9 @@ most wanted pages:
|
|||
- [meme](meme.md) (13)
|
||||
- [embedded](embedded.md) (13)
|
||||
- [cli](cli.md) (12)
|
||||
- [buddhism](buddhism.md) (12)
|
||||
- [emacs](emacs.md) (11)
|
||||
- [complex_number](complex_number.md) (11)
|
||||
- [buddhism](buddhism.md) (11)
|
||||
- [array](array.md) (11)
|
||||
- [tree](tree.md) (10)
|
||||
- [gpu](gpu.md) (10)
|
||||
|
|
|
|||
3
www.md
3
www.md
|
|
@ -123,4 +123,5 @@ A great deal of information on the Internet is sadly presented via web pages in
|
|||
- [cyberspace](cyberspace.md)
|
||||
- [SNet](snet.md)
|
||||
- [how to make a website](how_to.md)
|
||||
- [HTML](html.md)
|
||||
- [HTML](html.md)
|
||||
- [netstalking](netstalking.md)
|
||||
Loading…
Reference in a new issue