Olympiad Number Theory · Superchallenge problem

A simple graph on $17$ vertices contains no triangle. What is the largest possible number of edges?