- #1

- 30

- 0

any pone have any idea how to solve this question

thanx

Prove that the n-cube is connected, for n ≥ 1.

(Hint: build the n-cube using two copies of (n − 1)-cube and use induction

on n.)

- Thread starter hyderman
- Start date

- #1

- 30

- 0

any pone have any idea how to solve this question

thanx

Prove that the n-cube is connected, for n ≥ 1.

(Hint: build the n-cube using two copies of (n − 1)-cube and use induction

on n.)

- #2

HallsofIvy

Science Advisor

Homework Helper

- 41,833

- 962

The 2-cube is a square. You "build the 2-cube using two copies of the 1-cube" by using each one cube as an edge. In particular, if every point on one 1-cube is labled (x, 0) and the other (x, 1), then every point in the 2-cube is labled (x,y) with 0<= y< = 1.

If every point on one n-1-cube is labled (x

- Replies
- 5

- Views
- 7K

- Last Post

- Replies
- 2

- Views
- 7K

- Replies
- 3

- Views
- 576

- Replies
- 6

- Views
- 7K

- Last Post

- Replies
- 10

- Views
- 1K

- Replies
- 22

- Views
- 4K

- Last Post

- Replies
- 8

- Views
- 1K

- Last Post

- Replies
- 2

- Views
- 8K

- Last Post

- Replies
- 6

- Views
- 4K

- Replies
- 3

- Views
- 1K