[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math


View post   

File: 380 KB, 1920x1080, day_66.png [View same] [iqdb] [saucenao] [google]
10702142 No.10702142[DELETED]  [Reply] [Original]

Suppose that in a certain society, each pair of persons can be classified as either [math] amicable [/math] or [math] hostile [/math]. We shall say that each member of an amicable pair is a [math] friend [/math] of the other, and each member of a hostile pair is a [math] foe [/math] of the other. Suppose that the society has [math] \, n \, [/math] persons and [math] \, q \, [/math] amicable pairs, and that for every set of three persons, at least one pair is hostile. Prove that there is at least one member of the society whose foes include [math] \, q(1 - 4q/n^2) \, [/math] or fewer amicable pairs.