For each prime p, construct a graph Gp on {1,2,…p}, where m=n are adjacent if and only if p divides (m2+1−n)(n2+1−m). Prove that Gp is disconnected for infinitely many p prime numberscombinatoricsgraph theoryConnected graphsIMO ShortlistIMO Shortlist 2020