Original file (SVG file, nominally 512 × 683 pixels, file size: 12 KB)
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 20:57, 10 May 2021 |
![]() | 512 × 683 (12 KB) | Cmglee | Fix 10. |
20:50, 10 May 2021 |
![]() | 512 × 683 (12 KB) | Cmglee | {{Information |Description=The smallest two solutions, 23 and 128, of the original formulation of the Chinese remainder theorem problem found using a sieve by CMG Lee. |Source={{own}} |Date= |Author= Cmglee |Permission= |other_versions= }} Category:Modular arithmetic |
Original file (SVG file, nominally 512 × 683 pixels, file size: 12 KB)
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 20:57, 10 May 2021 |
![]() | 512 × 683 (12 KB) | Cmglee | Fix 10. |
20:50, 10 May 2021 |
![]() | 512 × 683 (12 KB) | Cmglee | {{Information |Description=The smallest two solutions, 23 and 128, of the original formulation of the Chinese remainder theorem problem found using a sieve by CMG Lee. |Source={{own}} |Date= |Author= Cmglee |Permission= |other_versions= }} Category:Modular arithmetic |