104 research outputs found

    Applications of some exponential sums on prime powers: a survey

    Full text link
    A survey paper on some recent results on additive problems with prime powers

    Efficient computation of the Euler-Kronecker constants of prime cyclotomic fields

    Full text link
    We introduce a new algorithm, which is faster and requires less computing resources than the ones previously known, to compute the Euler-Kronecker constants Gq\mathfrak{G}_q for the prime cyclotomic fields Q(ζq)\mathbb{Q}(\zeta_q), where qq is an odd prime and ζq\zeta_q is a primitive qq-root of unity. With such a new algorithm we evaluated Gq\mathfrak{G}_q and Gq+\mathfrak{G}_q^+, where Gq+\mathfrak{G}_q^+ is the Euler-Kronecker constant of the maximal real subfield of Q(ζq)\mathbb{Q}(\zeta_q), for some very large primes qq thus obtaining two new negative values of Gq\mathfrak{G}_q: G9109334831=0.248739\mathfrak{G}_{9109334831}= -0.248739\dotsc and G9854964401=0.096465\mathfrak{G}_{9854964401}= -0.096465\dotsc We also evaluated Gq\mathfrak{G}_q and Gq+\mathfrak{G}^+_q for every odd prime q106q\le 10^6, thus enlarging the size of the previously known range for Gq\mathfrak{G}_q and Gq+\mathfrak{G}^+_q. Our method also reveals that difference GqGq+\mathfrak{G}_q - \mathfrak{G}^+_q can be computed in a much simpler way than both its summands, see Section 3.4. Moreover, as a by-product, we also computed Mq=maxχχ0L/L(1,χ)M_q=\max_{\chi\ne \chi_0} \vert L^\prime/L(1,\chi) \vert for every odd prime q106q\le 10^6, where L(s,χ)L(s,\chi) are the Dirichlet LL-functions, χ\chi run over the non trivial Dirichlet characters mod qq and χ0\chi_0 is the trivial Dirichlet character mod qq. As another by-product of our computations, we will also provide more data on the generalised Euler constants in arithmetic progressions. The programs used to performed the computations here described and the numerical results obtained are available at the following web address: \url{http://www.math.unipd.it/~languasc/EK-comput.html}.Comment: 25 pages, 6 tables, 4 figures. Third known example of negative values for Ek(q) inserted. Complete set of computation of Ek(q) and Ek(q)^+ for every prime up to 10^6; computation of max|L'/L(1,chi)| for the same primes inserted. Two references added, typos correcte

    Sums of four prime cubes in short intervals

    Full text link
    We prove that a suitable asymptotic formula for the average number of representations of integers n=p13+p23+p33+p43n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}, where p1,p2,p3,p4p_1,p_2,p_3,p_4 are prime numbers, holds in intervals shorter than the the ones previously known.Comment: Unconditional result improved by using a Robert-Sargos estimate (lemmas 6-7); more detailed proof of Lemma 5 inserted. Correction of a typo. 10 page

    A Diophantine problem with prime variables

    Full text link
    We study the distribution of the values of the form λ1p1+λ2p2+λ3p3k\lambda_1 p_1 + \lambda_2 p_2 + \lambda_3 p_3^k, where λ1\lambda_1, λ2\lambda_2 and λ3\lambda_3 are non-zero real number not all of the same sign, with λ1/λ2\lambda_1 / \lambda_2 irrational, and p1p_1, p2p_2 and p3p_3 are prime numbers. We prove that, when 1<k<4/31 < k < 4 / 3, these value approximate rather closely any prescribed real number.Comment: submitte

    A Ces\`aro Average of Goldbach numbers

    Full text link
    Let Λ\Lambda be the von Mangoldt function and (rG(n)=m1+m2=nΛ(m1)Λ(m2))(r_G(n) = \sum_{m_1 + m_2 = n} \Lambda(m_1) \Lambda(m_2)) be the counting function for the Goldbach numbers. Let N2N \geq 2 be an integer. We prove that nNrG(n)(1n/N)kΓ(k+1)=N2Γ(k+3)2ρΓ(ρ)Γ(ρ+k+2)Nρ+1+ρ1ρ2Γ(ρ1)Γ(ρ2)Γ(ρ1+ρ2+k+1)Nρ1+ρ2+Ok(N1/2),\begin{align} &\sum_{n \le N} r_G(n) \frac{(1 - n/N)^k}{\Gamma(k + 1)} = \frac{N^2}{\Gamma(k + 3)} - 2 \sum_\rho \frac{\Gamma(\rho)}{\Gamma(\rho + k + 2)} N^{\rho+1}\\ &\qquad+ \sum_{\rho_1} \sum_{\rho_2} \frac{\Gamma(\rho_1) \Gamma(\rho_2)}{\Gamma(\rho_1 + \rho_2 + k + 1)} N^{\rho_1 + \rho_2} + \mathcal{O}_k(N^{1/2}), \end{align} for k>1k > 1, where ρ\rho, with or without subscripts, runs over the non-trivial zeros of the Riemann zeta-function ζ(s)\zeta(s).Comment: submitte

    On the constant in the Mertens product for arithmetic progressions. I. Identities

    Full text link
    The aim of the paper is the proof of new identities for the constant in the Mertens product for arithmetic progressions. We deal with the problem of the numerical computation of these constants in another paper.Comment: References added, misprints corrected. 9 page

    The number of Goldbach representations of an integer

    Full text link
    We prove the following result: Let N2N \geq 2 and assume the Riemann Hypothesis (RH) holds. Then n=1NR(n)=N222ρNρ+1ρ(ρ+1)+O(Nlog3N), \sum_{n=1}^{N} R(n) =\frac{N^{2}}{2} -2 \sum_{\rho} \frac{N^{\rho + 1}}{\rho (\rho + 1)} + O(N \log^{3}N), where ρ=1/2+iγ\rho=1/2+i\gamma runs over the non-trivial zeros of the Riemann zeta function ζ(s)\zeta(s)

    A Ces\`aro Average of Hardy-Littlewood numbers

    Full text link
    Let Λ\Lambda be the von Mangoldt function and rHL(n)=m1+m22=nΛ(m1),r_{\textit{HL}}(n) = \sum_{m_1 + m_2^2 = n} \Lambda(m_1), be the counting function for the Hardy-Littlewood numbers. Let NN be a sufficiently large integer. We prove that nNrHL(n)(1n/N)kΓ(k+1)=π1/22N3/2Γ(k+5/2)12NΓ(k+2)π1/22ρΓ(ρ)Γ(k+3/2+ρ)N1/2+ρ+1/2ρΓ(ρ)Γ(k+1+ρ)Nρ+N3/4k/2πk+11Jk+3/2(2πN1/2)k+3/2N1/4k/2πkρΓ(ρ)Nρ/2πρ1Jk+1/2+ρ(2πN1/2)k+1/2+ρ+Ok(1).\begin{align}\sum_{n \le N} r_{\textit{HL}}(n) \frac{(1 - n/N)^k}{\Gamma(k + 1)} &= \frac{\pi^{1 / 2}}2 \frac{N^{3 / 2}}{\Gamma(k + 5 / 2)} - \frac 12 \frac{N}{\Gamma(k + 2)} - \frac{\pi^{1 / 2}}2 \sum_{\rho} \frac{\Gamma(\rho)}{\Gamma(k + 3 / 2 + \rho)} N^{1 / 2 + \rho}\\ &+ 1/2 \sum_{\rho} \frac{\Gamma(\rho)}{\Gamma(k + 1 + \rho)} N^{\rho} + \frac{N^{3 / 4 - k / 2}}{\pi^{k + 1}} \sum_{\ell \ge 1} \frac{J_{k + 3 / 2} (2 \pi \ell N^{1 / 2})}{\ell^{k + 3 / 2}}\\ &- \frac{N^{1 / 4 - k / 2}}{\pi^k} \sum_{\rho} \Gamma(\rho) \frac{N^{\rho / 2}}{\pi^\rho} \sum_{\ell \ge 1} \frac{J_{k + 1 / 2 + \rho} (2 \pi \ell N^{1 / 2})} {\ell^{k + 1 / 2 + \rho}} + \mathcal{O}_k(1).\end{align} for k>1k > 1, where ρ\rho runs over the non-trivial zeros of the Riemann zeta-function ζ(s)\zeta(s) and Jν(u)J_{\nu} (u) denotes the Bessel function of complex order ν\nu and real argument uu.Comment: submitte

    Sum of one prime and two squares of primes in short intervals

    Get PDF
    Assuming the Riemann Hypothesis we prove that the interval [N,N+H][N, N + H] contains an integer which is a sum of a prime and two squares of primes provided that HC(logN)4H \ge C (\log N)^{4}, where C>0C > 0 is an effective constant.Comment: removed unconditional case; other minor changes inserte
    corecore