Tag: Prime

But that wasn’t obvious. They’d have to analyze a special set of functions, called Type I and Type II sums, for each version of their problem, then show that the sums were equivalent no matter which constraint they used. Only then would Green and Sawhney know they could substitute rough primes into their proof without…