Digital Commons Network^™

Accelerating Computational Algorithms, Michael Risley

Theses and Dissertations

Mathematicians and computational scientists are often limited in their ability to model complex phenomena by the time it takes to run simulations. This thesis will inform interested researchers on how the development of highly parallel computer graphics hardware and the compiler frameworks to exploit it are expanding the range of algorithms that can be explored on affordable commodity hardware. We will discuss the complexities that have prevented researchers from exploiting advanced hardware as well as the obstacles that remain for the non-computer scientist.

Analysis Of Mathematical Models Of The Human Lung, Cooper Racheal

Theses and Dissertations

The processes of lung ventilation and perfusion, diffusion, and gas transport make up the system of breathing and tissue oxygenation. Here, we present several mathematical formulations of the essential processes that contribute to breathing. These models aid in our understanding and analysis of this complex system and can be used to form treatments for patients on ventilators. With the right analysis and treatment options, patients can be helped and money can be saved. We conclude with the formulation of a mathematical model for the exchange of gasses in the body based on basic reaction kinetics.

Comparing Two Different Student Teaching Structures By Analyzing Conversations Between Student Teachers And Their Cooperating Teachers, Niccole Suzette Franc

Theses and Dissertations

Research has shown that preservice teachers participating in traditional student teaching programs tend to focus on classroom management, with very little focus on student mathematical thinking. The student teaching program at BYU has been redesigned in the hopes of shifting the focus of student teachers away from classroom management toward student mathematical thinking. This study compared conversations between student teachers and cooperating teachers before and after the redesign of the program to work towards determining the effectiveness of the refocusing of the new student teaching program. The study found that STs and CTs in the different student teaching structures were …

Standards Based Education In Egypt And Singapore, Dara Akeal El Masri

Theses and Dissertations

Mathematics education is important for all members of modern societies. In Egypt, the importance of mathematics education needs greater emphasis because of its role in providing job opportunities and helping to understand and build new economies, as well as, reducing the gap between Egypt and other developing countries. In order to know the aspects that need improvement in the Egyptian mathematics educational system, this study analyzed both the national Egyptian and the national Singaporean eighth grade mathematics educational system; mainly the standards, curricula, and textbooks. The analysis of the standards was done by comparing them to the characteristics of high …

Selected Research In Covering Systems Of The Integers And The Factorization Of Polynomials, Joshua Harrington

Theses and Dissertations

In 1960, Sierpi\'{n}ski proved that there exist infinitely many odd positive integers $k$ such that $k\cdot 2^n+1$ is composite for all positive integers $n$. Such integers are known as Sierpi\'{n}ski numbers. Letting $f(x)=ax^r+bx+c\in\mathbb{Z}[x]$, Chapter 2 of this document explores the existence of integers $k$ such that $f(k)2^n+d$ is composite for all positive integers $n$. Chapter 3 then looks into a polynomial variation of a similar question. In particular, Chapter~\ref{CH:FH} addresses the question, for what integers $d$ does there exist a polynomial $f(x)\in\mathbb{Z}[x]$ with $f(1)\neq -d$ such that $f(x)x^n+d$ is reducible for all positive integers $n$. The last two chapters of …

Sharp Bounds Associated With An Irreducibility Theorem For Polynomials Having Non-Negative Coefficients, Morgan Cole

Theses and Dissertations

Consider a polynomial f(x) having non-negative integer coefficients with f(b) prime for some integer b greater than or equal to 2. We will investigate the size of the coefficients of the polynomial and establish a largest such bound on the coefficients that would imply that f(x) is irreducible. A result of Filaseta and Gross has established sharp bounds on the coefficients of such a polynomial in the case that b = 10. We will expand these results for b in {8, 9, ..., 20}.

Coloring Pythagorean Triples And A Problem Concerning Cyclotomic Polynomials, Daniel White

Theses and Dissertations

One may easily show that there exist $O( \log n)$-colorings of $\{1,2, \ldots, n\}$ such that no Pythagorean triple with elements $\le n$ is monochromatic. In Chapter~\ref{CH:triples}, we investigate two analogous ideas. First, we find an asymptotic bound for the number of colors required to color $\{1,2,\ldots ,n\}$ so that every Pythagorean triple with elements $\le n$ is $3$-colored. Afterwards, we examine the case where we allow a vanishing proportion of Pythagorean triples with elements $\le n$ to fail to have this property.

Unrelated, in 1908, Schur raised the question of the irreducibility over $\Q$ of polynomials of the form …