I noticed that just like when we did base 10 we were using multiples of 9, for base n it works using multiples of n-1 (the solution above is an example). So that means that there are infinite solutions for all the possible "Your Choice" problems. I also got an answer to the problem that can't be solved using the above (the 2nd base 2 problem): 1 all around and 100 in the middle. Similarly for the base 10 problem if in base n (n-1)(amount of connections): if the sum of digits of that is n-1 then it should work (my answer to the 2nd base 2 problem is using that method). But still there can be answers not using the above methods. - aj

Could you please explain with an example? I didn't understand. -aj

Hi AJ,

I'll explore Base three. So the three determines how many symbols we can use to represent our numbers.

We get three symbols: 0, 1, and 2.

So counting from zero to ten would look like:

For a deeper explanation on base numbers, checkout this

link.Below is my solution to the base three skewer (there are likely more though):

Take a moment to work through it yourself using the table. Do you understand why my solution works?

See if you can figure out the flower for base three.

Oh, now I understood. Thank you. I will look into it. -aj

I noticed that just like when we did base 10 we were using multiples of 9, for base n it works using multiples of n-1 (the solution above is an example). So that means that there are infinite solutions for all the possible "Your Choice" problems. I also got an answer to the problem that can't be solved using the above (the 2nd base 2 problem): 1 all around and 100 in the middle. Similarly for the base 10 problem if in base n (n-1)(amount of connections): if the sum of digits of that is n-1 then it should work (my answer to the 2nd base 2 problem is using that method). But still there can be answers not using the above methods. - aj