Physical Sciences and Mathematics Commons^™

Approaches To The Erdős–Straus Conjecture, Ivan V. Morozov

Publications and Research

The Erdős–Straus conjecture, initially proposed in 1948 by Paul Erdős and Ernst G. Straus, asks whether the equation 4/n = 1/x + 1/y + 1/z is solvable for all n ∈ N and some x, y, z ∈ N. This problem touches on properties of Egyptian fractions, which had been used in ancient Egyptian mathematics. There exist many partial solutions, mainly in the form of arithmetic progressions and therefore residue classes. In this work we explore partial solutions and aim to expand them.

An Introduction To Number Theory, J. J. P. Veerman

PDXOpen: Open Educational Resources

These notes are intended for a graduate course in Number Theory. No prior familiarity with number theory is assumed.

Chapters 1-14 represent almost 3 trimesters of the course. Eventually we intend to publish a full year (3 trimesters) course on number theory. The current content represents courses the author taught in the academic years 2020-2021 and 2021-2022.

It is a work in progress. If you have questions or comments, please contact Peter Veerman (veerman@pdx.edu).

Arnold Transformations As Applied To Data Encryption, Haley N. Anderson

Electronic Theses and Dissertations

As our world becomes increasingly digital, data security becomes key. Data must be encrypted such that it can be easily encrypted only by the intended recipient. Arnold Transformations are a useful tool in this because of its unpredictable periodicity. Our goal is to outline a method for choosing an Arnold Transformation that is both secure and easy to implement. We find the necessary and sufficient condition that a key matrix has periodicity. The chosen key matrix has a random structure, and it has a periodicity that is sufficiently high. We apply this method to several image and data string examples …

Solve The Diophante`S Equations, Tulanboy T. Ibaydullayev, Alisher L. Abdulvohidov

Scientific Bulletin. Physical and Mathematical Research

This article is based on the lectures for gifted students of the faculty of Physics and Mathematics on the solution of Diophantine equations in science circles.

If the number of unknowns involved in a system of equations exceeds the number of equations, such equations are called Diophantine equations or indeterminate equations. Specifically, equations of the form

3x-5y=8, x²+3xy-y²=12,

x³+y²-3x+5=0, x³+y³=z³,… are indefinite equations.

Many of the equation or system of equations determine all the numbers to find solutions to the most common examples. Short multiplication formulas, …

Fibonacci And Lucas Numbers As Products Of Two Repdigits, Fati̇h Erduvan, Refi̇k Keski̇n

Turkish Journal of Mathematics

In this study, it is shown that the largest Fibonacci number that is the product of two repdigits is $F_{10}=55=5\cdot 11=55\cdot 1$ and the largest Lucas number that is the product of two repdigits is $L_{6}=18=2\cdot 9=3\cdot 6.$

Pythagorean Triples Containing Generalized Lucas Numbers, Zafer Şi̇ar, Refi̇k Keski̇n

Turkish Journal of Mathematics

Let $P$ and $Q$ be nonzero integers. Generalized Fibonacci and Lucas sequences are defined as follows: $U_{0}(P,Q)=0,U_{1}(P,Q)=1,$ and $ U_{n+1}(P,Q)=PU_{n}(P,Q)+QU_{n-1}(P,Q)$ for $n\geq 1$ and $ V_{0}(P,Q)=2,V_{1}(P,Q)=P,$ and $V_{n+1}(P,Q)=PV_{n}(P,Q)+QV_{n-1}(P,Q)$ for $n\geq 1,$ respectively. In this paper, we assume that $P$ and $Q$ are relatively prime odd positive integers and $P^{2}+4Q>0.$ We determine all indices $n$ such that $U_{n}=(P^{2}+4Q)x^{2}.$ Moreover, we determine all indices $n$ such that $(P^{2}+4Q)U_{n}=x^{2}.$ As a result, we show that the equation $V_{n}^{2}(P,1)+V_{n+1}^{2}(P,1)=x^{2}$ has solution only for $n=2,$ $P=1,$ $x=5$ and $V_{n+1}^{2}(P,-1)=V_{n}^{2}(P,-1)+x^{2}$ has no solutions. Moreover, we solve some Diophantine equations.

The Symbolic And Mathematical Influence Of Diophantus's Arithmetica, Cyrus Hettle

Journal of Humanistic Mathematics

Though it was written in Greek in a center of ancient Greek learning, Diophantus's Arithmetica is a curious synthesis of Greek, Egyptian, and Mesopotamian mathematics. It was not only one of the first purely number-theoretic and algebraic texts, but the first to use the blend of rhetorical and symbolic exposition known as syncopated mathematics. The text was influential in the development of Arabic algebra and European number theory and notation, and its development of the theory of indeterminate, or Diophantine, equations inspired modern work in both abstract algebra and computer science. We present, in this article, a selection of problems …

Special Representations, Nathanson's Lambda Sequences And Explicit Bounds, Satyanand Singh

Dissertations, Theses, and Capstone Projects

{Let $X$ be a group with identity $e$, we define $A$ as an infinite set of generators for $X$, and let $(X,d)$ be the metric space with word length $d_{A}$ induced by $A$. Nathanson showed that if $P$ is a nonempty finite set of prime numbers and $A$ is the set of positive integers whose prime factors all belong to $P$, then the metric space $({\bf{Z}},d_{A})$ has infinite diameter. Nathanson also studied the $\lambda_{A}(h)$ sequences, where $\lambda_{A}(h)$ is defined as the smallest positive integer $y$ with $d_{A}(e,y)=h$, and he posed the problem to compute $\lambda_{A}(h)$ and estimate its growth rate. …

Rational Linear Spaces On Hypersurfaces Over Quasi-Algebraically Closed Fields, Todd Cochrane, Craig V. Spencer, Hee-Sung Yang

Dartmouth Scholarship

Let k = F-q(t) be the rational function fi eld over F-q and f(x) is an element of k[x(1),..., x(s)] be a form of degree d. For l is an element of N, we establish that whenever s > l + Sigma(d)(w=1)w(2)(d - w + l - 1 l - 1), the projective hypersurface f(x) = 0 contains a k-rational linear space of projective dimension l. We also show that if s > 1 + d(d + 1)(2d + 1)/6, then for any k-rational zero a of f(x) there are in fi nitely many s-tuples (pi(1),...,pi(s) ) of monic irreducible polynomials over …

Solving Diophantine Equations, Florentin Smarandache, Octavian Cira

Branch Mathematics and Statistics Faculty and Staff Publications

In recent times, we witnessed an explosion of Number Theory problems that are solved using mathematical software and powerful computers. The observation that the number of transistors packed on integrated circuits doubles every two years made by Gordon E. Moore in 1965 is still accurate to this day. With ever increasing computing power more and more mathematical problems can be tacked using brute force. At the same time the advances in mathematical software made tools like Maple, Mathematica, Matlab or Mathcad widely available and easy to use for the vast majority of the mathematical research community. This tools don’t only …

Quotient Sets And Diophantine Equations, Stephan Ramon Garcia, Vincent Selhorst-Jones '09, Daniel E. Poore '11, Noah Simon '08

Pomona Faculty Publications and Research

Quotient sets U / U = {u / u¹: u, u¹ ϵ U} have been considered several times before in the MONTHLY. We consider more general quotient sets U / V and we apply our results to certain simultaneous Diophantine equations with side constraints.

Egyptian Fractions, Jodi Ann Hanley

Theses Digitization Project

Egyptian fractions are what we know as unit fractions that are of the form 1/n - with the exception, by the Egyptians, of 2/3. Egyptian fractions have actually played an important part in mathematics history with its primary roots in number theory. This paper will trace the history of Egyptian fractions by starting at the time of the Egyptians, working our way to Fibonacci, a geologist named Farey, continued fractions, Diophantine equations, and unsolved problems in number theory.

Simultaneous Rational Approximations And Related Diophantine Equations, John Rickert

Mathematical Sciences Technical Reports (MSTR)

In this paper we consider simultaneous approximations to algebraic numbers a₁,...,a_m .