Number Theory Commons^™

Quaestiones Neutrosophicae, Florentin Smarandache, Yale Landsberg

Branch Mathematics and Statistics Faculty and Staff Publications

The following dialogue contains cuts from different non-protocolar conversations, initially not intended for publication, held by the authors by email during the beginning of 2015 – on Neutrosophy and related topics.

Many thanks to all friends and dialogue partners who payed attention to Neutrosophy and connected areas, in emails, yahoo groups, social media, letters, private discussions.

Techno-Art Of Selariu Supermathematics Functions, 2nd Volume, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

An ALBUM, according to the dictionary, is defined as "notebook for storing photos, postcards, stamps, lyrics, quotes etc.", which, in other words, means gatherings of "pieces" of the same "species". Or, in the new Techno-Art of Selariu SuperMathematics Functions ALBUM (the second book of Selariu SuperMathematics Functions), one contemplates a unique COMPOSITION, INTER-, INTRA- and TRANS-DISCIPLINARY. (Capitalizing here is not a futility, but a harmony with the TRUTH.) One caveat I am indebted to do, as a consequent "reader" – over time, I received the ALBUM, chapter by chapter, pace by pace, which gave me the time to analyze / …

Neutrosophic Axiomatic System, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we introduce for the first time the notions of Neutrosophic Axiom, Neutrosophic Axiomatic System, Neutrosophic Deducibility and Neutrosophic Inference, Neutrosophic Proof, Neutrosophic Tautologies, Neutrosophic Quantifiers, Neutrosophic Propositional Logic, Neutrosophic Axiomatic Space, Degree of Contradiction (Dissimilarity) of Two Neutrosophic Axioms, and Neutrosophic Model. A class of neutrosophic implications is also introduced. A comparison between these innovatory neutrosophic notions and their corresponding classical notions is made. Then, three concrete examples of neutrosophic axiomatic systems, describing the same neutrosophic geometrical model, are presented at the end of the paper.

Further Results On Vanishing Coefficients In Infinite Product Expansions, James Mclaughlin

Mathematics Faculty Publications

We extend results of Andrews and Bressoud on the vanishing of coefficients in the series expansions of certain infinite products. These results have the form that if (q r−tk, qmk−(r−tk) ; q mk)∞ (q r, qmk−r; qmk)∞ =: X∞ n=0 cnq n , for certain integers k, m s and t, where r = sm+t, then ckn−rs is always zero. Our theorems also partly give a simpler reformulation of results of Alladi and Gordon, but also give results for cases not covered by the theorems of Alladi and Gordon. We also give some interpretations of the analytic results in terms …

On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh

CMC Senior Theses

This project is concerned with the set of primes modulo which some monic, irreducible polynomial over the integers has a root, called the Prime Set of the polynomial. We completely characterise these sets for degree 2 polynomials, and develop sufficient machinery from algebraic number theory to show that if the Galois group of a monic, irreducible polynomial over the integers is abelian, then its Prime Set can be written as the union of primes in some congruence classes modulo some integer.

A Cryptographic Attack: Finding The Discrete Logarithm On Elliptic Curves Of Trace One, Tatiana Bradley

Scripps Senior Theses

The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric problem. The elliptic curve discrete logarithm problem, as it is called, is hoped to be generally hard in one direction but not the other, and it is this asymmetry that makes it secure.

This paper describes the mathematics (and some of the computer science) necessary to understand and compute an attack on the elliptic curve discrete logarithm problem that works in a special case. The algorithm, proposed by Nigel Smart, renders the elliptic curve discrete logarithm problem easy in both directions for elliptic curves of …

Polynomials With Prescribed Bad Primes, David P. Roberts

Mathematics Publications

We tabulate polynomials in ℚ[t] with a given factorization partition, bad reduction entirely within a given set of primes, and satisfying auxiliary conditions associated to 0, 1, and ∞. We explain how these polynomials are of particular interest because of their role in the construction of nonsolvable number fields of arbitrarily large degree and bounded ramification.

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 …

The Tame-Wild Principle For Discriminant Relations For Number Fields, John W. Jones, David P. Roberts

Mathematics Publications

Consider tuples ( K₁ , … , K_r ) of separable algebras over a common local or global number field F₁, with the K_i related to each other by specified resolvent constructions. Under the assumption that all ramification is tame, simple group-theoretic calculations give best possible divisibility relations among the discriminants of K_i ∕ F . We show that for many resolvent constructions, these divisibility relations continue to hold even in the presence of wild ramification.

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 …

Computing Local Constants For Cm Elliptic Curves, Sunil Chetty, Lung Li

Mathematics Faculty Publications

Let E/k be an elliptic curve with CM by O. We determine a formula for (a generalization of) the arithmetic local constant of Mazur-Rubin at almost all primes of good reduction. We apply this formula to the CM curves defined over Q and are able to describe extensions F/Q over which the O-rank of E grows.

A Frobenius Question Related To Actions On Curves In Characteristic P, Darren B. Glass

Math Faculty Publications

We consider which integers g can occur as the genus and of a curve defined over a field of characteristic p which admits an automorphism of degree pq, where p and q are distinct primes. This investigation leads us to consider a certain family of three-dimensional Frobenius problems and prove explicit formulas giving their solution in many cases.

Finding Zeros Of Rational Quadratic Forms, John F. Shaughnessy

CMC Senior Theses

In this thesis, we introduce the notion of quadratic forms and provide motivation for their study. We begin by discussing Diophantine equations, the field of p-adic numbers, and the Hasse-Minkowski Theorem that allows us to use p-adic analysis determine whether a quadratic form has a rational root. We then discuss search bounds and state Cassels' Theorem for small-height zeros of rational quadratic forms. We end with a proof of Cassels' Theorem and suggestions for further reading.

Interval Neutrosophic Rough Set, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

This paper combines interval-valued neutrosophic sets and rough sets. It studies rougheness in interval-valued neutrosophic sets and some of its properties. Finally we propose a Hamming distance between lower an upper approximations of interval neutrosophic sets.

Importance Of Sources Using The Repeated Fusion Method And The Proportional Conflict Redistribution Rules #5 And #6, Florentin Smarandache, Jean Dezert

Branch Mathematics and Statistics Faculty and Staff Publications

We present in this paper some examples of how to compute by hand the PCR5 fusion rule for three sources, so the reader will better understand its mechanism. We also take into consideration the importance of sources, which is different from the classical discounting of sources.

Algebraic Structures On The Fuzzy Interval [0, 1), Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book we introduce several algebraic structures on the special fuzzy interval [0, 1). This study is different from that of the algebraic structures using the interval [0, n) n ≠ 1, as these structures on [0, 1) has no idempotents or zero divisors under ×. Further [0, 1) under product × is only a semigroup. However by defining min(or max) operation in [0, 1); [0, 1) is made into a semigroup. The semigroup under × has no finite subsemigroups but under min or max we have subsemigroups of order one, two and so on. [0, 1) under + …

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 …