Edité par LAP LAMBERT Academic Publishing Mai 2019, 2019
ISBN 10 : 6200091773 ISBN 13 : 9786200091772
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 39,90
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Neuware -These are the class notes for the first-semester undergraduate students of our college. These notes help students to acquire the basic knowledge of Number Theory. The pre-requisitions for reading these notes are the basic knowledge in set theory. It contains three chapters. In Chapter-I, we tried to discuss the construction of natural numbers and integers as well as the algebraic operations, ordering properties of them. Moreover, division algorithm, greatest integer functions are discussed briefly. In Chapter-II, Number theoretic functions are discussed with some well-known examples of number theoretic functions. In Chapter-III, we introduced the idea of congruences. Also, we discussed Euler's Theorem, Fermat's little theorem, Chinese remainder theorem, etc. As an application of Euler's theorem, public-key cryptosystems (RSA model) are also briefly introduced here.Books on Demand GmbH, Überseering 33, 22297 Hamburg 60 pp. Englisch.
Edité par LAP LAMBERT Academic Publishing Mai 2019, 2019
ISBN 10 : 6200091773 ISBN 13 : 9786200091772
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 39,90
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -These are the class notes for the first-semester undergraduate students of our college. These notes help students to acquire the basic knowledge of Number Theory. The pre-requisitions for reading these notes are the basic knowledge in set theory. It contains three chapters. In Chapter-I, we tried to discuss the construction of natural numbers and integers as well as the algebraic operations, ordering properties of them. Moreover, division algorithm, greatest integer functions are discussed briefly. In Chapter-II, Number theoretic functions are discussed with some well-known examples of number theoretic functions. In Chapter-III, we introduced the idea of congruences. Also, we discussed Euler's Theorem, Fermat's little theorem, Chinese remainder theorem, etc. As an application of Euler's theorem, public-key cryptosystems (RSA model) are also briefly introduced here. 60 pp. Englisch.
Edité par LAP LAMBERT Academic Publishing, 2019
ISBN 10 : 6200091773 ISBN 13 : 9786200091772
Langue: anglais
Vendeur : moluna, Greven, Allemagne
EUR 34,25
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Chakraborty BikashBikash Chakraborty did his Ph.D. in mathematics from the University of Kalyani. He is an Assistant Professor in the Department of Mathematics, Ramakrishna Mission Vivekananda Centenary College. His research focuses.
Edité par LAP LAMBERT Academic Publishing, 2019
ISBN 10 : 6200091773 ISBN 13 : 9786200091772
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 40,89
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - These are the class notes for the first-semester undergraduate students of our college. These notes help students to acquire the basic knowledge of Number Theory. The pre-requisitions for reading these notes are the basic knowledge in set theory. It contains three chapters. In Chapter-I, we tried to discuss the construction of natural numbers and integers as well as the algebraic operations, ordering properties of them. Moreover, division algorithm, greatest integer functions are discussed briefly. In Chapter-II, Number theoretic functions are discussed with some well-known examples of number theoretic functions. In Chapter-III, we introduced the idea of congruences. Also, we discussed Euler's Theorem, Fermat's little theorem, Chinese remainder theorem, etc. As an application of Euler's theorem, public-key cryptosystems (RSA model) are also briefly introduced here.