Explore BrainMass

Explore BrainMass

    GCD and base 16

    Not what you're looking for? Search our solutions OR ask your own Custom question.

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    A.
    Convert (11101)2 to base 16.

    b.
    Use the Euclidean algorithm to find gcd(34,21).

    © BrainMass Inc. brainmass.com November 24, 2021, 11:20 am ad1c9bdddf
    https://brainmass.com/math/discrete-math/gcd-and-base-16-factoring-22822

    Solution Preview

    a.
    Convert (11101)2 to base 16.
    hexadecimal: The place values are 1, 16, 256, 4096 etc.; the digits used are 0 to F.
    Because sixteen is two to the power four, there is a nice relationship between binary and hexadecimal. Each hexadecimal digit takes four bits to represent, so you can split a binary number up into nybbles and convert each one separately, ...

    Solution Summary

    This shows how to use the Euclidean algorithm

    $2.49

    ADVERTISEMENT