ANALYSIS of ALGORITHMS, Bulletin Board

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Pigeonhole Principle



1) prove Math induction using pigeonhole principle

-----------
2)
n points are selected at random along a circle and labeled with 0 or 1. prove that there are at most "Lower bond of ((3n-4)/2)" chords which join differently labeled points and which do not intersect inside the circle.


Join 18 million Eudora users by signing up for a free Eudora Web-Mail account at http://www.eudoramail.com

Date Prev | Date Next | Date Index | Thread Index