#autoparallel

One Variable: Compile g++ intersection.cpp Input: a1,b1,c1,l1,u1,a2,b2,c2,l2,u2 a1,b1 are the coefficients of x and y in first diophantine equation c1 is the constant element in the right hand side of the first diophantine equation l1 u1 is the limits for both x and y in the equation 2's is similar to ones for the 2nd equation Output: All possible solutions of first equation and their chains All possible solutions of second equation and their chains The intersection of chains of both the equation

PDP TWOVARIABLE: Compile g++ pairsolutions.cpp Input: a1,b1,l1,u1,a2,b2,l2,u2,c for i: for j: A[a1i + a2j] = .. .. = A[-b1i - b2j + c] The diophantine equations are a1x + b1y = c1 a2x + b2y = c2 c1 + c2 = c l1 u1 and l2 u2 are the bounds for i and j Output: Output dependent (i,j) pairs Indices of pairs which are dependent on each other