Coprimes: Difference between revisions
Content added Content deleted
(Added Wren) |
|||
Line 47: | Line 47: | ||
Found 2 coprimes |
Found 2 coprimes |
||
done... |
done... |
||
</pre> |
|||
=={{header|Wren}}== |
|||
{{libheader|Wren-math}} |
|||
Two numbers are coprime if their GCD is 1. |
|||
<lang ecmascript>import "/math" for Int |
|||
var pairs = [[21,15],[17,23],[36,12],[18,29],[60,15]] |
|||
System.print("The following pairs of numbers are coprime:") |
|||
for (pair in pairs) if (Int.gcd(pair[0], pair[1]) == 1) System.print(pair)</lang> |
|||
{{out}} |
|||
<pre> |
|||
The following pairs of numbers are coprime: |
|||
[17, 23] |
|||
[18, 29] |
|||
</pre> |
</pre> |
Revision as of 14:13, 20 April 2021
Coprimes is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
- Task
p and q are coprimes if they have no common factors other than 1.
Let input: [21,15],[17,23],[36,12],[18,29],[60,15]
Ring
<lang ring> see "working..." + nl row = 0 Coprimes = [[21,15],[17,23],[36,12],[18,29],[60,15]] input = "input: [21,15],[17,23],[36,12],[18,29],[60,15]" see input + nl see "Coprimes are:" + nl
lncpr = len(Coprimes) for n = 1 to lncpr
flag = 1 if Coprimes[n][1] < Coprimes[n][2] test = Coprimes[n][1] else test = Coprimes[n][2] ok for m = 2 to test if Coprimes[n][1]%m = 0 and Coprimes[n][2]%m = 0 flag = 0 exit ok next if flag = 1 row = row + 1 see "" + Coprimes[n][1] + " " + Coprimes[n][2] + nl ok
next
see "Found " + row + " coprimes" + nl see "done..." + nl </lang>
- Output:
working... input: [21,15],[17,23],[36,12],[18,29],[60,15] Coprimes are: 17 23 18 29 Found 2 coprimes done...
Wren
Two numbers are coprime if their GCD is 1. <lang ecmascript>import "/math" for Int
var pairs = [[21,15],[17,23],[36,12],[18,29],[60,15]] System.print("The following pairs of numbers are coprime:") for (pair in pairs) if (Int.gcd(pair[0], pair[1]) == 1) System.print(pair)</lang>
- Output:
The following pairs of numbers are coprime: [17, 23] [18, 29]