DOCSLIB.ORG

Multiamicable Numbers, 71 3X + 1 Problem, 190 A-Analogue of Smith's

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Index (A, r)-powerful, 114 k-Eulerian posets, 148 (m, k)-perfect, 41, 42 k-free part, 134 (α, β)-multiamicable numbers, 71 k-full, 236 3x + 1 problem, 190 k-full part, 134 A-analogue of Smith’s k-harmonic number, 44 determinant, 266 k-hyperperfect numbers, 50 A-convolution, 112, 278 k-Mobius¨ function of a poset, 147 A-multiplicative, 114 k-multiperfect numbers, 30 A-rational function, 114 k-perfect number, 32 Ak-convolutions, 113 k-perfect numbers, 33 B-convolution, 116 k-reduced residue system, 276 B-splines, 471 k-Smith number, 383 b-additive, 404 k-th power of an arithmetic e-multiperfect, 52 function, 108 e-perfect numbers, 52 k-unitary perfect number, 46 e-superperfect numbers, 53 kth cyclotomic polynomial, 561 f -expansions, 432 kth iterate of f , 196 f -generated number, 386 l p norm (p ≥ 1) of matrices, 274 f -iterative sequence, 427 M-void analogue of the Euler f -self-number, 386 totient, 290 G-ary digital expansion, 414 m-bi-unitary perfect numbers, 57 G-convolution, 121 m-bi-unitary superperfect numbers, 58 G-multiplicative functions, 121 m-integral, 539 jth iterate of the Carmichael m-multisuperperfect numbers, 55 function, 200 m-perfect numbers, 55 K convolution of incidence m-superperfect numbers, 39, 56 functions, 143 m-unitary (k, l)-perfect K -convolution, 114, 115 number, 57 K -iterate of an arithmetical m − e-perfect numbers, 58 function, 115 m − e-superperfect numbers, 58 k-ary divisor, 136 n-dimensional symplex, 568 619 INDEX n-permutations with η-colored q-Euler function, 286 head, 480 q-Euler numbers, 561 n-th prime pn, 180 q-Euler polynomials, 563 nth prime, 234 q-Eulerian numbers, 569 nth symmetric mean, 471 q-Eulerian polynomials, 570 p-adic L function, 566 q-exponential polynomial, 483 p-adic analysis, 541 q-generated number, 384 p-adic expansion, 498 q-Hurwitz ζ-function, 565 p-adic gamma function, 566 q-log- function, 563 p-adic integers, 550 q-multinomial coefficients, 506 p-adic integrals, 566 q-multiplicative, 401, 405, 413 p-adic log-gamma functions, 566 q-Niven number, 382 ζ p-adic mean value theorem, 546 q-Riemann -function, 562 p-adic method, 494 q-Stirling numbers, 481, 504 p-group, 155 q-tangent numbers, 559 p-local integers, 553 q-trigonometric function, 561 − p-Stirling numbers, 472 q L-series, 563 p, q-log-concavity, 515 r-Stirling numbers, 469 p, q-Stirling numbers, 484 S-perfect numbers, 55 t-chain, 370 Q-additive function, 389 Z-perfect numbers, 55 Q-multiplicative, 406 α-adic representation, 419 q-additive, 387, 401 γ -perfect numbers, 54 q-additive functions, 388 ψ-multiperfect numbers, 41 q-analog of log-concavity, 513 ψ-superperfect numbers, 40 q-analogs of Euler numbers, 559 ψ ◦ σ-perfect numbers, 40 q-analogue of a positive integer, 481 σ ◦ ψ-perfect numbers, 40 q-analogue of Bell numbers, 486 ϕ-amicable pairs, 71 q-analogue of Jordan’s totient, 286 ϕ-convergence, 187 q-analogue of power series, 486 ϕ-partitions, 223 q-analogue of the p-adic measure, 566 R-multiplicative, 407 q-analogue of the classical Euler R-system, 407 totient, 286 U-Stirling numbers, 485 q-analogue of the classical Ramanujan ”breeding” method by Borho and sum, 286 Hoffman, 63 q-ascending factorial, 569 q-Bernoulli numbers, 483, 561 Abelian minimal normal subgroup, q-Bernoulli polynomials, 562 155 q-binomial coefficient, 471 abelian number fields, 553 q-binomial coefficients, 480, 506 abstract prime number theorems, 154 620 INDEX abundant numbers, 17, 43 analytic continuation, 582 action of the cyclic group, 490 and Mellin-Perron summation adding prime totatives, 248 formula, 423 adding composite totatives, 248 aperiodic elements, 490 additive analogue of Euler’s totient, Apostol function, 129 291 applet, which computes the values additive analogue of the σ, 292 ϕ(n) and λ(n), 193 additive arithmetic function, 366 applications of Mobius¨ inversion adjacent slices, 568 formulae, 156 Airy asymptotic, 524 applications of the Mobius¨ functions, algebraic function fields, 161 139 algebraic independence of real valued Approximation theory, 469 arithmetic functions, 185 arithmetic process, 343 algebraic integers, 293, 421 arithmetic progression, 221 algebraic number field, 159, 263, 419 arithmetic progressions, 136, 151, algebraic number fields, 193 220, 229, 254 algebraic number theory, 160 arithmetical products, 285 algebraic numbers, 553 arithmetical semigroup, 149 Algebraic topology, 162 arithmetical semigroups, 292, 331 algebraic topology, 499 arithmetical triangles, 502 algorithms, 36, 419 ascents, 567 aliquot sequence, 72, 74 associated Stirling numbers, 502, 580 all-Niven, 383 asymptotic analysis, 511 Alladi’s totient, 282 asymptotic behavior of the Stirling almost all sums, 340, 342 numbers, 516 almost amicable pairs, 69 asymptotic density, 363 almost perfect numbers, 37, 38 asymptotic development of the almost superperfect numbers, 41 Stirling numbers of the first amicable k-tuples, 70 kind, 515 amicable numbers, 36, 60, 63 asymptotic expansions of Stirling amicable numbers in special numbers of the second kind, sequences, 67 520 amicable triples, 69 asymptotic normality, 416 analogue of Adams’ theorem, 557 asymptotic normality of Eulerian analogue of Euler’s formula, 62 numbers, 579 analogue of Lehmer’s problem, 213, asymptotic prime divisor, 341 214 asymptotic sign fluctuations, 517 analogue of Smith’s determinant, 266 asymptotically Poisson distributed, analogue of Thabit’s formula, 62 518 621 INDEX asymptotically unit exponential binary recurrence sequence, 240 variables, 341 binomial coefficient, 49, 107, 126, 371 automorphic numbers, 431 binomial coefficients, 243, 460, 474 average number of blocks, 512 binomial convolution of sequences, 117 Baker’s method, 418, 430 binomial measure, 375 Barrucand numbers, 494 biological analogies, 17 base q palindromes, 430 bipartite graphs, 348 basis, 481 birational transformation, 192 Bassily-Katai´ theorem, 403 block-additive, 410 Bauer’s theorems, 245 block-multiplicative, 408 BDE method, 61, 63 Bohr almost-periodic function, 136 Bell number, 461 Bohr-Fourier spectrum, 413 Bell numbers, 493 Bolyai-Renyi´ expansions, 432 Bell polynomials, 484, 495 Bombieri’s sieve, 227 Bell sequence, 512 Boole summation formula, 577 Benford law, 430 Boolean lattice, 513 Bernoulli and Euler polynomials, Borel σ-algebra, 344 529, 582 bounded below set, 148 Bernoulli and Stirling numbers, bounded variation, 103 259, 467 Brauer-Rademacher identity, 144, 180 Bernoulli number, 461 britannic number system, 407 Bernoulli numbers, 243, 244, 495, Brownian motion, 344 500, 518, 525 Brun’s sieve, 235 Bernoulli numbers of fractional order, Brun-Titchmarsh theorem, 216, 227 474 Buchstab function, 357 Bernoulli numbers of higher order, Burnside basis theorem, 293 500 Bernoulli numbers of order k, 468 C++ programming language, 217 beta-expansions, 432 cancellation property, 120 betrothed numbers, 68 canonical basis, 393 Beurling’s generalized primes, 207 canonical number system, 418 bi-unitary amicable numbers, 67 canonical number systems, 404 bi-unitary convolution, 111 Cantor representations, 412 bi-unitary divisor, 46 Carlitz congruence, 552 bi-unitary multiply perfect numbers, Carmichael conjecture, 228 47 Carmichael’s λ function, 193 bi-unitary perfect numbers, 47 Carmichael’s theorem, 190 bi-unitary quasiperfect, 47 Cashwell-Everett totient, 280 bilinearly recurrent orthogonality, 476 Catalan’s conjecture, 73 622 INDEX Cauchy product, 117, 122, 128 composition of some arithmetic Cauchy’s integral formula, 579 functions, 39 central factorial numbers, 479 computational evidence, 42 central limit theorem, 344, 402, 423 computer algebra, 486 chain, 72, 369 conductor, 553 chains, 141, 144 congruence of Kummer, 541 change of the sum of digits by congruence of Voronoi, 541 multiplication, 378 congruence properties, 477 character group, 151 congruence properties of σ (m)(n),42 characteristic equation, 240 congruence properties of Euler’s characteristic polynomial, 414 totient, 201 characters of finite abelian groups, 151 congruence property, 188 Chebysheff’s theorem, 207 congruences for Genocchi numbers, circle of convergence, 415 541 circulant matrix, 183 congruences for higher order circular permutations, 192 Bernoulli numbers, 549 classical Mobius¨ function, 99, 128, congruences for Stirling numbers, 488 135 conjecture, 42, 47, 51–53, 59, 195, code, 179, 396 229, 235, 241, 348, 382, 400, coefficients of cyclotomic 494, 499, 556, 558, 573 polynomials, 256 conjecture of Sierpinski, 229 Cohen totient ϕS, 290 conjectured, 46, 352 combinatorial and statistical conjectures, 199, 216, 237, 557 applications, 480 conjugacy classes, 157 combinatorial applications, 107, 477 conjugate Bernoulli numbers, 538 combinatorics on words, 390 conjugate Bernoulli polynomials, 538 common generalization of Liouville’s consecutive divisors, 342 function and the Mobius¨ consecutive prime factors, 337 function, 137 constants, 181 commutative group, 106 continued fractions, 432, 537, 561 commutative ring, 110, 121 continued powers and roots, 432 commutative semigroup, 117, 118 convex polytope, 559 commutator subgroup, 158 convolution of incidence functions, complete asymptotic expansion, 520 139 complete symmetric functions, 471 convolution on the set of sequences, complex bases, 417 537 complex variables, 381 convolutions with unbounded unity, composition of ϕ and other functions, 128 234 core, 208 623 INDEX core-reduced residue system, 290 derangements and cycle indicators, core-reduced totient of J. Sandor´ and 507 R. Sivaramakrishnan, 290 derived k-cycle, 337 cosets, 151 derived sequence, 337 counterexample to Carmichael’s
Recommended publications
  • Generalizations of Euler Numbers and Polynomials 1

    Generalizations of Euler Numbers and Polynomials 1

    GENERALIZATIONS OF EULER NUMBERS AND POLYNOMIALS QIU-MING LUO AND FENG QI Abstract. In this paper, the concepts of Euler numbers and Euler polyno- mials are generalized, and some basic properties are investigated. 1. Introduction It is well-known that the Euler numbers and polynomials can be defined by the following definitions. Definition 1.1 ([1]). The Euler numbers Ek are defined by the following expansion t ∞ 2e X Ek = tk, |t| ≤ π. (1.1) e2t + 1 k! k=0 In [4, p. 5], the Euler numbers is defined by t/2 ∞ n 2n 2e t X (−1) En t = sech = , |t| ≤ π. (1.2) et + 1 2 (2n)! 2 n=0 Definition 1.2 ([1, 4]). The Euler polynomials Ek(x) for x ∈ R are defined by xt ∞ 2e X Ek(x) = tk, |t| ≤ π. (1.3) et + 1 k! k=0 It can also be shown that the polynomials Ei(t), i ∈ N, are uniquely determined by the following two properties 0 Ei(t) = iEi−1(t),E0(t) = 1; (1.4) i Ei(t + 1) + Ei(t) = 2t . (1.5) 2000 Mathematics Subject Classification. 11B68. Key words and phrases. Euler numbers, Euler polynomials, generalization. The authors were supported in part by NNSF (#10001016) of China, SF for the Prominent Youth of Henan Province, SF of Henan Innovation Talents at Universities, NSF of Henan Province (#004051800), Doctor Fund of Jiaozuo Institute of Technology, China. This paper was typeset using AMS-LATEX. 1 2 Q.-M. LUO AND F. QI Euler polynomials are related to the Bernoulli numbers. For information about Bernoulli numbers and polynomials, please refer to [1, 2, 3, 4].
  • Idempotent Factorizations of Square-Free Integers

    Idempotent Factorizations of Square-Free Integers

    information Article Idempotent Factorizations of Square-Free Integers Barry Fagin Department of Computer Science, US Air Force Academy, Colorado Springs, CO 80840, USA; [email protected]; Tel.: +1-719-333-7377 Received: 20 June 2019; Accepted: 3 July 2019; Published: 6 July 2019 Abstract: We explore the class of positive integers n that admit idempotent factorizations n = p¯q¯ such that l(n)¶(p¯ − 1)(q¯ − 1), where l is the Carmichael lambda function. Idempotent factorizations with p¯ and q¯ prime have received the most attention due to their cryptographic advantages, but there are an infinite number of n with idempotent factorizations containing composite p¯ and/or q¯. Idempotent factorizations are exactly those p¯ and q¯ that generate correctly functioning keys in the Rivest–Shamir–Adleman (RSA) 2-prime protocol with n as the modulus. While the resulting p¯ and q¯ have no cryptographic utility and therefore should never be employed in that capacity, idempotent factorizations warrant study in their own right as they live at the intersection of multiple hard problems in computer science and number theory. We present some analytical results here. We also demonstrate the existence of maximally idempotent integers, those n for which all bipartite factorizations are idempotent. We show how to construct them, and present preliminary results on their distribution. Keywords: cryptography; abstract algebra; Rivest–Shamir–Adleman (RSA); computer science education; cryptography education; number theory; factorization MSC: [2010] 11Axx 11T71 1. Introduction Certain square-free positive integers n can be factored into two numbers (p¯, q¯) such that l(n)¶ (p¯ − 1)(q¯ − 1), where l is the Carmichael lambda function.
  • The Ray Attack on RSA Cryptosystems’, in R

    The Ray Attack on RSA Cryptosystems’, in R

    The ray attack, an inefficient trial to break RSA cryptosystems∗ Andreas de Vries† FH S¨udwestfalen University of Applied Sciences, Haldener Straße 182, D-58095 Hagen Abstract The basic properties of RSA cryptosystems and some classical attacks on them are described. Derived from geometric properties of the Euler functions, the Euler function rays, a new ansatz to attack RSA cryptosystemsis presented. A resulting, albeit inefficient, algorithm is given. It essentially consists of a loop with starting value determined by the Euler function ray and with step width given by a function ωe(n) being a multiple of the order ordn(e), where e denotes the public key exponent and n the RSA modulus. For n = pq and an estimate r < √pq for the smaller prime factor p, the running time is given by T (e,n,r)= O((r p)lnelnnlnr). − Contents 1 Introduction 1 2 RSA cryptosystem 2 2.1 Properties of an RSA key system . ... 4 2.2 ClassicalRSAattacks. 5 3 The Euler function ray attack 7 3.1 The ω-function and the order of a number modulo n ............... 7 3.2 Properties of composed numbers n = pq ..................... 10 3.3 Thealgorithm................................... 13 arXiv:cs/0307029v1 [cs.CR] 11 Jul 2003 4 Discussion 15 A Appendix 15 A.1 Euler’sTheorem.................................. 15 A.2 The Carmichael function and Carmichael’s Theorem . ......... 16 1 Introduction Since the revolutionary idea of asymmetric cryptosystems was born in the 1970’s, due to Diffie and Hellman [4] and Rivest, Shamir and Adleman [9], public key technology became an in- dispensable part of contemporary electronically based communication.
  • 1 Mersenne Primes and Perfect Numbers

    1 Mersenne Primes and Perfect Numbers

    1 Mersenne Primes and Perfect Numbers Basic idea: try to construct primes of the form an − 1; a, n ≥ 1. e.g., 21 − 1 = 3 but 24 − 1=3· 5 23 − 1=7 25 − 1=31 26 − 1=63=32 · 7 27 − 1 = 127 211 − 1 = 2047 = (23)(89) 213 − 1 = 8191 Lemma: xn − 1=(x − 1)(xn−1 + xn−2 + ···+ x +1) Corollary:(x − 1)|(xn − 1) So for an − 1tobeprime,weneeda =2. Moreover, if n = md, we can apply the lemma with x = ad.Then (ad − 1)|(an − 1) So we get the following Lemma If an − 1 is a prime, then a =2andn is prime. Definition:AMersenne prime is a prime of the form q =2p − 1,pprime. Question: are they infinitely many Mersenne primes? Best known: The 37th Mersenne prime q is associated to p = 3021377, and this was done in 1998. One expects that p = 6972593 will give the next Mersenne prime; this is close to being proved, but not all the details have been checked. Definition: A positive integer n is perfect iff it equals the sum of all its (positive) divisors <n. Definition: σ(n)= d|n d (divisor function) So u is perfect if n = σ(u) − n, i.e. if σ(u)=2n. Well known example: n =6=1+2+3 Properties of σ: 1. σ(1) = 1 1 2. n is a prime iff σ(n)=n +1 p σ pj p ··· pj pj+1−1 3. If is a prime, ( )=1+ + + = p−1 4. (Exercise) If (n1,n2)=1thenσ(n1)σ(n2)=σ(n1n2) “multiplicativity”.
  • On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function

    On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function

    mathematics Article On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function ŠtˇepánHubálovský 1,* and Eva Trojovská 2 1 Department of Applied Cybernetics, Faculty of Science, University of Hradec Králové, 50003 Hradec Králové, Czech Republic 2 Department of Mathematics, Faculty of Science, University of Hradec Králové, 50003 Hradec Králové, Czech Republic; [email protected] * Correspondence: [email protected] or [email protected]; Tel.: +420-49-333-2704 Received: 3 October 2020; Accepted: 14 October 2020; Published: 16 October 2020 Abstract: Let Fn be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest positive integer k such that Fk ≡ 0 (mod n). In this paper, we shall find all positive solutions of the Diophantine equation z(j(n)) = n, where j is the Euler totient function. Keywords: Fibonacci numbers; order of appearance; Euler totient function; fixed points; Diophantine equations MSC: 11B39; 11DXX 1. Introduction Let (Fn)n≥0 be the sequence of Fibonacci numbers which is defined by 2nd order recurrence Fn+2 = Fn+1 + Fn, with initial conditions Fi = i, for i 2 f0, 1g. These numbers (together with the sequence of prime numbers) form a very important sequence in mathematics (mainly because its unexpectedly and often appearance in many branches of mathematics as well as in another disciplines). We refer the reader to [1–3] and their very extensive bibliography. We recall that an arithmetic function is any function f : Z>0 ! C (i.e., a complex-valued function which is defined for all positive integer).
  • Prime Divisors in the Rationality Condition for Odd Perfect Numbers

    Prime Divisors in the Rationality Condition for Odd Perfect Numbers

    Aid#59330/Preprints/2019-09-10/www.mathjobs.org RFSC 04-01 Revised The Prime Divisors in the Rationality Condition for Odd Perfect Numbers Simon Davis Research Foundation of Southern California 8861 Villa La Jolla Drive #13595 La Jolla, CA 92037 Abstract. It is sufficient to prove that there is an excess of prime factors in the product of repunits with odd prime bases defined by the sum of divisors of the integer N = (4k + 4m+1 ℓ 2αi 1) i=1 qi to establish that there do not exist any odd integers with equality (4k+1)4m+2−1 between σ(N) and 2N. The existence of distinct prime divisors in the repunits 4k , 2α +1 Q q i −1 i , i = 1,...,ℓ, in σ(N) follows from a theorem on the primitive divisors of the Lucas qi−1 sequences and the square root of the product of 2(4k + 1), and the sequence of repunits will not be rational unless the primes are matched. Minimization of the number of prime divisors in σ(N) yields an infinite set of repunits of increasing magnitude or prime equations with no integer solutions. MSC: 11D61, 11K65 Keywords: prime divisors, rationality condition 1. Introduction While even perfect numbers were known to be given by 2p−1(2p − 1), for 2p − 1 prime, the universality of this result led to the the problem of characterizing any other possible types of perfect numbers. It was suggested initially by Descartes that it was not likely that odd integers could be perfect numbers [13]. After the work of de Bessy [3], Euler proved σ(N) that the condition = 2, where σ(N) = d|N d is the sum-of-divisors function, N d integer 4m+1 2α1 2αℓ restricted odd integers to have the form (4kP+ 1) q1 ...qℓ , with 4k + 1, q1,...,qℓ prime [18], and further, that there might exist no set of prime bases such that the perfect number condition was satisfied.
  • Ces`Aro's Integral Formula for the Bell Numbers (Corrected)

    Ces`Aro's Integral Formula for the Bell Numbers (Corrected)

    Ces`aro’s Integral Formula for the Bell Numbers (Corrected) DAVID CALLAN Department of Statistics University of Wisconsin-Madison Medical Science Center 1300 University Ave Madison, WI 53706-1532 [email protected] October 3, 2005 In 1885, Ces`aro [1] gave the remarkable formula π 2 cos θ N = ee cos(sin θ)) sin( ecos θ sin(sin θ) ) sin pθ dθ p πe Z0 where (Np)p≥1 = (1, 2, 5, 15, 52, 203,...) are the modern-day Bell numbers. This formula was reproduced verbatim in the Editorial Comment on a 1941 Monthly problem [2] (the notation Np for Bell number was still in use then). I have not seen it in recent works and, while it’s not very profound, I think it deserves to be better known. Unfortunately, it contains a typographical error: a factor of p! is omitted. The correct formula, with n in place of p and using Bn for Bell number, is π 2 n! cos θ B = ee cos(sin θ)) sin( ecos θ sin(sin θ) ) sin nθ dθ n ≥ 1. n πe Z0 eiθ The integrand is the imaginary part of ee sin nθ, and so an equivalent formula is π 2 n! eiθ B = Im ee sin nθ dθ . (1) n πe Z0 The formula (1) is quite simple to prove modulo a few standard facts about set par- n titions. Recall that the Stirling partition number k is the number of partitions of n n [n] = {1, 2,...,n} into k nonempty blocks and the Bell number Bn = k=1 k counts n k n n k k all partitions of [ ].
  • An Identity for Generalized Bernoulli Polynomials

    An Identity for Generalized Bernoulli Polynomials

    1 2 Journal of Integer Sequences, Vol. 23 (2020), 3 Article 20.11.2 47 6 23 11 An Identity for Generalized Bernoulli Polynomials Redha Chellal1 and Farid Bencherif LA3C, Faculty of Mathematics USTHB Algiers Algeria [email protected] [email protected] [email protected] Mohamed Mehbali Centre for Research Informed Teaching London South Bank University London United Kingdom [email protected] Abstract Recognizing the great importance of Bernoulli numbers and Bernoulli polynomials in various branches of mathematics, the present paper develops two results dealing with these objects. The first one proposes an identity for the generalized Bernoulli poly- nomials, which leads to further generalizations for several relations involving classical Bernoulli numbers and Bernoulli polynomials. In particular, it generalizes a recent identity suggested by Gessel. The second result allows the deduction of similar identi- ties for Fibonacci, Lucas, and Chebyshev polynomials, as well as for generalized Euler polynomials, Genocchi polynomials, and generalized numbers of Stirling. 1Corresponding author. 1 1 Introduction Let N and C denote, respectively, the set of positive integers and the set of complex numbers. (α) In his book, Roman [41, p. 93] defined generalized Bernoulli polynomials Bn (x) as follows: for all n ∈ N and α ∈ C, we have ∞ tn t α B(α)(x) = etx. (1) n n! et − 1 Xn=0 The Bernoulli numbers Bn, classical Bernoulli polynomials Bn(x), and generalized Bernoulli (α) numbers Bn are, respectively, defined by (1) (α) (α) Bn = Bn(0), Bn(x)= Bn (x), and Bn = Bn (0). (2) The Bernoulli numbers and the Bernoulli polynomials play a fundamental role in various branches of mathematics, such as combinatorics, number theory, mathematical analysis, and topology.
  • Paul Erdős and the Rise of Statistical Thinking in Elementary Number Theory

    Paul Erdős and the Rise of Statistical Thinking in Elementary Number Theory

    Paul Erd®s and the rise of statistical thinking in elementary number theory Carl Pomerance, Dartmouth College based on the joint survey with Paul Pollack, University of Georgia 1 Let us begin at the beginning: 2 Pythagoras 3 Sum of proper divisors Let s(n) be the sum of the proper divisors of n: For example: s(10) = 1 + 2 + 5 = 8; s(11) = 1; s(12) = 1 + 2 + 3 + 4 + 6 = 16: 4 In modern notation: s(n) = σ(n) − n, where σ(n) is the sum of all of n's natural divisors. The function s(n) was considered by Pythagoras, about 2500 years ago. 5 Pythagoras: noticed that s(6) = 1 + 2 + 3 = 6 (If s(n) = n, we say n is perfect.) And he noticed that s(220) = 284; s(284) = 220: 6 If s(n) = m, s(m) = n, and m 6= n, we say n; m are an amicable pair and that they are amicable numbers. So 220 and 284 are amicable numbers. 7 In 1976, Enrico Bombieri wrote: 8 There are very many old problems in arithmetic whose interest is practically nil, e.g., the existence of odd perfect numbers, problems about the iteration of numerical functions, the existence of innitely many Fermat primes 22n + 1, etc. 9 Sir Fred Hoyle wrote in 1962 that there were two dicult astronomical problems faced by the ancients. One was a good problem, the other was not so good. 10 The good problem: Why do the planets wander through the constellations in the night sky? The not-so-good problem: Why is it that the sun and the moon are the same apparent size? 11 Perfect numbers, amicable numbers, and similar topics were important to the development of elementary number theory.
  • Gaussian Prime Labeling of Super Subdivision of Star Graphs

    Gaussian Prime Labeling of Super Subdivision of Star Graphs

    of Math al em rn a u ti o c J s l A a Int. J. Math. And Appl., 8(4)(2020), 35{39 n n d o i i t t a s n A ISSN: 2347-1557 r e p t p n l I i c • Available Online: http://ijmaa.in/ a t 7 i o 5 n 5 • s 1 - 7 4 I 3 S 2 S : N International Journal of Mathematics And its Applications Gaussian Prime Labeling of Super Subdivision of Star Graphs T. J. Rajesh Kumar1,∗ and Antony Sanoj Jerome2 1 Department of Mathematics, T.K.M College of Engineering, Kollam, Kerala, India. 2 Research Scholar, University College, Thiruvananthapuram, Kerala, India. Abstract: Gaussian integers are the complex numbers of the form a + bi where a; b 2 Z and i2 = −1 and it is denoted by Z[i]. A Gaussian prime labeling on G is a bijection from the vertices of G to [ n], the set of the first n Gaussian integers in the spiral ordering such that if uv 2 E(G), then (u) and (v) are relatively prime. Using the order on the Gaussian integers, we discuss the Gaussian prime labeling of super subdivision of star graphs. MSC: 05C78. Keywords: Gaussian Integers, Gaussian Prime Labeling, Super Subdivision of Graphs. © JS Publication. 1. Introduction The graphs considered in this paper are finite and simple. The terms which are not defined here can be referred from Gallian [1] and West [2]. A labeling or valuation of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy, a label depending upon the vertex labels f(x) and f(y).
  • MAT344 Lecture 6

    MAT344 Lecture 6

    MAT344 Lecture 6 2019/May/22 1 Announcements 2 This week This week, we are talking about 1. Recursion 2. Induction 3 Recap Last time we talked about 1. Recursion 4 Fibonacci numbers The famous Fibonacci sequence starts like this: 1; 1; 2; 3; 5; 8; 13;::: The rule defining the sequence is F1 = 1;F2 = 1, and for n ≥ 3, Fn = Fn−1 + Fn−2: This is a recursive formula. As you might expect, if certain kinds of numbers have a name, they answer many counting problems. Exercise 4.1 (Example 3.2 in [KT17]). Show that a 2 × n checkerboard can be tiled with 2 × 1 dominoes in Fn+1 many ways. Solution: Denote the number of tilings of a 2 × n rectangle by Tn. We check that T1 = 1 and T2 = 2. We want to prove that they satisfy the recurrence relation Tn = Tn−1 + Tn−2: Consider the domino occupying the rightmost spot in the top row of the tiling. It is either a vertical domino, in which case the rest of the tiling can be interpreted as a tiling of a 2 × (n − 1) rectangle, or it is a horizontal domino, in which case there must be another horizontal domino under it, and the rest of the tiling can be interpreted as a tiling of a 2 × (n − 2) rectangle. Therefore Tn = Tn−1 + Tn−2: Since the number of tilings satisfies the same recurrence relation as the Fibonacci numbers, and T1 = F2 = 1 and T2 = F3 = 2, we may conclude that Tn = Fn+1.
  • MORE-ON-SEMIPRIMES.Pdf

    MORE-ON-SEMIPRIMES.Pdf

    MORE ON FACTORING SEMI-PRIMES In the last few years I have spent some time examining prime numbers and their properties. Among some of my new results are the a Prime Number Function F(N) and the concept of Number Fraction f(N). We can define these quantities as – (N ) N 1 f (N 2 ) 1 f (N ) and F(N ) N Nf (N 3 ) Here (N) is the divisor function of number theory. The interesting property of these functions is that when N is a prime then f(N)=0 and F(N)=1. For composite numbers f(N) is a positive fraction and F(N) will be less than one. One of the problems of major practical interest in number theory is how to rapidly factor large semi-primes N=pq, where p and q are prime numbers. This interest stems from the fact that encoded messages using public keys are vulnerable to decoding by adversaries if they can factor large semi-primes when they have a digit length of the order of 100. We want here to show how one might attempt to factor such large primes by a brute force approach using the above f(N) function. Our starting point is to consider a large semi-prime given by- N=pq with p<sqrt(N)<q By the basic definition of f(N) we get- p q p2 N f (N ) f ( pq) N pN This may be written as a quadratic in p which reads- p2 pNf (N ) N 0 It has the solution- p K K 2 N , with p N Here K=Nf(N)/2={(N)-N-1}/2.