'use strict'; function isPrime(n){ if(n<2) return false; for(let d=2;d*d<=n;d++) if(n%d===0) return false; return true; } function gcd(a,b){while(b){const t=a%b;a=b;b=t;}return a;} const W=210; const slots=[]; for(let t=1;t<=W;t++) if(gcd(t,W)===1 && gcd(t+2,W)===1) slots.push(t); const D=slots.length; const gaps=[]; for(let i=0;i`${i}:${t}(m30=${t%30},m7=${t%7},g=${gaps[i]})`).join(' ')); for (const p of [11,13]) { const r=slots.map(t=>t%p); console.log(`\n--- p=${p} residues: ${r.join(' ')}`); for(let i=0;i ${slots[j]}(res ${r[j]}) gap=${gaps[i]} d=${d} set={${r[i]},${(r[i]+2)%p}}`); } // longest run const legal=[]; for(let i=0;i!v); let best=0,c=0; for(let k=0;kbest)best=c;} else c=0;} console.log(` L(${p}) = ${best+1} (#161 says ${p===11?1:1})`); }