Timeline for Applications of the Chinese remainder theorem
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5, 2014 at 17:03 | comment | added | Realz Slaw | How can you divide by the elements in S? I assume you meant multiplication by modular inverse, which isn't actually division, unless it happens to divide exactly. | |
| Oct 7, 2013 at 12:41 | comment | added | Marc van Leeuwen | Actually the mentioned $E_8$ computations were done in serial, not in parallel. The constraint was memory, not time: the CRT allowed $1$-byte coefficients to be used instead of $4$-byte integers, which given the huge amount of coefficients required was a crucial memory savings at the time. | |
| Jul 12, 2012 at 11:52 | comment | added | Brendan McKay | Dirk Kinnaes and I used this method to find that there are 284473580014525286666121752496600242239281330559895142380815894680093529086840703279353601839695794392738788556778405044037630360510510198592329618381688979038688482537860239885961238887812656969372196798484462132843557299991075493007550627926803688745250953668796106910118867088442300850000 binary matrices of order 34 such that each row and each column have 17 ones. However I did meet one computer-illiterate mathematician who believed me when I claimed that we counted them one at a time. | |
| Jul 31, 2010 at 12:09 | comment | added | Pete L. Clark | I was just about to add the computation of the character table of E8 to the list when I saw this answer. So instead, a belated +1. | |
| Dec 29, 2009 at 16:52 | history | made wiki | Post Made Community Wiki by Anton Geraschenko | ||
| Dec 29, 2009 at 11:47 | history | answered | David E Speyer | CC BY-SA 2.5 |