Author: Aldo Peretti
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 12
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
Author: Aldo Peretti
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 12
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.
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 12
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
Author: Tatiana-Corina Dosescu
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 10
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.
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 10
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
Author: Linfan Mao
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 144
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.
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 144
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.
Harmonic Analysis and Convexity
Author: Alexander Koldobsky
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 3110775387
Category : Mathematics
Languages : en
Pages : 480
Book Description
In recent years, the interaction between harmonic analysis and convex geometry has increased which has resulted in solutions to several long-standing problems. This collection is based on the topics discussed during the Research Semester on Harmonic Analysis and Convexity at the Institute for Computational and Experimental Research in Mathematics in Providence RI in Fall 2022. The volume brings together experts working in related fields to report on the status of major problems in the area including the isomorphic Busemann-Petty and slicing problems for arbitrary measures, extremal problems for Fourier extension and extremal problems for classical singular integrals of martingale type, among others.
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 3110775387
Category : Mathematics
Languages : en
Pages : 480
Book Description
In recent years, the interaction between harmonic analysis and convex geometry has increased which has resulted in solutions to several long-standing problems. This collection is based on the topics discussed during the Research Semester on Harmonic Analysis and Convexity at the Institute for Computational and Experimental Research in Mathematics in Providence RI in Fall 2022. The volume brings together experts working in related fields to report on the status of major problems in the area including the isomorphic Busemann-Petty and slicing problems for arbitrary measures, extremal problems for Fourier extension and extremal problems for classical singular integrals of martingale type, among others.
Algorithmic Number Theory
Author: Duncan Buell
Publisher: Springer
ISBN: 3540248471
Category : Mathematics
Languages : en
Pages : 461
Book Description
The sixth Algorithmic Number Theory Symposium was held at the University of Vermont, in Burlington, from 13–18 June 2004. The organization was a joint e?ort of number theorists from around the world. There were four invited talks at ANTS VI, by Dan Bernstein of the Univ- sity of Illinois at Chicago, Kiran Kedlaya of MIT, Alice Silverberg of Ohio State University, and Mark Watkins of Pennsylvania State University. Thirty cont- buted talks were presented, and a poster session was held. This volume contains the written versions of the contributed talks and three of the four invited talks. (Not included is the talk by Dan Bernstein.) ANTS in Burlington is the sixth in a series that began with ANTS I in 1994 at Cornell University, Ithaca, New York, USA and continued at Universit ́eB- deaux I, Bordeaux, France (1996), Reed College, Portland, Oregon, USA (1998), the University of Leiden, Leiden, The Netherlands (2000), and the University of Sydney, Sydney, Australia (2002). The proceedings have been published as volumes 877, 1122, 1423, 1838, and 2369 of Springer-Verlag’s Lecture Notes in Computer Science series. The organizers of the 2004 ANTS conference express their special gratitude and thanks to John Cannon and Joe Buhler for invaluable behind-the-scenes advice.
Publisher: Springer
ISBN: 3540248471
Category : Mathematics
Languages : en
Pages : 461
Book Description
The sixth Algorithmic Number Theory Symposium was held at the University of Vermont, in Burlington, from 13–18 June 2004. The organization was a joint e?ort of number theorists from around the world. There were four invited talks at ANTS VI, by Dan Bernstein of the Univ- sity of Illinois at Chicago, Kiran Kedlaya of MIT, Alice Silverberg of Ohio State University, and Mark Watkins of Pennsylvania State University. Thirty cont- buted talks were presented, and a poster session was held. This volume contains the written versions of the contributed talks and three of the four invited talks. (Not included is the talk by Dan Bernstein.) ANTS in Burlington is the sixth in a series that began with ANTS I in 1994 at Cornell University, Ithaca, New York, USA and continued at Universit ́eB- deaux I, Bordeaux, France (1996), Reed College, Portland, Oregon, USA (1998), the University of Leiden, Leiden, The Netherlands (2000), and the University of Sydney, Sydney, Australia (2002). The proceedings have been published as volumes 877, 1122, 1423, 1838, and 2369 of Springer-Verlag’s Lecture Notes in Computer Science series. The organizers of the 2004 ANTS conference express their special gratitude and thanks to John Cannon and Joe Buhler for invaluable behind-the-scenes advice.
Combinatorics of Set Partitions
Author: Toufik Mansour
Publisher: CRC Press
ISBN: 1439863342
Category : Computers
Languages : en
Pages : 602
Book Description
Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Partitions presents methods used in the combinatorics of pattern avoidance and pattern enumeration in set partitions. Designed for students and researchers in discrete mathematics, the book is a one-stop reference on the results and research activities
Publisher: CRC Press
ISBN: 1439863342
Category : Computers
Languages : en
Pages : 602
Book Description
Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Partitions presents methods used in the combinatorics of pattern avoidance and pattern enumeration in set partitions. Designed for students and researchers in discrete mathematics, the book is a one-stop reference on the results and research activities
Handbook of Discrete and Computational Geometry
Author: Csaba D. Toth
Publisher: CRC Press
ISBN: 1498711421
Category : Computers
Languages : en
Pages : 1928
Book Description
The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.
Publisher: CRC Press
ISBN: 1498711421
Category : Computers
Languages : en
Pages : 1928
Book Description
The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.
Combinatorial Number Theory
Author: Bruce Landman
Publisher: Walter de Gruyter
ISBN: 3110925095
Category : Mathematics
Languages : en
Pages : 501
Book Description
This carefully edited volume contains selected refereed papers based on lectures presented by many distinguished speakers at the "Integers Conference 2005", an international conference in combinatorial number theory. The conference was held in celebration of the 70th birthday of Ronald Graham, a leader in several fields of mathematics.
Publisher: Walter de Gruyter
ISBN: 3110925095
Category : Mathematics
Languages : en
Pages : 501
Book Description
This carefully edited volume contains selected refereed papers based on lectures presented by many distinguished speakers at the "Integers Conference 2005", an international conference in combinatorial number theory. The conference was held in celebration of the 70th birthday of Ronald Graham, a leader in several fields of mathematics.
Number-Theoretic Algorithms in Cryptography
Author: Oleg Nikolaevich Vasilenko
Publisher: American Mathematical Soc.
ISBN: 9780821840900
Category : Language Arts & Disciplines
Languages : en
Pages : 274
Book Description
Algorithmic number theory is a rapidly developing branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. Among the algorithms used in cryptography, the following are especially important: algorithms for primality testing; factorization algorithms for integers and for polynomials in one variable; applications of the theory of elliptic curves; algorithms for computation of discrete logarithms; algorithms for solving linear equations over finite fields; and, algorithms for performing arithmetic operations on large integers. The book describes the current state of these and some other algorithms. It also contains extensive bibliography. For this English translation, additional references were prepared and commented on by the author.
Publisher: American Mathematical Soc.
ISBN: 9780821840900
Category : Language Arts & Disciplines
Languages : en
Pages : 274
Book Description
Algorithmic number theory is a rapidly developing branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. Among the algorithms used in cryptography, the following are especially important: algorithms for primality testing; factorization algorithms for integers and for polynomials in one variable; applications of the theory of elliptic curves; algorithms for computation of discrete logarithms; algorithms for solving linear equations over finite fields; and, algorithms for performing arithmetic operations on large integers. The book describes the current state of these and some other algorithms. It also contains extensive bibliography. For this English translation, additional references were prepared and commented on by the author.
Combinatorial Group Theory, Discrete Groups, and Number Theory
Author: Benjamin Fine
Publisher: American Mathematical Soc.
ISBN: 0821839853
Category : Mathematics
Languages : en
Pages : 282
Book Description
This volume consists of contributions by participants and speakers at two conferences. The first was entitled Combinatorial Group Theory, Discrete Groups and Number Theory and was held at Fairfield University, December 8-9, 2004. It was in honor of Professor Gerhard Rosenberger's sixtieth birthday. The second was the AMS Special Session on Infinite Group Theory held at Bard College, October 8-9, 2005. The papers in this volume provide a very interesting mix of combinatorial group theory, discrete group theory and ring theory as well as contributions to noncommutative algebraic cryptography.
Publisher: American Mathematical Soc.
ISBN: 0821839853
Category : Mathematics
Languages : en
Pages : 282
Book Description
This volume consists of contributions by participants and speakers at two conferences. The first was entitled Combinatorial Group Theory, Discrete Groups and Number Theory and was held at Fairfield University, December 8-9, 2004. It was in honor of Professor Gerhard Rosenberger's sixtieth birthday. The second was the AMS Special Session on Infinite Group Theory held at Bard College, October 8-9, 2005. The papers in this volume provide a very interesting mix of combinatorial group theory, discrete group theory and ring theory as well as contributions to noncommutative algebraic cryptography.