I don't understand why, when the condition is true (the number is odd), the µ causes the ? to go back to the beginning of the chain and execute the entire ×3‘ chain
@Christian μ is a chain separator, and the chain to the right is monadic as defined by µ, while the left chain is provided as a link to ? which accepts 3 links...it's kind of complicated but it can help you save lots of bytes
@EriktheOutgolfer Yeah, that part where the left chain is provided as a single link is what I don't understand, but that's okay, it does seem pretty complicated, I can just play around with it if I need the functionality
If the ×3‘ were a longer chain instead (without any chain separators), would the entire thing still get passed to ?? or is there a limit?
documentation addition was needed to solve the min-max consecutive integer sum challenge...because you can't expect students to just guess undocumented behavior