Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Number Theory

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 481 - 510 of 567

Full-Text Articles in Mathematics

Twin Solutions Of Even Order Boundary Value Problems For Ordinary Differential Equations And Finite Difference Equations, Xun Sun Jan 2009

Twin Solutions Of Even Order Boundary Value Problems For Ordinary Differential Equations And Finite Difference Equations, Xun Sun

Theses, Dissertations and Capstones

The Avery-Henderson fixed-point theorem is first applied to obtain the existence of at least two positive solutions for the boundary value problem

(-1)ny(2n) = f(y); n = 1; 2; 3 ... and t 2 [0; 1];

with boundary conditions

y(2k)(0) = 0

y(2k+1)(1) = 0 for k = 0; 1; 2 ... n - 1:

This theorem is subsequently used to obtain the existence of at least two positive solutions for the dynamic boundary value problem

(-1)n (2n)u(k)g(u(k)); n = 1; 2; 3 .... and k (0; ... N);

with boundary conditions

(2k)u(0) …


Reservation For Other Backward Classes In Indian Central Government Institutions Like Iits, Iims And Aiims – A Study Of The Role Of Media Using Fuzzy Super Frm Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Kandasamy Jan 2009

Reservation For Other Backward Classes In Indian Central Government Institutions Like Iits, Iims And Aiims – A Study Of The Role Of Media Using Fuzzy Super Frm Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The new notions of super column FRM model, super row FRM model and mixed super FRM model are introduced in this book. These three models are introduced specially to analyze the biased role of the print media on 27 percent reservation for the Other Backward Classes (OBCs) in educational institutions run by the Indian Central Government. This book has four chapters. In chapter one the authors introduce the three types of super FRM models. Chapter two uses these three new super fuzzy models to study the role of media which feverishly argued against 27 percent reservation for OBCs in Central …


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

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 …


Do The Coefficients Of A Modular Form Really "Encode Arithmetic Data"?, Ken Mcmurdy, Hari Ravindran Nov 2008

Do The Coefficients Of A Modular Form Really "Encode Arithmetic Data"?, Ken Mcmurdy, Hari Ravindran

Mathematical Sciences Technical Reports (MSTR)

Language and terminology are so critical to the understanding of modern math- ematics that it is often difficult for even very good mathematicians from different fields to discuss their work in any detail. As a result, common phrases often evolve within each discipline which attempt to capture the avor of some impor- tant idea while avoiding technicality and jargon. For example, when algebraic number theorists are asked why they are so interested in modular forms, it has become common to say with enthusiasm that the coefficients of a modular form "encode arithmetic data". If pressed further, one might go on …


Octic 2-Adic Fields, John W. Jones, David P. Roberts Jun 2008

Octic 2-Adic Fields, John W. Jones, David P. Roberts

Mathematics Publications

We compute all octic extensions of Q2 and find that there are 1823 of them up to isomorphism. We compute the associated Galois group of each field, slopes measuring wild ramification, and other quantities. We present summarizing tables here with complete information available at our online database of local fields.


Rethinking Pythagorean Triples, William J. Spezeski Jun 2008

Rethinking Pythagorean Triples, William J. Spezeski

Applications and Applied Mathematics: An International Journal (AAM)

It has been known for some 2000 years how to generate Pythagorean Triples. While the classical formulas generate all of the primitive triples, they do not generate all of the triples. For example, the triple (9, 12, 15) can’t be generated from the formulas, but it can be produced by introducing a multiplier to the primitive triple (3, 4, 5). And while the classical formulas produce the triple (3, 4, 5), they don’t produce the triple (4, 3, 5); a transposition is needed. This paper explores a new set of formulas that, in fact, do produce all of the triples …


Signed Decomposition Of Fully Fuzzy Linear Systems, Tofigh Allahviranloo, Nasser Mikaeilvand, Narsis A. Kiani, Rasol M. Shabestari Jun 2008

Signed Decomposition Of Fully Fuzzy Linear Systems, Tofigh Allahviranloo, Nasser Mikaeilvand, Narsis A. Kiani, Rasol M. Shabestari

Applications and Applied Mathematics: An International Journal (AAM)

System of linear equations is applied for solving many problems in various areas of applied sciences. Fuzzy methods constitute an important mathematical and computational tool for modeling real-world systems with uncertainties of parameters. In this paper, we discuss about fully fuzzy linear systems in the form AX = b (FFLS). A novel method for finding the non-zero fuzzy solutions of these systems is proposed. We suppose that all elements of coefficient matrix A are positive and we employ parametric form linear system. Finally, Numerical examples are presented to illustrate this approach and its results are compared with other methods.


A Statistical Look At Maps Of The Discrete Logarithm, Nathan Lindle May 2008

A Statistical Look At Maps Of The Discrete Logarithm, Nathan Lindle

Mathematical Sciences Technical Reports (MSTR)

Cryptography is being used today more than it ever has in the past. Millions of transactions are being conducted every hour using encrypted channels, most of which use the Internet as their medium. It is taken for granted by the average user that these transaction are secure, but mathematicians and computer scientists alike are constantly testing the algorithms being used. Several of these cryptosystems use the transformation

gx = y (mod n)

The appeal of this transformation is that it is quite simple to calculate gx mod n; exponentiation by squaring is fairly simple and quick even using …


An Improved Multi-Set Algorithm For The Dense Subset Sum Problem, Andrew Shallue May 2008

An Improved Multi-Set Algorithm For The Dense Subset Sum Problem, Andrew Shallue

Scholarship

No abstract provided.


Number Fields Ramified At One Prime, John W. Jones, David P. Roberts Jan 2008

Number Fields Ramified At One Prime, John W. Jones, David P. Roberts

Mathematics Publications

For G a finite group and p a prime, a G-p field is a Galois number field K with Gal(K/Q)≅G and disc(K)=±pa for some a. We study the existence of G-p fields for fixed G and varying p.


Multiplicative Properties Of Integral Binary Quadratic Forms, A. G. Earnest, Robert W. Fitzgerald Jan 2008

Multiplicative Properties Of Integral Binary Quadratic Forms, A. G. Earnest, Robert W. Fitzgerald

Articles and Preprints

In this paper, the integral binary quadratic forms for which the set of represented values is closed under k-fold products, for even positive integers k, will be characterized. This property will be seen to distinguish the elements of odd order in the form class group of a fixed discriminant. Further, it will be shown that this closure under k-fold products can always be expressed by a k-linear mapping from (Z2)k to Z2. In the case k = 2, this resolves a conjecture of Aicardi and Timorin.


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

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 …


Some Identities Between Basic Hypergeometric Series Deriving From A New Bailey-Type Transformation, James Mclaughlin, Peter Zimmer Jan 2008

Some Identities Between Basic Hypergeometric Series Deriving From A New Bailey-Type Transformation, James Mclaughlin, Peter Zimmer

Mathematics Faculty Publications

We prove a new Bailey-type transformation relating WPBailey pairs. We then use this transformation to derive a number of new 3- and 4-term transformation formulae between basic hypergeometric series.


Some New Families Of Tasoevian- And Hurwitzian Continued Fractions, James Mclaughlin Jan 2008

Some New Families Of Tasoevian- And Hurwitzian Continued Fractions, James Mclaughlin

Mathematics Faculty Publications

We derive closed-form expressions for several new classes of Hurwitzian- and Tasoevian continued fractions, including [0; p − 1, 1, u(a + 2nb) − 1, p − 1, 1, v(a + (2n + 1)b) − 1 ]∞ n=0, [0; c + dmn] ∞n=1 and [0; eun, fvn] ∞n=1. One of the constructions used to produce some of these continued fractions can be iterated to produce both Hurwitzian- and Tasoevian continued fractions of arbitrary long quasi-period, with arbitrarily many free parameters and whose limits can be determined as ratios of certain infinite series. We also derive expressions for arbitrarily long finite …


Chinese Neutrosophy And Taoist Natural Philosophy, Florentin Smarandache, Jiang Zhengjie Jan 2008

Chinese Neutrosophy And Taoist Natural Philosophy, Florentin Smarandache, Jiang Zhengjie

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.


Special Classes Of Set Codes And Their Applications, Florentin Smarandache, W.B. Vasantha Kandasamy Jan 2008

Special Classes Of Set Codes And Their Applications, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors introduce the notion of set codes, set bicodes and set n-codes. These are the most generalized notions of semigroup n-codes and group n-codes. Several types of set ncodes are defined. Several examples are given to enable the reader to understand the concept. These new classes of codes will find applications in cryptography, computer networking (where fragmenting of codes is to be carried out) and data storage (where confidentiality is to be maintained). We also describe the error detection and error correction of these codes. The authors feel that these codes would be appropriate to the …


The Probability Of Relatively Prime Polynomials, Arthur T. Benjamin, Curtis D. Bennet Jun 2007

The Probability Of Relatively Prime Polynomials, Arthur T. Benjamin, Curtis D. Bennet

All HMC Faculty Publications and Research

No abstract provided in this article.


Galois Number Fields With Small Root Discriminant, John W. Jones, David P. Roberts Feb 2007

Galois Number Fields With Small Root Discriminant, John W. Jones, David P. Roberts

Mathematics Publications

We pose the problem of identifying the set K(G,Ω) of Galois number fields with given Galois group G and root discriminant less than the Serre constant Ω ≈ 44.7632. We definitively treat the cases G = A4. A5, A6, and S4, S5, S6, finding exactly 59, 78, 5 and 527, 192, 13 fields, respectively. We present other fields with Galois groups SL3(2), A7, S7, PGL2(7), SL2(8), ΣL2(8), PGL2(9), PSL2(11), and …


Wild Partitions And Number Theory, David P. Roberts Jan 2007

Wild Partitions And Number Theory, David P. Roberts

Mathematics Publications

We introduce the notion of wild partition to describe in combinatorial language an important situation in the theory of p-adic fields. For Q a power of p, we get a sequence of numbers λQ,n counting the number of certain wild partitions of n. We give an explicit formula for the corresponding generating function ΛQ(x) = ΣλQ,nxn and use it to show that λ1/n Q,n tends to Q1/(p-1). We apply this asymptotic result to support a finiteness conjecture about number fields. Our finiteness conjecture …


Some Observations On Khovanskii's Matrix Methods For Extracting Roots Of Polynomials, James Mclaughlin, B. Sury Jan 2007

Some Observations On Khovanskii's Matrix Methods For Extracting Roots Of Polynomials, James Mclaughlin, B. Sury

Mathematics Faculty Publications

In this article we apply a formula for the n-th power of a 3×3 matrix (found previously by the authors) to investigate a procedure of Khovanskii’s for finding the cube root of a positive integer. We show, for each positive integer α, how to construct certain families of integer sequences such that a certain rational expression, involving the ratio of successive terms in each family, tends to α 1/3 . We also show how to choose the optimal value of a free parameter to get maximum speed of convergence. We apply a similar method, also due to Khovanskii, to a …


Symmetry And Specializability In The Continued Fraction Expansions Of Some Infinite Products, James Mclaughlin Jan 2007

Symmetry And Specializability In The Continued Fraction Expansions Of Some Infinite Products, James Mclaughlin

Mathematics Faculty Publications

Let f(x) ∈ Z[x]. Set f0(x) = x and, for n ≥ 1, define fn(x) = f(fn−1(x)). We describe several infinite families of polynomials for which the infinite product Y∞ n=0 ( 1 + 1 fn(x) ) has a specializable continued fraction expansion of the form S∞ = [1; a1(x), a2(x), a3(x), . . . ], where ai(x) ∈ Z[x] for i ≥ 1. When the infinite product and the continued fraction are specialized by letting x take integral values, we get infinite classes of real numbers whose regular continued fraction expansion is predictable. We also show that, under some …


Some Properties Of The Distribution Of The Numbers Of Points On Elliptic Curves Over A Finite Prime Field, Saiying He, James Mclaughlin Jan 2007

Some Properties Of The Distribution Of The Numbers Of Points On Elliptic Curves Over A Finite Prime Field, Saiying He, James Mclaughlin

Mathematics Faculty Publications

Let p ≥ 5 be a prime and for a, b ∈ Fp, let Ea,b denote the elliptic curve over Fp with equation y 2 = x 3 + a x + b. As usual define the trace of Frobenius ap, a, b by #Ea,b(Fp) = p + 1 − ap, a, b. We use elementary facts about exponential sums and known results about binary quadratic forms over finite fields to evaluate the sums P t∈Fp ap, t, b, P t∈Fp ap, a, t, Pp−1 t=0 a 2 p, t, b, Pp−1 t=0 a 2 p, a, t and Pp−1 …


Some More Long Continued Fractions, I, James Mclaughlin, Peter Zimmer Jan 2007

Some More Long Continued Fractions, I, James Mclaughlin, Peter Zimmer

Mathematics Faculty Publications

In this paper we show how to construct several infinite families of polynomials D(¯x, k), such that p D(¯x, k) has a regular continued fraction expansion with arbitrarily long period, the length of this period being controlled by the positive integer parameter k. We also describe how to quickly compute the fundamental units in the corresponding real quadratic fields.


Continued Fractions With Multiple Limits, Douglas Bowman, James Mclaughlin Jan 2007

Continued Fractions With Multiple Limits, Douglas Bowman, James Mclaughlin

Mathematics Faculty Publications

For integers m ≥ 2, we study divergent continued fractions whose numerators and denominators in each of the m arithmetic progressions modulo m converge. Special cases give, among other things, an infinite sequence of divergence theorems, the first of which is the classical Stern-Stolz theorem. We give a theorem on a class of Poincar´e type recurrences which shows that they tend to limits when the limits are taken in residue classes and the roots of their characteristic polynomials are distinct roots of unity. We also generalize a curious q-continued fraction of Ramanujan’s with three limits to a continued fraction with …


Ramanujan And Extensions And Contractions Of Continued Fractions, James Mclaughlin, Nancy Wyshinski Jan 2007

Ramanujan And Extensions And Contractions Of Continued Fractions, James Mclaughlin, Nancy Wyshinski

Mathematics Faculty Publications

If a continued fraction K∞n=1an/bn is known to converge but its limit is not easy to determine, it may be easier to use an extension of K∞n=1an/bn to find the limit. By an extension of K∞n=1an/bn we mean a continued fraction K∞n=1cn/dn whose odd or even part is K∞n=1an/bn. One can then possibly find the limit in one of three ways: (i) Prove the extension converges and find its limit; (ii) Prove the extension converges and find the limit of the other contraction (for example, the odd part, if K∞n=1an/bn is the even part); (ii) Find the limit of the …


Two Number-Theoretic Problems That Illustrate The Power And Limitations Of Randomness, Andrew Shallue Jan 2007

Two Number-Theoretic Problems That Illustrate The Power And Limitations Of Randomness, Andrew Shallue

Scholarship

This thesis contains work on two problems in algorithmic number theory. The first problem is to give an algorithm that constructs a rational point on an elliptic curve over a finite field. A fast and easy randomized algorithm has existed for some time. We prove that in the case where the finite field has characteristic 2, there is a deterministic algorithm with the same asymptotic running time as the existing randomized algorithm.


Neutrality And Many-Valued Logics, Florentin Smarandache, Andrew Schumann Jan 2007

Neutrality And Many-Valued Logics, Florentin Smarandache, Andrew Schumann

Branch Mathematics and Statistics Faculty and Staff Publications

ThisbookwrittenbyA. Schumann &F. Smarandache isdevotedtoadvances of non-Archimedean multiple-validity idea and its applications to logical reasoning. Leibnitz was the first who proposed Archimedes’ axiom to be rejected. He postulated infinitesimals (infinitely small numbers) of the unit interval [0,1] which are larger than zero, but smaller than each positive real number. Robinson applied this idea into modern mathematics in [117] and developed so-called non-standard analysis. In the framework of non-standard analysis there were obtained many interesting results examined in [37], [38], [74], [117].

There exists also a different version of mathematical analysis in that Archimedes’ axiom is rejected, namely, p-adic analysis (e.g., …


Auxiliary Information And A Priori Values In Construction Of Improved Estimators, Florentin Smarandache, Rajesh Singh, Pankaj Chauhan, Nirmala Sawan Jan 2007

Auxiliary Information And A Priori Values In Construction Of Improved Estimators, Florentin Smarandache, Rajesh Singh, Pankaj Chauhan, Nirmala Sawan

Branch Mathematics and Statistics Faculty and Staff Publications

This volume is a collection of six papers on the use of auxiliary information and a priori values in construction of improved estimators. The work included here will be of immense application for researchers and students who employ auxiliary information in any form. Below we discuss each paper: 1. Ratio estimators in simple random sampling using information on auxiliary attribute. Prior knowledge about population mean along with coefficient of variation of the population of an auxiliary variable is known to be very useful particularly when the ratio, product and regression estimators are used for estimation of population mean of a …


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

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 8Fn − 4 when n is odd and is 8Fn − 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.


Bass Series For Small Witt Rings, Robert W. Fitzgerald Jan 2006

Bass Series For Small Witt Rings, Robert W. Fitzgerald

Articles and Preprints

No abstract provided.