Sum of two adjacent numbers are primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 554: / Line 554: @@
 =35+36
 =36+37</lang>
+=={{header|jq}}==
+{{works with|jq}}
+'''Works with gojq, the Go implementation of jq'''
+This entry uses a memory-less approach to computing `is_prime`,
+and so a naive approach to computing the first 20 numbers satisfying
+the condition is appropriate.
+<lang jq>def is_prime:
+  . as $n
+  | if ($n < 2)         then false
+    elif ($n % 2 == 0)  then $n == 2
+    elif ($n % 3 == 0)  then $n == 3
+    else 5
+    | until( . <= 0;
+        if .*. > $n then -1
+	elif ($n % . == 0) then 0
+        else . + 2
+        |  if ($n % . == 0) then 0
+           else . + 4
+           end
+        end)
+    | . == -1
+    end;
+def naive:
+  limit(20;
+    range(0; infinite) as $i
+    | (2*$i + 1) as $q
+    | select($q | is_prime)
+    | "\($i) + \($i + 1) = \($q)" );
+naive</lang>
+{{out}}
+<pre>
++ 2 = 3
++ 3 = 5
++ 4 = 7
++ 6 = 11
++ 7 = 13
++ 9 = 17
++ 10 = 19
++ 12 = 23
++ 15 = 29
++ 16 = 31
++ 19 = 37
++ 21 = 41
++ 22 = 43
++ 24 = 47
++ 27 = 53
++ 30 = 59
++ 31 = 61
++ 34 = 67
++ 36 = 71
++ 37 = 73
+</pre>
 =={{header|Julia}}==