Segments on a Ruler

Problem

On a segment of length $n$ ( $n \in \mathbb{N}^*$ ), points are marked at every unit distance, giving $n + 1$ points including the endpoints.

1. How many segments have both endpoints among these points? 2. What is the total length of all these segments?

Answer

Solution

Difficulty	5/10
Topics	combinatorics, Counting

Whiteboard

Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.

Discussion

Ask questions, share alternate solutions, and use LaTeX freely.

0 comments

No comments yet.