Meeting Mob

Tests if (4n+1) divides (F_n + C) for a given range of n values. Uses optimized Montgomery reduction for high-performance computation.

Tests if p_3n divides (n² + 1), where p_k is the k-th prime number. Uses streaming prime generation for efficient computation up to 10 billion.

Finds exceptions to a conjecture about Tribonacci numbers: values of n where no N ≤ bound × n satisfies n | a_N (Tribonacci divisibility).

Tests 10·S₅(n) + 12·S₂(n) - 5·S₃(n) ≥ -12 where S_b(n) is digit sum in base b. Uses Web Workers for parallel browser-side computation.