(updated June 19) 6 Parameter search results for prime 101 (solutions modulo 101, no solutions found) with the restriction that both x and p-x appear in a tuple (Partial results)

(updated July 12) Products of arithmetic progressions that are cubes

(updated July 12) Products of arithmetic progressions that are squares

Code

Python 2.7 source code for searching arithmetic progressions whose product is a square

Python 2.7 source code for searching arithmetic progressions whose product is a cube

The main method of the programs is prod(). The program takes 4 inputs with 2 optional inputs: they are:
1. Filename for output file, write in quotation marks with extension, e.g. "output.txt"
2. Max range of parameters, must be a positive integer.
3. Number of progressions, must be a positive integer.
4. Length of progressions, must be a positive integer.
The 2 optional arguments are:
a. Minimum values of each parameter, written as an array in ascending order. E.g. [x1,x2,...,xn]
a. Maximum values of each parameter, written as an array in ascending order.

Warning: arrays must be as long as the number of progressions.

Example: prod("output.txt", 100, 3, 2, [1,10,50], [20,50,100]) will search all tuples [x,y,z] with 1 < x < 20, 10 < y < 50 and 50 < z < 100, and check if x(x+1)y(y+1)z(z+1) is a square/cube depending on the program. It outputs all search data to the file output.txt (overwriting any prior text in the file.)
Solutions can be found in the output file by CTRL+F searching for "found".