On formula to compute primes and the n th prime



Similar documents
On Formula to Compute Primes. and the n th Prime

Abraham Zaks. Technion I.I.T. Haifa ISRAEL. and. University of Haifa, Haifa ISRAEL. Abstract

Numerical Methods with MS Excel

The Digital Signature Scheme MQQ-SIG

ADAPTATION OF SHAPIRO-WILK TEST TO THE CASE OF KNOWN MEAN

Security Analysis of RAPP: An RFID Authentication Protocol based on Permutation

SHAPIRO-WILK TEST FOR NORMALITY WITH KNOWN MEAN

ANOVA Notes Page 1. Analysis of Variance for a One-Way Classification of Data

Fractal-Structured Karatsuba`s Algorithm for Binary Field Multiplication: FK

Credibility Premium Calculation in Motor Third-Party Liability Insurance

APPENDIX III THE ENVELOPE PROPERTY

ON SLANT HELICES AND GENERAL HELICES IN EUCLIDEAN n -SPACE. Yusuf YAYLI 1, Evren ZIPLAR 2. yayli@science.ankara.edu.tr. evrenziplar@yahoo.

On Error Detection with Block Codes

STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ " 1

Approximation Algorithms for Scheduling with Rejection on Two Unrelated Parallel Machines

IDENTIFICATION OF THE DYNAMICS OF THE GOOGLE S RANKING ALGORITHM. A. Khaki Sedigh, Mehdi Roudaki

The impact of service-oriented architecture on the scheduling algorithm in cloud computing

Statistical Pattern Recognition (CE-725) Department of Computer Engineering Sharif University of Technology

ECONOMIC CHOICE OF OPTIMUM FEEDER CABLE CONSIDERING RISK ANALYSIS. University of Brasilia (UnB) and The Brazilian Regulatory Agency (ANEEL), Brazil

A Study of Unrelated Parallel-Machine Scheduling with Deteriorating Maintenance Activities to Minimize the Total Completion Time

Constrained Cubic Spline Interpolation for Chemical Engineering Applications

Chapter = 3000 ( ( 1 ) Present Value of an Annuity. Section 4 Present Value of an Annuity; Amortization

A New Bayesian Network Method for Computing Bottom Event's Structural Importance Degree using Jointree

6.7 Network analysis Introduction. References - Network analysis. Topological analysis

A particle swarm optimization to vehicle routing problem with fuzzy demands

Maintenance Scheduling of Distribution System with Optimal Economy and Reliability

Preprocess a planar map S. Given a query point p, report the face of S containing p. Goal: O(n)-size data structure that enables O(log n) query time.

A Parallel Transmission Remote Backup System

Optimal multi-degree reduction of Bézier curves with constraints of endpoints continuity

Classic Problems at a Glance using the TVM Solver

Green Master based on MapReduce Cluster

Sequences and Series

Chapter 3. AMORTIZATION OF LOAN. SINKING FUNDS R =

M. Salahi, F. Mehrdoust, F. Piri. CVaR Robust Mean-CVaR Portfolio Optimization

Dynamic Two-phase Truncated Rayleigh Model for Release Date Prediction of Software

How To Value An Annuity

Forecasting Trend and Stock Price with Adaptive Extended Kalman Filter Data Fusion

IP Network Topology Link Prediction Based on Improved Local Information Similarity Algorithm

Three Dimensional Interpolation of Video Signals

An Approach to Evaluating the Computer Network Security with Hesitant Fuzzy Information

Fast, Secure Encryption for Indexing in a Column-Oriented DBMS

10/19/2011. Financial Mathematics. Lecture 24 Annuities. Ana NoraEvans 403 Kerchof

A DISTRIBUTED REPUTATION BROKER FRAMEWORK FOR WEB SERVICE APPLICATIONS

Average Price Ratios

THE McELIECE CRYPTOSYSTEM WITH ARRAY CODES. MATRİS KODLAR İLE McELIECE ŞİFRELEME SİSTEMİ

Using Phase Swapping to Solve Load Phase Balancing by ADSCHNN in LV Distribution Network

Projection model for Computer Network Security Evaluation with interval-valued intuitionistic fuzzy information. Qingxiang Li

Polyphase Filters. Section 12.4 Porat 1/39

Software Reliability Index Reasonable Allocation Based on UML

Curve Fitting and Solution of Equation

Numerical Comparisons of Quality Control Charts for Variables

Load and Resistance Factor Design (LRFD)

CHAPTER 2. Time Value of Money 6-1

Banking (Early Repayment of Housing Loans) Order,

where p is the centroid of the neighbors of p. Consider the eigenvector problem

Conversion of Non-Linear Strength Envelopes into Generalized Hoek-Brown Envelopes

MDM 4U PRACTICE EXAMINATION

1. MATHEMATICAL INDUCTION

The Gompertz-Makeham distribution. Fredrik Norström. Supervisor: Yuri Belyaev

Common p-belief: The General Case

Simple Linear Regression

A particle Swarm Optimization-based Framework for Agile Software Effort Estimation

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

of the relationship between time and the value of money.

The paper presents Constant Rebalanced Portfolio first introduced by Thomas

Automated Event Registration System in Corporation

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

Optimal Packetization Interval for VoIP Applications Over IEEE Networks

On Cheeger-type inequalities for weighted graphs

Chapter Eight. f : R R

1. The Time Value of Money

How To Balance Load On A Weght-Based Metadata Server Cluster

Suspicious Transaction Detection for Anti-Money Laundering

Settlement Prediction by Spatial-temporal Random Process

Statistical Intrusion Detector with Instance-Based Learning

3. Greatest Common Divisor - Least Common Multiple

Efficient Traceback of DoS Attacks using Small Worlds in MANET

CH. V ME256 STATICS Center of Gravity, Centroid, and Moment of Inertia CENTER OF GRAVITY AND CENTROID

Finito: A Faster, Permutable Incremental Gradient Method for Big Data Problems

AN ALGORITHM ABOUT PARTNER SELECTION PROBLEM ON CLOUD SERVICE PROVIDER BASED ON GENETIC

A Fair Non-repudiation Protocol without TTP on Conic Curve over Ring

ANALYTICAL MODEL FOR TCP FILE TRANSFERS OVER UMTS. Janne Peisa Ericsson Research Jorvas, Finland. Michael Meyer Ericsson Research, Germany

T = 1/freq, T = 2/freq, T = i/freq, T = n (number of cash flows = freq n) are :

DIGITAL AUDIO WATERMARKING: SURVEY

Real-Time Scheduling Models: an Experimental Approach

Load Balancing Control for Parallel Systems

Discrete-Event Simulation of Network Systems Using Distributed Object Computing

A probabilistic proof of a binomial identity

Integrating Production Scheduling and Maintenance: Practical Implications

Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications (JSAT), January Edition, 2011

10.5 Future Value and Present Value of a General Annuity Due

Transcription:

Joural's Ttle, Vol., 00, o., - O formula to compute prmes ad the th prme Issam Kaddoura Lebaese Iteratoal Uversty Faculty of Arts ad ceces, Lebao Emal: ssam.addoura@lu.edu.lb amh Abdul-Nab Lebaese Iteratoal Uversty chool of Egeerg, Lebao Emal: samh.abdulab@lu.edu.lb Abstract I ths paper, we propose a ew prmalty test, ad the we employ ths test to fd a formula for π that computes the umber of prmes wth ay terval. We fally propose a ew formula that computes the th prme umber as well as the et prme for ay gve umber. Keywords: prme, cogruece, prmalty test, Eucldea algorthm, seve of Eratosthees.. Itroducto ce Eucld [], prmes ad prme geerato were a challege of terest for umber theory researchers. Prmes are used may felds, oe ust eed to meto for eample the mportace of prmes etworg ad certfcate geerato []. ecurg commucato betwee two devces s acheved usg prmes sce prmes are the hardest to decpher [5]. The search for prme umbers s a cotuous tas for researchers. ome le [4] are loog for tw prmes others le [] are loog for large scaled prme umbers. The prme coutg fucto s a fucto that gves the umber of prmes that are less tha or equal to a gve umber. May le [] ad others have preseted the formula to compute the umber of prmes betwee ad a gve teger. Ths paper s dvded as follow: secto we preset the prmalty test. I secto 3, we troduce the prme coutg fucto that we wll use secto 5 to fd the et prme to ay gve umber. I secto 4, we coduct some results

ad buld the th prme fucto. I secto, we wll use the prmalty test to compare our results wth some recet results the lterature ad coclude ths paper.. Prmalty test I the paper, we employ the Euclda algorthm, eve of Eratosthees ad the fact that every prme s of the form where a teger. Let be a real umber, the floor of, deoted by s the largest teger that s less or equal to. To test the prmalty of t s eough to test the dvsblty of by all prmes. Let be of the form. mlarly, let be of the form. Theorem : If s ay teger such that g.c.d, = ad, the s prme f ad oly f s composte f ad oly f 0 Proof: s prme gcd, = mod 0, wth the rage of the summato the formulas of ad.

mlarly = ad cosequetly = The proof of the secod part of the theorem s obvous. 3. Prme Coutg Fucto The prme coutg fucto, deoted by the Gree letter π, s the umber of prmes less tha or equal to a gve umber. Computg the prmes s oe of the most fudametal problems umber theory. You ca see [0] for the latest wors regardg prme coutg fuctos. Usg the prevous prmalty test, we defe the followg ew form of the prme coutg fucto π. Recall that f s prme 3. 0 f s composte The couts the prmes betwee m ad where m. m Ad we ca wrte a formula for π as follows : 4 3. The sze of ths summato ca be dramatcally reduced by cosderg oly of the form +5 or +. 4 3.3 Thus the followg theorem s already proved. Theorem 5:, gves the umber of prmes. 4. The th Prme Fucto We are ow ready to troduce our ew formula to fd the th prme. The th prme umber s deoted by p wth p =, p =3, p 3 = 5 ad so o. Frst we troduce f as follows

f For =,, 3 ad = 0,,... 4. Or f For =,, 3 ad = 0,,... 4. These fuctos have the property that for for f 0 4.3 It s well ow that P ; see [8] ad [] for more detals. Usg the followg formula combed wth the above formula for π f P 4.4 We use f as 4. to obta the followg formula for th prme full: 4 P 4 3 P 4.5 Or usg f as 4. to obta the formula for th prme full: 5 P 4. These formulas are terms of aloe ad we do ot eed to ow ay of the prevous prmes. ee [] for formulas of the same ature.

The Wolfram Mathematca mplemetato of P as 4.5 s as follow: A[_] := -/Floor[Floor[qrt[]]/] + * um[floor[floor[/ + ] - / + ], {,, Floor[Floor[qrt[]]/] + }] B[_] := -/Floor[Floor[qrt[]]/] + * um[floor[floor[/ - ] - / - ], {,, Floor[Floor[qrt[]]/] + }] [_] := A[] + B[]/ PN[_] := 4 + um[floor[[ + ]], {,, Floor[ - /]}] + um[floor[[ - ]], {,, Floor[ + /]}] PT[_] := 3 + Floor[*Log[]] - um[floor[/*4 + um[floor[[ + ]], {,, Floor[ - /]}] + um[floor[[ - ]], {,, Floor[ + /]}]], {,, Floor[*Log[]] + }] 5. Net Prme The fucto etp fds the frst prme umber that s greater tha a gve umber. As [9] ad usg as defed secto, t s clear that: ad ow cosder the summato etp etp 0 such that etp etp = 0 etp fally we obta etp etp etp 5. We used the proposed prmalty test to mplemet etp as follow: et m m et 3 If the go to step 8 4 et m 5 5 If m the go to step 8 Go to step 8 Output the value of m

The Wolfram Mathematca mplemetato of etp s as follow: A[_] := -/Floor[Floor[qrt[]]/] + * um[floor[floor[/ + ] - / + ], {,, Floor[Floor[qrt[]]/] + }] B[_] := -/Floor[Floor[qrt[]]/] + * um[floor[floor[/ - ] - / - ], {,, Floor[Floor[qrt[]]/] + }] [_] := A[] + B[]/ =Iput["Iput a umber:"]; =Celg[-/]; m=0; Whle[True, m=+; If[[m]==,Brea[]]; m=+5; If[[m]==,Brea[]]; =+;]. Epermetal Results We mplemeted our algorthm usg Wolfram Mathematca verso 8. Table shows the results for the th prme whle table shows the results for the et prme. Those epermetal results show the complety of our prmalty test Refereces th prme P Value 50 4.s 9 00 5.58s 54 00.9s 3 50 8.4s 583 Table : th prme Net prme Net to etp Value 0^8 0.04s 0000000 0^9 0.8s 00000000 0^0.0s 000000009 0^.0s 00000000003 0^ 43.8s 000000000039 0^3 3.4 000000000003 Table : Net prme [] ANI. ANI X9.3-998: Dgtal gatures usg Reversble Publc Key Cryptography for the Facal ervces Idustry. Apped A, Amerca Natoal tadards Isttute, 998

[] C. P. Wllas, O Formulae for the th Prme Number, The Mathematcal Gazette, Vol. 48, No. 3, December, 94, 43-45 [3] E.. Rowlad, A Natural Prme-Geeratg Recurrece, Joural of Iteger equeces, Vol., 008, Artcle 08..8 [4] G. Teebaum, ad M.M. Frace, The prme umbers ad ther dstrbuto. Provdece, Amerca Mathematcal ocety. RI, 000. [5] IEEE. IEEE P33: tadard pecfcatos for Publc Key Cryptography. IEEE P33a D, Amedmet : Addtoal Techques. December, 00. [] M. Deléglse ad J. Rvet. Computg π: The Messel, Lehmer, Lagaras, Mller, Odlyzo Method. Mathematcs of computg. Vol. 5, 99, 35-45 [] M. Joye, P. Paller ad. Vaudeay. Effcet Geerato of Prme Numbers, vol. 95 of Lecture Notes Computer cece, 000, 340-354, prger-verlag. [8]. M. Ruz, Applcatos of maradache Fuctos ad Prme ad Coprme Fuctos, Amerca Research Press, Rehoboth, 00. [9]. M. Ruz, The geeral term of the prme umber sequece ad the maradache Prme Fucto, maradache Notos Joural 000 59. [0] T. Olvera e lva, Computg π: The combatoral method. Revsta do Detua, vol. 4,, march 00 [] V.. Igumov, Geerato of the large radom prme umbers. Toms tate Uversty Russa. Electro Devces ad Materals. 004, - 8 [] W. Narewcz, The developmet of prme umber theory: from Eucld to Hardy ad Lttlewood, prger Moographs Mathematcs, Berl, New Yor: prger-verlag, 000