# Base numbers

To understand the notion of **base numbers**, we look at our own number system. We use the decimal, or base-10, number system. To help explain what this means, consider the number 2746. This number can be rewritten as

Note that each number in 2746 is actually just a placeholder which shows how many of a certain power of 10 there are. The first digit to the left of the decimal place (recall that the decimal place is to the right of the 6, i.e. 2746.0) tells us that there are six 's, the second digit tells us there are four 's, the third digit tells us there are seven 's, and the fourth digit tells us there are two 's.

Base-10 uses digits 0-9. Usually, the base, or **radix**, of a number is denoted as a subscript written at the right end of the number (e.g. in our example above, , 10 is the radix).

## Contents

## Base Number Topics

## History

Base-10 is an apparently obvious counting system because people have 10 fingers. Historically, different societies utilized other systems. The Babylonian cultures are known to have used base-60; this is why we say there are 360 degrees in a circle and (fact check on this one coming) why we count 60 minutes in an hour and 60 seconds in a minute (they might have used it because it has so many multiples, 12 in fact, we wouldn't want any fractions). The Roman system, which didn't have any base system at all, used certain letters to represent certain values (e.g. I=1, V=5, X=10, L=50, C=100, D=500, M=1000). Imagine how difficult it would be to multiply LXV by MDII! That's why the introduction of the **Arabic numeral system**, base-10, revolutionized math and science in Europe.

## Example Problems

### Beginner

- Evaluate as a number in the decimal system.
- Solution: must be rewritten in the decimal system (base-10) before evaluating the square root. To do this, multiply and add Therefore, the answer is 7.

Find the base 2 number that is equivalent to

### Intermediate

- 2003 AIME I Problem 13
- Canadian Mathematics Olympiad Problem 3
- Suppose is an unknown polynomial, of unknown degree, with nonnegative integer coefficients. Your goal is to determine this polynomial. You have access to an oracle that, given an integer , spits out , the value of the polynomial at . However, the oracle charges a fee for each such computation, so you want to minimize the number of computations you ask the oracle to do. Show that it is possible to uniquely determine the polynomial after only two consultations of the oracle. (UIUC POW)

## Resources

#### Books

- The AoPS Introduction to Number Theory by Mathew Crawford.

#### Classes