2013International Journal of Pure and Apllied MathematicsOpen access

GENERATION OF PRIME NUMBERS FROM ADVANCED SEQUENCE AND DECOMPOSITION METHODS

B.B. Samir, M.A. Zardari, Youssef A. Y. Rezk

Open full text 0 citations

Abstract

The generation of prime numbers cause the use of data encryption techniques, as major primal is needed for the generation of pairs of keys.This paper proposes two prime number generation methods which are based on sequence of prime numbers and decomposition of a prime number".In these proposed methods, co-prime and decomposition properties of prime number are used.By considering the co-prime property, any sequence of consecutive primes are coupled together to generate their co-prime numbers.Let n be a number which is co-prime with a sequence of m prime numbers, which can be expressed as:where m is a sequence of prime numbers and p i be the i th prime number, with p 1 = 1.In the second approach i.e decomposition of prime number, the objective is to generate new prime numbers using decomposition of primes.For all integer numbers represented by X less than p 2 m+1 are prime numbers, it is shown in the following formula.

Open-access reader

About this research paper

What this paper is about

The generation of prime numbers cause the use of data encryption techniques, as major primal is needed for the generation of pairs of keys.This paper proposes two prime number generation methods which are based on sequence of prime numbers and decomposition of a prime number".In these proposed methods, co-prime and decomposition properties of prime number are used.By considering the co-prime property, any sequence of consecutive primes are coupled together to generate their co-prime numbers.Let n be a number which is co-prime with a sequence of m prime numbers, which can be expressed as:where m is a sequence of prime numbers and p i be the i th prime number, with p 1 = 1.In the second approach i.e decomposition of prime number, the objective is to generate new prime numbers using decomposition of primes.For all integer numbers represented by X less than p 2 m+1 are prime numbers, it is shown in the following formula.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The generation of prime numbers cause the use of data encryption techniques, as major primal is needed for the generation of pairs of keys.This paper proposes two prime number generation methods which are based on sequence of prime numbers and decomposition of a prime number".In these proposed methods, co-prime and decomposition properties of prime number are used.By considering the co-prime property, any sequence of consecutive primes are coupled together to generate their co-prime numbers.Let n be a number which is co-prime with a sequence of m prime numbers, which can be expressed as:where m is a sequence of prime numbers and p i be the i th prime number, with p 1 = 1.In the second approach i.e decomposition of prime number, the objective is to generate new prime numbers using decomposition of primes.For all integer numbers represented by X less than p 2 m+1 are prime numbers, it is shown in the following formula.

Key concepts: Prime (order theory), Prime number, Sequence (biology), Mathematics, Decomposition, Combinatorics, Prime element, Prime factor

Related papers

Back to paper searchBrowse research topicsOriginal source
GENERATION OF PRIME NUMBERS FROM ADVANCED SEQUENCE AND DECOMPOSITION METHODS — Research Paper | ScholarLens