Devise an algorithm that determines whether a given positive integer N is divisible by 13, and if NOT, to find the remainder.
N can contain up to 20,220 digits.

Note: Simply dividing by 13 or, performing long division by 13 is NOT permissible.

(In reply to My favorite by Jer)

This is like other tests for div by 13 found on the internet. It left you with 550, which you must decide is not divisible by 13. 

Posted by Charlie on 2022-04-15 11:18:26