All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Algorithms
Divisible by B (Posted on 2023-02-10) Difficulty: 3 of 5
Devise an algorithm to determine whether a given positive hexadecimal integer N is divisible by (B)16, and if NOT, to find the remainder.

N can contain up to (20220)10 digits.

o Simply dividing N by (B)16 is NOT permissible.
o (B)16 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.)
  Subject Author Date
SolutionAlgorithm and ProgramLarry2023-02-10 12:58:16
SolutionSolutionBrian Smith2023-02-10 12:57:34
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2023 by Animus Pactum Consulting. All rights reserved. Privacy Information