I’ve tried to get this kind of formula working on wolfram alpha:
a)
{ n ? ? > 1 : gcd(n,30) = 1 }
b)
{ n ? n ? ?, n?1, 2?n, 3?n, 5?n }
Both should produce similar sequence of numbers (SON):
7,11,13,17,19,23,29,31,37,41,43,47,49,53,59,61,67,71,73,77,79,83,89,91,97,101,
That I want to again use on other formula.
So is it possible to create a set:
a) such which has positive integers greater than 1 and which will produce 1 as a greatest common divider
or set:
b) such which has no numbers 1 or numbers with a product of 2, or numbers with a product of 3, or numbers with a product of 5?
Basicly I’m already stuck with the notation of n in Elements: n ? ? , how to do it plus I can’t get result outputting the SON mentioned above.
I have tried this: { n ? N > 1 : gcd(n, 30) = 1 } assume n variable - Wolfram|Alpha
