scholarly journals Successive Addition of Digits of an Integer Number: On Properties and Role in Studying Distribution of Primes

2020 ◽  
Author(s):  
Manish Khare ◽  
Kalyanlakshmi Chitta
Keyword(s):  
Number Theory ◽  
Prime Numbers ◽  
Integer Number ◽  
Distribution Of Primes ◽  
Mathematical Functions ◽  
Single Digit ◽  
Successive Addition ◽  
Goldbach Problem ◽  
Multiplication Property ◽  
Mathematical Applications

Successive-addition-of-digits-of-a-number(SADN) refers to the process of adding up the digits of an integer number until a single digit is obtained. Concept of SADN has been occasionally identified but seldom employed in extensive mathematical applications. This paper discusses SADN and its properties in terms of addition, subtraction and multiplication. Further, the paper applies the multiplication-property of SADN to understand the distribution of prime numbers. For this purpose the paper introduces three series of numbers -S1, S3 and S5 series- into which all odd numbers can be placed, depending on their SADN and the rationale of such classification. Extending the analysis the paper explains how composite numbers of the S1 and S5 series can be derived. Based on this discussion it concludes that even as the concept of SADN is rather simple in its formulation and appears as an obvious truism but a profound analysis of the properties of SADN in terms of fundamental mathematical functions reveals that SADN holds a noteworthy position in number theory and may have significant implications for unfolding complex mathematical questions like understanding the distribution of prime numbers and Goldbach-problem.

scholarly journals Successive Addition of Digits of an Integer Number: On Properties and Role in Studying Distribution of Primes

2020 ◽  
Author(s):  
Manish Khare ◽  
Kalyanlakshmi Chitta
Keyword(s):  
Number Theory ◽  
Prime Numbers ◽  
Integer Number ◽  
Distribution Of Primes ◽  
Mathematical Functions ◽  
Single Digit ◽  
Successive Addition ◽  
Goldbach Problem ◽  
Multiplication Property ◽  
Mathematical Applications

Successive-addition-of-digits-of-a-number(SADN) refers to the process of adding up the digits of an integer number until a single digit is obtained. Concept of SADN has been occasionally identified but seldom employed in extensive mathematical applications. This paper discusses SADN and its properties in terms of addition, subtraction and multiplication. Further, the paper applies the multiplication-property of SADN to understand the distribution of prime numbers. For this purpose the paper introduces three series of numbers -S1, S3 and S5 series- into which all odd numbers can be placed, depending on their SADN and the rationale of such classification. Extending the analysis the paper explains how composite numbers of the S1 and S5 series can be derived. Based on this discussion it concludes that even as the concept of SADN is rather simple in its formulation and appears as an obvious truism but a profound analysis of the properties of SADN in terms of fundamental mathematical functions reveals that SADN holds a noteworthy position in number theory and may have significant implications for unfolding complex mathematical questions like understanding the distribution of prime numbers and Goldbach-problem.

scholarly journals Identification of Composite Combinations: Key to Validate Goldbach Conjecture

2020 ◽  
Author(s):  
Manish Khare ◽  
Kalyanlakshmi Chitta
Keyword(s):  
Prime Number ◽  
Prime Numbers ◽  
Integer Number ◽  
Multiplicative Property ◽  
General Terms ◽  
Successive Addition ◽  
Detailed Method ◽  
Cyclical Pattern ◽  
General Method

This paper discusses a possible approach to validate the Goldbach conjucture which states that all even numbers can be expressed as a summation of two prime numbers. For this purpose the paper begins with the concept of successive-addition-of-digits-of-an-integer-number (SADN) and its properties in terms of basic algebraic functions like addition, multiplication and subtraction. This concept of SADN forms the basis for classifying all odd numbers into 3 series- the S1, S3 and S5 series- which comprise of odd numbers of SADN(7,4,1), SADN(3,9,6) and SADN(5,2,8) respectively and follow a cyclical order. The S1 and S5 series are of interest in the analysis since they include both prime and composite numbers while the S3 series exclusively consists of composite numbers. Furthermore, the multiplicative property of SADN shows why composites on the S1 series are derived as products of intra-series elements of the S1 and S5 series while composites on the S5 series are derived as products of inter-series elements of the S1 and S5 series. The role of SADN is also important in determining the relevant series for identifying the combination of primes for a given even number since it shows why such combinations for even numbers of SADN(1,4,7) will be found on the S5 series while those for even numbers of SADN(2,5,8) will lie on the S1 series and both the series have a role to play in identifying the prime number combinations for even numbers with SADN(3,6,9). Thereafter, the analysis moves to calculating the total number of acceptable combinations for a given even number that would include combinations in the nature of two composites (c1+c2), one prime and one composite (p+c) and two primes (p1+p2). A cyclical pattern followed by even numbers is also discussed in this context. Identifying the c1+c2 and p+c combinations and thereafter subtracting them from the total number of combinations will yield the number of p1+p2 combinations. For this purpose the paper discusses a general method to calculate the number of composites on the S1 and S5 series for a given number and provides a detailed method for deriving the number of c1+c2 combinations. The paper presents this analysis as a proof to validate the Goldbach conjecture. Since even numbers can be of SADN 1 to 9 and the relation between nTc (i.e. total number of acceptable combinations) and nc(i.e. number of composites) for all even numbers can either be of nTc > nc or nTc ≤ nc, the paper shows that the Goldbach conjecture is true for both these categories of even numbers. In this manner this analysis is totally inclusive of all even numbers in general terms and since the analysis of every even number is common in methodology but unique in compilation, apart from being totally inclusive, it is also mutually exclusive in nature. This proves that the Goldbach conjecture which states that all even numbers can be expressed as atleast one combination of two prime numbers holds true for all even numbers, across all categories possible. Additionally this approach proves that the identification of p1+p2 combinations which would validate the Goldbach conjecture lies in the identification of c1+c2 combinations.

scholarly journals Identification of Composite Combinations: Key to Validate Goldbach Conjecture

2020 ◽  
Author(s):  
Manish Khare ◽  
Kalyanlakshmi Chitta
Keyword(s):  
Prime Number ◽  
Prime Numbers ◽  
Integer Number ◽  
Multiplicative Property ◽  
General Terms ◽  
Successive Addition ◽  
Detailed Method ◽  
Cyclical Pattern ◽  
General Method

This paper discusses a possible approach to validate the Goldbach conjucture which states that all even numbers can be expressed as a summation of two prime numbers. For this purpose the paper begins with the concept of successive-addition-of-digits-of-an-integer-number (SADN) and its properties in terms of basic algebraic functions like addition, multiplication and subtraction. This concept of SADN forms the basis for classifying all odd numbers into 3 series- the S1, S3 and S5 series- which comprise of odd numbers of SADN(7,4,1), SADN(3,9,6) and SADN(5,2,8) respectively and follow a cyclical order. The S1 and S5 series are of interest in the analysis since they include both prime and composite numbers while the S3 series exclusively consists of composite numbers. Furthermore, the multiplicative property of SADN shows why composites on the S1 series are derived as products of intra-series elements of the S1 and S5 series while composites on the S5 series are derived as products of inter-series elements of the S1 and S5 series. The role of SADN is also important in determining the relevant series for identifying the combination of primes for a given even number since it shows why such combinations for even numbers of SADN(1,4,7) will be found on the S5 series while those for even numbers of SADN(2,5,8) will lie on the S1 series and both the series have a role to play in identifying the prime number combinations for even numbers with SADN(3,6,9). Thereafter, the analysis moves to calculating the total number of acceptable combinations for a given even number that would include combinations in the nature of two composites (c1+c2), one prime and one composite (p+c) and two primes (p1+p2). A cyclical pattern followed by even numbers is also discussed in this context. Identifying the c1+c2 and p+c combinations and thereafter subtracting them from the total number of combinations will yield the number of p1+p2 combinations. For this purpose the paper discusses a general method to calculate the number of composites on the S1 and S5 series for a given number and provides a detailed method for deriving the number of c1+c2 combinations. The paper presents this analysis as a proof to validate the Goldbach conjecture. Since even numbers can be of SADN 1 to 9 and the relation between nTc (i.e. total number of acceptable combinations) and nc(i.e. number of composites) for all even numbers can either be of nTc > nc or nTc ≤ nc, the paper shows that the Goldbach conjecture is true for both these categories of even numbers. In this manner this analysis is totally inclusive of all even numbers in general terms and since the analysis of every even number is common in methodology but unique in compilation, apart from being totally inclusive, it is also mutually exclusive in nature. This proves that the Goldbach conjecture which states that all even numbers can be expressed as atleast one combination of two prime numbers holds true for all even numbers, across all categories possible. Additionally this approach proves that the identification of p1+p2 combinations which would validate the Goldbach conjecture lies in the identification of c1+c2 combinations.

scholarly journals A Survey of Some Recent Developments on Higher Transcendental Functions of Analytic Number Theory and Applied Mathematics

Symmetry ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 2294
Author(s):  
Hari Mohan Srivastava
Keyword(s):  
Number Theory ◽  
Special Functions ◽  
Applied Mathematics ◽  
Analytic Number Theory ◽  
Review Article ◽  
Mathematical Functions ◽  
Analytic Number ◽  
Recent Developments ◽  
Transcendental Functions ◽  
Mathematical Sciences

Often referred to as special functions or mathematical functions, the origin of many members of the remarkably vast family of higher transcendental functions can be traced back to such widespread areas as (for example) mathematical physics, analytic number theory and applied mathematical sciences. Here, in this survey-cum-expository review article, we aim at presenting a brief introductory overview and survey of some of the recent developments in the theory of several extensively studied higher transcendental functions and their potential applications. For further reading and researching by those who are interested in pursuing this subject, we have chosen to provide references to various useful monographs and textbooks on the theory and applications of higher transcendental functions. Some operators of fractional calculus, which are associated with higher transcendental functions, together with their applications, have also been considered. Many of the higher transcendental functions, especially those of the hypergeometric type, which we have investigated in this survey-cum-expository review article, are known to display a kind of symmetry in the sense that they remain invariant when the order of the numerator parameters or when the order of the denominator parameters is arbitrarily changed.

scholarly journals Considerations for Goldbach's Strong Conjecture

2021 ◽  
Author(s):  
Carleilton Severino Silva
Keyword(s):  
Number Theory ◽  
Prime Numbers ◽  
Weak Version ◽  
Strong Version ◽  
Leonhard Euler

Since 1742, the year in which the Prussian Christian Goldbach wrote a letter to Leonhard Euler with his Conjecture in the weak version, mathematicians have been working on the problem. The tools in number theory become the most sophisticated thanks to the resolution solutions. Euler himself said he was unable to prove it. The weak guess in the modern version states the following: any odd number greater than 5 can be written as the sum of 3 primes. In response to Goldbach's letter, Euler reminded him of a conversation in which he proposed what is now known as Goldbach's strong conjecture: any even number greater than 2 can be written as a sum of 2 prime numbers. The most interesting result came in 2013, with proof of weak version by the Peruvian Mathematician Harald Helfgott, however the strong version remained without a definitive proof. The weak version can be demonstrated without major difficulties and will not be described in this article, as it becomes a corollary of the strong version. Despite the enormous intellectual baggage that great mathematicians have had over the centuries, the Conjecture in question has not been validated or refuted until today.

scholarly journals On exponential sums over prime numbers

1989 ◽  
Vol 46 (3) ◽  
pp. 423-437
Author(s):  
A. Sárközy ◽  
C. L. Stewart
Keyword(s):  
Number Theory ◽  
Exponential Sums ◽  
Prime Numbers ◽  
Consecutive Integers

AbstractIn this article we establish an estimate for a sum over primes that is the analogue of an estimate for a sum over consecutive integers which has proved to be very useful in applications of exponential sums to problems in number theory.

Index, sub-index and sub-factor of groups with interactions to number theory

2019 ◽  
Vol 19 (06) ◽  
pp. 2050101
Author(s):  
M. H. Hooshmand
Keyword(s):  
Number Theory ◽  
Direct Product ◽  
Prime Numbers ◽  
Additive Number Theory ◽  
Open Problems ◽  
Famous Conjecture ◽  
Future Directions ◽  
Left And Right ◽  
The Difference ◽  
Equivalent Conditions

This paper is the first step of a new topic about groups which has close relations and applications to number theory. Considering the factorization of a group into a direct product of two subsets, and since every subgroup is a left and right factor, we observed that the index conception can be generalized for a class of factors. But, thereafter, we found that every subset [Formula: see text] of a group [Formula: see text] has four related sub-indexes: right, left, upper and lower sub-indexes [Formula: see text], [Formula: see text] which agree with the conception index of subgroups, and all of them are equal if [Formula: see text] is a subgroup or normal sub-semigroup of [Formula: see text]. As a result of the topic, we introduce some equivalent conditions to a famous conjecture for prime numbers (“every even number is the difference of two primes”) that one of them is: the prime numbers set is index stable (i.e. all of its sub-indexes are equal) in integers and [Formula: see text]. Index stable groups (i.e. those whose subsets are all index stable) are a challenging subject of the topic with several results and ideas. Regarding the extension of the theory, we give some methods for evaluation of sub-indexes, by using the left and right differences of subsets. At last, we pose many open problems, questions, a proposal for additive number theory, and show some future directions of researches and projects for the theory.

The Legacy of Marin Mersenne: The Search for Primal Order and the Mentoring of Young Minds

2005 ◽  
Vol 98 (8) ◽  
pp. 525-529
Author(s):  
Jeffrey J. Wanko
Keyword(s):  
Number Theory ◽  
Prime Numbers ◽  
Regular Polygons ◽  
Perfect Numbers

The search for prime numbers has long held a great fascination for mathematicians and for mathematics enthusiasts. Whether as a mathematical recreation or as a serious study within number theory, this quest has resulted in some profound mathematical advances and in a few surprising results that held some unforeseen applications and connections to other areas. For example, the problems of finding perfect numbers and constructible regular polygons have both been simplified through the search for prime numbers (Bell 1937, Clawson 1996).

Number theory and other reminiscences of Viscount Cherwell

1988 ◽  
Vol 42 (2) ◽  
pp. 197-204 ◽  
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Fundamental Theorem ◽  
Prime Numbers ◽  
Christ Church ◽  
Active Interest ◽  
Fundamental Theorem Of Arithmetic ◽  
Elegant Proof ◽  
Theory Of Numbers

Lord Cherwell (i) was, of course, a very distinguished ex-perimental physicist but he had (like many others) a considerable active interest in the theory of numbers. I met him in 1930 when Christ Church, Oxford, elected me to a Senior (postgraduate) Scholarship and I migrated there from my original college. Cherwell’s first published work (2) in the theory of numbers was a very simple and elegant proof of the fundamental theorem of arithmetic, that any positive integer can be expressed as a product of prime numbers in just one way (apart from a possible rearrangement of the order of the factors). (A prime is a positive integer greater than 1 whose only factors are 1 and itself.) His proof is by the method of descent (used by Fermat, but not for this problem). Assume the fundamental theorem false and call any number that can be expressed as a product of primes in two or more ways abnormal.

Sign in / Sign up

Export Citation Format

Share Document