Proof Writing & Problem Solving · Challenge problem

A club has 21 members, and every member is friends with at least $k$ other members (friendship is mutual). What is the smallest $k$ that guarantees three members who are all friends with each other?