experimental-projects/oeis-research/Tim Johannes Ohrtmann/Least Lucas-Carmichael number which is divisible by b(n), where {b(n)} (A255602) is the list of all numbers which could be a divisor of a Lucas-Carmichael number/verify_bfile.sf

#!/usr/bin/ruby

var terms = []

ARGF.each {|line|
    terms << line.nums.last
}

var max_n = terms.len
var lucas_cyclic = max_n.by { .is_odd && .is_coprime(.psi) }

terms.each_kv {|k,v|

    say "Checking: #{lucas_cyclic[k]} | #{v}"

    assert(v.is_lucas_carmichael)
    assert_eq(v % lucas_cyclic[k], 0)

    if (lucas_cyclic[k].is_lucas_carmichael) {
        assert_eq(lucas_cyclic[k], v)
    }
}

say ":: No errors!"