- #1

- 28

- 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.)

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter hyderman
- Start date

- #1

- 28

- 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.)

Physics news on Phys.org

- #2

Science Advisor

Homework Helper

- 43,008

- 974

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

Share:

- Replies
- 6

- Views
- 756

- Replies
- 20

- Views
- 841

- Replies
- 10

- Views
- 667

- Replies
- 2

- Views
- 673

- Replies
- 4

- Views
- 777

- Replies
- 9

- Views
- 937

- Replies
- 1

- Views
- 977

- Replies
- 1

- Views
- 609

- Replies
- 14

- Views
- 670

- Replies
- 49

- Views
- 2K