Information for "Algorithm for finding multiplicative sequences with bounded discrepancy"
From Polymath Wiki
Jump to navigationJump to search
Basic information
| Display title | Algorithm for finding multiplicative sequences with bounded discrepancy |
| Default sort key | Algorithm for finding multiplicative sequences with bounded discrepancy |
| Page length (in bytes) | 1,818 |
| Namespace ID | 0 |
| Page ID | 340 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
Page protection
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
Edit history
| Page creator | SuneJ (talk | contribs) |
| Date of page creation | 06:24, 28 January 2010 |
| Latest editor | OBryant (talk | contribs) |
| Date of latest edit | 05:44, 29 January 2010 |
| Total number of edits | 2 |
| Total number of distinct authors | 2 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
