Number Theory Commons^™

One Formula For Non-Prime Numbers: Motivations And Characteristics, Mahmoud Mansour, Kamal Hassan Prof.

Basic Science Engineering

Primes are essential for computer encryption and cryptography, as they are fundamental units of whole numbers and are of the highest importance due to their mathematical qualities. However, identifying a pattern of primes is not easy. Thinking in a different way may get benefits, by considering the opposite side of the problem which means focusing on non-prime numbers. Recently, researchers introduced, the pattern of non-primes in two maximal sets while in this paper, non-primes are presented in one formula. Getting one-way formula for non-primes may pave the way for further applications based on the idea of primes.

Decomposition Of Beatty And Complementary Sequences, Geremías Polanco

Mathematics Sciences: Faculty Publications

In this paper we express the difference of two complementary Beatty sequences, as the sum of two Beatty sequences closely related to them. In the process we introduce a new Algorithm that generalizes the well known Minimum Excluded algorithm and provides a method to generate combinatorially any pair of complementary Beatty sequences.

Structure Of Number Theoretic Graphs, Lee Trent

Mathematical Sciences Technical Reports (MSTR)

The tools of graph theory can be used to investigate the structure
imposed on the integers by various relations. Here we investigate two
kinds of graphs. The first, a square product graph, takes for its vertices
the integers 1 through n, and draws edges between numbers whose product
is a square. The second, a square product graph, has the same vertex set,
and draws edges between numbers whose sum is a square.
We investigate the structure of these graphs. For square product
graphs, we provide a rather complete characterization of their structure as
a union of disjoint complete graphs. For …

Introduction To Discrete Mathematics: An Oer For Ma-471, Mathieu Sassolas

Open Educational Resources

The first objective of this book is to define and discuss the meaning of truth in mathematics. We explore logics, both propositional and first-order , and the construction of proofs, both formally and human-targeted. Using the proof tools, this book then explores some very fundamental definitions of mathematics through set theory. This theory is then put in practice in several applications. The particular (but quite widespread) case of equivalence and order relations is studied with detail. Then we introduces sequences and proofs by induction, followed by number theory. Finally, a small introduction to combinatorics is …

Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya

Department of Mathematics Facuty Scholarship and Creative Works

This issue showcases a compilation of papers on fluid mechanics (FM) education, covering different sub topics of the subject. The success of the first volume [1] prompted us to consider another follow-up special issue on the topic, which has also been very successful in garnering an impressive variety of submissions. As a classical branch of science, the beauty and complexity of fluid dynamics cannot be overemphasized. This is an extremely well-studied subject which has now become a significant component of several major scientific disciplines ranging from aerospace engineering, astrophysics, atmospheric science (including climate modeling), biological and biomedical science …

Arithmetical Structures On Paths With A Doubled Edge, Darren B. Glass, Joshua R. Wagner

Math Faculty Publications

An arithmetical structure on a graph is given by a labeling of the vertices that satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical structures for graphs in these families.

Some Results And Examples On Vertex Equitable Labeling, Mohamed Saied Aboshady, Reda Amin Elbarkoki, Eliwa Mohamed Roshdy, Mohamed Abdel Azim Seoud

Basic Science Engineering

In this paper we present a survey for all graphs with order at most 6 whether they are vertex equitable or not and we get an upper bound for the number of edges of any graph with 𝑝 vertices to be a vertex equitable graph. Also, we establish vertex equitable labeling for the 𝑚-chain of the complete bipartite graph 𝐾2,𝑛 and for the graph 𝑃𝑛 × 𝑃𝑚.

Greatest Common Divisor: Algorithm And Proof, Mary K. Flagg

Number Theory

No abstract provided.

Mod Rectangular Natural Neutrosophic Numbers, Florentin Smarandache, K. Ilanthenral, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors introduce the new notion of MOD rectangular planes. The functions on them behave very differently when compared to MOD planes (square). These are different from the usual MOD planes. Algebraic structures on these MOD rectangular planes are defined and developed. However we have built only MOD interval natural neutrosophic products

Nullification Of Torus Knots And Links, Zachary S. Bettersworth

Masters Theses & Specialist Projects

Knot nullification is an unknotting operation performed on knots and links that can be used to model DNA recombination moves of circular DNA molecules in the laboratory. Thus nullification is a biologically relevant operation that should be studied.

Nullification moves can be naturally grouped into two classes: coherent nullification, which preserves the orientation of the knot, and incoherent nullification, which changes the orientation of the knot. We define the coherent (incoherent) nullification number of a knot or link as the minimal number of coherent (incoherent) nullification moves needed to unknot any knot or link. This thesis concentrates on the study …

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 …

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 …

Nidus Idearum. Scilogs, Ii: De Rerum Consectatione, 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 second book 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 …

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.

Polynomials Occuring In Generating Function Identities For B-Ary Partitions, David Dakota Blair

Graduate Student Publications and Research

Let p_b(n) be the number of integer partitions of n whose parts are powers of b. For each m there is a generating function identity:

f_m(b,q)\sum_{n} p_b(n) q^n = (1-q)^m \sum_{n} p_b(b^m n q)q^n

where n ranges over all integer values. The proof of this identity appears in the doctoral thesis of the author. For more information see http://dakota.tensen.net/2015/rp/.

This dataset is a JSON object with keys m from 1 to 23 whose values are f_m(b,q).

Mod Planes: A New Dimension To Modulo Theory, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book for the first time authors study mod planes using modulo intervals [0, m); 2 ≤ m ≤ ∞. These planes unlike the real plane have only one quadrant so the study is carried out in a compact space but infinite in dimension. We have given seven mod planes viz real mod planes (mod real plane) finite complex mod plane, neutrosophic mod plane, fuzzy mod plane, (or mod fuzzy plane), mod dual number plane, mod special dual like number plane and mod special quasi dual number plane. These mod planes unlike real plane or complex plane or neutrosophic …

Mod Functions: A New Approach To Function Theory, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the notion of MOD functions are defined on MOD planes. This new concept of MOD functions behaves in a very different way. Even very simple functions like y = nx has several zeros in MOD planes where as they are nice single line graphs with only (0, 0) as the only zero. Further polynomials in MOD planes do not in general follows the usual or classical laws of differentiation or integration. Even finding roots of MOD polynomials happens to be very difficult as they do not follow the fundamental theorem of algebra, viz a nth degree polynomial …

Mod Pseudo Linear Algebras, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time elaborately study the notion of MOD vector spaces and MOD pseudo linear algebras. This study is new, innovative and leaves several open conjectures. In the first place as distributive law is not true we can define only MOD pseudo linear algebras. Secondly most of the classical theorems true in case of linear algebras are not true in case of MOD pseudo linear algebras. Finding even eigen values and eigen vectors happens to be a challenging problem. Further the notion of multidimensional MOD pseudo linear algebras are defined using the notion of MOD …

Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh

Mathematical Sciences Technical Reports (MSTR)

The Welch map x -> g^x-1+c is similar to the discrete exponential map x -> g^x, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to the Welch equation: g^x-1+c = x (mod p^e) where p is a prime, and looks at other patterns of the equation that could possibly exploited in a similar cryptographic system. Since the equation is modulo p^e, where p is a prime number, p-adic methods of analysis are used in counting the number of solutions modulo p …

Deconstructing The Welch Equation Using P-Adic Methods, Abigail Mann, Adelyn Yeoh

Rose-Hulman Undergraduate Research Publications

The Welch map x -> g^x-1+c is similar to the discrete exponential map x -> g^x, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to the Welch equation: g^x-1+c = x (mod p^e) where p is a prime, and looks at other patterns of the equation that could possibly exploited in a similar cryptographic system. Since the equation is modulo p^e, where p is a prime number, p-adic methods of analysis are used in counting the number of solutions modulo p …

Polynomial Factoring Algorithms And Their Computational Complexity, Nicholas Cavanna

Honors Scholar Theses

Finite fields, and the polynomial rings over them, have many neat algebraic properties and identities that are very convenient to work with. In this paper we will start by exploring said properties with the goal in mind of being able to use said properties to efficiently irreducibly factorize polynomials over these fields, an important action in the fields of discrete mathematics and computer science. Necessarily, we must also introduce the concept of an algorithm’s speed as well as particularly speeds of basic modular and integral arithmetic opera- tions. Outlining these concepts will have laid the groundwork for us to introduce …

Algebraic Structures On Finite Complex Modulo Integer Interval C([0, N)), Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors introduce the notion of finite complex modulo integer intervals. Finite complex modulo integers was introduced by the authors in 2011. Now using this finite complex modulo integer intervals several algebraic structures are built. Further the concept of finite complex modulo integers itself happens to be new and innovative for in case of finite complex modulo integers the square value of the finite complex number varies with varying n of Zn. In case of finite complex modulo integer intervals also we can have only pseudo ring as the distributive law is not true, in general in C([0, …

Special Pseudo Linear Algebras Using [0,N), Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book we introduce some special type of linear algebras called pseudo special linear algebras using the interval [0, n). These new types of special pseudo interval linear algebras has several interesting properties. Special pseudo interval linear algebras are built over the subfields in Zn where Zn is a S-ring. We study the substructures of them. The notion of Smarandache special interval pseudo linear algebras and Smarandache strong special pseudo interval linear algebras are introduced. The former Sspecial interval pseudo linear algebras are built over the Sring itself. Study in this direction has yielded several interesting results. S-strong special …

Soft Neutrosophic Algebraic Structures And Their Generalization - Vol. 1, Florentin Smarandache, Mumtaz Ali, Muhammad Shabir

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors introduced the notions of soft neutrosophic algebraic structures. These soft neutrosophic algebraic structures are basically defined over the neutrosophic algebraic structures which means a parameterized collection of subsets of the neutrosophic algebraic structure. For instance, the existence of a soft neutrosophic group over a neutrosophic group or a soft neutrosophic semigroup over a neutrosophic semigroup, or a soft neutrosophic field over a neutrosophic field, or a soft neutrosophic LA-semigroup over a neutrosophic LAsemigroup, or a soft neutosophic loop over a neutrosophic loop. It is interesting to note that these notions are defined over finite and …

Set Theoretic Approach To Algebraic Structures In Mathematics - A Revelation, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors bring out how sets in algebraic structure can be used to construct most generalized algebraic structures, like set linear algebra/vector space, set ideals in rings and semigroups. This sort of study is not only innovative but infact very helpful in cases instead of working with a large data we can work with a considerably small data. Thus instead of working with a vector space or a linear algebra V over a field F we can work with a subset in V and a needed subset in F, this can save both time and economy. The concept …

On A Pair Of Identities From Ramanujan's Lost Notebook, James Mclaughlin, Andrew Sills

Mathematics Faculty Publications

Using a pair of two variable series-product identities recorded by Ramanujan in the lost notebook as inspiration, we find some new identities of similar type. Each identity immediately implies an infinite family of Rogers-Ramanujan type identities, some of which are well-known identities from the literature. We also use these identities to derive some general identities for integer partitions.

Special Dual Like Numbers And Lattices, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors introduce a new type of dual numbers called special dual like numbers. These numbers are constructed using idempotents in the place of nilpotents of order two as new element. That is x = a + bg is a special dual like number where a and b are reals and g is a new element such that g2 =g. The collection of special dual like numbers forms a ring. Further lattices are the rich structures which contributes to special dual like numbers. These special dual like numbers x = a + bg; when a and b …

Non Associative Linear Algebras, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of non associative vector spaces and non associative linear algebras over a field. We construct non associative space using loops and groupoids over fields. In general in all situations, which we come across to find solutions may not be associative; in such cases we can without any difficulty adopt these non associative vector spaces/linear algebras. Thus this research is a significant one.

This book has six chapters. First chapter is introductory in nature. The new concept of non associative semilinear algebras is introduced in chapter two. This structure is …

The Combinatorialization Of Linear Recurrences, Arthur T. Benjamin, Halcyon Derks, Jennifer J. Quinn

All HMC Faculty Publications and Research

We provide two combinatorial proofs that linear recurrences with constant coefficients have a closed form based on the roots of its characteristic equation. The proofs employ sign-reversing involutions on weighted tilings.

Interval Semigroups, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book we introduce the notion of interval semigroups using intervals of the form [0, a], a is real. Several types of interval semigroups like fuzzy interval semigroups, interval symmetric semigroups, special symmetric interval semigroups, interval matrix semigroups and interval polynomial semigroups are defined and discussed. This book has eight chapters. The main feature of this book is that we suggest 241 problems in the eighth chapter. In this book the authors have defined 29 new concepts and illustrates them with 231 examples. Certainly this will find several applications. The authors deeply acknowledge Dr. Kandasamy for the proof reading …