Question

prove: Let the real number x have a Base 3 representation of: x = 0.x0x1x2x3x4x5x6x7… where...

prove: Let the real number x have a Base 3 representation of: x = 0.x0x1x2x3x4x5x6x7

where xi  is the ith digit of x. Then, if xi ={ 0 , 2 } (or xi not equal to 1) for all non-negative integers i, then x is in the Cantor set (Cantor dust).

Think about induction.

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let X=2N={x=(x1,x2,…):xi∈{0,1}} and define d(x,y)=2∑(i≥1)(3^−i)*|xi−yi|. Define f:X→[0,1] by f(x)=d(0,x), where 0=(0,0,0,…). Prove that maps X onto...
Let X=2N={x=(x1,x2,…):xi∈{0,1}} and define d(x,y)=2∑(i≥1)(3^−i)*|xi−yi|. Define f:X→[0,1] by f(x)=d(0,x), where 0=(0,0,0,…). Prove that maps X onto the Cantor set and satisfies (1/3)*d(x,y)≤|f(x)−f(y)|≤d(x,y) for x,y∈2N.
Let ? be a flow network, and let ? be a flow for ?. Prove that...
Let ? be a flow network, and let ? be a flow for ?. Prove that for any cut, x, of ?, the value of ? is equal to the flow across cut x, that is, |?| = ?(x). Use an induction proof on the number of vertices in set ? of the cut. That is, the base case would be |?| = 1, where ? = {?}. Please use induction to prove it.
Let f:[0,1]——>R be define by f(x)= x if x belong to rational number and 0 if...
Let f:[0,1]——>R be define by f(x)= x if x belong to rational number and 0 if x belong to irrational number and let g(x)=x (a) prove that for all partitions P of [0,1],we have U(f,P)=U(g,P).what does mean about U(f) and U(g)? (b)prove that U(g) greater than or equal 0.25 (c) prove that L(f)=0 (d) what does this tell us about the integrability of f ?
Use strong induction to prove that every natural number n ≥ 2 can be written as...
Use strong induction to prove that every natural number n ≥ 2 can be written as n = 2x + 3y, where x and y are integers greater than or equal to 0. Show the induction step and hypothesis along with any cases
14.) In Cantor's diagonalization, we construct a number x between 0 and 1 that's not on...
14.) In Cantor's diagonalization, we construct a number x between 0 and 1 that's not on the supposed list of real numbers between 0 and 1. Recall, to construct x we make x's ith digit (after the decimal point) equal to 1 if the corresponding digit of the ith number on the list is even and we make x's ith digit 0 otherwise. a) Suppose the list happens to start with the numbers 1/2, 1/3, 1/4, 1/5, 1/6, 1/7, 20.2/3,...
) Let α be a fixed positive real number, α > 0. For a sequence {xn},...
) Let α be a fixed positive real number, α > 0. For a sequence {xn}, let x1 > √ α, and define x2, x3, x4, · · · by the following recurrence relation xn+1 = 1 2 xn + α xn (a) Prove that {xn} decreases monotonically (in other words, xn+1 − xn ≤ 0 for all n). (b) Prove that {xn} is bounded from below. (Hint: use proof by induction to show xn > √ α for all...
1. Let x be a real number, and x > 1. Prove 1 < sqrt(x) and...
1. Let x be a real number, and x > 1. Prove 1 < sqrt(x) and sqrt(x) < x. 2. If x is an integer divisible by 4, and y is an integer that is not, prove x + y is not divisible by 4.
1. (a) Let S be a nonempty set of real numbers that is bounded above. Prove...
1. (a) Let S be a nonempty set of real numbers that is bounded above. Prove that if u and v are both least upper bounds of S, then u = v. (b) Let a > 0 be a real number. Define S := {1 − a n : n ∈ N}. Prove that if epsilon > 0, then there is an element x ∈ S such that x > 1−epsilon.
Let X be a non-empty finite set with |X| = n. Prove that the number of...
Let X be a non-empty finite set with |X| = n. Prove that the number of surjections from X to Y = {1, 2} is (2)^n− 2.
Prove that there is a positive real number x such that x2 - 2 = 0....
Prove that there is a positive real number x such that x2 - 2 = 0. What you'll need: Definition of a real number, definition of positive, definition of zero, and definition of Cauchy.