Information for "Refined greedy computation of multiplicative sequences"
From Polymath Wiki
Jump to navigationJump to search
Basic information
| Display title | Refined greedy computation of multiplicative sequences |
| Default sort key | Refined greedy computation of multiplicative sequences |
| Page length (in bytes) | 11,987 |
| Namespace ID | 0 |
| Page ID | 319 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
Page protection
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
Edit history
| Page creator | Thomas (talk | contribs) |
| Date of page creation | 12:34, 14 January 2010 |
| Latest editor | OBryant (talk | contribs) |
| Date of latest edit | 05:50, 31 July 2010 |
| Total number of edits | 8 |
| Total number of distinct authors | 3 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
