Related papers: Computing Pythagorean Triples
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…
Given any positive integer $n$, it is well-known that there always exists a triangle with rational sides $a,b$ and $c$ such that the area of the triangle is $n$. For a given prime $p \not \equiv 1$ modulo $8$ such that $p^{2}+1=2q$ for a…
Let $\Delta=\Delta(a,b,c)$ be a hyperbolic triangle group, a Fuchsian group obtained from reflections in the sides of a triangle with angles $\pi/a,\pi/b,\pi/c$ drawn on the hyperbolic plane. We define the arithmetic dimension of $\Delta$…
Let $m$, $n$ be positive integers such that $m>n$, $\gcd(m,n)=1$ and $m \not\equiv n \bmod 2$. In 1956, L. Je\'smanowicz \cite{Jes} conjectured that the equation $(m^2 - n^2)^x + (2mn)^y = (m^2+n^2)^z$ has only the positive integer solution…
We introduce a linear algebraic object called a bidiagonal triple. A bidiagonal triple consists of three diagonalizable linear transformations on a finite-dimensional vector space, each of which acts in a bidiagonal fashion on the…
One of the many number theoretic topics investigated by the ancient Greeks was perfect numbers, which are positive integers equal to the sum of their proper positive integral divisors. Mathematicians from Euclid to Euler investigated these…
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
In this paper, we chronologically recount several situations that have contributed to the development and formalization of the objects known as imaginary or complex numbers. We will begin by introducing the earliest documented knowing for…
In 2000, A. Tripathi used generating functions to obtain a formula for the number of non-negative solutions (x,y) of the equation ax + by = n where a, b and n are given positive integers. We generalize this procedure for the number of…
Relatively prime pairs of integers can be represented as nodes in three way branching trees. We construct trees of B\'ezout coefficients which correspond to the relatively prime pairs in the aforementioned trees. As one application, we…
The set of terms of an infinite sequence expressed by a recurrence relation is equal to the set of maximum numbers of all primitive Pythagorean triples such that the difference between the two non-maximum numbers is 1, which Cimmino showed.…
In this paper, we obtain the counting formulaes of convex pentagons and convex hexagons, respectively, in an $n$-triangular net by solving the corresponding recursive formulaes.
In this paper we present a new method of solving the classical diophantine equation $A^4+B^4=C^4+D^4$. Two methods of solving this equation, given by Euler, yield parametric solutions given by polynomials of degrees 7 and 13. Several other…
In this paper, we introduce a new and direct approach to study the solvability of systems of equations generated by bilinear forms. More precisely, let $B (\cdot, \cdot)$ be a non-degenerate bilinear form and $E$ be a set in…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…
We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by…
We give a characterization of all three points in $\mathbb R^4$ with integer coordinates which are at the same Euclidean distance apart. In three dimension the problem is characterized in terms of solutions of the Diophantine equations…
We classify all solution triples with Fibonacci components to the equation $a^2+b^2+c^2=3abc+m,$ for positive $m$. We show that for $m=2$ they are precisely $(1,F(b),F(b+2))$, with even $b$; for $m=21$, there exist exactly two Fibonacci…
We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…
A family of original formulae for computing number PI and its proof are presented. An algorithm is proposed to validate the results of this new algorithm.