Purchase Solution

GCD and base 16

Not what you're looking for?

Ask Custom Question

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.

View More Free Quizzes
Related BrainMass Solutions

  • Euclidean algorithm

    Use the Euclidean algorithm to find a) gcd(100, 101) 2. gcd(123, 277) 3. gcd(1529, 14039) 2. consider congruence x^2 ≡ 16 (mod 105) for integer x a.

  • Induction proof

    and (2) Find d=gcd (721 , 448), find integers s and t with d=721s + 448t, and put the fraction 448/721 in lowest terms. Solution. and BUT gcd(103, 64)=1, we conclude that d=gcd (721 , 448)=7.

  • Euclidean Algorithm

    Also find the gcd by Euclid's algorithm and then find the lcm from lcm(x,y)=xy/gcd(x,y). 3. Prove the following statment by induction. Use the headings Base, Inductive step, and By induction.

  • Discrete Math : History, Appearance and Application of Chinese Remainder Theorem in Chinese and Hindu Writings

    For an example, consider two triplets: {2, 4, 16} and {2, 8, 16}. Both have exactly the same gcd and lcm but obviously different products.

  • Equations and greatest common divisor

    = 5*1 +3 gcd(8,5) = gcd(5,3) 5=3*1+2 gcd(5,3) = gcd(3,2) 3=2*1+1 gcd(3,2) = gcd(2,1) 2=1*2 gcd(2,1)=1 Therefore gcd(234, 539)=1, and by backward substitution, 1=3-2=3-(5-3)=3*2-5=(8-5)*2-5=8*2-5*3=8*2-(21- 8*2)*3 =8*8-21*3=(71-21*3)*8-21

  • Greatest Common Divisors

    Let a, b be positive integers, and write a = qb + r, where q, r are Elements of Z and 0 (= or)< r < b. Suppose that d = gcd(a, b). a) If r = 0 show that d = b. b) If r > 0 show that d = gcd(b, r). 4.

  • Equality of gcd's

    Second, since x=gcd(ac,b), then x|b, x|ac. From the condition, we know gcd(a,b)=1, then we can find some integers m and n, such that am+bn=1. Then x|(bnc+acm)=c(bn+am)=c. Then we get x|b and x|c. So x|gcd(b,c)=y. therefore, x=y.

  • Greatest Common Divisor (GCD) in C++ with Example

    function and a driver program to test the function

  • An Iterative GCD Program and Testing in C

    95250 An Iterative GCD Program and Testing in C Write program to test function then write and test an equivalent iterative function int gcd (int a, int b) { int r; if ((r=a%b)==0) return b else return gcd(b,r); } The following program has been

View More Related Solutions