# GCD and base 16

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

A.

Convert (11101)2 to base 16.

b.

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

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