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.

See The Solution Submitted by K Sengupta

Rating: 5.0000 (1 votes)

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

Please log in:

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

Chatterbox:


perplexus dot info