perplexus.info :: Algorithms : Divisible by B

Divisible by B (Posted on 2023-02-10)

Devise an algorithm to determine whether a given positive hexadecimal integer N is divisible by (B)₁₆, and if NOT, to find the remainder.

N can contain up to (20220)₁₀ digits.

Note:
o Simply dividing N by (B)₁₆ is NOT permissible.
o (B)₁₆ is equal to 11 in base ten.

Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Solution: (Hide)

Please refer to:
The solution submitted by Brian Smith in this location.
The solution submitted by Larry in this location

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

Subject	Author	Date
No Subject	Ffaada	2024-10-27 11:56:54
re: Algorithm and Program	Ffaada	2024-10-07 11:55:25
Algorithm and Program	Larry	2023-02-10 12:58:16
Solution	Brian Smith	2023-02-10 12:57:34

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 (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info