retired

I also fail so see the difference from single-case handling in the example solution. If the batch processing is a design choice, the example solution should showcase that difference.

retired

Noted! May you please provide any feedback on how to improve.

That would make sense if the additional performance were actually required, and mapping individual modpows over the list would timeout. Is it, and does it?

You're absolutely right. This kata expects the user not to use pow() or **.
I'll make this restriction more explicit in the kata description, and update the tests if needed to catch such usage.

Thanks for your suggestion! However, this kata is intentionally designed to take a list of triplets instead of a single triplet.
It focuses on batch-processing modular exponentiations efficiently, which is slightly different from single-case handling.

Isn't that what the failure message says?

Or ask for an exact answer answer in degrees/angular minutes? Or maybe even ask for float degrees and check for exact equality taking advantage of the fact that all anwers are either full degrees or half degrees, which are exactly representable with floats? This would be cool, would require some special care in solutions which use pi, which is IMO nice.

Approved. Thank you.

thx for issues report i fixed

@author: see the Python authoring docs and the Authoring examples for references on how to make a kata properly.