English
Related papers

Related papers: A Generalised Stern-Brocot Tree from Regular Dioph…

200 papers

We prove that there exist infinitely many rationals a, b and c with the property that a^2-1, b^2-1, c^2-1, ab-1, ac-1 and bc-1 are all perfect squares. This provides a solution to a variant of the problem studied by Diophantus and Euler.

Number Theory · Mathematics 2018-07-03 Andrej Dujella , Ivica Gusić , Vinko Petričević , Petra Tadić

It is shown that for a finite set $A$ of four or more complex numbers, the cardinality of the set $C[A]$ of all cross-ratios generated by quadruples of pair-wise distinct elements of $A$ is $|C[A]|\gg…

Combinatorics · Mathematics 2017-05-05 Misha Rudnev

The continued fraction expansion of an irrational number $\alpha$ is eventually periodic if and only if $\alpha$ is a quadratic irrationality. However, very little is known regarding the size of the partial quotients of algebraic real…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

In this note we will analyze a diophantine equation raised by Michael Bennett in [1] that is pivotal in establishing that powers of five has few digits in its ternary expansion. We will show that the Diophantine equation…

Number Theory · Mathematics 2013-04-19 Satyanand Singh

We study some counting questions concerning products of positive integers $u_1, \ldots, u_n$ which form a non-zero perfect square, or more generally, a perfect $k$-th power. We obtain an asymptotic formula for the number of such integers of…

Number Theory · Mathematics 2019-11-20 Régis de la Bretèche , Pär Kurlberg , Igor E. Shparlinski

It is well-known that pythagorean triples can be represented by points of the unit circle with rational coordinates. These points form an abelian group, and we describe its structure. This structural description yields, almost immediately,…

Number Theory · Mathematics 2022-01-11 Amnon Yekutieli

An important unsolved problem in Diophantine number theory is to establish a general method to effectively find all solutions to any given $S$-unit equation with at least four terms. Although there are many works contributing to this…

Number Theory · Mathematics 2025-03-04 Takafumi Miyazaki

The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…

General Mathematics · Mathematics 2007-11-28 Florentin Smarandache

In this paper we deal with a problem of Peth\H{o} related to existence of quartic algebraic integer $\alpha$ for which $$ \beta=\frac{4\alpha^4}{\alpha^4-1}-\frac{\alpha}{\alpha-1} $$ is a quadratic algebraic number. By studying rational…

Number Theory · Mathematics 2017-03-16 Szabolcs Tengely , Maciej Ulas

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

Number Theory · Mathematics 2026-01-21 Sándor Z. Kiss , Csaba Sándor , Maciej Zakarczemny

In this short note we study the existence and number of solutions in the set of integers ($Z$) and in the set of natural numbers ($N$) of Diopahntine Equations of second degree with two variables of the general form $ax^2-by^2=c$.

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…

Group Theory · Mathematics 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan

We establish an explicit asymptotic formula for the number of rational solutions of intrinsic Diophantine inequalities on simply-connected simple algebraic groups, at arbitrarily small scales.

Number Theory · Mathematics 2021-01-05 Anish Ghosh , Alex Gorodnik , Amos Nevo

The beautiful quartic Diophantine equation $A^4+hB^4=C^4+hD^4$, where $h$ is a fixed arbitrary positive integer, has been studied by some mathematicians for many years. Although Choudhry, Gerardin and Piezas presented solutions of this…

Number Theory · Mathematics 2017-01-11 Farzali Izadi , Mehdi Baghalagdam

We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…

Number Theory · Mathematics 2018-12-31 Johannes Schleischitz

Let $D(n)$ be the number of pairwise disjoint Steiner quadruple systems. A simple counting argument shows that $D(n) \leq n-3$ and a set of $n-3$ such systems is called a large set. No nontrivial large set was constructed yet, although it…

Combinatorics · Mathematics 2019-12-11 Tuvi Etzion , Junling Zhou

We introduce two families of transcendental numbers which we call finite factorial (FF) and partially finite factorial (PFF) numbers respectively, with the former one being subfamily of the latter one. These numbers arise naturally from…

Number Theory · Mathematics 2024-02-21 Liangang Ma

Let $S$ denote a set of primes and let $a_1,\ldots,a_m$ be positive distinct integers. We call the $m$-tuple $(a_1,\ldots,a_m)$ an $S$-Diophantine tuple if $a_ia_j+1=s_{i,j}$ are $S$-integers for all $i\not=j$. In this paper, we show that…

Number Theory · Mathematics 2014-07-28 László Szalay , Volker Ziegler

In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p…

Number Theory · Mathematics 2009-05-21 Konstantine Zelator

In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-19 Stephen Dolan