DOCSLIB.ORG

From Vedic Square to the Digital Root ‘Clockworks’ of Modulo 90 Factorization

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
From Vedic Square to the Digital Root ‘Clockworks’ of Modulo 90 Factorization From Vedic Square to the Digital Root ‘Clockworks’ of Modulo 90 Factorization "Vedic Mathematics is...a sophisticated pedagogic and research tool ... ." – Dr. L.M. Singhvi, former UK High Commissioner for India, from his forward to Cosmic Calculator, by Williams & Gaskell Mathematicians from India’s ancient past are credited with inventing the ‘Vedic Square’ (pictured above). As anyone who has studied Vedic mathematics is aware, this deceptively simple multiplication matrix is a powerful analytical and computational tool. The numbers in the table’s column and row headings are cross-multiplied, and their products converted to their digital roots, distributed across 92 cells. [Digital root (aka repeated digit sum, iterated sum-of-digits, or modulus 9 function) refers to the single digit (1 - 9) that results when all digit sums are summed in turn; this reflects the fact that any natural number is congruent modulo 9 to its digital root. For example: 89 = 8+9 = 17 = 1+7 = 8, or dr(89) = 8.] When it comes to The Digital Root, we completely agree with the importance attributed to it by Talal Ghannam, Ph.D. (in physics): “It was through my search for meaning that I discovered how important the digital root space is, which in return rewarded me with a look at how elegant and beautiful the world really is.” from The Mystery of Numbers Revealed Through Their Digital Root. In the color-coded matrix below we apply the Vedic Square concept to the period-24 digital root of natural numbers not divisible by 2, 3, or 5─otherwise known as n ≡ {1, 7, 11, 13, 17, 19, 23, 29} modulo 30. We then expand the frame (x 3) to encompass n ≡ {1, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 77, 79, 83, 89} modulo 90. We’ll call this sequence our ‘domain.’ This action synchronizes the modulus with its period-24 digital root, and ─ as we shall discover ─ creates an explosion of symmetries. By definition, our domain consists of the number 1 and all prime numbers > 5 and their multiplicative multiples. The matrix below colorfully exposes the perfect symmetry underpinning factorization of our domain at the digital root level. This object expands geometrically to infinity, and can be configured to spiral within a modulo 90 factorization wheel (ref: primesdemystified.com): From Vedic Square to the Digital Root ‘Clockworks’ of Modulo 90 Factorization Given that by definition none of the elements in our defined domain are divisible by 3, you’ll find no 3’s, 6’s, or 9’s in its period-24 digital root sequence, viz. {1, 7, 2, 4, 8, 1, 5, 2, 4, 1, 5, 7, 2, 4, 8, 5, 7, 4, 8, 1, 5, 7, 2, 8} {repeat …}, comprised 4 each of numbers 1, 2, 4, 5, 7, and 8. This knowledge allows us to ‘collapse’ the Vedic Square, as pictured below (and we note that technically the subset {1, 2, 4, 5, 7, 8} forms a cyclic group of multiplicative units in the ring .) From our ‘Vedic Square Light’ matrix we can then extrapolate the 36 digital root dyads that drive factorization sequencing of composite numbers within our domain: Then, again employing the Vedic Square concept, we produce a sister matrix, albeit in her case we’ve converted the cross-multiplied products to their modulo 90 congruence rather than their digital roots (and note that the principal diagonal (highlighted in blue) sequences the squares, while the secondary diagonal (highlighted in pink) is comprised exclusively of prime numbers): From Vedic Square to the Digital Root ‘Clockworks’ of Modulo 90 Factorization And the beauty of it is that from the matrix pictured above we can extrapolate 24 sets of 24 = 576 modulo 90 factorization dyads that account for all composite numbers within our domain (and note that each set has perfect bilateral 90-sum symmetry): From Vedic Square to the Digital Root ‘Clockworks’ of Modulo 90 Factorization Lastly, we conjoin the 36 digital root operations of modulo 30 factorization with the 24 x 24 modulo 90 multiplication matrix to expose the beautiful ‘clockworks’ at the heart of factorization. The 576 dyads distribute evenly to 36 sets of 16: From Vedic Square to the Digital Root ‘Clockworks’ of Modulo 90 Factorization From Vedic Square to the Digital Root ‘Clockworks’ of Modulo 90 Factorization These digital root and modulo 90 dyadic patterns expose the profoundly beautiful symmetries and ‘initial conditions’ that ultimately determine the distribution of all prime numbers > 5. And if you’re asking, “How do you account for the first three primes: 2, 3, and 5?” The simple answer is that they and their primorial, 30, determine the structure within which factorization algorithms operate. Nor have 3, 6, and 9 disappeared from the scene: They are also present structurally as the digital root of modulo 30, 60, 90 cycles, and perhaps more profoundly in the form of rotating symmetry groups: equilateral triangles with vertices {1,4,7} and {2,5,8} that combinatorially rotate the vertices of equilateral triangle {3,6,9}, while the “trinity of triangles” rotate within a 9/3 star polygon in 24 period-24 cycles. 242 = 576.) Regardless, the beating heart at the center of these patterns is the Vedic Square. Go figure. The Guerrilla Arithmetician primesdemystified.com This work is licensed by its author, Gary William Croft, under a Creative Commons Attribute Share-Alike 3.0 Unported License. 08.11.2018 .
Load more

Recommended publications
  • A Clasification of Known Root Prime-Generating
    Special properties of the first absolute Fermat pseudoprime, the number 561 Marius Coman Bucuresti, Romania email: [email protected] Abstract. Though is the first Carmichael number, the number 561 doesn’t have the same fame as the third absolute Fermat pseudoprime, the Hardy-Ramanujan number, 1729. I try here to repair this injustice showing few special properties of the number 561. I will just list (not in the order that I value them, because there is not such an order, I value them all equally as a result of my more or less inspired work, though they may or not “open a path”) the interesting properties that I found regarding the number 561, in relation with other Carmichael numbers, other Fermat pseudoprimes to base 2, with primes or other integers. 1. The number 2*(3 + 1)*(11 + 1)*(17 + 1) + 1, where 3, 11 and 17 are the prime factors of the number 561, is equal to 1729. On the other side, the number 2*lcm((7 + 1),(13 + 1),(19 + 1)) + 1, where 7, 13 and 19 are the prime factors of the number 1729, is equal to 561. We have so a function on the prime factors of 561 from which we obtain 1729 and a function on the prime factors of 1729 from which we obtain 561. Note: The formula N = 2*(d1 + 1)*...*(dn + 1) + 1, where d1, d2, ...,dn are the prime divisors of a Carmichael number, leads to interesting results (see the sequence A216646 in OEIS); the formula M = 2*lcm((d1 + 1),...,(dn + 1)) + 1 also leads to interesting results (see the sequence A216404 in OEIS).
    [Show full text]
  • A NEW LARGEST SMITH NUMBER Patrick Costello Department of Mathematics and Statistics, Eastern Kentucky University, Richmond, KY 40475 (Submitted September 2000)
    A NEW LARGEST SMITH NUMBER Patrick Costello Department of Mathematics and Statistics, Eastern Kentucky University, Richmond, KY 40475 (Submitted September 2000) 1. INTRODUCTION In 1982, Albert Wilansky, a mathematics professor at Lehigh University wrote a short article in the Two-Year College Mathematics Journal [6]. In that article he identified a new subset of the composite numbers. He defined a Smith number to be a composite number where the sum of the digits in its prime factorization is equal to the digit sum of the number. The set was named in honor of Wi!anskyJs brother-in-law, Dr. Harold Smith, whose telephone number 493-7775 when written as a single number 4,937,775 possessed this interesting characteristic. Adding the digits in the number and the digits of its prime factors 3, 5, 5 and 65,837 resulted in identical sums of42. Wilansky provided two other examples of numbers with this characteristic: 9,985 and 6,036. Since that time, many things have been discovered about Smith numbers including the fact that there are infinitely many Smith numbers [4]. The largest Smith numbers were produced by Samuel Yates. Using a large repunit and large palindromic prime, Yates was able to produce Smith numbers having ten million digits and thirteen million digits. Using the same large repunit and a new large palindromic prime, the author is able to find a Smith number with over thirty-two million digits. 2. NOTATIONS AND BASIC FACTS For any positive integer w, we let S(ri) denote the sum of the digits of n.
    [Show full text]
  • 2019 Practice Mathcounts Solutions
    2019 Practice Mathcounts Solutions Austin Math Circle January 20, 2019 1 Sprint Round Problem 1. What is the sum of the first five odd numbers and the first four even numbers? Solution. This is simply the sum of all the integers one through nine, which is 45 . Proposed by Jay Leeds. Problem 2. Shipping a box costs a flat rate of $5 plus $2 for every pound after the first five pounds. How much does it cost to ship a 18-pound box? Solution. An 18-pound box has 13 excess pounds, so our fee is 13 $2 $5 $31 . ¢ Å Æ Proposed by Jay Leeds. Problem 3. In rectangle ABCD, AB 6, BC 8, and M is the midpoint of AB. What is the area of triangle Æ Æ CDM? Solution. We see that this triangle has base six and height eight, so its area is 6 8/2 24 . ¢ Æ Proposed by Jay Leeds. Problem 4. Creed flips three coins. What is the probability that he flips heads at least once? Express your answer as a common fraction. 3 Solution. There is a ¡ 1 ¢ 1 chance that Creed flips no heads, so the probability that he flips at least once heads 2 Æ 8 7 is 1 1 . ¡ 8 Æ 8 Proposed by Jay Leeds. Problem 5. Compute the median of the following five numbers: A 43 , B 4.5, C 23 , D 22, and E 4.9. Æ 9 Æ Æ 5 Æ Æ Write A, B, C, D, or E as your answer. Solution. We can easily sort 22 4, 4.5, and 4.9.
    [Show full text]
  • Sequences of Primes Obtained by the Method of Concatenation
    SEQUENCES OF PRIMES OBTAINED BY THE METHOD OF CONCATENATION (COLLECTED PAPERS) Copyright 2016 by Marius Coman Education Publishing 1313 Chesapeake Avenue Columbus, Ohio 43212 USA Tel. (614) 485-0721 Peer-Reviewers: Dr. A. A. Salama, Faculty of Science, Port Said University, Egypt. Said Broumi, Univ. of Hassan II Mohammedia, Casablanca, Morocco. Pabitra Kumar Maji, Math Department, K. N. University, WB, India. S. A. Albolwi, King Abdulaziz Univ., Jeddah, Saudi Arabia. Mohamed Eisa, Dept. of Computer Science, Port Said Univ., Egypt. EAN: 9781599734668 ISBN: 978-1-59973-466-8 1 INTRODUCTION The definition of “concatenation” in mathematics is, according to Wikipedia, “the joining of two numbers by their numerals. That is, the concatenation of 69 and 420 is 69420”. Though the method of concatenation is widely considered as a part of so called “recreational mathematics”, in fact this method can often lead to very “serious” results, and even more than that, to really amazing results. This is the purpose of this book: to show that this method, unfairly neglected, can be a powerful tool in number theory. In particular, as revealed by the title, I used the method of concatenation in this book to obtain possible infinite sequences of primes. Part One of this book, “Primes in Smarandache concatenated sequences and Smarandache-Coman sequences”, contains 12 papers on various sequences of primes that are distinguished among the terms of the well known Smarandache concatenated sequences (as, for instance, the prime terms in Smarandache concatenated odd
    [Show full text]
  • Conjecture of Twin Primes (Still Unsolved Problem in Number Theory) an Expository Essay
    Surveys in Mathematics and its Applications ISSN 1842-6298 (electronic), 1843-7265 (print) Volume 12 (2017), 229 { 252 CONJECTURE OF TWIN PRIMES (STILL UNSOLVED PROBLEM IN NUMBER THEORY) AN EXPOSITORY ESSAY Hayat Rezgui Abstract. The purpose of this paper is to gather as much results of advances, recent and previous works as possible concerning the oldest outstanding still unsolved problem in Number Theory (and the most elusive open problem in prime numbers) called "Twin primes conjecture" (8th problem of David Hilbert, stated in 1900) which has eluded many gifted mathematicians. This conjecture has been circulating for decades, even with the progress of contemporary technology that puts the whole world within our reach. So, simple to state, yet so hard to prove. Basic Concepts, many and varied topics regarding the Twin prime conjecture will be cover. Petronas towers (Twin towers) Kuala Lumpur, Malaysia 2010 Mathematics Subject Classification: 11A41; 97Fxx; 11Yxx. Keywords: Twin primes; Brun's constant; Zhang's discovery; Polymath project. ****************************************************************************** http://www.utgjiu.ro/math/sma 230 H. Rezgui Contents 1 Introduction 230 2 History and some interesting deep results 231 2.1 Yitang Zhang's discovery (April 17, 2013)............... 236 2.2 "Polymath project"........................... 236 2.2.1 Computational successes (June 4, July 27, 2013)....... 237 2.2.2 Spectacular progress (November 19, 2013)........... 237 3 Some of largest (titanic & gigantic) known twin primes 238 4 Properties 240 5 First twin primes less than 3002 241 6 Rarefaction of twin prime numbers 244 7 Conclusion 246 1 Introduction The prime numbers's study is the foundation and basic part of the oldest branches of mathematics so called "Arithmetic" which supposes the establishment of theorems.
    [Show full text]
  • Solutions and Investigations
    UKMT UKMT UKMT Junior Mathematical Challenge Thursday 30th April 2015 Organised by the United Kingdom Mathematics Trust supported by Solutions and investigations These solutions augment the printed solutions that we send to schools. For convenience, the solutions sent to schools are confined to two sides of A4 paper and therefore in many casesare rather short. The solutions given here have been extended. In some cases we give alternative solutions, and we have included some exercises for further investigation. We welcome comments on these solutions. Please send them to [email protected]. The Junior Mathematical Challenge (JMC) is a multiple-choice paper. For each question, you are presented with five options, of which just one is correct. It follows that often you canfindthe correct answers by working backwards from the given alternatives, or by showing that four of them are not correct. This can be a sensible thing to do in the context of the JMC. However, this does not provide a full mathematical explanation that would be acceptable if you were just given the question without any alternative answers. So for each question we have included a complete solution which does not use the fact that one of the given alternatives is correct. Thus we have aimed to give full solutions with all steps explained. We therefore hope that these solutions can be used as a model for the type of written solution that is expected when presenting a complete solution to a mathematical problem (for example, in the Junior Mathematical Olympiad and similar competitions). These solutions may be used freely within your school or college.
    [Show full text]
  • Number Theory Boring? Nein!
    Running head: PATTERNS IN NINE 1 Number Theory Boring? Nein! Discerning Patterns in Multiples of Nine Gina Higgins Mathematical Evolutions Jenny McCarthy, Jonathan Phillips Summer Ventures in Science and Mathematics The University of North Carolina at Charlotte PATTERNS IN NINE 2 Abstract This is the process Gina Higgins went through in order to prove that the digital sum of a whole, natural number multiplied by nine would always equal nine. This paper gives a brief history on the number nine and gives a color coded, three-hundred row chart of multiplies of nine as an example and reference. Basic number theory principles were applied with Mathematical Implementation to successfully create a method that confirmed the hypothesis that the digital root of every product of nine equals nine. From this method could evolve into possible future attempts to prove why the digital root anomaly occurred. PATTERNS IN NINE 3 The number nine is the largest digit in a based ten number (decimal) system. In many ancient cultures such as China, India and Egypt, the number nine was a symbol of strength representing royalty, religion or powerful enemies (Mackenzie, 2005). The symbol for the number nine used most commonly today developed from the Hindu-Arabic System written in the third century. Those symbols developed from the Brahmi numerals found as far back as 300 BC. (Ifrah, 1981) Figure 1 Number theory is a branch of mathematics dealing specifically with patterns and sequences found in whole numbers. It was long considered the purest form of mathematics because there was not a practical application until the 20th century when the computer was invented.
    [Show full text]
  • INDEX to ANSWERS Issue Page Number Symmetryplus 60 2
    INDEX TO ANSWERS Issue Page number SYMmetryplus 60 2 SYMmetryplus 61 4 SYMmetryplus 62 5 SYMmetryplus 63 8 SYMmetryplus 64 9 SYMmetryplus 65 10 SYMmetryplus 66 13 SYMmetryplus 67 15 SYMmetryplus 68 17 SYMmetryplus 69 21 SYMmetryplus 70 25 SYMmetryplus 71 29 SYMmetryplus 72 33 SYMmetryplus 73 37 SYMmetryplus 74 44 1 ANSWERS FROM ISSUE 60 SOME TRIANGLE NUMBERS – 2 Many thanks to Andrew Palfreyman who found five, not four solutions! 7 7 7 7 7 1 0 5 3 0 0 4 0 6 9 0 3 9 4 6 3 3 3 3 1 Grid A 6 6 1 3 2 6 2 0 1 6 0 0 Grid B CROSSNUMBER Many thanks again to Andrew Palfreyman who pointed out that 1 Down and 8 Across do not give unique answers so there are four possible solutions. 1 2 1 2 1 2 1 2 1 4 4 8 1 4 4 8 1 4 4 8 1 4 4 8 3 3 3 3 3 9 1 9 8 9 1 9 3 9 1 9 8 9 1 9 4 5 4 5 4 5 4 5 2 3 1 0 2 3 1 0 2 3 1 0 2 3 1 0 6 7 6 7 6 7 6 7 1 0 9 8 1 0 9 8 1 0 9 8 1 0 9 8 8 9 8 9 8 9 8 9 3 6 1 0 3 6 1 0 9 6 1 0 9 6 1 0 10 10 10 10 5 3 4 3 5 3 4 3 5 3 4 3 5 3 4 3 TREASURE HUNTS 12, 13 12 This is a rostral column in St Petersburg, Russia.
    [Show full text]
  • Sequences of Numbers Obtained by Digit and Iterative Digit Sums of Sophie Germain Primes and Its Variants
    Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 2 (2016), pp. 1473-1480 © Research India Publications http://www.ripublication.com Sequences of numbers obtained by digit and iterative digit sums of Sophie Germain primes and its variants 1Sheila A. Bishop, *1Hilary I. Okagbue, 2Muminu O. Adamu and 3Funminiyi A. Olajide 1Department of Mathematics, Covenant University, Canaanland, Ota, Nigeria. 2Department of Mathematics, University of Lagos, Akoka, Lagos, Nigeria. 3Department of Computer and Information Sciences, Covenant University, Canaanland, Ota, Nigeria. Abstract Sequences were generated by the digit and iterative digit sums of Sophie Germain and Safe primes and their variants. The results of the digit and iterative digit sum of Sophie Germain and Safe primes were almost the same. The same applied to the square and cube of the respective primes. Also, the results of the digit and iterative digit sum of primes that are not Sophie Germain are the same with the primes that are notSafe. The results of the digit and iterative digit sum of prime that are either Sophie Germain or Safe are like the combination of the results of the respective primes when considered separately. Keywords: Sophie Germain prime, Safe prime, digit sum, iterative digit sum. Introduction In number theory, many types of primes exist; one of such is the Sophie Germain prime. A prime number p is said to be a Sophie Germain prime if 21p is also prime. A prime number qp21 is known as a safe prime. Sophie Germain prime were named after the famous French mathematician, physicist and philosopher Sophie Germain (1776-1831).
    [Show full text]
  • Problems Archives
    Cache update: 56 minutes Problems Archives The problems archives table shows problems 1 to 651. If you would like to tackle the 10 most recently published problems then go to Recent problems. Click the description/title of the problem to view details and submit your answer. ID Description / Title Solved By 1 Multiples of 3 and 5 834047 2 Even Fibonacci numbers 666765 3 Largest prime factor 476263 4 Largest palindrome product 422115 5 Smallest multiple 428955 6 Sum square difference 431629 7 10001st prime 368958 8 Largest product in a series 309633 9 Special Pythagorean triplet 313806 10 Summation of primes 287277 11 Largest product in a grid 207029 12 Highly divisible triangular number 194069 13 Large sum 199504 14 Longest Collatz sequence 199344 15 Lattice paths 164576 16 Power digit sum 201444 17 Number letter counts 133434 18 Maximum path sum I 127951 19 Counting Sundays 119066 20 Factorial digit sum 175533 21 Amicable numbers 128681 22 Names scores 118542 23 Non-abundant sums 91300 24 Lexicographic permutations 101261 25 1000-digit Fibonacci number 137312 26 Reciprocal cycles 73631 27 Quadratic primes 76722 28 Number spiral diagonals 96208 29 Distinct powers 92388 30 Digit fifth powers 96765 31 Coin sums 74310 32 Pandigital products 62296 33 Digit cancelling fractions 62955 34 Digit factorials 82985 35 Circular primes 74645 36 Double-base palindromes 78643 37 Truncatable primes 64627 38 Pandigital multiples 55119 39 Integer right triangles 64132 40 Champernowne's constant 70528 41 Pandigital prime 59723 42 Coded triangle numbers 65704 43 Sub-string divisibility 52160 44 Pentagon numbers 50757 45 Triangular, pentagonal, and hexagonal 62652 46 Goldbach's other conjecture 53607 47 Distinct primes factors 50539 48 Self powers 100136 49 Prime permutations 50577 50 Consecutive prime sum 54478 Cache update: 56 minutes Problems Archives The problems archives table shows problems 1 to 651.
    [Show full text]
  • Some Interesting Facts, Myths and History of Mathematics
    International Journal of Mathematics and Statistics Invention (IJMSI) E-ISSN: 2321 – 4767 P-ISSN: 2321 - 4759 www.ijmsi.org Volume 4 Issue 6 || August. 2016 || PP-54-68 Some Interesting Facts, Myths and History of Mathematics Singh Prashant1 1(Department of Computer Science, Institute of Science, Banaras Hindu University) ABSTRACT : This paper deals with primary concepts and fallacies of mathematics which many a times students and even teachers ignore. Also this paper comprises of history of mathematical symbols, notations and methods of calculating time. I have also included some ancient techniques of solving mathematical real time problems. This paper is a confluence of various traditional mathematical techniques and their implementation in modern mathematics. I. INTRODUCTION I have heard my father saying that ―Mathematics is the only genuine subject as it does not change with boundary of countries‖. It is lucrative just because of its simplicity. Galileo once said, ―Mathematics is the language with which God wrote the Universe.‖ He was precise in calling mathematics a language, because like any dialect, mathematics has its own rubrics, formulas, and nuances. In precise, the symbols used in mathematics are quite unique to its field and are profoundly engrained in history. The following will give an ephemeral history of some of the greatest well-known symbols employed by mathematics. Categorized by discipline within the subject, each section has its own interesting subculture surrounding it. Arithmetic is the most rudimentary part of mathematics and covers addition, subtraction, multiplication, and the division of numbers. One category of numbers are the integers, -n,…-3,-2,-1,0,1,2,3,…n , where we say that n is in .The capital letter Z is written to represent integers and comes from the German word, Zahlen, meaning numbers.
    [Show full text]
  • 148289397.Pdf
    Through a mind darkly An empirically-informed philosophical perspective on systematic knowledge acquisition and cognitive limitations Helen De Cruz c Copyright by Helen De Cruz, 2011. All rights reserved. PhD-dissertation of University of Groningen Title: Through a mind darkly. An empirically-informed philosophical perspective on systematic knowledge acquisition and cognitive limita- tions. Author: H. L. De Cruz ISBN 978-90-367-5182-7 (ISBN print version: 978-90-367-5181-0) Publisher: University of Groningen, The Netherlands Printed by: Reproduct, Ghent, Belgium Cover illustration: The externalized thinker. This image is based on Au- gust Rodin’s bronze sculpture, The Thinker (Le Penseur, 1880). It il- lustrates one of the main theses of this dissertation: cognition is not a solitary and internalized process, but a collective, distributed and exter- nalized activity. RIJKSUNIVERSITEIT GRONINGEN Through a mind darkly An empirically-informed philosophical perspective on systematic knowledge acquisition and cognitive limitations Proefschrift ter verkrijging van het doctoraat in de Wijsbegeerte aan de Rijksuniversiteit Groningen op gezag van de Rector Magnificus, dr. E. Sterken in het openbaar te verdedigen op donderdag 27 oktober 2011 om 16.15 uur door Helen Lucretia De Cruz geboren op 1 september 1978 te Gent Promotor: Prof. dr. mr. I. E. Douven Beoordelingscommissie: Prof. dr. M. Muntersbjorn Prof. dr. J. Peijnenburg Prof. dr. L. Horsten CONTENTS List of figures ix List of tables xi List of papers xiii Acknowledgments xv Preface xvii 1 Introduction 1 1.1 Two puzzles on scientific knowledge ............ 1 1.1.1 Naturalism and knowledge acquisition ....... 1 1.1.2 Puzzle 1: The boundedness of human reasoning .
    [Show full text]