perplexus.info :: Algorithms : Divisible by 13

Divisible by 13 (Posted on 2022-04-15)

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.

See The Solution Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

re: No Subject

| Comment 4 of 11 |

(In reply to No Subject by Larry)

I would think

if temp%13 == 0:

return [True, temp%13]

else:

return [False, temp%13]

would not be allowable. This is basically asking if this final result is divisible by 13 by doing the division and finding the remainder.

Posted by Charlie on 2022-04-15 11:23:57

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info