DOCSLIB.ORG

Miscellaneous HOL Examples

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Miscellaneous HOL Examples Miscellaneous HOL Examples December 12, 2016 Contents 1 Some Isar command definitions 15 1.1 Diagnostic command: no state change............. 16 1.2 Old-style global theory declaration............... 16 1.3 Local theory specification.................... 16 2 Infinite Sets and Related Concepts 17 2.1 Infinitely Many and Almost All................. 18 2.2 Enumeration of an Infinite Set................. 21 3 Ad Hoc Overloading 24 3.1 Plain Ad Hoc Overloading.................... 24 3.2 Adhoc Overloading inside Locales................ 25 4 Permutation Types 27 5 Example of Declaring an Oracle 29 5.1 Oracle declaration........................ 29 5.2 Oracle as low-level rule...................... 29 5.3 Oracle as proof method..................... 30 6 Abstract Natural Numbers primitive recursion 34 7 Proof by guessing 37 8 Examples of function definitions 38 8.1 Very basic............................. 38 8.2 Currying.............................. 38 8.3 Nested recursion......................... 38 8.3.1 Here comes McCarthy's 91-function.......... 39 8.4 More general patterns...................... 39 8.4.1 Overlapping patterns................... 39 8.4.2 Guards.......................... 40 1 8.5 Mutual Recursion......................... 41 8.6 Definitions in local contexts................... 41 8.7 fun-cases ............................. 42 8.7.1 Predecessor........................ 42 8.7.2 List to option....................... 42 8.7.3 Boolean Functions.................... 43 8.7.4 Many parameters..................... 43 8.8 Partial Function Definitions................... 43 8.9 Regression tests.......................... 43 8.9.1 Context recursion.................... 44 8.9.2 A combination of context and nested recursion.... 44 8.9.3 Context, but no recursive call.............. 44 8.9.4 Tupled nested recursion................. 44 8.9.5 Let............................. 44 8.9.6 Abbreviations....................... 45 8.9.7 Simple Higher-Order Recursion............. 45 8.9.8 Pattern matching on records.............. 45 8.9.9 The diagonal function.................. 45 8.9.10 Many equations (quadratic blowup).......... 46 8.9.11 Automatic pattern splitting............... 46 8.9.12 Polymorphic partial-function.............. 46 9 Examples of automatically derived induction rules 47 9.1 Some simple induction principles on nat............ 47 10 Test of Locale Interpretation 48 11 Interpretation of Defined Concepts 48 11.1 Lattices.............................. 48 11.1.1 Definitions........................ 48 11.1.2 Total order <= on int .................. 57 11.1.3 Total order <= on nat .................. 58 11.1.4 Lattice dvd on nat .................... 59 11.2 Group example with defined operations inv and unit ..... 61 11.2.1 Locale declarations and lemmas............. 61 11.2.2 Interpretation of Functions............... 65 12 Using extensible records in HOL { points and coloured points 66 12.1 Points............................... 67 12.1.1 Introducing concrete records and record schemes... 67 12.1.2 Record selection and record update........... 67 12.1.3 Some lemmas about records............... 67 12.2 Coloured points: record extension................ 69 12.2.1 Non-coercive structural subtyping........... 70 2 12.3 Other features.......................... 70 12.4 A more complex record expression............... 72 12.5 Some code generation...................... 72 13 A general \while" combinator 72 13.1 Partial version.......................... 72 13.2 Total version........................... 76 14 An application of the While combinator 82 14.1 Example.............................. 82 15 Monoids and Groups as predicates over record schemes 83 16 Binary arithmetic examples 83 16.1 Regression Testing for Cancellation Simprocs......... 83 16.2 Arithmetic Method Tests.................... 85 16.3 The Integers............................ 86 16.4 The Natural Numbers...................... 89 16.5 Real Arithmetic.......................... 91 16.5.1 Addition.......................... 91 16.5.2 Negation......................... 91 16.5.3 Multiplication....................... 91 16.5.4 Inequalities........................ 91 16.5.5 Powers........................... 92 16.5.6 Tests............................ 92 16.6 Complex Arithmetic....................... 98 17 Examples for hexadecimal and binary numerals 99 18 Antiquotations 99 19 Multiple nested quotations and anti-quotations 100 20 Partial equivalence relations 101 20.1 Partial equivalence........................ 101 20.2 Equivalence on function spaces................. 102 20.3 Total equivalence......................... 103 20.4 Quotient types.......................... 103 20.5 Equality on quotients...................... 104 20.6 Picking representing elements.................. 105 21 Summing natural numbers 106 3 22 Three Divides Theorem 108 22.1 Abstract.............................. 108 22.2 Formal proof........................... 108 22.2.1 Miscellaneous summation lemmas............ 108 22.2.2 Generalised Three Divides................ 109 22.2.3 Three Divides Natural.................. 110 23 The Cubic and Quartic Root Formulas 112 24 The Cubic Formula 112 25 The Quartic Formula 115 26 The Pythagorean Theorem 115 27 Higher-Order Logic: Intuitionistic predicate calculus prob- lems 116 28 CTL formulae 122 28.1 Basic fixed point properties................... 123 28.2 The tree induction principle.................. 125 28.3 An application of tree induction................ 127 29 Arithmetic 127 29.1 Splitting of Operators: max, min, abs, op −, nat, op mod, op div ................................. 128 29.2 Meta-Logic............................ 130 29.3 Various Other Examples..................... 130 30 2-3 Trees 132 31 (Finite) multisets 141 31.1 The type of multisets....................... 141 31.2 Representing multisets...................... 142 31.3 Basic operations......................... 144 31.3.1 Conversion to set and membership........... 144 31.3.2 Union........................... 146 31.3.3 Difference......................... 147 31.3.4 Equality of multisets................... 149 31.3.5 Pointwise ordering induced by count.......... 151 31.3.6 Intersection and bounded union............. 155 31.3.7 Additional intersection facts............... 156 31.3.8 Additional bounded union facts............. 159 31.3.9 Subset is an order.................... 160 31.4 Replicate and repeat operations................. 160 4 31.4.1 Simprocs......................... 161 31.4.2 Conditionally complete lattice.............. 162 31.4.3 Filter (with comprehension syntax)........... 167 31.4.4 Size............................ 169 31.5 Induction and case splits..................... 171 31.5.1 Strong induction and subset induction for multisets. 172 31.6 The fold combinator....................... 173 31.7 Image............................... 175 31.8 Further conversions........................ 177 31.9 More properties of the replicate and repeat operations.... 183 31.10Big operators........................... 184 31.11Alternative representations................... 191 31.11.1 Lists............................ 191 31.12The multiset order........................ 195 31.12.1 Well-foundedness..................... 195 31.12.2 Closure-free presentation................ 198 31.13The multiset extension is cancellative for multiset union... 199 31.14Quasi-executable version of the multiset extension...... 200 31.14.1 Partial-order properties................. 201 31.14.2 Monotonicity of multiset union............. 203 31.14.3 Termination proofs with multiset orders........ 203 31.15Legacy theorem bindings..................... 206 31.16Naive implementation using lists................ 208 31.17BNF setup............................ 212 31.18Size setup............................. 219 32 Bubblesort 219 33 Merge Sort 221 34 A lemma for Lagrange's theorem 222 35 Groebner Basis Examples 223 35.1 Basic examples.......................... 223 35.2 Lemmas for Lagrange's theorem................. 224 35.3 Colinearity is invariant by rotation............... 225 36 Substitution and Unification 225 36.1 Terms............................... 226 36.2 Substitutions........................... 226 36.3 Unifiers and Most General Unifiers............... 228 36.4 The unification algorithm.................... 229 36.5 Properties used in termination proof.............. 229 36.6 Termination proof........................ 233 5 36.7 Unification returns a Most General Unifier........... 233 36.8 Unification returns Idempotent Substitution.......... 234 37 Primitive Recursive Functions 236 37.1 Ackermann's Function...................... 236 37.2 Primitive Recursive Functions.................. 238 38 The Full Theorem of Tarski 241 38.1 Partial Order........................... 244 38.2 sublattice............................. 248 38.3 lub................................. 248 38.4 glb................................. 250 38.5 fixed points............................ 251 38.6 lemmas for Tarski, lub...................... 251 38.7 Tarski fixpoint theorem 1, first part.............. 252 38.8 interval.............................. 253 38.9 Top and Bottom......................... 256 38.10fixed points form a partial order................ 257 39 Classical Predicate Calculus Problems 260 39.1 Traditional Classical Reasoner.................. 260 39.1.1 Pelletier's examples................... 260 39.1.2 Classical Logic: examples with quantifiers....... 262 39.1.3 Problems requiring quantifier duplication....... 262 39.1.4 Hard examples with quantifiers............. 263 39.1.5 Problems (mainly)
Load more

Recommended publications
  • A NOTE on the GAUSSIAN MOAT PROBLEM Real Axis
    A NOTE ON THE GAUSSIAN MOAT PROBLEM MADHUPARNA DAS Abstract. The Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded. In this paper, we have proved that the answer is ‘No’, that is an infinite sequence of distinct Gaussian prime numbers can not be bounded by an absolute constant, for the Gaussian primes p = a2 + b2 with a, b =6 0. We consider each prime (a, b) as a lattice point on the complex plane and use their properties to prove the main result. 1. Introduction Primes are always interesting topics for mathematicians. After lots of research work still, we don’t have any explicit formula for the distribution of the natural prime numbers. Prime number theorem gives an asymptotic formula for primes with some bounded error. Also, the prime number theorem implies that there are arbitrarily large gaps in the sequence of prime numbers, and this can also be proved directly: for any n, the n 1 consecutive numbers n!+2,n!+3,...,n!+ n are all composite. It’s very easy for natural primes− that it is not possible to walk to infinity with stepping on the natural prime numbers with bounded length gap. Now we can think about the same problem for the complex prime numbers or explicitly for ‘Gaussian Primes’. So, the question says: “Whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded.
    [Show full text]
  • On Prime Numbers and Related Applications
    International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-8 Issue-12, October 2019 On Prime Numbers and Related Applications V Yegnanarayanan, Veena Narayanan, R Srikanth Abstract: In this paper we probed some interesting aspects of Our motivating factor for this work stems from the classic primorial and factorial primes. We did some numerical analysis result of called Prime Number Theorem which beautifully about the distribution of prime numbers and tabulated our models the statistical behavioral pattern of huge primes viz., findings. Also, we pointed out certain interesting facts about the utility value of the study of prime numbers and their distributions chance for an arbitrarily picked 푛휖푁 to be a prime number is in control engineering and Brain networks. inverse in proportion to log(푛). Keywords: Factorial primes, Primorial primes, Prime numbers. II. RESULTS AND DISCUSSIONS I. INTRODUCTION A. Discussion on Primorial and Factorial Primes The irregular distribution of prime numbers makes it Our journey is driven by fascinating characteristics of difficult for us to presume and discover. Euclid about 2300 primordial primes and factorial primes. A primordial years before established that primes are infinitely many. Till function denoted 푃# is the product of all primes till P and date we are not aware of a formula for finding the nth 푛 includes P. The factorial function is 푛! = 푖=1 푖. A natural prime. It appears as if they are randomly embedded in N and curiosity pushes us to probe large primes. In order to do this, may be because of this that sequences of primes do not tend we need to get an idea by analyzing numbers such as to emanate from naturally happening processes.
    [Show full text]
  • Integer Sequences
    UHX6PF65ITVK Book > Integer sequences Integer sequences Filesize: 5.04 MB Reviews A very wonderful book with lucid and perfect answers. It is probably the most incredible book i have study. Its been designed in an exceptionally simple way and is particularly just after i finished reading through this publication by which in fact transformed me, alter the way in my opinion. (Macey Schneider) DISCLAIMER | DMCA 4VUBA9SJ1UP6 PDF > Integer sequences INTEGER SEQUENCES Reference Series Books LLC Dez 2011, 2011. Taschenbuch. Book Condition: Neu. 247x192x7 mm. This item is printed on demand - Print on Demand Neuware - Source: Wikipedia. Pages: 141. Chapters: Prime number, Factorial, Binomial coeicient, Perfect number, Carmichael number, Integer sequence, Mersenne prime, Bernoulli number, Euler numbers, Fermat number, Square-free integer, Amicable number, Stirling number, Partition, Lah number, Super-Poulet number, Arithmetic progression, Derangement, Composite number, On-Line Encyclopedia of Integer Sequences, Catalan number, Pell number, Power of two, Sylvester's sequence, Regular number, Polite number, Ménage problem, Greedy algorithm for Egyptian fractions, Practical number, Bell number, Dedekind number, Hofstadter sequence, Beatty sequence, Hyperperfect number, Elliptic divisibility sequence, Powerful number, Znám's problem, Eulerian number, Singly and doubly even, Highly composite number, Strict weak ordering, Calkin Wilf tree, Lucas sequence, Padovan sequence, Triangular number, Squared triangular number, Figurate number, Cube, Square triangular
    [Show full text]
  • New Congruences and Finite Difference Equations For
    New Congruences and Finite Difference Equations for Generalized Factorial Functions Maxie D. Schmidt University of Washington Department of Mathematics Padelford Hall Seattle, WA 98195 USA [email protected] Abstract th We use the rationality of the generalized h convergent functions, Convh(α, R; z), to the infinite J-fraction expansions enumerating the generalized factorial product se- quences, pn(α, R)= R(R + α) · · · (R + (n − 1)α), defined in the references to construct new congruences and h-order finite difference equations for generalized factorial func- tions modulo hαt for any primes or odd integers h ≥ 2 and integers 0 ≤ t ≤ h. Special cases of the results we consider within the article include applications to new congru- ences and exact formulas for the α-factorial functions, n!(α). Applications of the new results we consider within the article include new finite sums for the α-factorial func- tions, restatements of classical necessary and sufficient conditions of the primality of special integer subsequences and tuples, and new finite sums for the single and double factorial functions modulo integers h ≥ 2. 1 Notation and other conventions in the article 1.1 Notation and special sequences arXiv:1701.04741v1 [math.CO] 17 Jan 2017 Most of the conventions in the article are consistent with the notation employed within the Concrete Mathematics reference, and the conventions defined in the introduction to the first articles [11, 12]. These conventions include the following particular notational variants: ◮ Extraction of formal power series coefficients. The special notation for formal n k power series coefficient extraction, [z ] k fkz :7→ fn; ◮ Iverson’s convention.
    [Show full text]
  • Searching for a Counterexample to Kurepa's Conjecture
    SEARCHING FOR A COUNTEREXAMPLE TO KUREPA'S CONJECTURE VLADICA ANDREJIC´ AND MILOS TATAREVIC Abstract. Kurepa's conjecture states that there is no odd prime p that di- vides !p = 0!+1!+···+(p−1)!. We search for a counterexample to this conjec- ture for all p < 234. We introduce new optimization techniques and perform the computation using graphics processing units. Additionally, we consider the generalized Kurepa's left factorial given by !kn = (0!)k +(1!)k +···+((n−1)!)k, and show that for all integers 1 < k < 100 there exists an odd prime p such that p j!kp. 1. Introduction ¯Duro Kurepa defines an arithmetic function !n, known as the left factorial, by !n = 0! + 1! + ··· + (n − 1)! [14]. He conjectures that GCD(!n; n!) = 2 holds for all integers n > 1. This conjecture, originally introduced in 1971 [14], is also listed in [10, Section B44] and remains an open problem. For additional information, the reader can consult the expository article [12]. It is easy to see that the statement above is equivalent to the statement that !n is not divisible by n > 2, which can be reduced to primes. Thus, Kurepa's conjecture states that there is no odd prime p such that p divides !p. There have been numerous attempts to solve this problem, mostly by searching for a counterexample. The results of these attempts are listed in the accompanying table. Upper Bound Author Year p < 3 · 105 Z.ˇ Mijajlovi´c[16] 1990 p < 106 G. Gogi´c[9] 1991 p < 3 · 106 B. Maleˇsevi´c[15] 1998 p < 223 M.
    [Show full text]
  • Factoring of Large Numbers
    FACTORING OF LARGE NUMBERS It is well known that any number N can be represented as the product of a finite number of primes taken to the specified integer powers. Thus- 13867 = (7)2 (283) with sqrt(13867)= 117.756.. 23974723= (151) (179) (887) with sqrt(23974723)= 4896.398.. 43567217=(5021) (8677) with sqrt(43567217)= 6600.546.. 67537=67537 The first three examples represent composite numbers while the last is a prime. Now we know from some of our earlier notes that all primes above p=3 have the form- p=6n1 , where n=1,2,3,4,… This is a necessary but not sufficient condition for primes since there can be many composite numbers which also have this same form. We want to show here how to distinguish between a composite and prime number satisfying the 6n1 condition and from this deduce the product form of any number N. Since we don’t know before hand into how many prime terms a number N will factor, we begin with the safe bet that if N is a semi-prime N=pq, then p<sqrt(N), provided that p<q. If it is composed of three terms N=pqr, even when some of the factors appear multiple times, then it is save to assume that at least one of the primes is less than N1/3 and so on. So we definitely can state, regardless of the number of prime products present in N, at least one of them will always be less than the square-root of N unless the number itself is already a prime.
    [Show full text]
  • Numbers 1 to 100
    Numbers 1 to 100 PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Tue, 30 Nov 2010 02:36:24 UTC Contents Articles −1 (number) 1 0 (number) 3 1 (number) 12 2 (number) 17 3 (number) 23 4 (number) 32 5 (number) 42 6 (number) 50 7 (number) 58 8 (number) 73 9 (number) 77 10 (number) 82 11 (number) 88 12 (number) 94 13 (number) 102 14 (number) 107 15 (number) 111 16 (number) 114 17 (number) 118 18 (number) 124 19 (number) 127 20 (number) 132 21 (number) 136 22 (number) 140 23 (number) 144 24 (number) 148 25 (number) 152 26 (number) 155 27 (number) 158 28 (number) 162 29 (number) 165 30 (number) 168 31 (number) 172 32 (number) 175 33 (number) 179 34 (number) 182 35 (number) 185 36 (number) 188 37 (number) 191 38 (number) 193 39 (number) 196 40 (number) 199 41 (number) 204 42 (number) 207 43 (number) 214 44 (number) 217 45 (number) 220 46 (number) 222 47 (number) 225 48 (number) 229 49 (number) 232 50 (number) 235 51 (number) 238 52 (number) 241 53 (number) 243 54 (number) 246 55 (number) 248 56 (number) 251 57 (number) 255 58 (number) 258 59 (number) 260 60 (number) 263 61 (number) 267 62 (number) 270 63 (number) 272 64 (number) 274 66 (number) 277 67 (number) 280 68 (number) 282 69 (number) 284 70 (number) 286 71 (number) 289 72 (number) 292 73 (number) 296 74 (number) 298 75 (number) 301 77 (number) 302 78 (number) 305 79 (number) 307 80 (number) 309 81 (number) 311 82 (number) 313 83 (number) 315 84 (number) 318 85 (number) 320 86 (number) 323 87 (number) 326 88 (number)
    [Show full text]
  • Logarithm of the Exponents in the Prime Factorization of the Factorial
    International Mathematical Forum, Vol. 12, 2017, no. 13, 643 - 649 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.7543 Logarithm of the Exponents in the Prime Factorization of the Factorial Rafael Jakimczuk Divisi´onMatem´atica,Universidad Nacional de Luj´an Buenos Aires, Argentina Copyright c 2017 Rafael Jakimczuk. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc- tion in any medium, provided the original work is properly cited. Abstract P In this note we study the sum 2≤p≤n log E(p) where E(p) is the exponent of the prime p in the prime factorization of n!, the sum P 2≤p≤n HE(p), where Hk denotes the k-th harmonic number and an- other sums. We also consider the generalized harmonic numbers Hk;m of order m and obtain a strong connection between these sums and the Riemann zeta function. Mathematics Subject Classification: 11A99, 11B99 Keywords: Factorial, prime factorization, Exponents, Logarithm 1 Introduction Let us consider the prime factorization of a positive integer a s1 s2 sk a = p1 p2 ··· pk ; where p1; p2; : : : ; pk are the different primes in the prime factorization and s1; s2; : : : ; sk are the exponents. The total number of prime factors in the prime factorization is denoted Ω(a) (see [1, chapter XXII]), that is, Ω(a) = s1 + s2 + ··· + sk: 644 Rafael Jakimczuk Let us consider the factorial n!, the exponent of a prime p in its prime factor- ization will be denoted E(p). Then we can write the prime factorization of n! in the form n! = Y pE(p) 2≤p≤n since, clearly, the primes that appear in the prime factorization of n! are the primes not exceeding n.
    [Show full text]
  • Subject Index
    Subject Index Many of these terms are defined in the glossary, others are defined in the Prime Curios! themselves. The boldfaced entries should indicate the key entries. γ 97 Arecibo Message 55 φ 79, 184, see golden ratio arithmetic progression 34, 81, π 8, 12, 90, 102, 106, 129, 136, 104, 112, 137, 158, 205, 210, 154, 164, 172, 173, 177, 181, 214, 219, 223, 226, 227, 236 187, 218, 230, 232, 235 Armstrong number 215 5TP39 209 Ars Magna 20 ASCII 66, 158, 212, 230 absolute prime 65, 146, 251 atomic number 44, 51, 64, 65 abundant number 103, 156 Australopithecus afarensis 46 aibohphobia 19 autism 85 aliquot sequence 13, 98 autobiographical prime 192 almost-all-even-digits prime 251 averaging sets 186 almost-equipandigital prime 251 alphabet code 50, 52, 61, 65, 73, Babbage 18, 146 81, 83 Babbage (portrait) 147 alphaprime code 83, 92, 110 balanced prime 12, 48, 113, 251 alternate-digit prime 251 Balog 104, 159 Amdahl Six 38 Balog cube 104 American Mathematical Society baseball 38, 97, 101, 116, 127, 70, 102, 196, 270 129 Antikythera mechanism 44 beast number 109, 129, 202, 204 apocalyptic number 72 beastly prime 142, 155, 229, 251 Apollonius 101 bemirp 113, 191, 210, 251 Archimedean solid 19 Bernoulli number 84, 94, 102 Archimedes 25, 33, 101, 167 Bernoulli triangle 214 { Page 287 { Bertrand prime Subject Index Bertrand prime 211 composite-digit prime 59, 136, Bertrand's postulate 111, 211, 252 252 computer mouse 187 Bible 23, 45, 49, 50, 59, 72, 83, congruence 252 85, 109, 158, 194, 216, 235, congruent prime 29, 196, 203, 236 213, 222, 227,
    [Show full text]
  • (12) United States Patent (10) Patent No.: US 7,917,525 B2 Rawlingswi Et All E 45) Date of Patent : Mar.E 29, 2011
    USOO791 7525B2 (12) United States Patent (10) Patent No.: US 7,917,525 B2 RawlingsWi et all e 45) Date of Patent : Mar.e 29, 2011 (54) ANALYZING ADMINISTRATIVE 5,956,689 A 9/1999 Everhart, III ..................... 705/3 HEALTHCARE CLAMS DATA AND OTHER 5,970,463 A 10/1999 Cave et al. ..... ... TOS/3 5,970.464 A 10/1999 Apte et al. ......... ... TOS/4 DATASOURCES 6,014,631 A 1/2000 Teagarden et al. ... TOS/3 6,137,911 A 10/2000 Zhilyaev ............ 382,225 (75) Inventors: Jean Rawlings, Roy, UT (US); David 6,151,581. A 1 1/2000 Kraftson et al. ... TOS/3 Anderson, Chaska, MN (US); Carl 6,223,164 B1 4/2001 Seare et al. .... ... TOS/2 Kraus, Raleigh, NC (US); Andrew 6.253,186 B1 6/2001 Pendleton, Jr. ... TOS/2 r s s 6,370,511 B1 4/2002 Dang ............. ... TOS/3 Paris, Victor, NY (US) 6,732,113 B1 5/2004 Ober et al. .................... 707/102 (73) Assignee: Ingenix, Inc., Eden Prairie, MN (US) (Continued) (*) Notice: Subject to any disclaimer, the term of this FOREIGN PATENT DOCUMENTS patent is extended or adjusted under 35 EP 1420344 A2 * 5, 2004 U.S.C. 154(b) by 357 days. OTHER PUBLICATIONS (21) Appl. No.: 11/567,577 Grunwald et al., “Analysis of Genotypic Diversity Data for Popula (22) Filed Dec. 6, 2006 tions of Microorganisms.” Phytopathology, 93:738-746, 2003. 1C ec. O, (Continued) (65) Prior Publication Data US 2007/O174252A1 Jul 26, 2007 Primary Examiner — John R. Cottingham s Assistant Examiner — Susan F Rayyan Related U.S.
    [Show full text]
  • A-Primer-On-Prime-Numbers.Pdf
    A Primer on Prime Numbers Prime Numbers “Prime numbers are the very atoms of arithmetic. The primes are the jewels studded throughout the vast expanse of the infinite universe of numbers that mathematicians have studied down the centuries.” Marcus du Sautoy, The Music of the Primes 2 • Early Primes • Named Primes • Hunting for Primes • Visualizing Primes • Harnessing Primes 3 Ishango bone The Ishango bone is a bone tool, dated to the Upper Paleolithic era, about 18,000 to 20,000 BC. It is a dark brown length of bone, the fibula of a baboon, It has a series of tally marks carved in three columns running the length of the tool Note: image is 4 reversed A History and Exploration of Prime Numbers • In the book How Mathematics Happened: The First 50,000 Years, Peter Rudman argues that the development of the concept of prime numbers could have come about only after the concept of division, which he dates to after 10,000 BC, with prime numbers probably not being understood until about 500 BC. He also writes that "no attempt has been made to explain why a tally of something should exhibit multiples of two, prime numbers between 10 and 20,… Left column 5 https://en.wikipedia.org/wiki/Ishango_bone Euclid of Alexandria 325-265 B.C. • The only man to summarize all the mathematical knowledge of his times. • In Proposition 20 of Book IX of the Elements, Euclid proved that there are infinitely many prime numbers. https://en.wikipedia.org/wiki/Euclid 6 Eratosthenes of Cyrene 276-194 B.C.
    [Show full text]
  • Primes of the Form N!1
    PRIMES OF THE FORM N!1 Several years ago we first made the observation that certain the factorial terms N!+1 and N!-1 often have the form of primes such as 3!-1=5, 3!+1=7, 4!-1=23. We want in this note to show why such primes exist and that there probably are an infinite number of these prime sub-group members. Let us begin by writing out the first fifteen integers and their factorial form and corresponding exponential vectors. We get the following table- N N! Exponential Vector 1 1 [0 0 0 0 0 0 0 0] 2 2 [1 0 0 0 0 0 0 0] 3 6 [1 1 0 0 0 0 0 0] 4 24 [3 1 0 0 0 0 0 0] 5 120 [3 1 1 0 0 0 0 0] 6 720 [4 2 1 0 0 0 0 0] 7 5040 [4 2 1 1 0 0 0 0] 8 40320 [7 2 1 1 0 0 0 0] 9 362880 [7 4 1 1 0 0 0 0] 10 3628800 [8 4 2 1 0 0 0 0] 11 39916800 [8 4 2 1 1 0 0 0] 12 479001600 [10 5 2 1 1 0 0 0] 13 6227020800 [10 5 2 1 1 1 0 0] 14 87178291200 [11 5 2 2 1 1 0 0] 15 1307674368000 [11 6 3 2 1 1 0 0] What is noticeable at once from the exponential vector forms shown is that N! is dominated by two taken to a positive power with three following at a lower power and five at a still lower power.
    [Show full text]