令$r_Q(n)$为非负整数$n$的四元二次型$Q=x_1^2+2x_2^2+x_3^2+x_4^2+x_1x_3+x_1x_4+x_2x_4$的表示数。我们首先证明了不同于13的任何素数$p$和与$p$互素的任何正整数$n$的恒等式$r_Q(p^2n)=r_Q(p^2)r_Q(n)/r_Q(1)$，这在[Eum et al，A modularity criterion for Klein forms，with an application to modular forms of level 13，J. Math. Anal. 375（2011），28- 41]。并且，我们明确地确定了数$r_Q(n^2)$以及任何整数$n$的简明公式。
英文摘要：
Let $r_Q(n)$ be the representation number of a nonnegative integer $n$ by the quaternary quadratic form $Q=x_1^2+2x_2^2+x_3^2+x_4^2+x_1x_3+x_1x_4+x_2x_4$. We first prove the identity $r_Q(p^2n)=r_Q(p^2)r_Q(n)/r_Q(1)$ for any prime $p$ different from 13 and any positive integer $n$ prime to $p$, which was conjectured in [Eum et al, A modularity criterion for Klein forms, with an application to modular forms of level 13, J. Math. Anal. Appl. 375 (2011), 28--41]. And, we explicitly determine a concise formula for the number $r_Q(n^2)$ as well for any integer $n$.
For $0\leq α<1$ and prime number $p$ let $L(α,p)$ be the sum of the first $[αp]$ values of Legendre symbol modulo $p$. We study positivity of $L(α,p)$ and prove that for $|α-\frac13|<2\cdot 10^{-6}$ and for rational $α\leq \frac12$ with denominators in the set $\{1,2,3,4,5,6,8,12\}$ the inequality $L(α,p)\geq 0$ holds for majority of primes.
We decrease the length of the shortest interval for which almost all even integers in it are the sum of two primes. This is achieved by applying a version of the Circle Method that uses two minorants together with a nonnegative model for one of them. Compared to Harman's previous strongest result of this type, we in this way do not need any vector sieve type inequality and so require neither additional majorants nor strong density requirements for the minorants.
For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets affording identical representation functions. We solve a recent problem of Lev and Chen.
Fix $α\in (0,1/3)$. We show that, from a topological point of view, almost all sets $A\subseteq \mathbb{N}$ have the property that, if $A^\prime=A$ for all but $o(n^α)$ elements, then $A^\prime$ is not a nontrivial sumset $B+C$. In particular, almost all $A$ are totally irreducible. In addition, we prove that the measure analogue holds with $α=1$.
We prove a conjecture posted in the Online Encyclopedia of Integer Sequences, namely that there are exactly five positive integers that can be written in more than one way as the sum of a nonnegative power of 2 and a nonnegative power of 3. The case for both powers being positive follows from a theorem of Bennett. We use elementary methods to prove the case where zero exponents are allowed.
We prove that for every nonnegative integer $m$ there exists an $\varepsilon>0$ such that if $λ\in (0,\varepsilon]$ and $x$ is sufficiently large in terms of $m$, then the number of positive integers $n\leq x$ for which the interval $[n,n+λ\log n]$ contains exactly $m$ primes is at least a constant times $x/\log x.$ This improves a result of T. Freiberg, when $λ$ is small.
Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let the representation function $R_{S}(n)$ denote the number of solutions of the equation $n=s+s'$ with $s, s'\in S$ and $s<s'$. In this paper, we determine the structure of $C, D\subseteq \mathbb{N}$ with $C\cup D=[0, m]$ and $|C\cap D|=2$ such that $R_{C}(n)=R_{D}(n)$ for any nonnegative integer $n$.
For a nonnegative integer $n$, and a prime $\wp$ in $\mathbb{F}_q[T]$, we prove a result that provides a method for computing the number of integers $m$ with $0 \le m \le n$ for which the Carlitz binomial coefficients $\binom{n}{m}_C$ fall into each of the residue classes modulo $\wp$. Our main result can be viewed as a function field analogue of the Garfield-Wilf theorem.
Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. For a $k$-tuple of positive integers $\underlineλ = (λ_{1}, \dots{} ,λ_{k})$ with $1 \le λ_{1} < λ_{2} < \dots{} < λ_{k}$, we define the additive representation function $R_{A,\underlineλ}(n) = |\{(a_{1}, \dots{} ,a_{k})\in A^{k}: λ_{1}a_{1} + \dots{} + λ_{k}a_{k} = n\}|$. For $k = 2$, Moser constructed a set $A$ of nonnegative integers such that $R_{A,\underlineλ}(n) = 1$ holds for every nonnegative integer $n$. In this paper we characterize all the $k$-tuples $\underlineλ$ and the sets $A$ of nonnegative integers with $…
Let $p>3$ be a prime, and let $(\frac{\cdot}p)$ be the Legendre symbol. Let $b\in\mathbb Z$ and $\varepsilon\in\{\pm 1\}$. We mainly prove that $$\left|\left\{N_p(a,b):\ 1<a<p\ \text{and}\ \left(\frac ap\right)=\varepsilon\right\}\right|=\frac{3-(\frac{-1}p)}2,$$ where $N_p(a,b)$ is the number of positive integers $x<p/2$ with $\{x^2+b\}_p>\{ax^2+b\}_p$, and $\{m\}_p$ with $m\in\mathbb{Z}$ is the least nonnegative residue of $m$ modulo $p$.
This paper is devoted to study some expressions of the type $\prod_{p} p^{\lfloor\frac{x}{f(p)}\rfloor}$, where $x$ is a nonnegative real number, $f$ is an arithmetic function satisfying some conditions, and the product is over the primes $p$. We begin by proving that such expressions can be expressed by using the $\mathrm{lcm}$ function, without any reference to prime numbers; we illustrate this result with several examples. The rest of the paper is devoted to study the two particular cases related to $f(m) = m$ and $f(m) = m - 1$. In both cases, we found arithmetic properties and analytic es…
Let $\mathbb{N}$ be the set of all nonnegative integers. For any integer $r$ and $m$, let $r+m\mathbb{N}=\{r+mk: k\in\mathbb{N}\}$. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_{S}(n)$ denote the number of solutions of the equation $n=s+s'$ with $s, s'\in S$ and $s<s'$. Let $r_{1}, r_{2}, m$ be integers with $0<r_{1}<r_{2}<m$ and $2\mid r_{1}$. In this paper, we prove that there exist two sets $C$ and $D$ with $C\cup D=\mathbb{N}$ and $C\cap D=(r_{1}+m\mathbb{N})\cup (r_{2}+m\mathbb{N})$ such that $R_{C}(n)=R_{D}(n)$ for all $n\in\mathbb{N}$ if and only if there exists a positive …
The equation $|p^x \pm q^y| = c$ in nonnegative $x$, $y$
通过允许$x$和$y$为零以及正值，我们改进了标题方程（其中$p$和$q$是素数，$c$是正整数）的早期工作。早期的工作的标题方程表明，除了列出的例外，有最多两个解决方案，在正整数$x$和$y$，使用初等方法。在这里，我们表明，与列出的例外情况下，有最多两个解决方案的非负整数$x$和$y$，但证明是依赖于非初等工作的Mittette，贝内特，卢卡，和Szalay。为了提供一些我们的结果与纯粹的初等证明，我们给简短的初等证明的结果卢卡，使可能的一个初等引理，也有一个应用程序熟悉的方程$x^2 + C = y^n$。我们也给Szalay的结果更短更简单的证明。最后给出了广义Pillai方程$(-1)^u r a^x + (-1)^v s b^y = c$解的个数的结果。
For nonempty sets $A,B$ of nonnegative integers and an integer $n$, let $r_{A,B}(n)$ be the number of representations of $n$ as $a+b$ and $d_{A,B}(n)$ be the number of representations of $n$ as $a-b$, where $a\in A, b\in B$. In this paper, we determine the sets $A,B$ such that $r_{A,B}(n)=1$ for every nonnegative integer $n$. We also consider the \emph{difference} structure and prove that: there exist sets $A$ and $B$ of nonnegative integers such that $r_{A,B}(n)\ge 1$ for all large $n$, $A(x)B(x)=(1+o(1))x$ and for any given nonnegative integer $c$, we have $d_{A,B}(n)=c$ for infinitely many …
Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which is not a multiple of $b$ and has only small (in a suitable sense) prime factors has at least four nonzero digits in its representation in base $b$.
We construct an infinite family of representations of finite groups with an irreducible adjoint action and we give an application to the question of lacunary of Frobenius traces in Galois representations.
Let us denote the nth difference between consecutive primes by d_n. The Prime Number Theorem clearly implies that d_n is logn on average. Paul Erdős conjectured about 60 years ago that the sequence d_n/logn is everywhere dense on the nonnegative part of the real line. He and independently G. Ricci proved in 1954-55 that the set J of limit points of the sequence {d_n/logn} has positive Lebesgue measure. The first and until now only concrete known element of J was proved to be the number zero in the work of Goldston, Yildirim and the present author. The author of the present note showed in 2013 …
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of an elliptic curve over a finite field $\mathbb F_q$. Further, a method is described which computes representations of primes from reduced quadratic forms by means of the integral roots of polynomials over $\mathbb Z$. Lastly, some progress is made on the still-unsettled general problem of deciding which primes are represented by which classes of quadratic f…
Let $n>1$, $e\geq 0$ and a prime number $p\geq 2^{n+2+2e}+3$, such that the index of regularity of $p$ is $\leq e$. We show that there are infinitely many irreducible Galois representations $ρ: Gal(\bar{\mathbb{Q}}/\mathbb{Q})\rightarrow {GL}_n(\mathbb{Q}_p)$ unramified at all primes $l\neq p$. Furthermore, these representations are shown to have image containing a fixed finite index subgroup of ${SL}_n(\mathbb{Z}_p)$. Such representations are constructed by lifting suitable residual representations $\barρ$ with image in the diagonal torus in ${GL}_n(\mathbb{F}_p)$, for which the global deform…
This article surveys modularity, level raising and level lowering questions for two-dimensional representations modulo prime powers of the absolute Galois group of the rational numbers. It contributes some new results and describes algorithms and a database of modular forms orbits and higher congruences.
本文研究了非负整数n和1/2的所有形式为（3 n +2）/（2n+1）的有理数生成的乘法半群.这个半群中的整数子半群称为野整数半群，野数是这个子半群中的不可约元。本文证明了除3以外的所有素数p都是野数。对于非负整数n，由形式为（3 n +2）/（2n+1）的有理数生成的乘法半群中的整数的子半群称为Wooley整数半群，其不可约元称为Wooley数。这个半群被证明是递归的，并制定了各种公开的问题关于Wooley整数。
We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$ [5] respectively. We use the same technique to study the corresponding problem for sums of just $k$ perfect $k$-th powers of primes.
In 1951, Linnik proved the existence of a constant $K$ such that every sufficiently large even number is the sum of two primes and at most $K$ powers of 2. Since then, this style of approximation has been considered for problems similar to the Goldbach conjecture. One such problem is the representation of a sufficiently large even number as a sum of four squares of primes and at most $k$ powers of two. In 2014, Zhao proved this to be true with $k = 46$. In this paper, we reduce this to $k = 31$.
In this paper, let $ϕ$ be the Drinfeld module over $\mathbb{F}_{q}(T)$ of prime rank $r$ defined by $$ϕ_T=T+τ^{r-1}+T^{q-1}τ^r.$$ We prove that under certain condition on $\mathbb{F}_q$, the adelic Galois representation $$ρ_ϕ:{\rm{Gal}}(\mathbb{F}_q(T)^{\rm{sep}}/\mathbb{F}_q(T))\longrightarrow \varprojlim_{\mathfrak{a}}{\rm{Aut}}(ϕ[\mathfrak{a}])\cong {\rm{GL_r}}(\widehat{A})$$ is surjective.
In this note, assuming a variant of the Generalized Riemann Hypothesis, which does not exclude the existence of real zeros, we prove an asymptotic formula for the mean value of the representation function for the sum of two primes in arithmetic progressions. This is an improvement of the result of F. Rüppel in 2009, and the generalization of the result of A. Languasco and A. Zaccagnini concerning the ordinary Goldbach problem in 2012.
Uniformly for small $q$ and $(a,q)=1$, we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to $a$ modulo $q$ and a square-free integer. Our method is based on the notion of local model developed by Ramaré and may be viewed as an abstract circle method.
