Let n be a positive integer. Let S be a set of ordered pairs (x,y) such that 1≤x≤n and 0≤y≤n in each pair, and there are no pairs (a,b) and (c,d) of different elements in S such that a2+b2 divides both
ac+bd and ad−bc. In terms of n, determine the size of the largest possible set S. number theorygaussiangaussian integerDivisibilityRMM Shortlist