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.

Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Solution: (Hide)

Refer to the solution submitted by:
Larry here and here.
Charlie here and here.

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
No Subject	K Sengupta	2022-05-03 04:18:04
TESTBANK22	dianeparker	2022-05-03 01:56:20
No Subject	K Sengupta	2022-04-27 22:56:52
Amazing post	Alex Frost	2022-04-27 04:55:22
Test for 20,220-digit numbers	Charlie	2022-04-15 14:48:27
re(2): No Subject	Larry	2022-04-15 14:07:28
re: No Subject	Charlie	2022-04-15 14:02:01
re: No Subject	Charlie	2022-04-15 11:23:57
re: My favorite	Charlie	2022-04-15 11:18:26
My favorite	Jer	2022-04-15 10:37:47
No Subject	Larry	2022-04-15 09:04:26

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