Andere Kunden interessierten sich auch für
![Smooth Functor]( "Smooth Functor")
Smooth Functor25,99 €![Smooth Function]( "Smooth Function")
Smooth Function25,99 €![Smooth Infinitesimal Analysis]( "Smooth Infinitesimal Analysis")
Smooth Infinitesimal Analysis22,99 €![Flows of Non-Smooth Vector Fields and Degenerate Elliptic Equations]( "Flows of Non-Smooth Vector Fields and Degenerate Elliptic Equations")
Flows of Non-Smooth Vector Fields and Degenerate Elliptic Equations23,99 €![Nonlinear Differential Problems with Smooth and Nonsmooth Constraints]( "Nonlinear Differential Problems with Smooth and Nonsmooth Constraints")
Nonlinear Differential Problems with Smooth and Nonsmooth Constraints113,99 €![Smooth Bézier Surfaces over Unstructured Quadrilateral Meshes]( "Smooth Bézier Surfaces over Unstructured Quadrilateral Meshes")
Smooth Bézier Surfaces over Unstructured Quadrilateral Meshes41,99 €![Sobolev Spaces, Their Generalizations and Elliptic Problems in Smooth and Lipschitz Domains]( "Sobolev Spaces, Their Generalizations and Elliptic Problems in Smooth and Lipschitz Domains")
Sobolev Spaces, Their Generalizations and Elliptic Problems in Smooth and Lipschitz Domains74,99 €
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.