SKOLEM: Solves the Skolem Problem for simple integer LRS

On the first line write the coefficients of the recurrence relation, separated by spaces.
On the second line write an equal number of space-separated initial values.
The LRS must be simple, non-degenerate, and not the zero LRS.
The tool will output all zeros (at both positive and negative indices), along with a completeness certificate.


                  a₁ a₂ ... a_k 

                  u₀ u₁ ... u_k-1

where:


       u_n+k = a₁·u_n+k-1 + a₂·u_n+k-2 + ... + a_k·u_n

Auto-fill examples:

LRS input:

Always render full LRS (otherwise restricted to 400 characters)

I solemnly swear the LRS is non-degenerate (skips degeneracy check, it will timeout or break if the LRS is degenerate!)

I solemnly swear the LRS is minimal (skips minimality check)

Use GCD reduction (reduces initial values by GCD)

Debug:print

Use Baker-Davenport algorithm

Bound only (will not search for zeros up to the bound, if timeout try this to see if bound is very big)

List LRS up to bound (up to 400 unless render full LRS also chosen)

Search in both directions

Search for negative indices (note: positive will not be searched)

Use leapfrogging algorithm of [2]

Factor subcases (merges subcases into single linear set, sometimes requires higher modulo classes)

Find the smallest modulo (often slower)