Home > Algorithms
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.
No Subject
|
Comment 11 of 11 |
|
|
|
Please log in:
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:
|