• Title/Summary/Keyword: the sum of primes

Search Result 7, Processing Time 0.018 seconds

ON THE PRIMES WITH $P_{n+1}-P_n = 8$ AND THE SUM OF THEIR RECIPROCALS

  • Lee Heon-Soo;Park Yeon-Yong
    • Journal of applied mathematics & informatics
    • /
    • v.22 no.1_2
    • /
    • pp.441-452
    • /
    • 2006
  • We introduce the counting function ${\pi}^*_{2.8}(x)$ of the primes with difference 8 between consecutive primes ($p_n,\;p_{n+l}=p_n+8$) can be approximated by logarithm integral $Li^*_{2.8}$. We calculate the values of ${\pi}^*_{2.8}(x)$ and the sum $C_{2,8}(x)$ of reciprocals of primes with difference 8 between consecutive primes $p_n,\;p_{n+l}=p_n+8$ where x is counted up to $7{\times}10^{10}$. From the results of these calculations. we obtain ${\pi}^*_{2.8}(7{\times}10^{10}$)= 133295081 and $C_{2.8}(7{\times}10^{10}) = 0.3374{\pm}2.6{\times}10^{-4}$.

ON THE SEVERAL DIFFERENCES BETWEEN PRIMES

  • Park, Yeonyong;Lee, Heonsoo
    • Journal of applied mathematics & informatics
    • /
    • v.13 no.1_2
    • /
    • pp.37-51
    • /
    • 2003
  • Enumeration of the primes with difference 4 between consecutive primes, is counted up to 5${\times}$10$\^$10/, yielding the counting function ,r2,4(5${\times}$10$\^$10/) = l18905303. The sum of reciprocals of primes with gap 4 between consecutive primes is computed B$_4$(5 ${\times}$ 10$\^$10/) = 1.1970s4473029 and B$_4$ = 1.197054 ${\pm}$ 7 ${\times}$ 10$\^$-6/. And Enumeration of the primes with difference 6 between consecutive primes, is counted up to 5${\times}$10$\^$10/, yielding the counting function $\pi$$\_$2.6/(5${\times}$10$\^$10/) = 215868063. The sum of reciprocals of primes with gap 6 between consecutive primes is computed B$\_$6/(5${\times}$10$\^$10/) = 0.93087506039231 and B$\_$6/ = 1.135835 ${\pm}$ 1.2${\times}$10$\^$-6/.

A study on the approximation function for pairs of primes with difference 10 between consecutive primes (연속하는 두 소수의 차가 10인 소수 쌍에 대한 근사 함수에 대한 연구)

  • Lee, Heon-Soo
    • Journal of Internet of Things and Convergence
    • /
    • v.6 no.4
    • /
    • pp.49-57
    • /
    • 2020
  • In this paper, I provided an approximation function Li*2,10(x) using logarithm integral for the counting function π*2,10(x) of consecutive deca primes. Several personal computers and Mathematica were used to validate the approximation function Li*2,10(x). I found the real value of π*2,10(x) and approximate value of Li*2,10(x) for various x ≤ 1011. By the result of theses calculations, most of the error rates are margins of error of 0.005%. Also, I proved that the sum C2,10(∞) of reciprocals of all primes with difference 10 between primes is finite. To find C2,10(∞), I computed the sum C2,10(x) of reciprocals of all consecutive deca primes for various x ≤ 1011 and I estimate that C2,10(∞) probably lies in the range C2,10(∞)=0.4176±2.1×10-3.

The Prime Counting Function (소수계량함수)

  • Lee, Sang-Un;Choi, Myeong-Bok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.101-109
    • /
    • 2011
  • The Riemann's zeta function $\zeta(s)$ has been known as answer for a number of primes $\pi$(x) less than given number x. In prime number theorem, there are another approximation function $\frac{x}{lnx}$,Li(x), and R(x). The error about $\pi$(x) is R(x) < Li(x) < $\frac{x}{lnx}$. The logarithmic integral function is Li(x) = $\int_{2}^{x}\frac{1}{lnt}dt$ ~ $\frac{x}{lnx}\sum\limits_{k=0}^{\infty}\frac{k!}{(lnx)^k}=\frac{x}{lnx}(1+\frac{1!}{(lnx)^1}+\frac{2!}{(lnx)^2}+\cdots)$. This paper shows that the $\pi$(x) can be represent with finite Li(x), and presents generalized prime counting function $\sqrt{{\alpha}x}{\pm}{\beta}$. Firstly, the $\pi$(x) can be represent to $Li_3(x)=\frac{x}{lnx}(\sum\limits_{t=0}^{{\alpha}}\frac{k!}{(lnx)^k}{\pm}{\beta})$ and $Li_4(x)=\lfloor\frac{x}{lnx}(1+{\alpha}\frac{k!}{(lnx)^k}{\pm}{\beta})}k\geq2$ such that $0{\leq}t{\leq}2k$. Then, $Li_3$(x) is adjusted by $\pi(x){\simeq}Li_3(x)$ with ${\alpha}$ and error compensation value ${\beta}$. As a results, this paper get the $Li_3(x)=Li_4(x)=\pi(x)$ for $x=10^k$. Then, this paper suggests a generalized function $\pi(x)=\sqrt{{\alpha}x}{\pm}{\beta}$. The $\pi(x)=\sqrt{{\alpha}x}{\pm}{\beta}$ function superior than Riemann's zeta function in representation of prime counting.