Timeline for A closed formula for a sequence of integers
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 10, 2012 at 18:15 | comment | added | Gerhard Paseman | One thing that bothers me about the question is that it is ill defined. For example, a_(l+2) does not exist for most values of l, and this is true of some other indices. Further, a computer search using valid pairs of (l,n) should make it clear which values of j will produce the desired minimum, and such j can be easily described. Because of the nature of the description, I suspect no nice form exists for the general term. Gerhard "Ask Me About System Design" Paseman, 2012.08.10 | |
| Aug 10, 2012 at 17:23 | comment | added | daniel birmajer | I posted a similar question at StackExchange: math.stackexchange.com/questions/180374/… | |
| Aug 9, 2012 at 18:16 | comment | added | Gerhard Paseman | This is for fixed l, (in my view) a fairly simple optimization, and is equivalent to the minimum of a set of two values. I would like more motivation, an idea of what you have tried, and either admission that it is homework or a real good reason why I should not let you solve it yourself. Gerhard "Willing To Give Another Hint" Paseman, 2012.08.09 | |
| Aug 9, 2012 at 17:35 | comment | added | Shahrooz | You can write a program, with Maple, Magma or Matlab, and obtaining some directions for examining. Also, if you give these results here, I think it is helpful and the problem will be clearer. | |
| Aug 9, 2012 at 17:00 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
spelling; deleted 1 characters in body
|
| Aug 9, 2012 at 16:42 | comment | added | Mariano Suárez-Álvarez | You asked this at math.stackexchange.com/questions/180374/… some 20 hours ago. It is usually best to ask on one site and wait a bit (a few days) before reasking on the other site. When you do ask again, add links between the two instances of the question. | |
| Aug 9, 2012 at 16:39 | history | asked | daniel birmajer | CC BY-SA 3.0 |