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).

Estimates the least c so that |C_k(1 / P((1-mx)/x))| < m^c·k by sampling random integer polynomials.

Tests whether the k-th digit of 1 / P(n) in base (n+m) matches a_k from 1 / P((1-mx)/x) under the n ≥ m² + a_k+1 condition.

Searches for counterexamples where ord_{|pⁿ−qⁿ|}(p) ≠ ord_{|pⁿ−qⁿ|}(q). Uses arbitrary-precision BigInt arithmetic.