Timeline for Sequences, semigroups, addition formulae.
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2012 at 6:30 | vote | accept | joro | ||
| Feb 1, 2011 at 22:49 | history | edited | Tegiri Nenashi | CC BY-SA 2.5 |
deleted 104 characters in body
|
| Feb 1, 2011 at 7:21 | comment | added | joro | @Tegiri Thank you. I wrote the example is artificial - a(n) is efficiently computable anyway. Though working with [a(2n),a(2n+1)] conceals the addition of [2n,2n+1]. | |
| Jan 31, 2011 at 21:55 | history | edited | Tegiri Nenashi | CC BY-SA 2.5 |
deleted 2 characters in body
|
| Jan 31, 2011 at 21:25 | history | edited | Tegiri Nenashi | CC BY-SA 2.5 |
added 79 characters in body; deleted 2 characters in body; deleted 1 characters in body
|
| Jan 31, 2011 at 19:48 | history | edited | Tegiri Nenashi | CC BY-SA 2.5 |
added 37 characters in body; deleted 1 characters in body
|
| Jan 31, 2011 at 19:35 | history | edited | Tegiri Nenashi | CC BY-SA 2.5 |
added 56 characters in body; added 11 characters in body; added 65 characters in body
|
| Jan 31, 2011 at 19:30 | history | edited | Tegiri Nenashi | CC BY-SA 2.5 |
added 153 characters in body; added 3 characters in body
|
| Jan 31, 2011 at 19:23 | history | edited | Tegiri Nenashi | CC BY-SA 2.5 |
deleted 15 characters in body; edited body
|
| Jan 31, 2011 at 19:17 | history | answered | Tegiri Nenashi | CC BY-SA 2.5 |