Tell me more ;)
Few digits have some instabilites in range ^0, ^1, ^2...
I've decied don't look to any literature and base only on my school math.
I just accidentaly saw solution... i'm so stupid...
I passed near solution many times but i could not see it...
Wasted so much time... but i can better value genius of this solution.

You was right, that was diffrent but simillar test [2,2,1,2].
Thank you for quick help :)

I tried Console again and now works...magic....
I will debug more, thanks for reply and encourage to try agin.

I tried Console, Debug.. nothing appears in this Kata (worked in others).
Maybe, but when i throw on this test there is no fail and
when i on this particular test only (SequenceEqual) force 6 it show assert with 4 and vice versa.

I stuck with this and spend substantial time with pen, paper & wolfram...
if you going up to next numeber simple mod (6 mod 4 = 2) fails, one solution is take one more digit, next powers of 6(not only) ((36 mod 4 = 0 what gives 1).

In C# version case { 2, 2, 101, 2} seems to have two test with diffrent answers (6 is correct, but even when force return 6 new error with Excpected:4 shows).
It would be nice to add (in Attempt) comments with send array in assert string parameter, because now only result and expected is visible
and posiblity to show console mesages is disabled. I "debuged" this using throw...
I almost finished (olny from my head and pen&paper) and refuse to give up and i'm hoping some can help!

In details you mention unstable coding by human operator, but i don't see any of this in tests.
Allmost all soultions assume signals to be integer multipy of given signal norms and unit.
Is this what author has on mind ?