Zsigmondy's Theorem for Chebyshev polynomials
Stefan Bara\'nczuk

TL;DR
This paper investigates the properties of Chebyshev polynomial sequences, specifically identifying all pairs where the sequence terms lack primitive prime divisors, extending classical number theory results.
Contribution
It provides a complete classification of pairs (n, a) where T_n(a) - 1 has no primitive prime divisor, applying Zsigmondy's theorem to Chebyshev polynomials.
Findings
Identifies all pairs (n, a) with no primitive prime divisor in T_n(a) - 1
Extends Zsigmondy's theorem to Chebyshev polynomial sequences
Provides a comprehensive list of exceptional cases
Abstract
For an integer consider the sequence defined by the Chebyshev polynomials . We list all pairs for which the term has no primitive prime divisor.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Mathematics and Applications
