See if you can solve this puzzle, BLF

[Drydess]

but can you prove that it's impossible is the question

well I coulda spent my time making a graph like he did but I was on a phone so

[Ad Bot]

[Teneksi]

but can you prove that it's impossible is the question

are you taking intro to proofs? combinatorics?

I'm having flashbacks to that class. I was good at figuring out solutions, but terrible at describing them formally.


https://www.youtube.com/watch?v=sfkUi6bUrAY&t=5m22s

[sir dooble]

I'm not certain. Writing it out I get the same configurations.
[333][311][322][132][113][121][231][212][113][223]
Anything I do to these, adding to the front or back, just gives me another of the group.

Trying to work from the answer backwards gives me a seperate list of numbers with no overlap.

So. provided I've understood the rules properly, you can't go from [333] to [221].
lol, 11 replies. too slow on a console.

[Ipquarx]

are you taking intro to proofs? combinatorics?

nah but I like proofs
and that graph works just fine, it totally proves that it's impossible. But there are definitely other ways to prove it, I did it formally myself before I posted this. I'll probably post mine a bit later

[}]Crazy[{]

its not possible
post something actually possible

[TheBlackParrot]

i want to know so bad im coding something to solve this for me fml

edit: p sure it's not solvable
edit 2: brute forcing it just shows the same numbers dooble and eksi mentioned

[Ipquarx]

its not possible
post something actually possible

okay here's my proof that it's impossible
let's call the number of spins needed for the first number a, the number of spins for the second number b, the spins for the third number c.
Now for the first number, no matter how you spin it, the number of spins that get you to the correct first number, divided by 3, is going to have a remainder 2. That's written as a mod 3 = 2.
Similarly, b mod 3 = 2, and c mod 3 = 1.

But b can also be written as a + c, since it's always moved up no matter if you spin a or c. So now it's (a + c) mod 3 = 2.
But we know what a and c are! (2 + 1) mod 3 = 2 -> 3 mod 3 = 2 -> 0 = 2
this is a contradiction, therefore the puzzle is impossible

[Marios]

I don't get it, crazy knew it was impossible and you wanted to prove to him that it was impossible?

Thanks for elaborating on the puzzle anyway.

[KentMansleyDaBoss]

i win

[Doughboy]

can you add one to the first two, and then add one to the last two after that?
if so then yes it is possible
if no then its not

wait no ive confused myself now this is bum. no it is not possible.