Consider graphs (directed or undirected) in which there is at most one edge between any two vertices (selfloops are possible). Use proof by induction to prove that under this condition a graph with n vertices has at most n^2 edges.