- #1

- 23

- 0

The answer is n(n-3)/2.

I don't know how to do that.

- Thread starter fork
- Start date

- #1

- 23

- 0

The answer is n(n-3)/2.

I don't know how to do that.

- #2

Tide

Science Advisor

Homework Helper

- 3,076

- 0

Set up a recursion for the number of diagonals in an n-gon: [itex]D_{n+1} = D_n + n - 2[/itex].

- #3

- 23

- 0

I don't understand how can I set up

[itex]D_{n+1} = D_n + n - 2[/itex].

[itex]D_{n+1} = D_n + n - 2[/itex].

- #4

HallsofIvy

Science Advisor

Homework Helper

- 41,833

- 961

- Last Post

- Replies
- 3

- Views
- 877

- Replies
- 10

- Views
- 763

- Replies
- 14

- Views
- 5K

- Replies
- 2

- Views
- 128

- Last Post

- Replies
- 1

- Views
- 2K

- Replies
- 4

- Views
- 1K

- Replies
- 6

- Views
- 918

- Last Post

- Replies
- 2

- Views
- 2K

- Replies
- 3

- Views
- 1K

- Replies
- 1

- Views
- 799