Primitive Representations of Integers by $x^3+y^3+2z^3$
Samir Siksek
备注：
This paper has been withdrawn by the author. Roger Heath-Brown has pointed out to me that the paper duplicates his result found in: "The density of zeros of forms for which weak approximation fails", Math. Comp. 59 (1992), 613-623
A well-known open problem is to show that the cubic form $x^3+y^3+2z^3$ represents all integers. An obvious variant of this problem is whether every integer can be {\em primitively} represented by $x^3+y^3+2z^3$. In other words, given an integer $n$, are there coprime integers $x$, $y$, $z$ such that $x^3+y^3+2z^3=n$? In this note we answer this variant question negatively. Indeed, we use cubic reciprocity to show that for every integral solution to $x^3+y^3+2z^3=8^m$,the unknowns $x$, $y$, $z$ are divisible by $2^m$.
A primitive root modulo an integer $n$ is the generator of the multiplicative group of integers modulo $n$. Gauss proved that for any prime number $p$ greater than $3$, the sum of its primitive roots is congruent to $1$ modulo $p$ while its product is congruent to $μ(p-1)$ modulo $p$, where $μ$ is the Möbius function. In this paper, we will generalize these two interesting congruences and give the congruences of the sum and the product of integers with the same index modulo $n$.
A positive definite integral quadratic form is said to be almost (primitively) universal if it (primitively) represents all but at most finitely many positive integers. In general, almost primitive universality is a stronger property than almost universality. The two main results of this paper are: 1) every primitively universal form nontrivially represents zero over every ring of p-adic integers, and 2) every almost universal form in five or more variables is almost primitively universal.
E. Artin conjectured that any integer $a >1$ which is not a perfect square is a primitive root modulo $p$ for infinitely many primes $p.$ Let $f_a(p)$ be the multiplicative order of the non-square integer $a$ modulo the prime $p.$ M. R. Murty and S. Srinivasan [10] showed that if $\sum_{p<x} \frac 1 {f_a(p)}= O(x^{1/4})$ then Artin's conjecture is true for $a.$ We relate the Murty-Srinivasan condition to sums involving the cyclotomic periods from the subfields of $\mathbb Q(e^{2πi/p})$ corresponding to the subgroups $<a> \subseteq \mathbb F*_p.$
We establish a connection between semi-primitive roots of the multiplicative group of integers modulo $2^{k}$ where $k\geq 3$, and the logarithmic base in the algorithm introduced by Fit-Florea and Matula (2004) for computing the discrete logarithm modulo $2^{k}$. Fit-Florea and Matula used properties of the semi-primitive root 3 modulo $2^{k}$ to obtain their results and provided a conversion formula for other possible bases. We show that their results can be extended to any semi-primitive root modulo $2^{k}$ and also present a generalized version of their algorithm to find the discrete logar…
Let $F=\mathbb{F}_{q^m}$, $m>6$, $n$ a positive integer, and $f=p/q$ with $p$, $q$ co-prime irreducible polynomials in $F[x]$ and deg$(p)$ $+$ deg$(q)= n$. A sufficient condition has been obtained for the existence of primitive pairs $(α, f(α))$ in $F$ such that for any prescribed $a, b$ in $E=\mathbb{F}_q$, Tr$F/E (α) = a$ and Tr$F/E (α^{-1}) = b$. Further, for every positive integer $n$, such a pair definitely exists for large enough $(q,m)$. The case $n = 2$ is dealt separately and proved that such a pair exists for all $(q,m)$ apart from at most $64$ choices.
Let $m$, $n$ be positive integers such that $m>n$, $\gcd(m,n)=1$ and $m \not\equiv n \bmod 2$. In 1956, L. Jeśmanowicz \cite{Jes} conjectured that the equation $(m^2 - n^2)^x + (2mn)^y = (m^2+n^2)^z$ has only the positive integer solution $(x,y,z) = (2,2,2)$. This problem is not yet solved. In this paper, combining a lower bound for linear forms in two logarithms due to M. Laurent \cite{Lau} with some elementary methods, we prove that if $mn \equiv 2 \bmod 4$ and $m > 30.8 n$, then Jeśmanowicz' conjecture is true.
Let $(a, b, c)$ be a primitive Pythagorean triple parameterized as $a=u^2-v^2,\ b=2uv,\ c=u^2+v^2$,\ where $u>v>0$ are co-prime and not of the same parity. In 1956, L. Je{ś}manowicz conjectured that for any positive integer $n$, the Diophantine equation $(an)^x+(bn)^y=(cn)^z$ has only the positive integer solution $(x,y,z)=(2,2,2)$. In this connection we call a positive integer solution $(x,y,z)\ne (2,2,2)$ with $n>1$ exceptional. In 1999 M.-H. Le gave necessary conditions for the existence of exceptional solutions which were refined recently by H. Yang and R.-Q. Fu. In this paper we give a un…
In this article, we establish an average behaviour of the normalised Fourier coefficients of the Hecke eigenforms supported at the integers represented by any primitive integral positive definite binary quadratic form of fixed discriminant $D < 0$ when the class number $h(D) = 1$. We also obtain a quantitative result for the number of sign changes of the sequence of the normalised Fourier coefficients $λ_{f}(n)$ of the Hecke eigenforms $f$ where $n$ is represented by any primitive integral positive definite binary quadratic form of fixed discriminant $D < 0$ when the class number $h(D) = 1$ in…
The paper presents a systematic construction of primitive Pythagorean triples. The order of enumeration on the set of primitive Pythagorean triples is defined. The order is based on the representation of a primitive Pythagorean triple by dividing the side of the generating square into two groups of factors using gnomons. In paper is shown the inverse mapping of the elements of a primitive Pythagorean triple to the parameters of the partition of the side of the generating square, the representation of primitive Pythagorean triples as the sum of two connected gnomons, a one-to-one correspondence…
One unsolved mathematical problem remains the perfect cuboid problem. A perfect cuboid is a rectangular parallelepiped whose edges, face diagonals and space diagonal are all expressed as integers. No such cuboid has yet been discovered and its existence has also not been proven. This paper shows a proof of the non-existence of a perfect cuboid.
Suppose $ m,n\geq 2 $ are co prime integers. We prove certain new symmetries of the base $ n $ representation of $ 1/m $, and in particular characterize the subgroup generated by $ n $ inside $ (\mathbb{Z}/m\mathbb{Z})^\times $. As an application we give a sufficient condition for a prime $ p $ such that a non square number $ n $ is a primitive root modulo $ p $.
Given $F= \mathbb{F}_{p^{t}}$, a field with $p^t$ elements, where $p $ is a prime power, $t\geq 7$, $n$ are positive integers and $f=f_1/f_2$ is a rational function, where $f_1, f_2$ are relatively prime, irreducible polynomials with $deg(f_1) + deg(f_2) = n $ in $F[x]$. We construct a sufficient condition on $(p,t)$ which guarantees primitive pairing $(ε, f(ε))$ exists in $F$ such that $Tr_{\mathbb{F}_{p^t}/\mathbb{F}_p}(ε) = a$ and $Tr_{\mathbb{F}_{p^t}/\mathbb{F}_p}(f(ε)) = b$ for any prescribed $a,b \in \mathbb{F}_{p}$. Further, we demonstrate for any positive integer $n$, such a pair defi…
Let $n\ge 2$ be an integer and let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a prime power. Given $\mathbb F_q$-affine hyperplanes $\mathcal A_1, \ldots, \mathcal A_n$ of $\mathbb F_{q^n}$ in general position, we study the existence and distribution of primitive elements of $\mathbb F_{q^n}$, avoiding each $\mathcal A_i$. We obtain both asymptotic and concrete results, relating to past works on digits over finite fields.
Erdős proved that $\mathcal{F}(A) := \sum_{a \in A}\frac{1}{a\log a}$ converges for any primitive set of integers $A$ and later conjectured this sum is maximized when $A$ is the set of primes. Banks and Martin further conjectured that $\mathcal{F}(\mathcal{P}_1) > \ldots > \mathcal{F}(\mathcal{P}_k) > \mathcal{F}(\mathcal{P}_{k+1}) > \ldots$, where $\mathcal{P}_j$ is the set of integers with $j$ prime factors counting multiplicity, though this was recently disproven by Lichtman. We consider the corresponding problems over the function field $\mathbb{F}_q[x]$, investigating the sum $\mathcal{F}…
For $q=3^r$ ($r>0$), denote by $\mathbb{F}_q$ the finite field of order $q$ and for a positive integer $m\geq2$, let $\mathbb{F}_{q^m}$ be its extension field of degree $m$. We establish a sufficient condition for existence of a primitive normal element $α$ such that $f(α)$ is a primitive element, where $f(x)= ax^2+bx+c$, with $a,b,c\in \mathbb{F}_{q^m}$ satisfying $b^2\neq ac$ in $\Fm$ except for at most 9 exceptional pairs $(q,m)$.
Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements and $r$ be a positive divisor of $q^n-1$. An element $α\in \mathbb{F}_{q^n}^*$ is called $r$-primitive if its multiplicative order is $(q^n-1)/r$. Also, $α\in \mathbb{F}_{q^n}$ is $k$-normal over $\mathbb{F}_q$ if the greatest common divisor of the polynomials $g_α(x) = αx^{n-1}+ α^q x^{n-2} + \ldots + α^{q^{n-2}}x + α^{q^{n-1}}$ and $x^n-1$ in $\mathbb{F}_{q^n}[x]$ has degree $k$. These concepts generalize the ideas of primitive and normal elements, respectively. In this paper, we consider non-negative integers $m_1,m_2,k_1,k_2$, po…
Let $\mathbb{F}_q$ be the finite field of $q$ elements, and let $k\mid q-1$ be a positive integer. Let $f(x)=ax^2+bx+c$ be a quadratic polynomial in $\mathbb{F}_q[x]$ with $b^2-4ac\ne0$. In this paper, we show that if $q>\max\{e^{e^3},(2k)^6\}$, then there is a primitive element $g$ of $\mathbb{F}_q$ such that $f(g)\in\mathbb{F}_q^{\times k}=\{x^k: x\in\mathbb{F}_q\setminus\{0\}\}$. Moreover, we shall confirm a conjecture posed by Sun.
Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements, and let $m_1$ and $m_2$ be positive integers. Given polynomials $f_1(x), f_2(x) \in \mathbb{F}_q[x]$ with $\textrm{deg}(f_i(x)) \leq m_i$, for $i = 1, 2$, and such that the rational function $f_1(x)/f_2(x)$ belongs to a certain set which we define, we present a sufficient condition for the existence of a primitive element $α\in \mathbb{F}_{q^n}$, normal over $\mathbb{F}_q$, such that $f_1(α)/f_2(α)$ is also primitive.
An integer of the form $T_x=\frac{x(x+1)}2$ for some positive integer $x$ is called a triangular number. A ternary triangular form $aT_{x}+bT_{y}+cT_{z}$ for positive integers $a,b$ and $c$ is called regular if it represents every positive integer that is locally represented. In this article, we prove that there are exactly 49 primitive regular ternary triangular forms.
A point in the $d$-dimensional integer lattice $\mathbb{Z}^d$ is primitive when its coordinates are relatively prime. Two primitive points are multiples of one another when they are opposite, and for this reason, we consider half of the primitive points within the lattice, the ones whose first non-zero coordinate is positive. We solve the packing problem that asks for the largest possible number of such points whose absolute values of any given coordinate sum to at most a fixed integer $k$. We present several consequences of this result at the intersection of geometry, number theory, and combi…
A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that $\mathcal{A}=\mathcal{B}+\mathcal{C}$ (resp. $\mathcal{A}Δ(\mathcal{B}+\mathcal{C})$ is finite). If none of these properties hold, the set $\mathcal{A}$ is called totally primitive. We define $\mathbb{Z}$-decomposability analogously with subsets $\mathcal{A,B,C}$ of $\mathbb{Z}$. Wirsing showed that almost all subsets of $\mathbb{N}$ are totally primitive. In this paper, …
A set of integers greater than 1 is primitive if no element divides another. Erdős proved in 1935 that the sum of $1/(n \log n)$ for $n$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he asked if this universal bound is attained by the set of prime numbers. We answer the Erdős question in the affirmative for 2-primitive sets. Here a set is 2-primitive if no element divides the product of 2 other elements.
We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of prime numbers. The proof uses the probabilistic method. Using the same techniques we improve the bounds obtained by He for gaps in geometric-progression-free sets.
Let $Q(n)$ denote the count of the primitive subsets of the integers $\{1,2\ldots n\}$. We give a new proof that $Q(n) = α^{(1+o(1))n}$ which allows us to give a good error term and to improve upon the lower bound for the value of this constant $α$. We also show that the method developed can be applied to many similar problems that can be stated in terms of the divisor graph, including other questions about primitive sets, geometric-progression-free sets, and the divisor graph path-cover problem.
Let $r$, $n$ be positive integers, $k$ be a non-negative integer and $q$ be any prime power such that $r\mid q^n-1.$ An element $α$ of the finite field $\mathbb{F}_{q^n}$ is called an {\it $r$-primitive} element, if its multiplicative order is $(q^n-1)/r$, and it is called a {\it $k$-normal} element over $\mathbb{F}_q$, if the greatest common divisor of the polynomials $m_α(x)=\sum_{i=1}^{n} α^{q^{i-1}}x^{n-i}$ and $x^n-1$ is of degree $k.$ In this article, we define the characteristic function for the set of $k$-normal elements, and with the help of this, we establish a sufficient condition f…
