|
Warning: this is an htmlized version!
The original is here, and the conversion rules are here. |
;; (find-sh "cd ~/books/ && find * | sort") ;; (find-sh "cd ~/books/__comp/ && find * | sort") ;; https://drive.google.com/drive/folders/1xMyINsx0-Q795_IYwXYXwjnC1pjbYcri ;; https://drive.google.com/drive/folders/1xMyINsx0-Q795_IYwXYXwjnC1pjbYcri?usp=sharing ;; «.audibert» (to "audibert") ;; «.epp» (to "epp") ;; «.gersting» (to "gersting") ;; «.gries-schneider» (to "gries-schneider") ;; «.goranko» (to "goranko") ;; «.hunter» (to "hunter") ;; «.kolman-busby-ross» (to "kolman-busby-ross") ;; «.lehman-leighton-meyer» (to "lehman-leighton-meyer") ;; «.rosen» (to "rosen") ;; «.scheinerman» (to "scheinerman") ;; «.vandervelde» (to "vandervelde") ;; «.cl-cam-ac-uk-logicproof» (to "cl-cam-ac-uk-logicproof") ;; «.rags-maths-and-logic» (to "rags-maths-and-logic") ;; «audibert» (to ".audibert") ;; (find-books "__discrete/__discrete.el" "audibert") ;; https://fr.wikipedia.org/wiki/Pierre_Audibert (code-pdf-page "audibert" "~/books/__discrete/audibert__mathematics_for_informatics_and_computer_science.pdf") (code-pdf-text "audibert" "~/books/__discrete/audibert__mathematics_for_informatics_and_computer_science.pdf" 1) ;; (find-audibertpage) ;; (find-audibertpage 4 "Contents") ;; (find-audiberttext 4 "Contents") ;; (find-audibertpage (+ 1 189) "Index") ;; (find-audiberttext "") ;; «epp» (to ".epp") ;; (find-books "__discrete/__discrete.el" "epp") ;; Susanna S. Epp: "Discrete Mathematics with Applications" (4th ed) (code-pdf-page "epp" "~/books/__discrete/epp__discrete_mathematics_with_applications_4th_ed.pdf") (code-pdf-text "epp" "~/books/__discrete/epp__discrete_mathematics_with_applications_4th_ed.pdf" 28) ;; (find-epppage) ;; (find-epppage 12 "Contents") ;; (find-epptext 12 "Contents") ;; (find-epppage (+ 1 28) "Index") ;; (find-epptext "") ;; (find-epppage (+ 28 1) "Chapter 1 Speaking Mathematically") ;; (find-epppage (+ 28 1) "1.1 Variables") ;; (find-epppage (+ 28 6) "1.2 The Language of Sets") ;; (find-epppage (+ 28 13) "1.3 The Language of Relations and Functions") ;; (find-epppage (+ 28 23) "Chapter 2 The Logic of Compound Statements") ;; (find-epppage (+ 28 23) "2.1 Logical Form and Logical Equivalence") ;; (find-epppage (+ 28 39) "2.2 Conditional Statements") ;; (find-epppage (+ 28 51) "2.3 Valid and Invalid Arguments") ;; (find-epppage (+ 28 64) "2.4 Application: Digital Logic Circuits") ;; (find-epppage (+ 28 78) "2.5 Application: Number Systems and Circuits for Addition") ;; (find-epppage (+ 28 96) "Chapter 3 The Logic of Quantified Statements") ;; (find-epppage (+ 28 96) "3.1 Predicates and Quantified Statements I") ;; (find-epppage (+ 28 103) "Implicit quantification") ;; (find-epppage (+ 28 108) "3.2 Predicates and Quantified Statements II") ;; (find-epppage (+ 28 117) "3.3 Statements with Multiple Quantifiers") ;; (find-epppage (+ 28 132) "3.4 Arguments with Quantified Statements") ;; (find-epppage (+ 28 145) "4. Elementary Number Theory and Methods of Proof") ;; (find-epppage (+ 28 146) "4.1 Direct Proof and Counterexample I: Introduction") ;; (find-epppage (+ 28 163) "4.2 Direct Proof and Counterexample II: Rational Numbers") ;; (find-epppage (+ 28 170) "4.3 Direct Proof and Counterexample III: Divisibility") ;; (find-epppage (+ 28 180) "and the Quotient-Remainder Theorem") ;; (find-epppage (+ 28 191) "4.5 Direct Proof and Counterexample V: Floor and Ceiling") ;; (find-epppage (+ 28 198) "4.6 Indirect Argument: Contradiction and Contraposition") ;; (find-epppage (+ 28 207) "4.7 Indirect Argument: Two Classical Theorems") ;; (find-epppage (+ 28 214) "4.8 Application: Algorithms") ;; (find-epppage (+ 28 227) "and Recursion") ;; (find-epppage (+ 28 227) "5.1 Sequences") ;; (find-epppage (+ 28 244) "5.2 Mathematical Induction I") ;; (find-epppage (+ 28 258) "5.3 Mathematical Induction II") ;; (find-epppage (+ 28 268) "and the Well-Ordering Principle for the Integers") ;; (find-epppage (+ 28 279) "5.5 Application: Correctness of Algorithms") ;; (find-epppage (+ 28 290) "5.6 Defining Sequences Recursively") ;; (find-epppage (+ 28 304) "5.7 Solving Recurrence Relations by Iteration") ;; (find-epppage (+ 28 317) "with Constant Coefficients") ;; (find-epppage (+ 28 328) "5.9 General Recursive Definitions and Structural Induction") ;; (find-epppage (+ 28 336) "Chapter 6 Set Theory") ;; (find-epppage (+ 28 336) "6.1 Set Theory: Definitions and the Element Method of Proof") ;; (find-epppage (+ 28 352) "6.2 Properties of Sets") ;; (find-epppage (+ 28 367) "6.3 Disproofs, Algebraic Proofs, and Boolean Algebras") ;; (find-epppage (+ 28 374) "6.4 Boolean Algebras, Russell's Paradox, and the Halting Problem") ;; (find-epppage (+ 28 383) "Chapter 7 Functions") ;; (find-epppage (+ 28 383) "7.1 Functions Defined on General Sets") ;; (find-epppage (+ 28 397) "7.2 One-to-One and Onto, Inverse Functions") ;; (find-epppage (+ 28 416) "7.3 Composition of Functions") ;; (find-epppage (+ 28 428) "7.4 Cardinality with Applications to Computability") ;; (find-epppage (+ 28 442) "Chapter 8 Relations") ;; (find-epppage (+ 28 442) "8.1 Relations on Sets") ;; (find-epppage (+ 28 449) "8.2 Reflexivity, Symmetry, and Transitivity") ;; (find-epppage (+ 28 459) "8.3 Equivalence Relations") ;; (find-epppage (+ 28 478) "8.4 Modular Arithmetic with Applications to Cryptography") ;; (find-epppage (+ 28 498) "8.5 Partial Order Relations") ;; (find-epppage (+ 28 516) "Chapter 9 Counting and Probability") ;; (find-epppage (+ 28 517) "9.1 Introduction") ;; (find-epppage (+ 28 525) "9.2 Possibility Trees and the Multiplication Rule") ;; (find-epppage (+ 28 540) "9.3 Counting Elements of Disjoint Sets: The Addition Rule") ;; (find-epppage (+ 28 554) "9.4 The Pigeonhole Principle") ;; (find-epppage (+ 28 565) "9.5 Counting Subsets of a Set: Combinations") ;; (find-epppage (+ 28 584) "9.6 r-Combinations with Repetition Allowed") ;; (find-epppage (+ 28 592) "9.7 Pascal's Formula and the Binomial Theorem") ;; (find-epppage (+ 28 605) "9.8 Probability Axioms and Expected Value") ;; (find-epppage (+ 28 611) "Independent Events") ;; (find-epppage (+ 28 625) "Chapter 10 Graphs and Trees") ;; (find-epppage (+ 28 625) "10.1 Graphs: Definitions and Basic Properties") ;; (find-epppage (+ 28 642) "10.2 Trails, Paths, and Circuits") ;; (find-epppage (+ 28 661) "10.3 Matrix Representations of Graphs") ;; (find-epppage (+ 28 675) "10.4 Isomorphisms of Graphs") ;; (find-epppage (+ 28 683) "10.5 Trees") ;; (find-epppage (+ 28 694) "10.6 Rooted Trees") ;; (find-epppage (+ 28 701) "10.7 Spanning Trees and Shortest Paths") ;; (find-epppage (+ 28 717) "Chapter 11 Analysis of Algorithm Efficiency") ;; (find-epppage (+ 28 717) "11.1 Real-Valued Functions of a Real Variable and Their Graphs") ;; (find-epppage (+ 28 725) "11.2 O-, -, and -Notations") ;; (find-epppage (+ 28 739) "11.3 Application: Analysis of Algorithm Efficiency I") ;; (find-epppage (+ 28 751) "Graphs and Orders") ;; (find-epppage (+ 28 764) "11.5 Application: Analysis of Algorithm Efficiency II") ;; (find-epppage (+ 28 779) "Chapter 12 Regular Expressions and Finite-State Automata") ;; (find-epppage (+ 28 780) "12.1 Formal Languages and Regular Expressions") ;; (find-epppage (+ 28 791) "12.2 Finite-State Automata") ;; (find-epppage (+ 28 808) "12.3 Simplifying Finite-State Automata") ;; «gersting» (to ".gersting") ;; (find-books "__discrete/__discrete.el" "gersting") (code-pdf "gersting" "~/books/__discrete/gersting__fundamentos_matematicos_para_a_ciencia_da_computacao_3a_ed.pdf") (code-pdftotext "gersting" "~/books/__discrete/gersting__fundamentos_matematicos_para_a_ciencia_da_computacao_3a_ed.pdf" 20) ;; (find-gerstingpage) ;; (find-gerstingpage 11 "Sumário resumido") ;; (find-gerstingpage 13 "Sumário") ;; (find-gerstingpage (+ 20 1) "1. Lógica formal") ;; (find-gerstingpage (+ 20 2) "1.1. Sentenças, representaço simbólica e tautologias") ;; (find-gerstingpage (+ 20 4) "Fórmulas bem formadas") ;; (find-gerstingpage (+ 20 12) "1.2. Quantificadores, predicados e validade") ;; (find-gerstingpage (+ 20 13) "Variável muda") ;; (find-gerstingpage (+ 20 15) "ligada") ;; (find-gerstingpage (+ 20 15) "livre") ;; (find-gerstingpage (+ 20 20) "1.3. Lógica proposicional") ;; (find-gerstingpage (+ 20 27) "1.4. Lógica de predicados") ;; (find-gerstingpage (+ 20 33) "1.5.") ;; (find-gerstingpage (+ 20 49) "2. Demonstrações, recursão e análise de algoritmo") ;; (find-gerstingpage (+ 20 50) "2.1. Técnicas de demonstração") ;; (find-gerstingpage (+ 20 56) "2.2. Indução") ;; (find-gerstingpage (+ 20 67) "2.3. Recursão e Relação de Recorrência") ;; (find-gerstingpage (+ 20 67) "Definições recursivas") ;; (find-gerstingpage (+ 20 69) "Conjuntos recursivos") ;; (find-gerstingpage (+ 20 83) "2.4. Análise de Algoritmos e Mais Sobre Prova de Correção") ;; (find-gerstingpage (+ 20 97) "3. Conjuntos e combinatória") ;; (find-gerstingpage (+ 20 98) "3.1. Conjuntos") ;; (find-gerstingpage (+ 20 120) "3.2. Contagem") ;; (find-gerstingpage (+ 20 128) "3.3. Princípio da Inclusão e Exclusão e ... Pombo") ;; (find-gerstingpage (+ 20 133) "3.4. Permutações e Combinações") ;; (find-gerstingpage (+ 20 142) "3.5. O Polinõmio Binomial") ;; (find-gerstingpage (+ 20 150) "4. ") ;; (find-gerstingpage (+ 20 152) "4.1. ") ;; (find-gerstingpage (+ 19 168) "4.2. ") ;; (find-gerstingpage (+ 20 181) "4.3. ") ;; (find-gerstingtext "") ;; «gries-schneider» (to ".gries-schneider") ;; (find-books "__discrete/__discrete.el" "gries-schneider") (code-pdf-page "griesschneider" "~/books/__discrete/gries_schneider__a_logical_approach_to_discrete_math.pdf") (code-pdf-text "griesschneider" "~/books/__discrete/gries_schneider__a_logical_approach_to_discrete_math.pdf" 1) ;; (find-griesschneiderpage) ;; (find-griesschneiderpage 1 "Contents") ;; (find-griesschneiderpage (+ 1 189) "Index") ;; (find-griesschneidertext "") ;; «goranko» (to ".goranko") ;; (find-books "__discrete/__discrete.el" "goranko") (code-pdf-page "gorankodm" "~/books/__discrete/conradie_goranko__logic_and_discrete_mathematics_a_concise_introduction.pdf") (code-pdf-text "gorankodm" "~/books/__discrete/conradie_goranko__logic_and_discrete_mathematics_a_concise_introduction.pdf" 1) ;; (find-gorankodmpage) ;; (find-gorankodmpage 7 "Contents") ;; (find-gorankodmpage (+ 1 189) "Index") ;; (find-gorankodmtext "") ;; «hunter» (to ".hunter") ;; (find-books "__discrete/__discrete.el" "hunter") ;; Sugested by Hudson Costa (code-pdf "hunteredm" "~/books/__discrete/hunter__essentials_of_discrete_mathematics.pdf") (code-pdftotext "hunteredm" "~/books/__discrete/hunter__essentials_of_discrete_mathematics.pdf" 1) ;; (find-hunteredmpage) ;; (find-hunteredmpage 5 "Contents") ;; (find-hunteredmpage 37 "1.2.2 Derivation rules") ;; (find-hunteredmpage (+ 1 511) "Index") ;; (find-hunteredmtext "") ;; «kolman-busby-ross» (to ".kolman-busby-ross") ;; (find-books "__discrete/__discrete.el" "kolman-busby-ross") (code-pdf-page "kolman" "~/books/__discrete/kolman_busby_ross__discrete_mathematical_structures.pdf") (code-pdf-text "kolman" "~/books/__discrete/kolman_busby_ross__discrete_mathematical_structures.pdf" 1) ;; (find-kolmanpage) ;; (find-kolmanpage 1 "Contents") ;; (find-kolmanpage (+ 1 189) "Index") ;; (find-kolmantext "") ;; «lehman-leighton-meyer» (to ".lehman-leighton-meyer") ;; (find-books "__discrete/__discrete.el" "lehman-leighton-meyer") ;; https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-fall-2010/readings/MIT6_042JF10_notes.pdf (code-pdf-page "llmmit6" "$S/https/ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-fall-2010/readings/MIT6_042JF10_notes.pdf") (code-pdf-text "llmmit6" "$S/https/ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-fall-2010/readings/MIT6_042JF10_notes.pdf") ;; (find-llmmit6page) ;; (find-llmmit6text) ;; (find-llmmit6page 3 "Contents") ;; (find-llmmit6text 3 "Contents") ;; «rosen» (to ".rosen") ;; (find-books "__discrete/__discrete.el" "rosen") ;; Kenneth H. Rosen: "Discrete Mathematics and Its Applications" (7th ed) (code-pdf "rosen" "~/books/__discrete/rosen__discrete_mathematics_and_its_applications_7th_ed.pdf") (code-pdftotext "rosen" "~/books/__discrete/rosen__discrete_mathematics_and_its_applications_7th_ed.pdf" 21) ;; (find-rosenpage) ;; (find-rosenpage 4 "Contents") ;; (find-rosenpage (+ 21 1) "Index") ;; (find-rosentext "") ;; (find-rosenpage (+ 21 0) "About the Author") ;; (find-rosenpage (+ 21 0) "Preface") ;; (find-rosenpage (+ 21 0) "The Companion Website") ;; (find-rosenpage (+ 21 0) "To the Student") ;; (find-rosenpage (+ 21 1) "1 The Foundations: Logic and Proofs") ;; (find-rosenpage (+ 21 1) "1.1 Propositional Logic") ;; (find-rosenpage (+ 21 16) "1.2 Applications of Propositional Logic") ;; (find-rosenpage (+ 21 25) "1.3 Propositional Equivalences") ;; (find-rosenpage (+ 21 36) "1.4 Predicates and Quantifiers") ;; (find-rosenpage (+ 21 57) "1.5 Nested Quantifiers") ;; (find-rosenpage (+ 21 69) "1.6 Rules of Inference") ;; (find-rosenpage (+ 21 80) "1.7 Introduction to Proofs") ;; (find-rosenpage (+ 21 92) "1.8 Proof Methods and Strategy") ;; (find-rosenpage (+ 21 109) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 115) "2 Basic Structures: Sets, Functions, Sequences, Sums, and Matrices") ;; (find-rosenpage (+ 21 115) "2.1 Sets") ;; (find-rosenpage (+ 21 127) "2.2 Set Operations") ;; (find-rosenpage (+ 21 138) "2.3 Functions") ;; (find-rosenpage (+ 21 156) "2.4 Sequences and Summations") ;; (find-rosenpage (+ 21 170) "2.5 Cardinality of Sets") ;; (find-rosenpage (+ 21 177) "2.6 Matrices") ;; (find-rosenpage (+ 21 185) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 191) "3 Algorithms") ;; (find-rosenpage (+ 21 191) "3.1 Algorithms") ;; (find-rosenpage (+ 21 204) "3.2 The Growth of Functions") ;; (find-rosenpage (+ 21 218) "3.3 Complexity of Algorithms") ;; (find-rosenpage (+ 21 232) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 237) "4 Number Theory and Cryptography") ;; (find-rosenpage (+ 21 237) "4.1 Divisibility and Modular Arithmetic") ;; (find-rosenpage (+ 21 245) "4.2 Integer Representations and Algorithms") ;; (find-rosenpage (+ 21 257) "4.3 Primes and Greatest Common Divisors") ;; (find-rosenpage (+ 21 274) "4.4 Solving Congruences") ;; (find-rosenpage (+ 21 287) "4.5 Applications of Congruences") ;; (find-rosenpage (+ 21 294) "4.6 Cryptography") ;; (find-rosenpage (+ 21 306) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 311) "5 Induction and Recursion") ;; (find-rosenpage (+ 21 311) "5.1 Mathematical Induction") ;; (find-rosenpage (+ 21 333) "5.2 Strong Induction and Well-Ordering") ;; (find-rosenpage (+ 21 344) "5.3 Recursive Definitions and Structural Induction") ;; (find-rosenpage (+ 21 360) "5.4 Recursive Algorithms") ;; (find-rosenpage (+ 21 372) "5.5 Program Correctness") ;; (find-rosenpage (+ 21 377) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 385) "6 Counting") ;; (find-rosenpage (+ 21 385) "6.1 The Basics of Counting") ;; (find-rosenpage (+ 21 399) "6.2 The Pigeonhole Principle") ;; (find-rosenpage (+ 21 407) "6.3 Permutations and Combinations") ;; (find-rosenpage (+ 21 415) "6.4 Binomial Coefficients and Identities") ;; (find-rosenpage (+ 21 423) "6.5 Generalized Permutations and Combinations") ;; (find-rosenpage (+ 21 434) "6.6 Generating Permutations and Combinations") ;; (find-rosenpage (+ 21 439) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 445) "7 Discrete Probability") ;; (find-rosenpage (+ 21 445) "7.1 An Introduction to Discrete Probability") ;; (find-rosenpage (+ 21 452) "7.2 Probability Theory") ;; (find-rosenpage (+ 21 468) "7.3 Bayes' Theorem") ;; (find-rosenpage (+ 21 477) "7.4 Expected Value and Variance") ;; (find-rosenpage (+ 21 494) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 501) "8 Advanced Counting Techniques") ;; (find-rosenpage (+ 21 501) "8.1 Applications of Recurrence Relations") ;; (find-rosenpage (+ 21 514) "8.2 Solving Linear Recurrence Relations") ;; (find-rosenpage (+ 21 527) "8.3 Divide-and-Conquer Algorithms and Recurrence Relations") ;; (find-rosenpage (+ 21 537) "8.4 Generating Functions") ;; (find-rosenpage (+ 21 552) "8.5 InclusionExclusion") ;; (find-rosenpage (+ 21 558) "8.6 Applications of InclusionExclusion") ;; (find-rosenpage (+ 21 565) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 573) "9 Relations") ;; (find-rosenpage (+ 21 573) "9.1 Relations and Their Properties") ;; (find-rosenpage (+ 21 583) "9.2 n-ary Relations and Their Applications") ;; (find-rosenpage (+ 21 591) "9.3 Representing Relations") ;; (find-rosenpage (+ 21 597) "9.4 Closures of Relations") ;; (find-rosenpage (+ 21 607) "9.5 Equivalence Relations") ;; (find-rosenpage (+ 21 618) "9.6 Partial Orderings") ;; (find-rosenpage (+ 21 633) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 641) "10 Graphs") ;; (find-rosenpage (+ 21 641) "10.1 Graphs and Graph Models") ;; (find-rosenpage (+ 21 651) "10.2 Graph Terminology and Special Types of Graphs") ;; (find-rosenpage (+ 21 668) "10.3 Representing Graphs and Graph Isomorphism") ;; (find-rosenpage (+ 21 678) "10.4 Connectivity") ;; (find-rosenpage (+ 21 693) "10.5 Euler and Hamilton Paths") ;; (find-rosenpage (+ 21 707) "10.6 Shortest-Path Problems") ;; (find-rosenpage (+ 21 718) "10.7 Planar Graphs") ;; (find-rosenpage (+ 21 727) "10.8 Graph Coloring") ;; (find-rosenpage (+ 21 735) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 745) "11 Trees") ;; (find-rosenpage (+ 21 745) "11.1 Introduction to Trees") ;; (find-rosenpage (+ 21 757) "11.2 Applications of Trees") ;; (find-rosenpage (+ 21 772) "11.3 Tree Traversal") ;; (find-rosenpage (+ 21 785) "11.4 Spanning Trees") ;; (find-rosenpage (+ 21 797) "11.5 Minimum Spanning Trees") ;; (find-rosenpage (+ 21 803) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 811) "12 Boolean Algebra") ;; (find-rosenpage (+ 21 811) "12.1 Boolean Functions") ;; (find-rosenpage (+ 21 819) "12.2 Representing Boolean Functions") ;; (find-rosenpage (+ 21 822) "12.3 Logic Gates") ;; (find-rosenpage (+ 21 828) "12.4 Minimization of Circuits") ;; (find-rosenpage (+ 21 843) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 847) "13 Modeling Computation") ;; (find-rosenpage (+ 21 847) "13.1 Languages and Grammars") ;; (find-rosenpage (+ 21 858) "13.2 Finite-State Machines with Output") ;; (find-rosenpage (+ 21 865) "13.3 Finite-State Machines with No Output") ;; (find-rosenpage (+ 21 878) "13.4 Language Recognition") ;; (find-rosenpage (+ 21 888) "13.5 Turing Machines") ;; (find-rosenpage (+ 21 899) "End-of-Chapter Material") ;; (find-rosenpage (+ 21 999) "Appendixes") ;; (find-rosenpage (+ 21 999) "1 Axioms for the Real Numbers and the Positive Integers") ;; (find-rosenpage (+ 21 999) "2 Exponential and Logarithmic Functions") ;; (find-rosenpage (+ 21 999) "3 Pseudocode") ;; (find-rosenpage (+ 21 999) "Suggested Readings") ;; (find-rosenpage (+ 21 999) "Answers to Odd-Numbered Exercises") ;; (find-rosenpage (+ 21 999) "Photo Credits") ;; (find-rosenpage (+ 21 999) "Index of Biographies") ;; (find-rosenpage (+ 21 999) "Index") ;; «scheinerman» (to ".scheinerman") ;; (find-books "__discrete/__discrete.el" "scheinerman") ;; (find-angg ".emacs" "scheinerman-esquemas") ;; file:///home/edrx/books/__discrete/scheinerman__matematica_discreta_ed_2011.pdf ;; https://drive.google.com/drive/folders/1xMyINsx0-Q795_IYwXYXwjnC1pjbYcri (code-pdf "scheinerman" "~/books/__discrete/scheinerman__matematica_discreta_ed_2011.pdf") (code-pdftotext "scheinerman" "~/books/__discrete/scheinerman__matematica_discreta_ed_2011.pdf" 19) ;; (find-scheinermanpage) ;; (find-scheinermanpage 6 "Sumário") ;; (find-scheinermanpage (+ 19 1) "1. Alegria") ;; (find-scheinermanpage (+ 19 2) "2. Definição") ;; (find-scheinermanpage (+ 19 8) "3. Teorema") ;; (find-scheinermanpage (+ 19 15) "Lema") ;; (find-scheinermanpage (+ 19 17) "4. Prova") ;; (find-scheinermanpage (+ 19 21) "Esquema de prova 1: se-então") ;; (find-scheinermanpage (+ 19 25) "Esquema de prova 2: se-e-somente-se") ;; (find-scheinermanpage (+ 19 28) "Exercícios") ;; (find-scheinermanpage (+ 19 28) "5. Contraexemplo") ;; (find-scheinermanpage (+ 19 29) "Esquema de prova 3: refutar se-então") ;; (find-scheinermanpage (+ 19 30) "n^2 + n + 41 é primo") ;; (find-scheinermanpage (+ 19 31) "6. Algebra de Boole") ;; (find-scheinermanpage (+ 19 34) "Esquema de prova 4: equivalência lógica") ;; (find-scheinermanpage (+ 19 41) "Capítulo 2. Coleções") ;; (find-scheinermanpage (+ 19 41) "7. Listas") ;; (find-scheinermanpage (+ 19 50) "8. Fatorial") ;; (find-scheinermanpage (+ 19 55) "9. Conjuntos I: introdução, subconjuntos") ;; (find-scheinermanpage (+ 19 56) "Esquema de prova 5: conjuntos iguais") ;; (find-scheinermanpage (+ 19 59) "Esquema de prova 6: subconjunto") ;; (find-scheinermanpage (+ 19 65) "Esquema de prova 7: afirmações existenciais") ;; (find-scheinermanpage (+ 19 66) "Esquema de prova 8: afirmações universais") ;; (find-scheinermanpage (+ 19 74) "Esquema de prova 9: prova combinatória") ;; (find-scheinermanpage (+ 19 147) "Esquema de prova 10: utilizando inclusão-exclusão") ;; (find-scheinermanpage (+ 19 156) "Esquema de prova 11: contrapositiva") ;; (find-scheinermanpage (+ 19 158) "Esquema de prova 12: contradição") ;; (find-scheinermanpage (+ 19 160) "Esquema de prova 13: provar que conjunto é vazio") ;; (find-scheinermanpage (+ 19 161) "Esquema de prova 14: unicidade") ;; (find-scheinermanpage (+ 19 167) "Esquema de prova 15: contra-exemplo mínimo") ;; (find-scheinermanpage (+ 19 171) "Esquema de prova 16: prova por boa ordenação") ;; (find-scheinermanpage (+ 19 177) "21. Indução") ;; (find-scheinermanpage (+ 19 181) "Esquema de prova 17: indução") ;; (find-scheinermanpage (+ 19 187) "Esquema de prova 18: indução forte") ;; (find-scheinermanpage (+ 19 192) "Exercícios") ;; (find-scheinermanpage (+ 19 225) "Esquema de prova 19: f:A->B") ;; (find-scheinermanpage (+ 19 229) "Esquema de prova 20: um para um") ;; (find-scheinermanpage (+ 19 231) "Esquema de prova 21: sobre") ;; (find-scheinermanpage (+ 19 246) "Esquema de prova 22: funções iguais") ;; (find-scheinermanpage (+ 19 357) "36. Aritmética modular") ;; (find-scheinermanpage (+ 19 375) "38. ") ;; (find-scheinermanpage (+ 19 387) "Capítulo 8. Álgebra") ;; (find-scheinermanpage (+ 19 395) "Esquema de prova 23: (G,*) é um grupo") ;; (find-scheinermanpage (+ 19 405) "41. Subgrupos") ;; (find-scheinermanpage (+ 19 406) "Esquema de prova 24: subgrupo") ;; (find-scheinermanpage (+ 19 415) "42. O pequeno teorema de Fermat") ;; (find-scheinermanpage (+ 19 424) "43. ") ;; (find-scheinermanpage (+ 19 428) "44. ") ;; (find-scheinermanpage (+ 19 443) "Capítulo 9. Grafos") ;; (find-scheinermanpage (+ 19 443) "46. ") ;; (find-scheinermanpage (+ 19 455) "47. ") ;; (find-scheinermanpage (+ 19 464) "48. ") ;; (find-scheinermanpage (+ 19 473) "49. Árvores") ;; (find-scheinermanpage (+ 19 479) "Esquema de prova 25: supressão de folhas") ;; (find-scheinermanpage (+ 19 484) "50. Grafos eulerianos") ;; (find-scheinermanpage (+ 19 490) "51. Coloração") ;; (find-scheinermanpage (+ 19 500) "52. Grafos planares") ;; (find-scheinermanpage (+ 19 517) "Capítulo 10. Conjuntos parcialmente ordenados") ;; (find-scheinermanpage (+ 19 517) "53. ") ;; (find-scheinermanpage (+ 19 518) "Diagrama de Hasse") ;; (find-scheinermanpage (+ 19 549) "57. Exercícios") ;; (find-scheinermanpage (+ 19 561) "Glossário") ;; (find-scheinermantext "") ;; «vandervelde» (to ".vandervelde") ;; (find-books "__discrete/__discrete.el" "vandervelde") (code-pdf-page "vandervelde" "~/books/__discrete/vandervelde__bridge_to_higher_mathematics.pdf") (code-pdf-text "vandervelde" "~/books/__discrete/vandervelde__bridge_to_higher_mathematics.pdf" 1) ;; (find-vanderveldepage) ;; (find-vanderveldepage 1 "Contents") ;; (find-vanderveldepage (+ 1 189) "Index") ;; (find-vanderveldetext "") ;; «cl-cam-ac-uk-logicproof» (to ".cl-cam-ac-uk-logicproof") ;; (find-books "__discrete/__discrete.el" "cl-cam-ac-uk-logicproof") ;; https://www.cl.cam.ac.uk/teaching/1516/LogicProof/materials.html ;; https://www.cl.cam.ac.uk/teaching/1516/LogicProof/logic-notes.pdf ;; https://www.cl.cam.ac.uk/teaching/1516/DiscMath/ ;; ;; (find-books "__comp/__comp.el" "unixtools") ;; https://www.cl.cam.ac.uk/teaching/1516/UnixTools/ ;; https://www.cl.cam.ac.uk/teaching/1516/UnixTools/unixtools-slides.pdf ;; https://www.cl.cam.ac.uk/teaching/1516/UnixTools/notes.pdf ;; «rags-maths-and-logic» (to ".rags-maths-and-logic") ;; (find-books "__discrete/__discrete.el" "rags-maths-and-logic") ;; http://www.math.mcgill.ca/rags/jac.html ;; http://www.math.mcgill.ca/rags/JAC/124-193a.html ;; http://www.math.mcgill.ca/rags/JAC/124/TextChp1.pdf (code-xpdf "concrete" "~/books/__discrete/knuth__concrete_mathematics.pdf") (code-xpdf "concretesc" "~/books/__discrete/knuth__concrete_mathematics__scan.pdf") ;; (find-concretepage 12 "Contents") ;; (find-concretepage (+ 13 637) "Index") ;; (find-concretescpage 12 "Contents") ;; (find-concretescpage (+ 14 606) "Index") ;; http://gigapedia.com/items/12094/discrete-mathematics (code-djvu "lovasz" "~/books/__discrete/lovasz_pelikan_vesztergombi__discrete_mathematics.djvu") ;; (find-lovaszpage 8 "Contents") ;; (find-lovaszpage (+ 10 287) "Index") ;; http://gigapedia.com/items/217106/an-invitation-to-discrete-mathematics--2nd-edition (code-xpdf "nesetril" "~/books/__discrete/matousek_nesetril__invitation_to_discrete_mathematics.pdf") ;; (find-nesetrilpage 16 "Contents") ;; (find-nesetrilpage (+ 19 433) "Index") ;; ;; Local Variables: ;; mode: emacs-lisp ;; coding: utf-8-unix ;; End: