ISBN: 9786131243578 - Smooth Number: Number Theory, Integer, Integer Factorization, Prime Number, Leonard Adleman, Cryptography, Negative and Positive Numbers (4 results)

ISBN: 
Refine with Advanced Search

Refine your search

  • Books (4)

  • New (4)

to

Custom price range (£)

to

  • Language: English

    Published by Omniscriptum Mär 2026, 2026

    6131243573 / 9786131243578

    • Softcover
    • Print on Demand

    Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.

    5-star seller
    Contact seller

    Condition: New

    £ 33.58

    £ 19.23 shipping 
    Ships from Germany to U.S.A.

    Quantity: 2 available

    Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In number theory, a smooth number is an integer which factors completely into small prime numbers; the term seems coined by Leonard Adleman. Smooth numbers are especially important in cryptography relying on factorization.A positive integer is called B-smooth if none of its prime factors are greater than B. For example, 1,620 has prime factorization 22 × 34 × 5; therefore 1,620 is 5-smooth because none of its prime factors are greater than 5. 5-smooth numbers are also called regular numbers or Hamming numbers; 7-smooth numbers are sometimes called highly composite, although this conflicts with another meaning of that term. 124 pp. Englisch.…

  • Language: English

    Published by Omniscriptum, 2026

    6131243573 / 9786131243578

    • Softcover
    • Print on Demand

    Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

    5-star seller
    Contact seller

    Condition: New

    £ 40.67

    £ 29.26 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In number theory, a smooth number is an integer which factors completely into small prime numbers; the term seems coined by Leonard Adleman. Smooth numbers are especially important in cryptography relying on factorization.A positive integer is called B-smooth if none of its prime factors are greater than B. For example, 1,620 has prime factorization 22 × 34 × 5; therefore 1,620 is 5-smooth because none of its prime factors are greater than 5. 5-smooth numbers are also called regular numbers or Hamming numbers; 7-smooth numbers are sometimes called highly composite, although this conflicts with another meaning of that term.…

  • Language: English

    Published by OmniScriptum, 2026

    6131243573 / 9786131243578

    • Softcover
    • Print on Demand

    Seller: preigu, Osnabrück, Germanypreigu

    5-star seller
    Contact seller

    Condition: New

    £ 107.88

    £ 58.51 shipping 
    Ships from Germany to U.S.A.

    Quantity: 5 available

    Taschenbuch. Condition: Neu. Smooth Number | Number Theory, Integer, Integer Factorization, Prime Number, Leonard Adleman, Cryptography, Negative and Positive Numbers | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131243578 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. …

  • Language: English

    Published by Omniscriptum Mär 2026, 2026

    6131243573 / 9786131243578

    • Softcover
    • Print on Demand

    Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

    5-star seller
    Contact seller

    Condition: New

    £ 134.31

    £ 50.15 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In number theorya smooth number is an integer which factors completely into small primenumbers; the term seems coined by Leonard Adleman. Smooth numbers areespecially important in cryptography relying on factorization.A positiveinteger is called B-smooth if none of its prime factors are greater thanB. For example, 1,620 has prime factorization 22 × 34 × 5; therefore1,620 is 5-smooth because none of its prime factors are greater than 5.5-smooth numbers are also called regular numbers or Hamming numbers;7-smooth numbers are sometimes called highly composite, although thisconflicts with another meaning of that term.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 124 pp. Englisch.…