Search arXiv⌕ Search

arXiv · 2610.25661

The factorial separation conjecture

Abstract

We propose the Factorial Separation Conjecture (FSC), a strict strengthening of earlier factorial gap conjectures: \[ |n!-m^k|>n \] for all integers $n\ge8$ and $m,k\ge2$. The inequality excludes every displacement up to and including the factorial index. We prove the conjecture unconditionally for exponents divisible by three, for even exponents at least four, and for every exponent at least two when the largest prime divisor of the base is at most $n+2$. For exponents divisible by five, we prove the finite interval $8\le n\le1100$ and all sufficiently large indices, with an effective but uncomputed threshold. The conclusion for every $n\ge8$ and every exponent divisible by five is proved under the Generalized Riemann Hypothesis (GRH) for a specified family of Dedekind zeta functions. Here GRH asserts that their nontrivial zeros have real part $1/2$. The arguments combine valuations, cyclotomic factorizations, cubic reciprocity, character estimates and explicit formulas. All finite comparisons are justified in the text. The general conjecture remains open.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Valmir Krasniqi. 2026-10-19. The factorial separation conjecture. https://arxiv.org/abs/2610.25661

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dynamical systems defined by polynomials with algebraic properties

Let (x_n; n\in Z) be a bisequence of elements x_n in the 1-dimensional torus R/Z, which is called a stream over R/Z. Let P(z)=a_k z^k+...+a_1 z+a_0 be a polynomial with integer coefficients. Define the set of streams over R/Z such that the convolution product P(z)\times(x_n; n\in Z)=(\sum_{i=0}^k a_i x_{n-i}; n\in Z)=(0; n\in Z), which is called the stream 0 of P. We study similarities between stream 0 of P and the roots of P(z)=0.

math.NT↗

Effective existence of primitive k-normal elements via affine spaces

Let $\mathbb{F}_{q^n}$ be the finite field with $q^n$ elements. An element $α\in \mathbb{F}_{q^n}$ is $k$-normal over $\mathbb{F}_q$ if $α$ and its conjugates span an $\mathbb{F}_q$-subspace of dimension $n-k$. It is known that, for $q$ sufficiently large, a primitive $k$-normal element exists if and only if there exists a $k$-normal element free of binomials, but the lower bound on $q$ is not explicit. We count the $k$-normal elements in specific affine subspaces of $\mathbb{F}_{q^n}$ and show that, in some of them, all but at most one element is $k$-normal. Combining this with character sum estimates over affine spaces and a sieve, we obtain an explicit lower bound on $q$ above which a primitive $k$-normal element exists, provided there is a $k$-normal element free of binomials whose $\mathbb{F}_q$-order has a linear factor or is irreducible. As an application, we compute these bounds for $5 \le n \le 8$ and give a complete characterization of the existence of primitive $k$-normal elements in $\mathbb{F}_{q^6}$ over $\mathbb{F}_q$.

math.NT↗