http://cantorsattic.info/api.php?action=feedcontributions&user=Ordnials&feedformat=atom Cantor's Attic - User contributions [en] 2022-10-07T01:50:49Z User contributions MediaWiki 1.24.4 http://cantorsattic.info/index.php?title=User:Ordnials&diff=1337 User:Ordnials 2017-03-26T19:24:42Z <p>Ordnials: Introducing</p> <hr /> <div>I'm interested in transfinite numbers. This wiki is inactive for the last years so I joined.</div> Ordnials http://cantorsattic.info/index.php?title=File:Omega-e.png&diff=1336 File:Omega-e.png 2017-03-26T19:20:58Z <p>Ordnials: Ordinals!!!!</p> <hr /> <div>Ordinals!!!!</div> Ordnials http://cantorsattic.info/index.php?title=Indecomposable&diff=1335 Indecomposable 2017-03-26T19:17:11Z <p>Ordnials: Images</p> <hr /> <div>[[File:https://upload.wikimedia.org/wikipedia/commons/thumb/e/e6/Omega-exp-omega-labeled.svg/832px-Omega-exp-omega-labeled.svg]]An indecomposable ordinal is an ordinal that can't be expressed as the sum of two smaller numbers.<br /> <br /> == Form ==<br /> An indecomposable ordinal is in the form $$\omega^n$$.<br /> <br /> === Proof ===<br /> Any ordinal that multiplies with a finite amount or added with anything can be expressed as the sum of two smaller ordinals. To avoid this, start with the smallest indecomposable ordinal and multiply it by $$\omega$$ every time. This is the best way of finding all indecomposable ordinals. Why? It is because $$\omega^n$$ is equal to $$\omega$$ sums of $$\omega^(n-1)$$.<br /> <br /> {{stub}}</div> Ordnials http://cantorsattic.info/index.php?title=Indecomposable&diff=1334 Indecomposable 2017-03-26T19:14:17Z <p>Ordnials: </p> <hr /> <div>An indecomposable ordinal is an ordinal that can't be expressed as the sum of two smaller numbers.<br /> <br /> == Form ==<br /> An indecomposable ordinal is in the form $$\omega^n$$.<br /> <br /> === Proof ===<br /> Any ordinal that multiplies with a finite amount or added with anything can be expressed as the sum of two smaller ordinals. To avoid this, start with the smallest indecomposable ordinal and multiply it by $$\omega$$ every time. This is the best way of finding all indecomposable ordinals. Why? It is because $$\omega^n$$ is equal to $$\omega$$ sums of $$\omega^(n-1)$$. https://upload.wikimedia.org/wikipedia/commons/thumb/e/e6/Omega-exp-omega-labeled.svg/832px-Omega-exp-omega-labeled.svg.png<br /> <br /> {{stub}}</div> Ordnials http://cantorsattic.info/index.php?title=Indecomposable&diff=1333 Indecomposable 2017-03-26T18:54:44Z <p>Ordnials: </p> <hr /> <div>An indecomposable ordinal is an ordinal that can't be expressed as the sum of two smaller numbers.<br /> <br /> == Form ==<br /> An indecomposable ordinal is in the form $$\omega^n$$.<br /> <br /> === Proof ===<br /> Any ordinal that multiplies with a finite amount or added with anything can be expressed as the sum of two smaller ordinals. To avoid this, start with the smallest indecomposable ordinal and multiply it by $$\omega$$ every time. This is the best way of finding all indecomposable ordinals. Why? It is because $$\omega^n$$ is equal to $$\omega$$ sums of $$\omega^(n-1)$$.<br /> <br /> {{stub}}</div> Ordnials http://cantorsattic.info/index.php?title=Indecomposable&diff=1332 Indecomposable 2017-03-26T18:52:33Z <p>Ordnials: LATEX problems</p> <hr /> <div>An indecomposable ordinal is an ordinal that can't be expressed as the sum of two smaller numbers.<br /> <br /> == Form ==<br /> An indecomposable ordinal is in the form $$\omega^n$$.<br /> <br /> === Proof ===<br /> Any ordinal that multiplies with a finite amount or added with anything can be expressed as the sum of two smaller ordinals. To avoid this, start with the smallest indecomposable ordinal and multiply it by $$\omega$$ every time. This is the best way of finding all indecomposable ordinals. Why? It is because $$\omega^n$$ is equal to $$\omega$$ sums of $$\omega^n-1$$.<br /> <br /> {{stub}}</div> Ordnials http://cantorsattic.info/index.php?title=Indecomposable&diff=1331 Indecomposable 2017-03-26T18:51:01Z <p>Ordnials: Ok</p> <hr /> <div>An indecomposable ordinal is an ordinal that can't be expressed as the sum of two smaller numbers.<br /> <br /> == Form ==<br /> An indecomposable ordinal is in the form $$\omega^n$$.<br /> <br /> === Proof ===<br /> Any ordinal that multiplies with a finite amount or added with anything can be expressed as the sum of two smaller ordinals. To avoid this, start with the smallest indecomposable ordinal and multiply it by $$\omega$$ every time. This is the best way of finding all indecomposable ordinals. Why? It is because $$\omega^n)\ is equal to \(\omega$$ sums of $$\omega^n-1$$.<br /> <br /> {{stub}}</div> Ordnials http://cantorsattic.info/index.php?title=Indecomposable&diff=1330 Indecomposable 2017-03-26T18:47:30Z <p>Ordnials: </p> <hr /> <div>An indecomposable ordinal is an ordinal that can't be expressed as the sum of two smaller numbers.<br /> <br /> == Form ==<br /> An indecomposable ordinal is in the form $$\omega^n$$.<br /> <br /> === Proof ===<br /> Any ordinal that multiplies with a finite amount or added with anything can be expressed as the sum of two smaller ordinals. To avoid this, start with the smallest indecomposable ordinal and multiply it by $$\omega$$ every time. This is the best way of finding all indecomposable ordinals. Why? It is because...<br /> <br /> {{stub}}</div> Ordnials