(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

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

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

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Induction problems

**Physics Forums | Science Articles, Homework Help, Discussion**