Timeline for Vector of only ones by activating the bits
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 13, 2021 at 16:14 | comment | added | Notamathematician | @domotorp, thank you for comment! Very interesting link indeed. | |
| Nov 12, 2021 at 22:14 | comment | added | user44191 | @domotorp It is possible with that many activations only if it is possible at all; if the length is $3k + 2$ (i.e. if $n$ is 1 mod 3), then it may not be possible at all. For example, consider $n = 1$ with the zero-vector. | |
| Nov 12, 2021 at 21:31 | review | Close votes | |||
| Nov 23, 2021 at 10:05 | |||||
| Nov 12, 2021 at 21:11 | comment | added | domotorp | Of course it is possible with that many activations, why on Earth would you ever activate anything twice? See also mathworld.wolfram.com/LightsOutPuzzle.html | |
| Nov 12, 2021 at 16:45 | history | asked | Notamathematician | CC BY-SA 4.0 |