Computations for "Factorwise Divisibility of Sidelnikov–Lempel–Cohn–Eastman Sequence Polynomials at Composite Orders 3ℓ"

Python scripts supporting the exact finite-field, cyclotomic-integer, and numerical Gauss-sum computations in the paper "Factorwise Divisibility of Sidelnikov–Lempel–Cohn–Eastman Sequence Polynomials at Composite Orders 3ℓ". The archive includes exact factor-pattern computations over F_{p^3}, exact reduction of the order-21 Jacobi sums in Z[X]/(Φ_21(X)), numerical Davenport–Hasse checks, and a script reproducing Table 1 of Section 9. The prime p = 613 is provided as an additional test beyond the table.