GCD and base 16
Not what you're looking for?
A.
Convert (11101)2 to base 16.
b.
Use the Euclidean algorithm to find gcd(34,21).
Purchase this Solution
Solution Summary
This shows how to use the Euclidean algorithm
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, ...
Purchase this Solution
Free BrainMass Quizzes
Probability Quiz
Some questions on probability
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.