{"component":{"type":17,"accent_color":7315445,"components":[{"type":10,"content":"-# WikiRNG · Roll of 10/1/2026 · by [Catapulfy](https://wikirng.com/u/Catapulfy)"},{"type":10,"content":"## [Incompressibility method](https://wikirng.com/roll/X156H8)\n*Proof method*"},{"type":10,"content":">>> In mathematics, the incompressibility method is a proof method like the probabilistic method, the counting method or the pigeonhole principle. To prove that an object in a certain class (on average) satisfies a certain property, select an object of that class…"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### 🟦 Obscure · 136,264 SP\n-# Top 13%"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 ∑ **Problem Set** · Obscure · +49,666 SP\n-# Has 20+ math formulas.\n🟦 🧰 **Uses** · Obscure · +25,639 SP\n-# Has a Uses or Applications section.\n🟦 🧪 **arXiv** · Obscure · +18,888 SP\n-# Links to arXiv.\n🟦 🧮 **Equation** · Obscure · +17,503 SP\n-# Has a math formula.\n🟦 📦 **Amazon** · Obscure · +11,805 SP\n-# Links to Amazon.\n🟩 ➰ **Stuck in a Loop** · Notable · +5,509 SP\n-# First links loop forever and never reach Philosophy.\n-# +11 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/X156H8"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Incompressibility_method"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}