Mostrando 81 - 88 Resultados de 88 Para Buscar '"Fermat"', tiempo de consulta: 0.05s Limitar resultados
  1. 81
    por Saha, A.
    Publicado 2013
    Tabla de Contenidos: “…9.6.5 DES Decryption -- 9.6.6 Strength of DES -- 9.7 Advance Versions of DES -- 9.7.1 Double DES -- 9.7.2 Triple DES -- 9.8 Asymmetric-key Cryptography -- 9.8.1 Public and Private Key -- 9.9 RSA Algorithm -- 9.9.1 Example of RSA -- 9.9.2 Strength of RSA -- 9.10 Symmetric versus Asymmetric-key Cryptography -- 9.11 Diffie-Hellman Key Exchange -- 9.11.1 The Algorithm -- 9.12 Steganography -- 9.13 Quantum Cryptography -- 9.14 Solved Problems -- Multiple Choice Questions -- Review Questions -- Appendix A: Some Related Mathematics -- A.1 Fermat's Little Theorem -- A.2 Chinese Remainder Theorem -- A.3 Prime Number Generation -- A.3.1 Sieve of Eratosthenes -- Bibliography -- Index…”
    Libro electrónico
  2. 82
    Publicado 2007
    Tabla de Contenidos: “…7.1.3 Sequences -- 7 .1.4 Permutations -- 7.2 Induction -- 7.2.1 The Sum of Odd Numbers -- 7 .2.2 Subset Counting Revisited -- 7 .2.3 More Induction Proofs -- 7 .2.4 Counting Regions -- 7.3 Counting Subsets -- 7.3.1 The Number of Ordered Subsets -- 7 .3.2 The Number of Subsets of a Given Size -- 7 .3.3 The Binomial Theorem -- 7 .3.4 Distributing Presents -- 7 .3.5 Anagrams -- 7 .3.6 Distribution of Money -- 7.4 Pascal's Triangle -- 7 .4.1 Identities in the Pascal Triangle -- 7.4.2 A Bird's- Eye View at the Pascal Triangle -- 7.5 Combinatorial Probability -- 7.5.1 Events and Probabilities -- 7 .5.2 Independent Repetition of an Experiment -- 7 .5.3 The Law of Large Numbers -- 7.6 Fibonacci Numbers -- 7.6.1 Fibonacci's Exercise -- 7 .6.2 Lots of Identities -- 7 .6.3 A Formula for the Fibonacci Numbers -- 7.7 Integers, Divisors, and Primes -- 7. 7.1 Divisibility of Integers -- 7.7.2 Primes and Their History -- 7.7.3 Factorization into Primes -- 7.7.4 Fermat's "Little" Theorem -- 7.7.5 The Euclidean Algorithm -- 7. 7.6 Primality Test -- Chapter 8: Combinatorics -- 8.1 The Pigeonhole Principle -- 8.2 Strong Pigeonholes -- 8.2.1 Pigeonhole Principle Examples: Weighing Balls -- 8.3 Dilworth's Theorem -- 8.4 Problems -- 8.5 Sets of the Same Size: Bijections -- 8.6 Finite Sets -- 8.7 Inclusion-Exclusion -- 8.8 lnfinite Sets -- 8.9 Schroder-Bcrnstein Theorem -- 8.10 Countable Sets -- 8.11 The Continuum -- 8.12 Diagonal Argwnents -- 8.12.1 A Paradox -- 8.13 Set Theory Revisited -- 8.13.1 Bijections, Injections, Surjections -- 8.13.2 Finite Cardinality -- 8.14 Functions and Permutations -- 8.14.1 Surjection, Injection, Bijection -- 8.14.2 Permutation -- Chapter 9: Automata -- 9.1 Introduction -- 9.1.1 Abstraction -- 9.2 Decision Problems vs Functions -- 9.2.1 Strings -- 9.2.2 Operations on Strings -- 9.2.3 Operations on Sets…”
    Libro electrónico
  3. 83
    por Konheim, Alan G., 1934-
    Publicado 2010
    Tabla de Contenidos: “…Number Theory and Modern Algebra -- 5.1: Prime Numbers -- 5.2: Modular Arithmetic and the Euclidean Algorithm -- 5.3: Modular Multiplication -- 5.4: The Theorems of Fermat and Euler -- 5.5: Fields and Extension Fields -- 5.6: Factorization of Integers -- 5.7: Testing Primality -- 6. …”
    Libro electrónico
  4. 84
    Introduction to digital mobile communication
    Introduction to Digital Mobile Communication
    Publicado 2015
    Tabla de Contenidos: “…Likelihood Receiver and -- the Viterbi Algorithm 170 -- 3.3.9 The Optimum Receiver for Signals without -- Intersymbol Interference 174 -- 3.4 Synchronization 175 -- 3.4.1 Symbol Timing Recovery 175 -- 3.4.2 Frame Synchronization 176 -- 3.5 Scrambling 177 -- 3.6 Public Key Cryptosystem 180 -- 3.7 Multiplexing and Multiple Access 182 -- 3.8 The Channel Capacity 183 -- Appendix 3.A Fermat's Theorem and the Chinese Remainder -- Theorem 185 -- References 187 -- 4 Mobile Radio Channels 189 -- 4.1 Path Loss 190 -- 4.2 Shadowing 193 -- 4.3 Fast Fading 193 -- 4.3.1 RF Power Spectrum Spread due to Fast Fading 195 -- 4.3.2 Correlations Between the In?]…”
    Libro electrónico
  5. 85
    por Meskens, Ad
    Publicado 2010
    “…The marginal notes by Fermat in his copy of Diophantos, including his famous “Last Theorem”, were the starting point of a whole new research subject: the theory of numbers…”
    Libro electrónico
  6. 86
    Publicado 2022
    “…Siendo hoy uno de los campos de la matemática con más aplicaciones, repasa su historia y la formulación de sus principales leyes, teoremas y paradojas, vinculados a los nombres, entre otros, de Cardano, Galileo, Fermat, Pascal, Huygens, Bernoulli o Gauss, y especialmente de Laplace y Kolmogórov. …”
    Libro electrónico
  7. 87
    Publicado 2021
    “…Siendo hoy uno de los campos de la matemática con más aplicaciones, repasa su historia y la formulación de sus principales leyes, teoremas y paradojas, vinculados a los nombres, entre otros, de Cardano, Galileo, Fermat, Pascal, Huygens, Bernoulli o Gauss, y especialmente de Laplace y Kolmogórov. …”
    Libro
  8. 88
    Publicado 2022
    “…Nicht hörbar, weil durchgehend schweigend, verwischt 4’33’’ die Werkgrenzen und verkörpert zugleich das Prinzip der stillen Fermate: ein unendlich großer Zeitraum. Dessen Möglichkeitsbedingung zeichnete die antike griechische Zeit- und Musiktheorie als Ort der Weltseele vor: ein ewig wiederkehrender Nullpunkt der Zeit. …”
    Libro electrónico