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

Physical Sciences and Mathematics Commons

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

Articles 1 - 26 of 26

Full-Text Articles in Physical Sciences and Mathematics

Elliptic Functions And Iterative Algorithms For Π, Eduardo Jose Evans Jan 2023

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 …


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

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 …


Computational Thinking In Mathematics And Computer Science: What Programming Does To Your Head, Al Cuoco, E. Paul Goldenberg Jan 2021

Computational Thinking In Mathematics And Computer Science: What Programming Does To Your Head, Al Cuoco, E. Paul Goldenberg

Journal of Humanistic Mathematics

How you think about a phenomenon certainly influences how you create a program to model it. The main point of this essay is that the influence goes both ways: creating programs influences how you think. The programs we are talking about are not just the ones we write for a computer. Programs can be implemented on a computer or with physical devices or in your mind. The implementation can bring your ideas to life. Often, though, the implementation and the ideas develop in tandem, each acting as a mirror on the other. We describe an example of how programming and …


Sum Of Cubes Of The First N Integers, Obiamaka L. Agu Dec 2020

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 Apr 2020

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 …


On Rugina’S System Of Thought, Florentin Smarandache Apr 2018

On Rugina’S System Of Thought, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

This article investigates Rugina's orientation table and gives particular examples for several of its seven models. Leon Walras's Economics of Stable Equilibrium and Keynes's Economics of Disequilibrium are combined in Rugina's orientation table in systems which are s percent stable and 100 ÿ s percent unstable, where s may be 100, 95, 65, 50, 35, 5, and 0. Classical logic and modern logic are united in Rugina's integrated logic, and then generalized in neutrosophic logic.


The Rsa Cryptosystem, Rodrigo Iglesias Jan 2018

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 Jan 2018

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.


Mathematics. Possible Subjects For The High School Entrance Examination And The Capacity Examination In Romania, Florentin Smarandache, Constantin Coanda, Ionuț Ivanescu Jan 2016

Mathematics. Possible Subjects For The High School Entrance Examination And The Capacity Examination In Romania, Florentin Smarandache, Constantin Coanda, Ionuț Ivanescu

Branch Mathematics and Statistics Faculty and Staff Publications

The present book tries to offer students and teachers knowledge evaluation tools for all the chapters from the current Romanian mathematics syllabus. In the evolution of teenagers, the phase of admission in high schools mobilizes particular efforts and emotions. The present workbook aims to be a permanent advisor in the agitated period starting with the capacity examination and leading to the admittance to high school. The tests included in this workbook have a complementary character as opposed to the many materials written with the purpose to support all those who prepare for such examinations and they refer to the entire …


A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero Jan 2016

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.


Integral Generalized Binomial Coefficients Of Multiplicative Functions, Imanuel Chen Jan 2015

Integral Generalized Binomial Coefficients Of Multiplicative Functions, Imanuel Chen

Summer Research

The binomial coefficients are interestingly always integral. However, when you generalize the binomial coefficients to any class of function, this is not always the case. Multiplicative functions satisfy the properties: f(ab) = f(a)f(b) when a and b are relatively prime, and f(1) = 1. Tom Edgar of Pacific Lutheran University and Michael Spivey of the University of Puget Sound developed a Corollary that determines which values of n and m will always have integral generalized binomial coefficients for all multiplicative functions. The purpose of this research was to determine as many patterns within this corollary as possible as well as …


On Crittenden And Vanden Eynden's Conjecture, Florentin Smarandache Jan 2014

On Crittenden And Vanden Eynden's Conjecture, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

It is possible to cover all (positive) integers with n geometrical progressions of integers? Find a necessary and sufficient condition for a general class of positive integer sequences such that, for a fixed n , there are n (distinct) sequences of this class which cover all integers.


The Kronecker-Weber Theorem: An Exposition, Amber Verser Nov 2013

The Kronecker-Weber Theorem: An Exposition, Amber Verser

Lawrence University Honors Projects

This paper is an investigation of the mathematics necessary to understand the Kronecker-Weber Theorem. Following an article by Greenberg, published in The American Mathematical Monthly in 1974, the presented proof does not use class field theory, as the most traditional treatments of the theorem do, but rather returns to more basic mathematics, like the original proofs of the theorem. This paper seeks to present the necessary mathematical background to understand the proof for a reader with a solid undergraduate background in abstract algebra. Its goal is to make what is usually an advanced topic in the study of algebraic number …


Factoring The Duplication Map On Elliptic Curves For Use In Rank Computations, Tracy Layden Jan 2013

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.


Circular Units Of Function Fields, Frederick Harrop Apr 2012

Circular Units Of Function Fields, Frederick Harrop

Frederick F Harrop

A unit index-class number formula is proved for subfields of cyclotomic function fields in analogy with similar results for subfields of cyclotomic number fields.


Prove It!, Kenny W. Moran Jan 2012

Prove It!, Kenny W. Moran

Journal of Humanistic Mathematics

A dialogue between a mathematics professor, Frank, and his daughter, Sarah, a mathematical savant with a powerful mathematical intuition. Sarah's intuition allows her to stumble into some famous theorems from number theory, but her lack of academic mathematical background makes it difficult for her to understand Frank's insistence on the value of proof and formality.


Leonhard Euler's Contribution To Infinite Polynomials, Jack Dean Meekins Jan 2012

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.


Problems With And Without … Problems!, Florentin Smarandache Jan 2011

Problems With And Without … Problems!, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

This book is addressed to College honor students, researchers, and professors. It contains 136 original problems published by the author in various scientific journals around the world. The problems could be used to preparing for courses, exams, and Olympiads in mathematics. Many of these have a generalized form. For each problem we provide a detailed solution.

I was a professeur coopérant between 1982-1984, teaching mathematics in French language at Lycée Sidi EL Hassan Lyoussi in Sefrou, Province de Fès, Morocco. I used many of these problems for selecting and training, together with other Moroccan professors, in Rabat city, of the …


The Fibonacci Sequence, Arik Avagyan Jan 2010

The Fibonacci Sequence, Arik Avagyan

A with Honors Projects

A review was made of the Fibonacci sequence, its characteristics and applications.


A Unifying Field In Logics: Neutrosophic Logic Neutrosophy, Neutrosophic Set, Neutrosophic Probability (In Traditional Chinese), Florentin Smarandache, Feng Liu Jan 2003

A Unifying Field In Logics: Neutrosophic Logic Neutrosophy, Neutrosophic Set, Neutrosophic Probability (In Traditional Chinese), Florentin Smarandache, Feng Liu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.


Proceedings Of The First International Conference On Neutrosophy, Neutrosophic Logic, Neutrosophic Set, Neutrosophic Probability And Statistics, Florentin Smarandache Jan 2002

Proceedings Of The First International Conference On Neutrosophy, Neutrosophic Logic, Neutrosophic Set, Neutrosophic Probability And Statistics, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In 1960s Abraham Robinson has developed the non-standard analysis, a formalization of analysis and a branch of mathematical logic, that rigorously defines the infinitesimals. Informally, an infinitesimal is an infinitely small number. Formally, x is said to be infinitesimal if and only if for all positive integers n one has xxx < 1/n. Let &>0 be a such infinitesimal number. The hyper-real number set is an extension of the real number set, which includes classes of infinite numbers and classes of infinitesimal numbers. Let’s consider the non-standard finite numbers 1+ = 1+&, where “1” is its standard part and “&” its non-standard part, …


Algebra În Exercijii Şi Probleme Pentru Liceu, Florentin Smarandache, Ion Goian, Raisa Grigor, Vasila Marin Jan 2000

Algebra În Exercijii Şi Probleme Pentru Liceu, Florentin Smarandache, Ion Goian, Raisa Grigor, Vasila Marin

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.


Asupra Unor Noi Functii În Teoria Numerelor, Florentin Smarandache Jan 1999

Asupra Unor Noi Functii În Teoria Numerelor, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Performantele matematicii actuale,ca si descoperirile din viitor isi au,desigur, inceputul in cea mai veche si mai aproape de filozofie ramura a matematicii, in teoria numerelor. Matematicienii din toate timpurile au fost, sunt si vor fi atrasi de frumusetea si varietatea problemelor specifice acestei ramuri a matematicii. Regina a matematicii, care la randul ei este regina a stiintelor, dupa cum spunea Gauss, teoria numerelor straluceste cu lumina si atractiile ei, fascinandu-ne si usurandu-ne drumul cunoasterii legitatilor ce guverneaza macrocosmosul si microcosmosul. De la etapa antichitatii, cand teoria numerelor era cuprinsa in aritmetica, la etapa aritmeticii superioare din perioada Renasterii, cand teoria …


Metode De Calcul În Analiza Matematică, Florentin Smarandache, C. Dumitrescu Jan 1995

Metode De Calcul În Analiza Matematică, Florentin Smarandache, C. Dumitrescu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.


Only Problems, Not Solutions! (Fourth Edition), Florentin Smarandache Jan 1993

Only Problems, Not Solutions! (Fourth Edition), Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.


Problemes Avec Et, Sans Problemes!, Florentin Smarandache Jan 1983

Problemes Avec Et, Sans Problemes!, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.