<ruby id="d9npn"></ruby>

      <sub id="d9npn"><progress id="d9npn"></progress></sub>

      <nobr id="d9npn"></nobr>

      <rp id="d9npn"><big id="d9npn"><th id="d9npn"></th></big></rp>

      <th id="d9npn"><meter id="d9npn"></meter></th>

      Questions tagged [prime-numbers]

      Questions where prime numbers play a key-role, such as: questions on the distribution of prime numbers (twin primes, gaps between primes, Hardy–Littlewood conjectures, etc); questions on prime numbers with special properties (Wieferich prime, Wolstenholme prime, etc.). This tag is often used as a specialized tag in combination with the top-level tag nt.number-theory and (if applicable) analytic-number-theory.

      Filter by
      Sorted by
      Tagged with
      1
      vote
      0answers
      64 views

      Convergence with the recurrence $T_{n+1}=T_n^2-T_n+\frac{n}{p_n}$

      For each integer $n\geq 1$ I define the recurrence $$T_{n+1}=T_n^2-T_n+\frac{n}{p_n},$$ with $T_1=1$, where $p_k$ denotes the $k-th$ prime. So multiplying by $(-1)^n$ and telecoping gives that for ...
      2
      votes
      0answers
      101 views

      Prime numbers and sieving up to $q(x)=\log(x)(1+o(1))$

      Let $x,z\in\mathbb{R}_{+}$ Let $P_z = \displaystyle{\small \prod_{\substack{p \leq z \\ \text{p prime}}} {\normalsize p}}$ Let $I(x, z)=\{k \in \mathbb{N} \, | \, k \leq x \text{ and } \gcd(k, P_z)=...
      3
      votes
      0answers
      202 views

      Complexity of representations of sets using elementary functions

      Fermat conjectured that $2^{2^n}+1$ is prime for every $n \in \mathbb{N}.$ Before even knowing about Euler's counterexample (that $2^{32}+1 = 641 \cdot 6700417$), you could possibly say that Fermat ...
      1
      vote
      0answers
      78 views

      From Firoozbakht's conjecture to set interesting conjectures for sequences or series of primes

      In this post we denote the $k-th$ prime number as $p_k$. I present two conjectures, the first about the asymptotic behaviour of a product and the other about an alternating series. I don't know if ...
      0
      votes
      0answers
      28 views

      On values of $n\geq 1$ satisfying that for all primorial $N_k$ less than $n$ the difference $n-N_k$ is a prime number

      In this post I present a similar question that shows section A19 of [1], I was inspired in it to define my sequence and question. I am asking about it since I think that the problem that arises from ...
      4
      votes
      0answers
      72 views

      Is the ratio of a number to the variance of its divisors injective?

      The variance $v_n$ of a natural number $n$ is defined as the variance of its divisors. There are distinct integer whose variances are equal e,g. $v_{691} = v_{817}$. However I observed that for $n \le ...
      -1
      votes
      0answers
      48 views

      Primes in Arithmetic Sequence [closed]

      An arithmetic sequence with 10 terms has common difference d. if the absolute value of each term is a prime number, find the smallest possible value of d.
      0
      votes
      1answer
      53 views

      On the integral $I_s = \int_{1}^{\infty} (\pi(x)-Li(x))x^{-s-1} \mathrm{d}x$-follow up question

      This is a follow up on On the integral $I_s =\int_{1}^{\infty} (\pi(x)-Li(x))x^{-s-1} dx$ According to the answer that i got, $I_s$ is not known to converge for any real $s<1$. But suppose $I_s$ ...
      2
      votes
      2answers
      140 views

      On the integral $I_s =\int_{1}^{\infty} (\pi(x)-Li(x))x^{-s-1} dx$

      Define $\pi(x)$ to be the prime counting function and Li(x) the logarithmic integral. Let $I_s$ be defined as above. Is $I_s$ known to be convergent for any real number $s<1$ ?
      0
      votes
      0answers
      59 views

      Is it possible to get a conjecture similar to Mandl's conjecture for a different arithmetic function of number theory, mainly related to primes?

      I'm curious to know if are in the literature analogous conjectures to the conjecture due to Mandl, I ask about these analogous conjectures for different sequences playing an important role in number ...
      3
      votes
      2answers
      377 views

      On the product $\prod_{k=1}^{(p-1)/2}(x-e^{2\pi i k^2/p})$ with $x$ a root of unity

      Let $p$ be an odd prime. Dirichlet's class number formula for quadratic fields essentially determines the value of the product $\prod_{k=1}^{(p-1)/2}(1-e^{2\pi ik^2/p})$. I think it is interesting to ...
      25
      votes
      2answers
      1k views

      Is there a Kolmogorov complexity proof of the prime number theorem?

      Lance Fortnow uses Kolmorogov complexity to prove an Almost Prime Number Theorem (https://lance.fortnow.com/papers/files/kaikoura.pdf, after theorem $2.1$): the $i$th prime is at most $i(\log i)^2$. ...
      1
      vote
      0answers
      44 views

      What about series involving strong primes?

      I know about the importance in analytic number theory of the sutdy of series involving prime numbers or constellations of prime numbers, for example, if I am not wrong, major theorems are Mertens' ...
      9
      votes
      1answer
      316 views

      A conjectural formula for the class number of the field $\mathbb Q(\sqrt{-p})$ with $p\equiv3\pmod8$

      Question. Is my following conjecture new? How to prove it? Conjecture. Let $p>3$ be a prime with $p\equiv3\pmod 8$, and let $h(-p)$ denote the class number of the imaginary quadratic field $\...
      2
      votes
      0answers
      65 views

      An attempt to get a variant of Agoh–Giuga conjecture

      The idea of this post is an attempt to explore a variant of the so-called Agoh–Giuga conjecture. In past days, and today, I tried to think about variants of this conjecture exploring congruences about ...

      15 30 50 per page
      特码生肖图
      <ruby id="d9npn"></ruby>

          <sub id="d9npn"><progress id="d9npn"></progress></sub>

          <nobr id="d9npn"></nobr>

          <rp id="d9npn"><big id="d9npn"><th id="d9npn"></th></big></rp>

          <th id="d9npn"><meter id="d9npn"></meter></th>

          <ruby id="d9npn"></ruby>

              <sub id="d9npn"><progress id="d9npn"></progress></sub>

              <nobr id="d9npn"></nobr>

              <rp id="d9npn"><big id="d9npn"><th id="d9npn"></th></big></rp>

              <th id="d9npn"><meter id="d9npn"></meter></th>

              财神捕鱼最新版 2016山东时时诈骗案 内蒙古时时快三开奖 天津时时是随机 幸运时时彩计划网 三分赛车走势图查询 香港开马开奖现场直播 11选5走势图安徽时时 吉林时时电子走势图 时时彩下载手机版