Timeline for The sequence $a_{n+1}=\left\lceil \frac{-1+\sqrt{5}}{2}a_{n}-a_{n-1} \right\rceil$ is periodic
Current License: CC BY-SA 3.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Feb 7, 2016 at 11:36 | vote | accept | jack | ||
| Feb 6, 2016 at 6:46 | answer | added | zeb | timeline score: 14 | |
| Feb 4, 2016 at 15:49 | comment | added | mkreisel | Given the quasicrystals pictured below, I wonder whether this paper and its sequel (by the same author) are relevant: arxiv.org/pdf/1512.00650v1.pdf | |
| Feb 3, 2016 at 14:52 | answer | added | Wolfgang | timeline score: 8 | |
| Feb 3, 2016 at 1:59 | answer | added | Lev Borisov | timeline score: 7 | |
| Feb 2, 2016 at 15:10 | answer | added | Peter Mueller | timeline score: 19 | |
| Jan 31, 2016 at 17:02 | comment | added | Fedor Petrov | @FelipeVoloch Well, many questions I ask here do not arise in my research (some come from teaching, some from working on math competitions, some from pure curiosity), does it mean that they are not appropriate here? I do not think so. It is easy to make a 'research level question' from this: describe all linear reccurences for which such a sequence is always periodic. But why not start from this? | |
| Jan 31, 2016 at 16:50 | answer | added | Noam D. Elkies | timeline score: 23 | |
| Jan 31, 2016 at 13:53 | comment | added | Felipe Voloch | I still think this should not be on MO. It may be a hard problem but is not a research problem, i.e., I doubt it arose independently in jack's research. Second, I assume whoever posed the problem in the competition (plus, I hope, some of the competitors) know how to solve it, so asking them and not MO is a more efficient way of getting the answer. | |
| Jan 31, 2016 at 13:03 | comment | added | Todd Trimble | Thanks, jack. Generally the community should be allowed to decide these things, and the balance appears to be in your favor here. (As one point of reference, though, I think Putnam problems generally don't survive without a good reason.) | |
| Jan 31, 2016 at 12:47 | comment | added | Lev Borisov | An obvious remark is that one should show that the sequence is bounded. This would imply periodicity without any specific information about the period. | |
| Jan 31, 2016 at 12:29 | history | reopened |
Max Alekseyev Fedor Petrov Michael Renardy Joe Silverman Vít Tuček |
||
| Jan 31, 2016 at 12:22 | review | Reopen votes | |||
| Jan 31, 2016 at 12:32 | |||||
| Jan 31, 2016 at 12:13 | comment | added | jack | @ToddTrimble I agree MO is not for discussing contest problems. However, as explained above, Miklos Schweitzer is definitely not a conventional contest. Its problems are basically of research level. | |
| Jan 31, 2016 at 12:06 | history | edited | jack | CC BY-SA 3.0 |
added 915 characters in body
|
| Jan 31, 2016 at 3:03 | review | Reopen votes | |||
| Jan 31, 2016 at 7:24 | |||||
| Jan 30, 2016 at 23:12 | comment | added | Fedor Petrov | Actually, Miklos Schweitzer competition is as close to research level as possible. If there are solutions anywhere in the web (not this particular problem), I would really appreciate the link. | |
| Jan 30, 2016 at 23:00 | history | closed |
Felipe Voloch Greg Martin Ilya Bogdanov Steven Landsburg Todd Trimble |
Not suitable for this site | |
| Jan 30, 2016 at 23:00 | comment | added | Todd Trimble | This site is not really for discussing contest problems unless there is some research angle of interest to professionals. Perhaps Art of Problem Solving would be better. | |
| Jan 30, 2016 at 21:26 | review | Close votes | |||
| Jan 30, 2016 at 23:03 | |||||
| Jan 30, 2016 at 21:07 | history | asked | jack | CC BY-SA 3.0 |