Module 1: Basic Set Theory
Module 2: Modular Arithmetic, Divisibility, and the Fundamental Theorem of Arithmetic
Module 3: Functions and Relations
Module 4: Truth Tables and Symbolic Logic
Module 5: Basic Direct Proofs
Module 6: Proof Techniques Part 1: Contrapositive and Contradiction
Module 7: Sequences, Sums, and Products
Module 8: Proof Techniques Part 2: (Weak) Induction
Module 9: Recurrence Relations and Recursion
Module 10: Counting Systems (Binary, Hex, Octal, etc.)
Module 11: Combinatorics
Module 12: Graph Theory
Module 13: Review

Module 10 Homework Problems

Easier homework this week! Lots of bonuses to help your overall homework grade! You MUST show all work and all computations to get credit.

Convert the following numbers from base 2 to decimal.

  1. \(10101_2\)
  2. \(11111_2\)
  3. \(1101010110_2\)

Convert the following base 10 numbers to base 2

  1. \(212_{10}\)
  2. \(256_{10}\)
  3. \(541_{10}\)
  4. \(5121_{10}\)

(Bonus +5 each) Convert the following as indicated

  1. Convert \(241_{10}\) to base 3
  2. Convert \(132_{10}\) to base 5
  3. Convert \(15_{10}\) to base 1 (Hint: if ternary (base 3) represents all numbers with only three different digits, and binary represents all numbers with only two digits, how many digits can we use to represent a number in base 1?)

Perform the indicated operations, keeping your answer in base 2.

  1. \(11011_2+110001_2\)
  2. \(10101_2+1111_2\)
  3. \(1011_2+10001_2+101111_2\)
  4. \(1001_2-111_2\)
  5. \(101101_2-111011_2\)
  6. (Bonus +5) \(10111_2-1101101_2\) (yes, your answer will be negative)
  7. \(1010_2 \cdot 1101_2\)
  8. \(11101_2\cdot 101_2\).
  9. (Bonus +5) \(132_4+123_4\)
  10. (Bonus +5) \(5123_9-3172_9\)

Here’s a crazy fact about bit strings and binary numbers that might blow your mind: every computer program is nothing more than a string of bits, like 1011010101010100100101010101111001010100100010100010100. Every bit string is a binary number that can be converted to a decimal number. Therefore, every program that has been or ever will be written is just a number! And since every decimal number can be converted to a bit string, every number (technically) represents a computer program. So, one could legitimately ask “I wonder what computer program 1,387,469,213 does…”

(Computability-Theoretic disclaimer on the above fact: context/encoding is important to determine what the 1,387,469,213th program does. For instance, different operating systems (OS’s) might interpret the binary conversion of 1,387,469,213 differently, and so 1,387,469,213 might mean different things to different OS’s. So not only does each natural number represent a program, it actually represents many different objects, depending on the “context” in which the number is used.)

Scroll to Top