Timeline for Maximize combinatorial sum for boolean function
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 22, 2014 at 20:25 | history | edited | Per Alexandersson | CC BY-SA 3.0 |
fixed typo (i think)
|
| Aug 22, 2014 at 20:24 | comment | added | Per Alexandersson | You mean, $f(x)=1$, and not $f(x)=x$ i suppose. (I edited the question) | |
| Jul 24, 2014 at 3:53 | comment | added | user56357 | Yes, n,t are integers, $n>t$, $t>1$. | |
| Jul 23, 2014 at 19:49 | answer | added | Robert Israel | timeline score: 1 | |
| Jul 23, 2014 at 19:36 | comment | added | Robert Israel | $n$ and $t$ given, $t > 1$? $(n-1)/t$ an integer? How did this problem arise? | |
| Jul 23, 2014 at 19:00 | history | edited | user56357 | CC BY-SA 3.0 |
added 32 characters in body
|
| Jul 23, 2014 at 18:53 | review | First posts | |||
| Jul 23, 2014 at 19:15 | |||||
| Jul 23, 2014 at 18:52 | history | asked | user56357 | CC BY-SA 3.0 |