I'm not sure I quite understand step 2. I managed to write code to obtain all prime numbers (factors) up to my limit. I don't know how to proceed because I don't understand the suggested second step you provided.

(I'm new to number theory and coding in general)

## Search found 2 matches

- Tue Jul 02, 2019 3:09 am
- Forum: Number Theory
- Topic: Generate tuples of pairwise coprimes with limit on largest element
- Replies:
**2** - Views:
**85**

- Sun Jun 30, 2019 4:42 pm
- Forum: Number Theory
- Topic: Generate tuples of pairwise coprimes with limit on largest element
- Replies:
**2** - Views:
**85**

### Generate tuples of pairwise coprimes with limit on largest element

I'm trying to find an efficient way to find tuples or arrays with 10 elements of pairwise coprime integers below a given limit M. How would I write the following program? loop over all (a,b,c,d,e,f,g,h,i,j) such that 0 < a < b < c <d < e < f < g < h < i <j <M and gcd(a,b,c,d,e,f,g,h,i,j) == 1 .. do ...