Ormiston pairs: Difference between revisions

Content added Content deleted

Inline

@@ Line 257: / Line 257: @@
     "fmt"
     "rcu"
-    "sort"
 )
-func areEqual(l1, l2 []int) bool {
-    len1 := len(l1)
-    len2 := len(l2)
-    if len1 != len2 {
-        return false
-    }
-    for i := 0; i < len1; i++ {
-        if l1[i] != l2[i] {
-            return false
-        }
-    }
-    return true
-}
 func main() {
@@ Line 287: / Line 272: @@
             continue
         }
-        d1 := rcu.Digits(p1, 10)
+        key1 := 1
-        d2 := rcu.Digits(p2, 10)
+        for _, dig := range rcu.Digits(p1, 10) {
-        sort.Ints(d1)
+            key1 *= primes[dig]
-        sort.Ints(d2)
+        }
-        if areEqual(d1, d2) {
+        key2 := 1
+        for _, dig := range rcu.Digits(p2, 10) {
+            key2 *= primes[dig]
+        }
+        if key1 == key2 {
             if count < 30 {
                 orm30 = append(orm30, [2]int{p1, p2})