Number Theory Commons^™

Nidus Idearum. Scilogs, I: De Neutrosophia, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Welcome into my scientific lab! My lab[oratory] is a virtual facility with noncontrolled conditions in which I mostly perform scientific meditation and chats: a nest of ideas (nidus idearum, in Latin). I called the jottings herein scilogs (truncations of the words scientific, and gr. Λόγος – appealing rather to its original meanings "ground", "opinion", "expectation"), combining the welly of both science and informal (via internet) talks (in English, French, and Romanian). In this first books of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others …

Luhn Primes Of Order Ω, Florentin Smarandache, Octavian Cira

Branch Mathematics and Statistics Faculty and Staff Publications

A prime p, that added to its reverse results in a new prime is called a Luhn prime . The number 229 is a Luhn prime because 229 + 922 = 1151 and 1151 is also a prime . We extend the definition of Luhn primes, present some of the of their properties and ways to determine them .

Special Type Of Fixed Point Pairs Using Mod Rectangular Matrix Operators, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time define a special type of fixed points using MOD rectangular matrices as operators. In this case the special fixed points or limit cycles are pairs which is arrived after a finite number of iterations. Such study is both new and innovative for it can find lots of applications in mathematical modeling. Since all these Zn or I nZ or 〈Zn ∪ g〉 or 〈Zn ∪ g〉I or C(Zn) or CI(Zn) are all of finite order we are sure to arrive at a MOD fixed point pair or a MOD limit cycle pair …

Mathematics. Possible Subjects For The High School Entrance Examination And The Capacity Examination In Romania, Florentin Smarandache, Constantin Coanda, Ionuț Ivanescu

Branch Mathematics and Statistics Faculty and Staff Publications

The present book tries to offer students and teachers knowledge evaluation tools for all the chapters from the current Romanian mathematics syllabus. In the evolution of teenagers, the phase of admission in high schools mobilizes particular efforts and emotions. The present workbook aims to be a permanent advisor in the agitated period starting with the capacity examination and leading to the admittance to high school. The tests included in this workbook have a complementary character as opposed to the many materials written with the purpose to support all those who prepare for such examinations and they refer to the entire …

Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem, Florentin Smarandache, Luige Vladareanu, Said Broumi, Assia Bakali, Muhammad Akram

Branch Mathematics and Statistics Faculty and Staff Publications

The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.

Single Valued Neutrosophic Graphs: Degree, Order And Size, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali

Branch Mathematics and Statistics Faculty and Staff Publications

The single valued neutrosophic graph is a new version of graph theory presented recently as a generalization of fuzzy graph and intuitionistic fuzzy graph. The single valued neutrosophic graph (SVN-graph) is used when the relation between nodes (or vertices) in problems are indeterminate. In this paper, we examine the properties of various types of degrees, order and size of single valued neutrosophic graphs and a new definition for regular single valued neutrosophic graph is given.

An Exposition Of The Eisenstein Integers, Sarada Bandara

Masters Theses

In this thesis, we will give a brief introduction to number theory and prime numbers. We also provide the necessary background to understand how the imaginary ring of quadratic integers behaves.

An example of said ring are complex numbers of the form ℤ[ω] = {a+bω ∣ a, b ∈ ℤ} where ω² + ω + 1 = 0. These are known as the Eisenstein integers, which form a triangular lattice in the complex plane, in contrast with the Gaussian integers, ℤ[i] = {a + bi ∣ a, b ∈ …

A Measure Theoretic Approach To Problems Of Number Theory With Applications To The Proof Of The Prime Number Theorem, Russell Lee Jahn

All Graduate Theses, Dissertations, and Other Capstone Projects

In this paper we demonstrate how the principles of measure theory can be applied effectively to problems of number theory. Initially, necessary concepts from number theory will be presented. Next, we state standard concepts and results from measure theory to which we will need to refer. We then develop our repertoire of measure theoretic machinery by constructing the needed measures and defining a generalized version of the multiplicative convolution of measures. A suitable integration by parts formula, one that is general enough to handle various combinations of measures, will then be derived. At this juncture we will be ready to …

Automated Conjecturing Approach To The Discrete Riemann Hypothesis, Alexander Bradford

Theses and Dissertations

This paper is a study on some upper bounds of the Mertens function, which is often considered somewhat of a ``mysterious" function in mathematics and is closely related to the Riemann Hypothesis. We discuss some known bounds of the Mertens function, and also seek new bounds with the help of an automated conjecture-making program named CONJECTURING, which was created by C. Larson and N. Van Cleemput, and inspired by Fajtowicz's Dalmatian Heuristic. By utilizing this powerful program, we were able to form, validate, and disprove hypotheses regarding the Mertens function and how it is bounded.