NOTES ON NUMBER THEORY AND DISCRETE MATHEMATICS, VOLUME 9, NUMBER 2, 2003

NOTES ON NUMBER THEORY AND DISCRETE MATHEMATICS, VOLUME 9, NUMBER 2, 2003 PDF Author: Aldo Peretti
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 12

Get Book Here

Book Description
Articles, notes and problems on Smarandache Function, Pseudo-Smarandache function, Smarandache-simple functions, Inferior Smarandache Prime Part, Smarandache double factorial function, Generalized Smarandache Palindrome, Smarandache problems, Smarandache circular sequence etc.

NOTES ON NUMBER THEORY AND DISCRETE MATHEMATICS, VOLUME 9, NUMBER 2, 2003

NOTES ON NUMBER THEORY AND DISCRETE MATHEMATICS, VOLUME 9, NUMBER 2, 2003 PDF Author: Aldo Peretti
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 12

Get Book Here

Book Description
Articles, notes and problems on Smarandache Function, Pseudo-Smarandache function, Smarandache-simple functions, Inferior Smarandache Prime Part, Smarandache double factorial function, Generalized Smarandache Palindrome, Smarandache problems, Smarandache circular sequence etc.

An Algorithm for Calculating Smarandache's Function and Wich Using Legendre's Formula

An Algorithm for Calculating Smarandache's Function and Wich Using Legendre's Formula PDF Author: Tatiana-Corina Dosescu
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 10

Get Book Here

Book Description
The paper presents a calculation algorithm for the values of the function S, defined by Fl. Smarandache [6], [1], [4], [5], an algorithm that uses the writing of numbers in base ten and it is based on Legendre's formula and some theoretical results. It differs from the one presented in [8], which avoids factorization, and from the one presented in [6], which requires writing on a generalized basis. Then a characterization of a prime number is given. Finally, a numerical application is presented.The paper presents a calculation algorithm for the values of the function S, defined by Fl. Smarandache [6], [1], [4], [5], an algorithm that uses the writing of numbers in base ten and it is based on Legendre's formula and some theoretical results. It differs from the one presented in [8], which avoids factorization, and from the one presented in [6], which requires writing on a generalized basis. Then a characterization of a prime number is given. Finally, a numerical application is presented.

International Journal of Mathematical Combinatorics, Volume 2, 2011

International Journal of Mathematical Combinatorics, Volume 2, 2011 PDF Author: Linfan Mao
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 144

Get Book Here

Book Description
The mathematical combinatorics is a subject that applying combinatorial notion to all mathematics and all sciences for understanding the reality of things in the universe. The International J. Mathematical Combinatorics is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly, which publishes original research papers and survey articles in all aspects of mathematical combinatorics, Smarandache multi-spaces, Smarandache geometries, non-Euclidean geometry, topology and their applications to other sciences.

Additive Combinatorics

Additive Combinatorics PDF Author: Andrew Granville
Publisher: American Mathematical Soc.
ISBN: 9780821870396
Category : Mathematics
Languages : en
Pages : 348

Get Book Here

Book Description
This book, based in part on lectures delivered at the 2006 CRM-Clay School on Additive Combinatorics, brings together some of the top researchers in one of the hottest topics in analysis today. This new subject brings together ideas from many different areas to prove some extraordinary results. The book encompasses proceedings from the school, articles on open questions in additive combinatorics, and new research.

Graph-Theoretic Concepts in Computer Science

Graph-Theoretic Concepts in Computer Science PDF Author: Fedor V. Fomin
Publisher: Springer
ISBN: 3540483829
Category : Computers
Languages : en
Pages : 368

Get Book Here

Book Description
This book constitutes the thoroughly refereed post-proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2006, held in Bergen, Norway in June 2006. The 30 revised full papers presented together with one invited paper were carefully selected from 91 submissions. The papers address all aspects of graph-theoretic concepts in computer science.

Mathematical Constants II

Mathematical Constants II PDF Author: Steven R. Finch
Publisher: Cambridge University Press
ISBN: 1108470599
Category : Mathematics
Languages : en
Pages : 783

Get Book Here

Book Description
Famous mathematical constants include the ratio of circular circumference to diameter, π = 3.14 ..., and the natural logarithm base, e = 2.718 .... Students and professionals can often name a few others, but there are many more buried in the literature and awaiting discovery. How do such constants arise, and why are they important? Here the author renews the search he began in his book Mathematical Constants, adding another 133 essays that broaden the landscape. Topics include the minimality of soap film surfaces, prime numbers, elliptic curves and modular forms, Poisson-Voronoi tessellations, random triangles, Brownian motion, uncertainty inequalities, Prandtl-Blasius flow (from fluid dynamics), Lyapunov exponents, knots and tangles, continued fractions, Galton-Watson trees, electrical capacitance (from potential theory), Zermelo's navigation problem, and the optimal control of a pendulum. Unsolved problems appear virtually everywhere as well. This volume continues an outstanding scholarly attempt to bring together all significant mathematical constants in one place.

Graph-Theoretic Concepts in Computer Science

Graph-Theoretic Concepts in Computer Science PDF Author: Juraj Hromkovič
Publisher: Springer
ISBN: 3540305599
Category : Computers
Languages : en
Pages : 413

Get Book Here

Book Description
During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci?c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o?ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment.

Guide to Pairing-Based Cryptography

Guide to Pairing-Based Cryptography PDF Author: Nadia El Mrabet
Publisher: CRC Press
ISBN: 1315353148
Category : Computers
Languages : en
Pages : 587

Get Book Here

Book Description
This book is devoted to efficient pairing computations and implementations, useful tools for cryptographers working on topics like identity-based cryptography and the simplification of existing protocols like signature schemes. As well as exploring the basic mathematical background of finite fields and elliptic curves, Guide to Pairing-Based Cryptography offers an overview of the most recent developments in optimizations for pairing implementation. Each chapter includes a presentation of the problem it discusses, the mathematical formulation, a discussion of implementation issues, solutions accompanied by code or pseudocode, several numerical results, and references to further reading and notes. Intended as a self-contained handbook, this book is an invaluable resource for computer scientists, applied mathematicians and security professionals interested in cryptography.

Hadamard Matrices

Hadamard Matrices PDF Author: Jennifer Seberry
Publisher: John Wiley & Sons
ISBN: 1119520274
Category : Mathematics
Languages : en
Pages : 354

Get Book Here

Book Description
Up-to-date resource on Hadamard matrices Hadamard Matrices: Constructions using Number Theory and Algebra provides students with a discussion of the basic definitions used for Hadamard Matrices as well as more advanced topics in the subject, including: Gauss sums, Jacobi sums and relative Gauss sums Cyclotomic numbers Plug-in matrices, arrays, sequences and M-structure Galois rings and Menon Hadamard differences sets Paley difference sets and Paley type partial difference sets Symmetric Hadamard matrices, skew Hadamard matrices and amicable Hadamard matrices A discussion of asymptotic existence of Hadamard matrices Maximal determinant matrices, embeddability of Hadamard matrices and growth problem for Hadamard matrices The book can be used as a textbook for graduate courses in combinatorics, or as a reference for researchers studying Hadamard matrices. Utilized in the fields of signal processing and design experiments, Hadamard matrices have been used for 150 years, and remain practical today. Hadamard Matrices combines a thorough discussion of the basic concepts underlying the subject matter with more advanced applications that will be of interest to experts in the area.

Handbook of Enumerative Combinatorics

Handbook of Enumerative Combinatorics PDF Author: Miklos Bona
Publisher: CRC Press
ISBN: 1482220865
Category : Mathematics
Languages : en
Pages : 1073

Get Book Here

Book Description
Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods.This important new work is edited by Miklos Bona of the University of Florida where he