Intereting Posts

Vanishing of Taylor series coefficient
Evaluating $\int_0^1 \frac{\arctan x \log x}{1+x}dx$
Laplace transformations for dummies
What is the maximum value of $|f(z)|$ on the unit disc $D=\{z \in \mathbb C:|z|\leq 1\}$?
Identity and possible generalization of the reflective periodic continued fractions
Showing a $2\times2$ matrix is invertible
Show that if $f^{-1}((\alpha, \infty))$ is open for any $\alpha \in \mathbb{R}$, then $f$ is lower-semicontinuous.
Is there a general formula for the derivative of $\exp(A(x))$ when $A(x)$ is a matrix?
Product of lim sups
If G is fully residually cyclic, does G have at most one subgroup of each finite index?
Translations in two dimensions – Group theory
General solution of second-order linear ODE
Two different comultiplications on a Hopf algebra
What does it mean when a function is finite?
Deriving the addition formula for the lemniscate functions from a total differential equation

In Baby Rudin,I find reference to the fact that the binary representation of a real number implies the uncountablity of the set of real numbers.(page 30)But I have two questions:

- Does every real number have a binary representation?If yes , how do I prove it?
- For a given real number $a$, how can I generate its binary representation?

Thanks in advance.I am aware of the binary representation of integers but I had never thought of a binary representation of real numbers earlier.

- Using 8x8 Binary Matrices as a hash
- Function that sends $1,2,3,4$ to $0,1,1,0$ respectively
- Finding element in binary representation of $GF(2^6)$
- Possible distinct binary tree structures at depth d
- Count the number of n-bit strings with an even number of zeros.
- A proof that powers of two cannot be expressed as the sum of multiple consecutive positive integers that uses binary representations?

- Why hyperreal numbers are built so complicatedly?
- Converting $\frac{2}{7}$ to a binary number in a $32$ bit computer
- Proof that every repeating decimal is rational
- What mathematical structure models arithmetic with physical units?
- Determining the position of a binary value with $k$ one bits and $n-k$ zeros in an enumeration of $C_k^n$ bit strings
- Does set $\mathbb{R}^+$ include zero?
- Converting decimal(base 10) numbers to binary by repeatedly dividing by 2
- Calculate the last digit of $3^{347}$
- why binary is read right to left
- What could be better than base 10?

Every real number $\alpha>0$ (to make things simpler) can be developed into an infinite binary expansion of the form $$110\ldots10\,.\,1011101\ldots\ ,$$

where to the left of the “decimal” point we only have finitely many digits and to the right an unending sequence of digits. Numbers of the form $n/2^N$ $\ (n, N\in{\mathbb N}_{\geq0})$ have exactly two such representations (this is the $0.999\ldots=1.000\ldots$ phenomenon in decimal), all other numbers have exactly one representation. In fact it is possible to construct the full real number system (with addition, multiplication and order) as such an “uncountable list” of binary fractions. This has been sketched by Gowers here: http://www.dpmms.cam.ac.uk/~wtg10/decimals.html

A real number $\alpha>0$ can be considered as “given” when for each $N$ it is possible to name an integer $a_N$ such that

$${a_N\over 2^N}\leq \alpha<{a_N+1\over 2^N}\ .$$

Using induction one easily proves that

$$2 a_N\leq a_{N+1}\leq 2a_N+1\ ,$$

and this implies that the finite binary representation of $a_{N+1}$ is obtained from the representation of $a_N$ by appending a $0$ or a $1$. Now the quotients $a_N/2^N$ approximate the given number $\alpha$. Writing $a_N$ in binary

and separating the last $N$ digits by a “decimal” point we therefore get a finite binary approximation of $\alpha$, and things work out such that for $N’>N$ the first $N$ places (after the “decimal” point) of $a_N$ and $a_{N’}$ coincide. In this way we get an ever better approximation of $\alpha$ just by adding new “binary places” to the right.

When I say $\pi = 3.14\ldots$ in decimal, what does that mean? In principle, what it really means is that $\pi$ times a hundred is at least the integer three hundred and fourteen, and is less than three hundred and fifteen. And since I already know how to write the decimal representation of an *integer*, I can write down $314$ and then shift the point two places up to get $3.14$. So the first few digits of the decimal representation of $\pi$ are $3.14$. If I want more digits, I multiply $\pi$ by a bigger power of the base, in this case ten, and compare *that* result with the integers.

The binary representation is exactly the same thing, except with powers of two instead of powers of ten. For example, $\pi$ times eight is a little over twenty-five (which is $11001$ in binary), so the binary representation of $\pi$ goes $11.001\ldots$.

Yes, every real number has a binary representation, just like every real number has a decimal (and an octal, and hexadecimal, and similar for any other base) representation, though only if you allow an infinite number of digits.

There may be a cleverer way to prove it, but I’d suggest this:

- Let x be a real number. If x a rational, we’re done, so assume x is an irrational real.
- Let epsilon greater than zero be given. Show that you can find a rational number q such that the difference between q and x is less than epsilon.
- Thus you can approximate x to an arbitrary degree of accuracy by taking more digits.
- The limit as epsilon goes to zero, is your representation.

Of course, if you don’t allow an infinite number of digits then no irrational number has a binary (or decimal, or hexadecimal…) representation.

(I assumed that you mean computing representation by binary, Rahul Narain has a better answer if it is not the case)

I am not sure this is a mathematics question but feel free to read this:

http://en.wikipedia.org/wiki/Double-precision_floating-point_format

This is the most common representation of an approximation of a real number in computing. It is important that you know that not all numbers can be represented in most of the type and in computing these types are approximations.

Do not confuse binary with computing representation. You could create your own binary type which could theoretically store a number with an infinite number of digits with infinite memory but in the real-world, not only you have memory limitations but the common used types are standardised.

- Lagrange multiplier constrain critical point
- Understanding the definition of tensors as multilinear maps
- Span of an empty set is the zero vector
- Find a solution: $3(x^2+y^2+z^2)=10(xy+yz+zx)$
- Verifying the examples of Dual Space
- Intermediate fields of a finite field extension that is not separable
- How were trigonometrical functions of $\dfrac{2\pi}{17}$ calculated?
- Uniqueness of minimizing geodesic $\Rightarrow$ uniqueness of connecting geodesic?
- trouble with non-homogeneous ODE system… which method shall I use?
- Is my Riemann Sum correct?
- Count the number of positive solutions for a linear diophantine equation
- Is $0$ a natural number?
- Is the reciprocal of an analytic function analytic?
- $f$ is convex function iff Hessian matrix is nonnegative-definite.
- Showing $(P\to Q)\land (Q\to R)\equiv (P\to R)\land$ {without truth table}