Number Theory Commons^™

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 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 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 …

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 …

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, …

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 …

Generalizations Of Two Statistics On Linear Tilings, Toufik Mansour, Mark Shattuck

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we study generalizations of two well-known statistics on linear square-and-domino tilings by considering only those dominos whose right half covers a multiple of 􀝇, where 􀝇 is a fixed positive integer. Using the method of generating functions, we derive explicit expressions for the joint distribution polynomials of the two statistics with the statistic that records the number of squares in a tiling. In this way, we obtain two families of q -generalizations of the Fibonacci polynomials. When 􀝇 􀵌 1, our formulas reduce to known results concerning previous statistics. Special attention is payed to the case 􀝇 …

Q -Analogs Of Identities Involving Harmonic Numbers And Binomial Coefficients, Toufik Mansour, Mark Shattuck, Chunwei Song

Applications and Applied Mathematics: An International Journal (AAM)

Recently, McCarthy presented two algebraic identities involving binomial coefficients and harmonic numbers, one of which generalizes an identity used to prove the Apéry number supercongruence. In 2008, Prodinger provided human proofs of identities initially obtained by Osburn and Schneider using the computer program Sigma. In this paper, we establish q -analogs of a fair number of the identities appearing in McCarthy (Integers 11 (2011): A37) and Prodinger (Integers 8 (2008): A10) by making use of q -partial fractions.

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.

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 …

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 …

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 …

Ergodic And Combinatorial Proofs Of Van Der Waerden's Theorem, Matthew Samuel Rothlisberger

CMC Senior Theses

Followed two different proofs of van der Waerden's theorem. Found that the two proofs yield important information about arithmetic progressions and the theorem. van der Waerden's theorem explains the occurrence of arithmetic progressions which can be used to explain such things as the Bible Code.

Compression Theorems For Periodic Tilings And Consequences, Arthur T. Benjamin, Alex K. Eustis '06, Mark A. Shattuck

All HMC Faculty Publications and Research

We consider a weighted square-and-domino tiling model obtained by assigning real number weights to the cells and boundaries of an n-board. An important special case apparently arises when these weights form periodic sequences. When the weights of an nm-tiling form sequences having period m, it is shown that such a tiling may be regarded as a meta-tiling of length n whose weights have period 1 except for the first cell (i.e., are constant). We term such a contraction of the period in going from the longer to the shorter tiling as "period compression". It turns out that …

Superbimatrices And Their Generalizations, Florentin Smarandache, W.B Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The systematic study of supermatrices and super linear algebra has been carried out in 2008. These new algebraic structures find their applications in fuzzy models, Leontief economic models and data-storage in computers. In this book the authors introduce the new notion of superbimatrices and generalize it to super trimatrices and super n-matrices. Study of these structures is not only interesting and innovative but is also best suited for the computerized world. The main difference between simple bimatrices and super bimatrices is that in case of simple bimatrices we have only one type of product defined on them, whereas in case …

N- Linear Algebra Of Type I And Its Applications, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

With the advent of computers one needs algebraic structures that can simultaneously work with bulk data. One such algebraic structure namely n-linear algebras of type I are introduced in this book and its applications to n-Markov chains and n-Leontief models are given. These structures can be thought of as the generalization of bilinear algebras and bivector spaces. Several interesting n-linear algebra properties are proved. This book has four chapters. The first chapter just introduces n-group which is essential for the definition of nvector spaces and n-linear algebras of type I. Chapter two gives the notion of n-vector spaces and several …

Self-Avoiding Walks And Fibonacci Numbers, Arthur T. Benjamin

All HMC Faculty Publications and Research

By combinatorial arguments, we prove that the number of self-avoiding walks on the strip {0, 1} × Z is 8F_n − 4 when n is odd and is 8F_n − n when n is even. Also, when backwards moves are prohibited, we derive simple expressions for the number of length n self-avoiding walks on {0, 1} × Z, Z × Z, the triangular lattice, and the cubic lattice.

Mapping The Discrete Logarithm, Daniel R. Cloutier

Mathematical Sciences Technical Reports (MSTR)

The discrete logarithm is a problem that surfaces frequently in the field of cryptog- raphy as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the functional graph is largely dependent on an interaction between g and p-1. In fact, there are precisely as many different functional graph structures as there are divisors of p-1. This paper extracts two of these structures, permutations and binary functional graphs. Estimates exist for the shape of a random permutation, but …

Fixed Point And Two-Cycles Of The Discrete Logarithm, Joshua Holden

Mathematical Sciences Technical Reports (MSTR)

We explore some questions related to one of Brizolis: does every prime p have a pair (g, h) such that h is a fixed point for the discrete logarithm with base g? We extend this question to ask about not only fixed points but also two-cycles. Campbell and Pomerance have not only answered the fixed point question for sufficiently large p but have also rigorously estimated the number of such pairs given certain conditions on g and h. We attempt to give heuristics for similar estimates given other conditions on g and h and also in the case …