Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
Articles 1 - 8 of 8
Full-Text Articles in Entire DC Network
Elliptic Functions And Iterative Algorithms For Π, Eduardo Jose Evans
Elliptic Functions And Iterative Algorithms For Π, Eduardo Jose Evans
UNF Graduate Theses and Dissertations
Preliminary identities in the theory of basic hypergeometric series, or `q-series', are proven. These include q-analogues of the exponential function, which lead to a fairly simple proof of Jacobi's celebrated triple product identity due to Andrews. The Dedekind eta function is introduced and a few identities of it derived. Euler's pentagonal number theorem is shown as a special case of Ramanujan's theta function and Watson's quintuple product identity is proved in a manner given by Carlitz and Subbarao. The Jacobian theta functions are introduced as special kinds of basic hypergeometric series and various relations between them derived using the triple …
Sum Of Cubes Of The First N Integers, Obiamaka L. Agu
Sum Of Cubes Of The First N Integers, Obiamaka L. Agu
Electronic Theses, Projects, and Dissertations
In Calculus we learned that Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. …
On The Mersenne Prime Numbers, Julia Vanlandingham
On The Mersenne Prime Numbers, Julia Vanlandingham
Undergraduate Honors Thesis Projects
The prime numbers have been an important field of research for thousands of years and are intertwined with most other fields of mathematics. One topic that has piqued the interest of mathematicians young and old is the Mersenne prime numbers, which have applications in many mathematics and computer science fields. The Mersenne primes get a lot of attention because there is not much known about them. However, we do have a very simple primality test for Mersenne numbers, which is why the largest currently known primes are Mersenne primes. These primes are also very closely related to another class of …
The Rsa Cryptosystem, Rodrigo Iglesias
The Rsa Cryptosystem, Rodrigo Iglesias
Williams Honors College, Honors Research Projects
This paper intends to present an overview of the RSA cryptosystem. Cryptosystems are mathematical algorithms that disguise information so that only the people for whom the information is intended can read it. The invention of the RSA cryptosystem in 1977 was a significant event in the history of cryptosystems. We will describe in detail how the RSA cryptosystem works and then illustrate the process with a realistic example using fictional characters. In addition, we will discuss how cryptosystems worked prior to the invention of RSA and the advantage of using RSA over any of the previous cryptosystems. This will help …
An Algorithm To Determine All Odd Primitive Abundant Numbers With D Prime Divisors, Jacob Liddy
An Algorithm To Determine All Odd Primitive Abundant Numbers With D Prime Divisors, Jacob Liddy
Williams Honors College, Honors Research Projects
An abundant number is said to be primitive if none of its proper divisors are abundant. Dickson proved that for an arbitrary positive integer d there exists only finitely many odd primitive abundant numbers having exactly d prime divisors. In this paper we describe a fast algorithm that finds all primitive odd numbers with d unique prime divisors. We use this algorithm to find all the number of odd primitive abundant numbers with 6 unique Divisors. We use this algorithm to prove that an odd weird number must have at least 6 prime divisors.
A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero
A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero
Undergraduate Honors Thesis Collection
This thesis displays a sample distribution, generated from both a simulation (for large n) by computer program and explicitly calculated (for smaller n), that is not governed by the Central Limit Theorem and, in fact seems to display chaotic behavior. To our knowledge, the explicit calculation of the sample distribution function is new. This project outlines the results that have found a relation to number theory in a probabilistic game that has perplexed mathematicians for hundreds of years.
Factoring The Duplication Map On Elliptic Curves For Use In Rank Computations, Tracy Layden
Factoring The Duplication Map On Elliptic Curves For Use In Rank Computations, Tracy Layden
Scripps Senior Theses
This thesis examines the rank of elliptic curves. We first examine the correspondences between projective space and affine space, and use the projective point at infinity to establish the group law on elliptic curves. We prove a section of Mordell’s Theorem to establish that the abelian group of rational points on an elliptic curve is finitely generated. We then use homomorphisms established in our proof to find a formula for the rank, and then provide examples of computations.
Leonhard Euler's Contribution To Infinite Polynomials, Jack Dean Meekins
Leonhard Euler's Contribution To Infinite Polynomials, Jack Dean Meekins
Theses Digitization Project
This thesis will focus on Euler's famous method for solving the infinite polynomial. It will show how he manipulated the sine function to find all possible points along the sine function such that the sine A would equal to y; these would be roots of the polynomial. It also shows how Euler set the infinite polynomial equal to the infinite product allowing him to determine which coefficients were equal to which reciprocals of the roots, roots squared, roots cubed, etc.