相关论文: Twelve new primitive binary trinomials

In this article, we introduce and study a new integer sequence referred to as the higher order Mersenne sequence. The proposed sequence is analogous to the higher order Fibonacci numbers and closely associated with the Mersenne numbers.…

Let $x$ denote a sufficiently large integer. We show that the recent result of Grimmelt and Merikoski actually yields the largest prime factor of $n^2 +1$ is greater than $x^{1.317}$ infinitely often. As an application, we give a new upper…

For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof for the…

Generating primes is a fundamental problem in modern cryptography. Deterministic primality tests work well for special integers such as Mersenne or Proth primes, but these forms are quite restrictive. In this paper, we give a direct method…

The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Its coefficients are the subject of intensive study and some formulas are known for them. Here we are interested in formulas…

Motivated by Euler's observation that the polynomial $x^{2} + x + 41$ takes on prime values for $0 \leq x \leq 39$, we search for large values of $x$ for which $N = x^{2} + x + 41$ is prime. To apply classical primality proving results…

We determine the density of integral binary forms of given degree that have squarefree discriminant, proving for the first time that the lower density is positive. Furthermore, we determine the density of integral binary forms that cut out…

Mordell in 1958 gave a new proof of the three squares theorem. Those techniques were generalized by Blackwell, et al., in 2016 to characterize the integers represented by the remaining six "Ramanujan-Dickson ternaries". We continue the…

This paper is concerned with trinomials of the form $z^{n}+az^{m}+b$, where $0<m<n$ are relatively prime integers and $a$ and $b$ are non-zero complex numbers. Typically (but not exclusively), $a$ will be an integer with $|a| \geq 2$, while…

We give a minimal system of 476 generators (resp. 510 generators) for the algebra of SL(2,C)-covariant polynomials on binary forms of degree 9 (resp. degree 10). These results were only known as conjectures so far. The computations rely on…

We present algorithms giving upper and lower bounds for the number of independent primitive rational Vassiliev invariants of degree m modulo those of degree m-1. The values have been calculated for the formerly unknown degrees m = 10, 11,…

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

I review recent developments of "non-semisimple" modular tensor categories in the sense of Lyubashenko and the categorical Verlinde formula for such categories (this is a proceedings article for Meeting for Study of Number theory, Hopf…

Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…

In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.

Let $\Omega(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1).…

We determine a primitive form for a universal unfolding of an affine cusp polynomial. Moreover, we prove that the resulting Frobenius manifold is isomorphic to the one constructed from the Gromov-Witten theory for an orbifold projective…

Wright proved that there exists a number $c$ such that if $g_0 = c$ and $g_{n+1} = 2^{g_n}$, then $\lfloor g_n \rfloor$ is prime for all $n > 0$. Wright gave $c = 1.9287800$ as an example. This value of $c$ produces three primes, $\lfloor…

A subset of $\{1,2,\ldots,2n\}$ is said to be primitive if it does not contain any pair of elements $(u,v)$ such that $u$ is a divisor of $v$. Let $D(n)$ denote the number of primitive subsets of $\{1,2,\ldots,2n\}$ with $n$ elements.…