- #1

guroten

- 32

- 0

## Homework Statement

show that for n points in a plane, with no 3 points colinear, the number of line segments joining all pairs of points is (n^2-n)/2

**Problem 2**

Show that sqrt(n) is strictly less than 1/sqrt(1) +1/sqrt(2)+...+1/sqrt(n) for n[tex]\geq[/tex] 2

## The Attempt at a Solution

For problem 1, I have no idea how to start. For problem 2, I tried manipulating the equation and substituting in the induction assumption, but I couldn't get anywhere with it.