{"component":{"type":17,"accent_color":14263361,"components":[{"type":10,"content":"-# WikiRNG · Roll of 10/26/2026 · by [Melioss](https://wikirng.com/u/Melioss)"},{"type":10,"content":"## [Euclid's theorem](https://wikirng.com/roll/HNSV1T)\n*Infinitely many prime numbers exist*"},{"type":10,"content":">>> Euclid's theorem is a fundamental statement in number theory that asserts that there are infinitely many prime numbers. It was first proven by Euclid in his work Elements. There are at least 200 proofs of the theorem."},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### 🟧 Fabled · 336,769 SP\n-# Top 3% · ❤️ 1"},{"type":10,"content":"*there are 200 theorem*"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 🧪 **Preprint** · Obscure · +93,114 SP\n-# Cites a preprint.\n🟦 💗 **Vital (Level 4)** · Obscure · +72,358 SP\n-# One of the 10,000 Level 4 vital articles.\n🟦 ∑ **Problem Set** · Obscure · +49,666 SP\n-# Has 20+ math formulas.\n🟦 🧪 **arXiv** · Obscure · +18,876 SP\n-# Links to arXiv.\n🟦 🧮 **Equation** · Obscure · +17,512 SP\n-# Has a math formula.\n🟦 🌟 **Featured Abroad** · Obscure · +14,125 SP\n-# Featured or Good in another language.\n-# +33 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/HNSV1T"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Euclid's_theorem"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}