Other Mathematics Commons^™

Primitive Pythagorean Triples In Lean And Reduction Modulo Odd Prime Powers, Luke Biddle

Mathematical Sciences Undergraduate Honors Theses

Primitive Pythagorean triples (PPTs) are (a,b,c) triples that satisfy the Pythagorean theorem and share no other common factors outside of 1. This project examines these PPTs reduction modulo odd prime powers by combining proof writing and number-theoretical analysis with the process of verification and formalization in the Lean proof coding language. Using the parameterization of PPTs generated by using the unit circle with additional conditions, we investigate how these triples behave modulo  for odd primes , with emphasis on counting the number of elements in the set of PPTs (a,b,c) modulo pⁿ . By using cases based on initial …

A Virtual Community Math Circle, Skona Brittain, Sayonita Ghosh Hajra, Steve Heller, Daniel Hodgins, Peter Petto, Gabriella Pinter, Lauren Rose, A. Gwinn Royal, Asmita Sodhi

Journal of Math Circles

The Julia Robinson Mathematics Festival (JRMF) Community Math Circle is free, volunteer-run, and online. We collaborate with JRMF and use their activities in our events. Started during the pandemic, the Community Math Circle continues to thrive. We have about 40 participants attending every month, typically kids aged 6 to 13, teachers, facilitators, and other adults. This article describes how our event is organized, planned, and executed, and how we train facilitators. We will also offer reflections on our successes and challenges.

Patterns Within The Collatz Conjecture, Kiel Harrison

SACAD: Scholarly Activities

The Collatz Conjecture, also known as 3n+1, one of the most famous unsolved problems in mathematics, has been forever out of reach of being truly solved. However, through the application of traces, there is now a new pathway forward to working out a potential solution. This study shows how this pathway was found, and what steps need to be taken to follow it.

Strong Neighborhood-Prime Labelings Under Ordinary & Gaussian Integers, Micheal Arnal-Brown

Murray State Theses and Dissertations

This thesis introduces and studies the notion of a strong neighborhood-prime labeling, a strengthening of the neighborhood-prime labeling where the label 1 can be assigned to any vertex in a graph. We prove that several graph families—including paths, cycles (excluding those congruent to 2 modulo 4), caterpillars, helm graphs, closed helm graphs, gear graphs, and graphs with universal vertices—admit such labelings, and also provide results to more general classes of graphs. We extend this new labeling concept to the Gaussian integers using a spiral order- ing on Z[i] and define a Gaussian analogue of strongly neighborhood-primeness. To support this extension, …

Limit Theorems For L-Functions In Analytic Number Theory, Asher Roberts

Dissertations, Theses, and Capstone Projects

We use the method of Radziwill and Soundararajan to prove Selberg’s central limit theorem for the real part of the logarithm of the Riemann zeta function on the critical line in the multivariate case. This gives an alternate proof of a result of Bourgade. An upshot of the method is to determine a rate of convergence in the sense of the Dudley distance. This is the same rate Selberg claims using the Kolmogorov distance. We also achieve the same rate of convergence in the case of Dirichlet L-functions. Assuming the Riemann hypothesis, we improve the rate of convergence by using …

Combinatorial Problems On The Integers: Colorings, Games, And Permutations, Collier Gaiser

Electronic Theses and Dissertations

This dissertation consists of several combinatorial problems on the integers. These problems fit inside the areas of extremal combinatorics and enumerative combinatorics.

We first study monochromatic solutions to equations when integers are colored with finitely many colors in Chapter 2. By looking at subsets of {1, 2, . . . , n} whose least common multiple is small, we improved a result of Brown and Rödl on the smallest integer n such that every 2-coloring of {1, 2, . . . , n} has a monochromatic solution to equations with unit fractions. Using a recent result of Boza, …

Rsa Algorithm, Evalisbeth Garcia Diazbarriga

ATU Scholars Symposium

I will be presenting about the RSA method in cryptology which is the coding and decoding of messages. My research will focus on proving that the method works and how it is used to communicate secretly.

Paley Graphs, Prime Graphs, And Crossword Puzzles, Robert D. Jacobs Jr.

Theses and Dissertations

In this paper, we will talk about many different mathematical concepts. We will prove theorems about Paley graphs, prime graphs, and crossword puzzles. It will be very fun.

The results in the section about Paley graphs include structure theorems about the subgraph induced by the quadratic residues, the subgraph induced by the non-residues and a few related subgraphs. The main is to better understand the “independence structure” of the Paley graph itself. No good upper bound on the independence number of Paley graphs is known. Theorems about these subgraphs, and various counts aim at future improvement of upper bounds for …

On The Spectrum Of Quaquaversal Operators, Josiah Sugarman

Dissertations, Theses, and Capstone Projects

In 1998 Charles Radin and John Conway introduced the Quaquaversal Tiling. A three dimensional hierarchical tiling with the property that the orientations of its tiles approach a uniform distribution faster than what is possible for hierarchical tilings in two dimensions. The distribution of orientations is controlled by the spectrum of a certain Hecke operator, which we refer to as the Quaquaversal Operator. For example, by showing that the largest eigenvalue has multiplicity equal to one, Charles Radin and John Conway showed that the orientations of this tiling approach a uniform distribution. In 2008, Bourgain and Gamburd showed that this operator …

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 …

A Comparison Of Cryptographic Methods, Christopher Gilmore

Senior Honors Theses

While elliptic curve cryptography and quantum cryptography are significantly different branches of cryptography, they provide a suitable reference point for comparison of the value of developing methods used in the present and investing in methods to be used in the future. Elliptic curve cryptography is quite common today, as it is generally secure and efficient. However, as the field of cryptography advances, the value of quantum cryptography’s inherent security from its basic properties should be considered, as a fully realized quantum cryptosystem has the potential to be quite powerful. Ultimately, it is of critical importance to determine the value of …

Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs

UNO Student Research and Creative Activity Fair

The University of Omaha math department's Problem of the Week was taken over in Fall 2019 from faculty by the authors. The structure: each semester (Fall and Spring), three problems are given per week for twelve weeks, with each problem worth ten points - mimicking the structure of arguably the most well-regarded university math competition around, the Putnam Competition, with prizes awarded to top-scorers at semester's end. The weekly competition was halted midway through Spring 2020 due to COVID-19, but relaunched again in Fall 2021, with massive changes.

Now there are three difficulty tiers to POW problems, roughly corresponding to …

An Integration Of Art And Mathematics, Henry Jaakola

Undergraduate Honors Theses

Mathematics and art are seemingly unrelated fields, requiring different skills and mindsets. Indeed, these disciplines may be difficult to understand for those not immersed in the field. Through art, math can be more relatable and understandable, and with math, art can be imbued with a different kind of order and structure. This project explores the intersection and integration of math and art, and culminates in a physical interdisciplinary product. Using the Padovan Sequence of numbers as a theoretical basis, two artworks are created with different media and designs, yielding unique results. Through these pieces, the order and beauty of number …

Elliptic Curves And Their Practical Applications, Henry H. Hayden Iv

Graduate Theses/Dissertations

Finding rational points that satisfy functions known as elliptic curves induces a finitely-generated abelian group. Such functions are powerful tools that were used to solve Fermat's Last Theorem and are used in cryptography to send private keys over public systems. Elliptic curves are also useful in factoring and determining primality.

Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang

Electronic Theses and Dissertations

While the "path integral" formulation of quantum mechanics is both highly intuitive and far reaching, the path integrals themselves often fail to converge in the usual sense. Richard Feynman developed regularization as a solution, such that regularized path integrals could be calculated and analyzed within a strictly physics context. Over the past 50 years, mathematicians and physicists have retroactively introduced schemes for achieving mathematical rigor in the study and application of regularized path integrals. One such scheme was introduced in 2007 by the mathematicians Klaus Kirsten and Paul Loya. In this thesis, we reproduce the Kirsten and Loya approach to …

Theory And Application Of Hypersoft Set, Florentin Smarandache, Muhammad Saeed, Muhammad Saqlain, Mohamed Abdel-Baset

Branch Mathematics and Statistics Faculty and Staff Publications

Aims and Scope Florentin Smarandache generalize the soft set to the hypersoft set by transforming the function �� into a multi-argument function. This extension reveals that the hypersoft set with neutrosophic, intuitionistic, and fuzzy set theory will be very helpful to construct a connection between alternatives and attributes. Also, the hypersoft set will reduce the complexity of the case study. The Book “Theory and Application of Hypersoft Set” focuses on theories, methods, algorithms for decision making and also applications involving neutrosophic, intuitionistic, and fuzzy information. Our goal is to develop a strong relationship with the MCDM solving techniques and to …

Mathematical Magic: A Study Of Number Puzzles, Nicasio M. Velez

Rose-Hulman Undergraduate Mathematics Journal

Within this paper, we will briefly review the history of a collection of number puzzles which take the shape of squares, polygons, and polyhedra in both modular and nonmodular arithmetic. Among other results, we develop construction techniques for solutions of both Modulo and regular Magic Squares. For other polygons in nonmodular arithmetic, specifically of order 3, we present a proof of why there are only four Magic Triangles using linear algebra, disprove the existence of the Magic Tetrahedron in two ways, and utilizing the infamous 3-SUM combinatorics problem we disprove the existence of the Magic Octahedron.

Solving Neutrosophic Linear Equations Systems Using Symbolic Computation (Resolucion De Sistemas De Ecuaciones Lineales Neutrosóficas Mediante Computación Simbólica), Maykel Leyva-Vazquez, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we apply the concept of neutrosophic numbers to solve a systems of neutrophic linear equations using symbolic computation. Also, we utilize Jupyter, which is supported in Google Colaboratory for performing symbolic computation. The sympy library of Python is used to perform the process of neutrosophic computation. Systems of neutrosophic linear equations are solved through symbolic computation in Python. A case study was developed for the determination of vehicular traffic with indeterminacy. This king of computation opens new ways to deal with indeterminacy in real-world problems.

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

The Name Tag Problem, Christian Carley

Rose-Hulman Undergraduate Mathematics Journal

The Name Tag Problem is a thought experiment that, when formalized, serves as an introduction to the concept of an orthomorphism of $\Zn$. Orthomorphisms are a type of group permutation and their graphs are used to construct mutually orthogonal Latin squares, affine planes and other objects. This paper walks through the formalization of the Name Tag Problem and its linear solutions, which center around modular arithmetic. The characterization of which linear mappings give rise to these solutions developed in this paper can be used to calculate the exact number of linear orthomorphisms for any additive group Z/nZ, which is demonstrated …

Decision Making On Teachers’ Adaptation To Cybergogy In Saturated Interval- Valued Refined Neutrosophic Overset /Underset /Offset Environment, Florentin Smarandache, Nivetha Martin, Priya R.

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic overset, neutrosophic underset and neutrosophic offset introduced by Smarandache are the special kinds of neutrosophic sets with values beyond the range [0,1] and these sets are pragmatic in nature as it represents the real life situations. This paper introduces the concept of saturated refined neutrosophic sets and extends the same to the special kinds of neutrosophic sets. The proposed concept is applied in decision making on Teacher’s adaptation to cybergogy. The decision making environment is characterized by different types of teachers, online teaching skills and various training methods. Fuzzy relation is used to match the most suitable method to …

Numerical Computations Of Vortex Formation Length In Flow Past An Elliptical Cylinder, Matthew Karlson, Bogdan Nita, Ashwin Vaidya

Department of Mathematics Faculty Scholarship and Creative Works

We examine two dimensional properties of vortex shedding past elliptical cylinders through numerical simulations. Specifically, we investigate the vortex formation length in the Reynolds number regime 10 to 100 for elliptical bodies of aspect ratio in the range 0.4 to 1.4. Our computations reveal that in the steady flow regime, the change in the vortex length follows a linear profile with respect to the Reynolds number, while in the unsteady regime, the time averaged vortex length decreases in an exponential manner with increasing Reynolds number. The transition in profile is used to identify the critical Reynolds number which marks the …

Codes, Cryptography, And The Mceliece Cryptosystem, Bethany Matsick

Senior Honors Theses

Over the past several decades, technology has continued to develop at an incredible rate, and the importance of properly securing information has increased significantly. While a variety of encryption schemes currently exist for this purpose, a number of them rely on problems, such as integer factorization, that are not resistant to quantum algorithms. With the reality of quantum computers approaching, it is critical that a quantum-resistant method of protecting information is found. After developing the proper background, we evaluate the potential of the McEliece cryptosystem for use in the post-quantum era by examining families of algebraic geometry codes that allow …

Complex Powers Of I Satisfying The Continued Fraction Functional Equation Over The Gaussian Integers, Matthew Niemiro '20

Exemplary Student Work

We investigate and then state the conditions under which i^z satisfies the simple continued fraction functional equation for real and then complex z over the Gaussian integers.

Inquiry In Inquiry: A Classification Of The Learning Theories Underlying Inquiry-Based Undergraduate Number Theory Texts, Rebecca L. Butler

Honors Projects

While undergraduate inquiry-based texts in number theory share similar approaches with respect to learning as the embodiment of professional practice, this does not entail that these texts all operate from the same fundamental understanding of what it means to learn mathematics. In this paper, the instructional design of several texts of the aforementioned types are analyzed to assess the theory of learning under which they operate. From this understanding of the different theories of learning employed in an inquiry-based mathematical setting, one can come to understand the popular model of what it is to learn number theory in a meaningful …

Extension Of Soft Set To Hypersoft Set, And Then To Plithogenic Hypersoft Set, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we generalize the soft set tothe hypersoft set by transforming the function F into a multi-attribute function. Then we introduce the hybrids of Crisp, Fuzzy, Intuitionistic Fuzzy, Neutrosophic, and Plithogenic Hypersoft Set.

Special Issue: New Types Of Neutrosophic Set/Logic/Probability, Neutrosophic Over-/Under-/ Off-Set, Neutrosophic Refined Set, And Their Extension To Plithogenic Set/Logic/ Probability, With Applications, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

A Short Remark On Gödel Incompleteness Theorem And Its Self-Referential Paradox From Neutrosophic Logic Perspective, Florentin Smarandache, Victor Christianto

Branch Mathematics and Statistics Faculty and Staff Publications

It is known from history of mathematics, that Gödel submitted his two incompleteness theorems, which can be considered as one of hallmarks of modern mathematics in 20th century. Here we argue that Gödel incompleteness theorem and its self-referential paradox have not only put Hilbert’s axiomatic program into question, but he also opened up the problem deep inside the then popular Aristotelian Logic. Although there were some attempts to go beyond Aristotelian binary logic, including by Lukasiewicz’s three-valued logic, here we argue that the problem of self-referential paradox can be seen as reconcilable and solvable from Neutrosophic Logic perspective. Motivation of …

Special Issue: Algebraic Structures Of Neutrosophic Triplets, Neutrosophic Duplets, Or Neutrosophic Multisets, Vol. Ii, Florentin Smarandache, Xiaohong Zhang, Mumtaz Ali

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Triangular Cubic Hesitant Fuzzy Einstein Hybrid Weighted Averaging Operator And Its Application To Decision Making, Florentin Smarandache, Aliya Fahmi, Fazli Amin, Madad Khan, Nasruddin Hassan

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, triangular cubic hesitant fuzzy Einstein weighted averaging (TCHFEWA) operator, triangular cubic hesitant fuzzy Einstein ordered weighted averaging (TCHFEOWA) operator and triangular cubic hesitant fuzzy Einstein hybrid weighted averaging (TCHFEHWA) operator are proposed. An approach to multiple attribute group decision making with linguistic information is developed based on the TCHFEWA and the TCHFEHWA operators. Furthermore, we establish various properties of these operators and derive the relationship between the proposed operators and the existing aggregation operators. Finally, a numerical example is provided to demonstrate the application of the established approach