DOCSLIB.ORG

AAAI Proceedings Template

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
AAAI Proceedings Template Reverse Factorization and Comparison of Factorization Algorithms in attack to RSA Sadi Evren SEKER Cihan MERT Dept. of Business Administration. Electrical Engineering Dept. Istanbul Medeniyet University The University of Texas at Dallas [email protected] [email protected] ABSTRACT details of the factorization algorithms we have implemented Factorization algorithms have a major role in the computer in this study. The experiments section will go into the details security and cryptography. Most of the widely used crypto- of the big number of integers their properties after generation graphic algorithms, like RSA, are built on the mathematical and evaluation of the algorithms. difficulty of factorization for big prime numbers. This re- search, proposes a new approach to the factorization by using 2. PROBLEM STATEMENT two new enhancements. The new approach is also compared A stepwise approach to the study can be viewed as in the Fig- with six different factorization algorithms and evaluated the ure 1. performance on a big data environment. The algorithms cov- ered are elliptic curve method, quadratic sieve, Fermat’s method, trial division and Pollard rho methods. Success rates are compared over a million of integer numbers with different difficulties. We have implemented our own algorithm for ran- dom number generation, which is also explained in the paper. We also empirically show that the new approach has an ad- vantage on the factorization attack to RSA. Keywords Factorization, Cryptography, Benchmarking Acknowledgement Work of Sadi Evren SEKER is supported by Istanbul University, research projects department under project number YADOP-27254 1. INTRODUCTION This study can be viewed as three major steps. In the first layer, we have generated big integers with a new approach on the generation. After the generation, the factorization algo- rithms including the new approach are executed. Finally, on Figure 1. Overview of Study the last step the performance of the algorithms are evaluated. In order to simulate the RSA prime number factorization In this paper, the problem will be defined and an overview of problem, we have only concentrated on the semi-prime num- the problem will be demonstrated in the problem statement bers. The random generator is designed to generate the semi- section. The related work section will cover a brief literature prime numbers. In order to make the time performance more review about the contemporary studies on the factorization explicit we have generated huge number of semi-prime num- algorithms. The background chapter will briefly describe the bers and stored them in a database. After storing, the factori- zation algorithms are executed on those numbers. Finally each algorithm is evaluated in the time performance. 3.3. Quadratic Sieve To factorize a number n, quadratic sieve method [3] attempts 3. BACKGROUND to find two numbers x and y such that 푥 ≢ ±푦 (푚표푑 푛) and 푥2 ≡ 푦2(푚표푑 푛). If two such numbers are found, this From the early times, the factorization of composite numbers implies that (x − y)(x + y) ≡ 0 (mod n). Then, x − y must has been an interesting area of studying and there are some have non-trivial factors in common with n. To achieve this, algorithms carried on like Sieve of Eratosthenes ( 276 – 194 a common strategy for finding such x and y is the following. BC). Choose a smoothness bound B. The number π(B),which Also the by the spreading usage of modern cryptographic sys- denotes the number of prime numbers less than B, will control tems which some are built on the difficulty of factoring, like both the number of vectors needed and the length of the RSA[1], the factorization problem has been a studying area. vectors. Then use sieving to locate π(B) + 1 numbers 푥푖 such 2 that 푦푖≡ (푥푖 푚표푑 푛) is B-smooth. Factor the 푦푖 and Initially factoring started with dividing a number by larger generate exponent vectors mod 2 for each one. Find a subset and larger primes until you had the factorization. This trial of these vectors which add to the zero vector. Multiply the division was not improved until Fermat’s method in which corresponding 푥푖 together naming the result mod n: x and the factorization of the difference of two squares is used. 2 the 푦푖 together which yields a B-smooth square 푦 . Next, While Fermat's method is much faster than trial division, 2 2 when it comes to the real world of factoring, for example for obtained equality 푥 ≡ 푦 (푚표푑 푛) gives two square roots of 2 factoring several hundred digits long RSA modulus, the (푥 푚표푑 푛), one by taking the square root in the integers 2 purely iterative Fermat’s method is too slow. This led the de- of 푦 namely 푦, and the other the a computed in previous velopment of several other methods, such as a pair of proba- step. Having desired identity(x − y)(x + y) ≡ 0(mod n), bilistic methods by Pollard in the mid 70's, the p − 1 method compute the 퐺퐶퐷(푥 − 푦, 푛). This gives a factor. If the factor and the ρ method, the Elliptic Curve Method discovered by is trivial, try again with a different a or linear dependency. H. Lenstra in 1987 . However, the fastest algorithms such as 3.4. Pollard Rho the Number Field Sieve (and its variants), the Quadratic Sieve Pollard’s rho method [4] is based on a combination of two (and it variants), and Continued Fraction Method utilize the ideas on Floyd's cycle-finding algorithm and birthday same trick as Fermat. The remainder of this paper will briefly paradox that are also useful for various other factoring discuss some of the above methods and focus on reverse fac- methods. torization method, a new approach. Let N be a number that is neither a perfect power nor a prime 3.1. Factorization by Trial Division and p the smallest prime factor of N. Generate sequence of numbers 푥0, 푥1, 푥2, … from 푍푁 uniformly, independently at random then after at most p + 1 Trial method is a brute-force method of finding a divisor of such pickings for the first time, there are two numbers 푥푖 and an integer N by simply trying if N is divisible by 푥푠 with i < s such that 푥푖 ≡ 푥푠 (푚표푑 푝). Since N is 2,3,5,7,11,13,17,…, i.e., all primes which are less than or not a perfect power, there is another prime factor q > p of N. equal to √푁 in succession, until a divisor is reached. Since the numbers 푥푖 and 푥푠 are randomly chosen from 푍푁, by the Chinese remaindering theorem, 푥푖 ≢ 푥푠 (푚표푑 푞) To partially or completely factor N, Trial division is an effec- with probability 1 − 1/푞 even under the condition that 푥푖 ≡ tive and simple method. It is reasonable to use trial division 푥푠 (푚표푑 푝). Therefore, 푔푐푑(푥푖 − 푥푠, 푁) is a nontrivial method as a factoring method when N is not too large. factor of N with probability at least 1 − 1/푞. Since the 푥 푚표푑 푝 behave more or less as random integers 3.2. Fermat Factorization 푖 in 0,1, … , 푝 − 1 , by computing 푔푐푑(푥푖 − 푥푗, 푁), for 푖 ≠ 푗 , the factorization of N after about 푐√푝 elements of the Fermat's factorization method [2] looks for the representation sequence can be computed, for some small constant c. 2 of an odd integer N as the difference of two squares N = This suggests that approximately (푐√푝) /2 pairs 푥푖 , 푥푗 have a2 − b2 . Then to be considered. However, this can easily be avoided by only N = (a − b)(a + b) computing 푔푐푑(푥푖 − 푥2푖, 푁) for 푖 = 0,1, … , i.e., by and N is factored. generating two copies of the sequence, one at the regular speed and one at the double speed. This can be expected to To factor any number N, first calculate √N. Then compute result in a factorization of N after approximately 2√푝 gcd a2 − N starting with a, the first integer greater than N and √ 2 2 2 computations. If this GCD ever comes to N, then the continue until reaching a square b . Since a − N = b , algorithm terminates with failure, since this means 푥푖 = N = a2 − b2 . So N is factorized into N = (a − b)(a + b) .If 푥2푖 and therefore, by Floyd's cycle-finding algorithm, the the only factors found are N and 1, then N is a prime number. sequence has cycled and continuing any further would only If N is not prime, use the same algorithm for each factor. be repeating previous work. Fermat's method works well when the number is factorized into two terms of approximately equal size. It works poorly when the factors are of very different sizes. 4. Semi-prime Factorization in RSA Where the number of prime factors of cn is consierede as This study focus on the fast and efficient factorization for the m+1. semi-prime numbers. The semi-prime numbers are For the given cn, the equation (2) can be concluded. considered as the multiplication of two prime numbers, say p and q. In some sources the semi-prime numbers are also 푚 named as pq numbers for this reason. ( 푛 ∈ 푁 ∧ 푛|푓푖) ⇔ 푛푖| {ℤ|푛 = (⋂ ℤ|푓푖)} (2) The advantage of factorizing the semi-prime numbers in RSA 푖=1 crypto system is the two prime factors of semi-prime numbers Where N is the domain set of search for the prime numbers, should be in equal digists or almost in equal digits. The reason 2 is, if the number of digits of one prime of the semi-prime which are the numbers from 2 to √푐푛.
Load more

Recommended publications
  • Fast Tabulation of Challenge Pseudoprimes Andrew Shallue and Jonathan Webster
    THE OPEN BOOK SERIES 2 ANTS XIII Proceedings of the Thirteenth Algorithmic Number Theory Symposium Fast tabulation of challenge pseudoprimes Andrew Shallue and Jonathan Webster msp THE OPEN BOOK SERIES 2 (2019) Thirteenth Algorithmic Number Theory Symposium msp dx.doi.org/10.2140/obs.2019.2.411 Fast tabulation of challenge pseudoprimes Andrew Shallue and Jonathan Webster We provide a new algorithm for tabulating composite numbers which are pseudoprimes to both a Fermat test and a Lucas test. Our algorithm is optimized for parameter choices that minimize the occurrence of pseudoprimes, and for pseudoprimes with a fixed number of prime factors. Using this, we have confirmed that there are no PSW-challenge pseudoprimes with two or three prime factors up to 280. In the case where one is tabulating challenge pseudoprimes with a fixed number of prime factors, we prove our algorithm gives an unconditional asymptotic improvement over previous methods. 1. Introduction Pomerance, Selfridge, and Wagstaff famously offered $620 for a composite n that satisfies (1) 2n 1 1 .mod n/ so n is a base-2 Fermat pseudoprime, Á (2) .5 n/ 1 so n is not a square modulo 5, and j D (3) Fn 1 0 .mod n/ so n is a Fibonacci pseudoprime, C Á or to prove that no such n exists. We call composites that satisfy these conditions PSW-challenge pseudo- primes. In[PSW80] they credit R. Baillie with the discovery that combining a Fermat test with a Lucas test (with a certain specific parameter choice) makes for an especially effective primality test[BW80].
    [Show full text]
  • The Number Field Sieve for Discrete Logarithms
    The Number Field Sieve for Discrete Logarithms Henrik Røst Haarberg Master of Science Submission date: June 2016 Supervisor: Kristian Gjøsteen, MATH Norwegian University of Science and Technology Department of Mathematical Sciences Abstract We present two general number field sieve algorithms solving the discrete logarithm problem in finite fields. The first algorithm pre- sented deals with discrete logarithms in prime fields Fp, while the second considers prime power fields Fpn . We prove, using the standard heuristic, that these algorithms will run in sub-exponential time. We also give an overview of different index calculus algorithms solving the discrete logarithm problem efficiently for different possible relations between the characteristic and the extension degree. To be able to give a good introduction to the algorithms, we present theory necessary to understand the underlying algebraic structures used in the algorithms. This theory is largely algebraic number theory. 1 Contents 1 Introduction 4 1.1 Discrete logarithms . .4 1.2 The general number field sieve and L-notation . .4 2 Theory 6 2.1 Number fields . .6 2.1.1 Dedekind domains . .7 2.1.2 Module structure . .9 2.1.3 Norm of ideals . .9 2.1.4 Units . 10 2.2 Prime ideals . 10 2.3 Smooth numbers . 13 2.3.1 Density . 13 2.3.2 Exponent vectors . 13 3 The number field sieve in prime fields 15 3.1 Overview . 15 3.2 Calculating logarithms . 15 3.3 Sieving . 17 3.4 Schirokauer maps . 18 3.5 Linear algebra . 20 3.5.1 A note about smooth t and g .............. 22 3.6 Run time .
    [Show full text]
  • A Set of Sequences in Number Theory
    A SET OF SEQUENCES IN NUMBER THEORY by Florentin Smarandache University of New Mexico Gallup, NM 87301, USA Abstract: New sequences are introduced in number theory, and for each one a general question: how many primes each sequence has. Keywords: sequence, symmetry, consecutive, prime, representation of numbers. 1991 MSC: 11A67 Introduction. 74 new integer sequences are defined below, followed by references and some open questions. 1. Consecutive sequence: 1,12,123,1234,12345,123456,1234567,12345678,123456789, 12345678910,1234567891011,123456789101112, 12345678910111213,... How many primes are there among these numbers? In a general form, the Consecutive Sequence is considered in an arbitrary numeration base B. Reference: a) Student Conference, University of Craiova, Department of Mathematics, April 1979, "Some problems in number theory" by Florentin Smarandache. 2. Circular sequence: 1,12,21,123,231,312,1234,2341,3412,4123,12345,23451,34512,45123,51234, | | | | | | | | | --- --------- ----------------- --------------------------- 1 2 3 4 5 123456,234561,345612,456123,561234,612345,1234567,2345671,3456712,... | | | --------------------------------------- ---------------------- ... 6 7 How many primes are there among these numbers? 3. Symmetric sequence: 1,11,121,1221,12321,123321,1234321,12344321,123454321, 1234554321,12345654321,123456654321,1234567654321, 12345677654321,123456787654321,1234567887654321, 12345678987654321,123456789987654321,12345678910987654321, 1234567891010987654321,123456789101110987654321, 12345678910111110987654321,... How many primes are there among these numbers? In a general form, the Symmetric Sequence is considered in an arbitrary numeration base B. References: a) Arizona State University, Hayden Library, "The Florentin Smarandache papers" special collection, Tempe, AZ 85287- 1006, USA. b) Student Conference, University of Craiova, Department of Mathematics, April 1979, "Some problems in number theory" by Florentin Smarandache. 4. Deconstructive sequence: 1,23,456,7891,23456,789123,4567891,23456789,123456789,1234567891, ..
    [Show full text]
  • The Factoring Dead: Preparing for the Cryptopocalypse
    THE FACTORING DEAD: PREPARING FOR THE CRYPTOPOCALYPSE Javed Samuel — javed[at]isecpartners[dot]com iSEC Partners, Inc 123 Mission Street, Suite 1020 San Francisco, CA 94105 https://www.isecpartners.com March 20, 2014 Abstract This paper will explain the latest breakthroughs in the academic cryptography community and look ahead at what practical issues could arise for popular cryptosystems. Specifically, we will focus on the recent major devel- opments in discrete mathematics and their potential ability to undermine our trust in the most basic asymmetric primitives, including RSA. We will explain the basic theories behind RSA and the state-of-the-art in large number- ing factoring, and how several recent papers may point the way to massive improvements in this area. The paper will then switch to the practical aspects of the doomsday scenario, and will answer the question “What happens the day after RSA is broken?” We will point out the many obvious and hidden uses of RSA and related algorithms and outline how software engineers and security teams can operate in a post-RSA world. We will also discuss the results of our survey of popular products and software, and point out the ways in which individuals can prepare for the “zombie cryptopocalypse”. 1 INTRODUCTION Over the past few years, there have been numerous attacks on the current SSL infrastructure. These have ranged from BEAST [97], CRIME [88], Lucky 13 [2][86], RC4 bias attacks [1][91] and BREACH [42]. These attacks all show the fragility of the current SSL architecture as vulnerabilities have been found in a variety of features ranging from compression, timing and padding [90].
    [Show full text]
  • Counting Integers with a Smooth Totient
    COUNTING INTEGERS WITH A SMOOTH TOTIENT W. D. BANKS, J. B. FRIEDLANDER, C. POMERANCE, AND I. E. SHPARLINSKI Abstract. In an earlier paper we considered the distribution of integers n for which Euler's totient function at n has all small prime factors. Here we obtain an improvement that is likely to be best possible. 1. Introduction Our paper [1] considers various multiplicative problems related to Euler's function '. One of these problems concerns the distribution of integers n for which '(n) is y-smooth (or y-friable), meaning that all prime factors of '(n) are at most y. Let Φ(x; y) denote the number of n ≤ x such that '(n) is y-smooth. Theorem 3.1 in [1] asserts that the following bound holds: For any fixed " > 0, numbers x; y with y ≥ (log log x)1+", and u = log x= log y ! 1, we have the bound Φ(x; y) ≤ x= exp((1 + o(1))u log log u): In this note we we establish a stronger bound. Merging Propositions 2.3 and 3.2 below we prove the following result. Theorem 1.1. For any fixed " > 0, numbers x; y with y ≥ (log log x)1+", and u = log x= log y ! 1, we have Φ(x; y) ≤ x exp−u(log log u + log log log u + o(1)): One might wonder about a matching lower bound for Φ(x; y), but this is very difficult to achieve since it depends on the distribution of primes p with p−1 being y-smooth. Let (x; y) denote the number of y- smooth integers at most x, and let π(x; y) denote the number of primes p ≤ x such that p−1 is y-smooth.
    [Show full text]
  • Use of SIMD-Based Data Parallelism to Speed up Sieving in Integer-Factoring Algorithms ?
    Use of SIMD-Based Data Parallelism to Speed up Sieving in Integer-Factoring Algorithms ? Binanda Sengupta and Abhijit Das Department of Computer Science and Engineering Indian Institute of Technology Kharagpur, West Bengal, PIN: 721302, India binanda.sengupta,[email protected] Abstract. Many cryptographic protocols derive their security from the appar- ent computational intractability of the integer factorization problem. Currently, the best known integer-factoring algorithms run in subexponential time. Effi- cient parallel implementations of these algorithms constitute an important area of practical research. Most reported implementations use multi-core and/or dis- tributed parallelization. In this paper, we use SIMD-based parallelization to speed up the sieving stage of integer-factoring algorithms. We experiment on the two fastest variants of factoring algorithms: the number-field sieve method and the multiple-polynomial quadratic sieve method. Using Intel’s SSE2 and AVX in- trinsics, we have been able to speed up index calculations in each core during sieving. This performance enhancement is attributed to a reduction in the pack- ing and unpacking overheads associated with SIMD registers. We handle both line sieving and lattice sieving. We also propose improvements to make our im- plementations cache-friendly. We obtain speedup figures in the range 5–40%. To the best of our knowledge, no public discussions on SIMD parallelization in the context of integer-factoring algorithms are available in the literature. Keywords: Integer Factorization, Sieving, Multiple-Polynomial Quadratic Sieve Method, Number-Field Sieve Method, Single Instruction Multiple Data, Stream- ing SIMD Extensions, Advanced Vector Extensions 1 Introduction Let n be a large composite integer having the factorization k v vp1 vp2 pk vpi n = p1 p2 ··· pk = ∏ pi : i=1 The integer factorization problem deals with the determination of all the prime divisors p1; p2;:::; pk of n and their corresponding multiplicities vp1 ;vp2 ;:::;vpk .
    [Show full text]
  • Binomial Coefficients and Lucas Sequences
    Journal of Number Theory 93, 246–284 (2002) doi:10.1006/jnth.2001.2721, available online at http://www.idealibrary.comon Binomial Coefficients and Lucas Sequences Achim Flammenkamp Fakultät für Mathematik, Universität Bielefeld, Postfach 10 01 31, 33 501 Bielefeld, Germany E-mail: [email protected] and Florian Luca Instituto de Matema´ticas de la UNAM, Campus Morelia, Apartado Postal 61-3 (Xangari), CP 58 089, Morelia, Michoa´can, Mexico E-mail: [email protected] Communicated by A. Granville View metadata, citation and similarReceived papers at October core.ac.uk 30, 2000 brought to you by CORE provided by Elsevier - Publisher Connector 1. INTRODUCTION Throughout this paper, a and b are integers such that a>|b|. For any non-negative integer n let an −bn u = (1) n a−b and n n vn =a +b . (2) The sequences (un )n \ 0 and (vn )n \ 0 are particular instances of the so-called Lucas sequences of first and second kind, respectively. These sequences enjoy very nice arithmetic properties and diophantine equations involving members of such sequences often arise in the study of exponential diophantine equations. In this paper, we investigate the occurrence of binomial coefficients in sequences whose general term is given by formula (1) or (2). That is, we look at the solutions of the diophantine equations m u =1 2 for m \ 2k>2 (3) n k 246 0022-314X/02 $35.00 © 2002 Elsevier Science (USA) ⁄ All rights reserved. BINOMIAL COEFFICIENTS AND SEQUENCES 247 and m v =1 2 for m \ 2k>2. (4) n k m m m Notice that since ( 1 )=m and ( k )=( m−k) hold for all m \ 1 and for all 1 [ k [ m−1, the assumption m \ 2k>2 imposes no restriction at all on the non-trivial solutions of the equations (3) and (4).
    [Show full text]
  • POLYA SEMINAR WEEK 2: NUMBER THEORY K. Soundararajan And
    POLYA SEMINAR WEEK 2: NUMBER THEORY K. Soundararajan and Ravi Vakil The Rules. There are too many problems to consider. Pick a few problems that you find fun, and play around with them. The only rule is that you may not pick a problem that you already know how to solve: where's the fun in that? General problem solving strategies. Try small cases; plug in smaller numbers. Search for a pattern. Draw pictures. Choose effective notation. Work in groups. Divide into cases. Look for symmetry. Work backwards. Argue by contradiction. Parity? Pigeonhole? Induction? Generalize the problem, sometimes that makes it easier. Be flexible: consider many possible approaches before committing to one. Be stubborn: don't give up if your approach doesn't work in five minutes. Ask. Eat pizza, have fun! 1. Of the numbers below 2016 which has the largest number of divisors? (Num- bers with more divisors than all previous ones were called \highly composite" by Ramanujan who made a detailed study of their structure.) 2. Prove that for every positive integer n coprime to 10 there is a multiple of n that does not contain the digit 1 in its decimal expansion. 3. Prove that the product of any four consecutive natural numbers cannot be a perfect square. (Note: In fact, Erd}osand Selfridge proved the beautiful result that no product of any number of consecutive natural numbers can be a perfect power.) 4. If 4n + 2n + 1 is prime then n must be a power of 3. Pn Qn 5. For which positive integers n does j=1 j divide j=1 j.
    [Show full text]
  • Using Formal Concept Analysis in Mathematical Discovery
    Using Formal Concept Analysis in Mathematical Discovery Simon Colton and Daniel Wagner sgc, [email protected] Combined Reasoning Group Department of Computing Imperial College, London http://www.doc.ic.ac.uk/crg/ Abstract. Formal concept analysis (FCA) comprises a set of powerful algorithms which can be used for data analysis and manipulation, and a set of visualisation tools which enable the discovery of meaningful re- lationships between attributes of the data. We explore the potential of combining FCA and mathematical discovery tools in order to better fa- cilitate discovery tasks. In particular, we propose a novel lookup method for the Encyclopedia of Integer Sequences, and we show how conjectures from the Graffiti discovery program can be better understood using FCA visualisation tools. We argue that, not only can FCA tools greatly en- hance the management and visualisation of mathematical knowledge, but they can also be used to drive exploratory processes. 1 Introduction Formal Concept Analysis (FCA) consists of a set of well established techniques for the analysis and manipulation of data. FCA has a strong theoretical un- derpinning, efficient implementations of fast algorithms, and useful visualisation tools. There are strong links between FCA and machine learning, and the con- nection of both fields is an active area of research [8,12,13]. We concentrate here on the combination of FCA tools with systems developed to aid mathemat- ical discovery. In particular, we are interested in addressing (i) whether FCA algorithms can be used to enhance the discovery process and (ii) whether FCA visualisation tools can enable better understanding of the discoveries made.
    [Show full text]
  • Primes of the Form (Bn + 1)/(B + 1)
    1 2 Journal of Integer Sequences, Vol. 3 (2000), 3 Article 00.2.7 47 6 23 11 Primes of the Form (bn + 1)=(b + 1) Harvey Dubner 449 Beverly Road, Ridgewood, New Jersey 07450 Torbj¨orn Granlund Notvarpsgr¨and 1, 1tr SE-116 66 Stockholm, Sweden Email addresses: [email protected] and [email protected] Abstract Numbers of the form (bn + 1)=(b + 1) are tested for primality. A table of primes and probable primes is presented for b up to 200 and large values of n. 1999 Mathematics Subject Classification: Primary 11A41 Keywords: prime numbers, generalized repunits 1. Introduction A truly prodigious amount of computation has been devoted to investigating numbers of the form bn 1. The Cunningham project, to factor these numbers for b from 2 to 12, is perhaps± the longest running computer project of all time [4]. The range of b has been extended to 100 and even further in special cases [1][2] . The Mersenne numbers, 2n 1 have been studied extensively for hundreds of years and the largest known prime− is almost always a Mersenne prime. In [6], generalized repunit primes of the form (bn 1)=(b 1) were tabulated for bases up to 99 and large values of n. − − The purpose of this paper is to present the results of computer searches for primes of the form, bn + 1 (1) Q(b; n) = b + 1 for bases up to 200 and large values of n. 1 2 2. Prime Search For certain values of n in (1) the denominator cannot divide the numerator and are thus excluded from this study, and Q has algebraic factors for certain other values of b; n so that it cannot be prime.
    [Show full text]
  • List of Numbers
    List of numbers This is a list of articles aboutnumbers (not about numerals). Contents Rational numbers Natural numbers Powers of ten (scientific notation) Integers Notable integers Named numbers Prime numbers Highly composite numbers Perfect numbers Cardinal numbers Small numbers English names for powers of 10 SI prefixes for powers of 10 Fractional numbers Irrational and suspected irrational numbers Algebraic numbers Transcendental numbers Suspected transcendentals Numbers not known with high precision Hypercomplex numbers Algebraic complex numbers Other hypercomplex numbers Transfinite numbers Numbers representing measured quantities Numbers representing physical quantities Numbers without specific values See also Notes Further reading External links Rational numbers A rational number is any number that can be expressed as the quotient or fraction p/q of two integers, a numerator p and a non-zero denominator q.[1] Since q may be equal to 1, every integer is a rational number. The set of all rational numbers, often referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by a boldface Q (or blackboard bold , Unicode ℚ);[2] it was thus denoted in 1895 byGiuseppe Peano after quoziente, Italian for "quotient". Natural numbers Natural numbers are those used for counting (as in "there are six (6) coins on the table") and ordering (as in "this is the third (3rd) largest city in the country"). In common language, words used for counting are "cardinal numbers" and words used for ordering are
    [Show full text]
  • Sum of the Reciprocals of Famous Series: Mathematical Connections with Some Sectors of Theoretical Physics and String Theory
    1Torino, 14/04/2016 Sum of the reciprocals of famous series: mathematical connections with some sectors of theoretical physics and string theory 1,2 Ing. Pier Franz Roggero, Dr. Michele Nardelli , P.i. Francesco Di Noto 1Dipartimento di Scienze della Terra Università degli Studi di Napoli Federico II, Largo S. Marcellino, 10 80138 Napoli, Italy 2 Dipartimento di Matematica ed Applicazioni “R. Caccioppoli” Università degli Studi di Napoli “Federico II” – Polo delle Scienze e delle Tecnologie Monte S. Angelo, Via Cintia (Fuorigrotta), 80126 Napoli, Italy Abstract In this paper it has been calculated the sums of the reciprocals of famous series. The sum of the reciprocals gives fundamental information on these series. The higher this sum and larger numbers there are in series and vice versa. Furthermore we understand also what is the growth factor of the series and that there is a clear link between the sums of the reciprocal and the "intrinsic nature" of the series. We have described also some mathematical connections with some sectors of theoretical physics and string theory 2Torino, 14/04/2016 Index: 1. KEMPNER SERIES ........................................................................................................................................................ 3 2. SEXY PRIME NUMBERS .............................................................................................................................................. 6 3. TWIN PRIME NUMBERS .............................................................................................................................................
    [Show full text]