相关论文: Fermat's Last Theorem, Solution Sets v6

This paper presents a novel direct elementary proof for Fermat's Last Theorem. We use algebra, modular math, and binomial series to develop inherent mathematical relationships hidden within Fermat's Last Theorem. With these derived…

We study the extent to which sets A in Z/NZ, N prime, resemble sets of integers from the additive point of view (``up to Freiman isomorphism''). We give a direct proof of a result of Freiman, namely that if |A + A| < K|A| and |A| < c(K)N…

For nonempty sets $A,B$ of nonnegative integers and an integer $n$, let $r_{A,B}(n)$ be the number of representations of $n$ as $a+b$ and $d_{A,B}(n)$ be the number of representations of $n$ as $a-b$, where $a\in A, b\in B$. In this paper,…

In this paper we study the Fermat equation $x^n+y^n=z^n$ over quadratic fields $\mathbb{Q}(\sqrt{d})$ for squarefree $d$ with $26 \leq d \leq 97$. By studying quadratic points on the modular curves $X_0(N)$, $d$-regular primes, and working…

$S \subseteq \mathbb{Z}_{2n}$ is said to be sum-free if $S$ has no solution to the equation $a+b=c$. The sum-free process on $\mathbb{Z}_{2n}$ starts with $S:=\emptyset$, and iteratively inserts elements of $\mathbb{Z}_{2n}$, where each…

In this study, we find continued fraction expansion of sqrt(d) when d=a^2b^2-b and d=a^2b^2-2b where a and b are positive integers. We consider the integer solutions of the Pell equations x^2-(a^2b^2-b)y^2=N and x^2-(a^2b^2-2b)y^2=N when N…

The main objective of this study is to investigate the existence and forms of solutions of systems of general quadratic functional equations in $\mathbb{C}^n$. By utilizing Nevanlinna theory in $\mathbb{C}^n$, we explore the existence and…

Let $K$ be a totally real number field and consider a Fermat-type equation $Aa^p+Bb^q=Cc^r$ over $K$. We call the triple of exponents $(p,q,r)$ the signature of the equation. We prove various results concerning the solutions to the Fermat…

Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…

Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. Let SF(G) denotes the set of all sum-free subets of $G$ and $\sigma(G)$ denotes…

For k>=3 let A \subset [1,N] be a set not containing a solution to a_1 x_1+...+a_k x_k=a_1 x_{k+1}+...+a_k x_{2k} in distinct integers. We prove that there is an epsilon>0 depending on the coefficients of the equation such that every such A…

We show that if $A\subset \{1,\ldots,N\}$ has no solutions to $a-b=n^2$ with $a,b\in A$ and $n\geq 1$ then \[|A|\ll \frac{N}{(\log N)^{c\log\log \log N}}\] for some absolute constant $c>0$. This improves upon a result of…

The \textit{Collatz's conjecture} is an unsolved problem in mathematics. It is named after Lothar Collatz in 1973. The conjecture also known as Syrucuse conjecture or problem. Take any positive integer $ n $. If $ n $ is even then divide it…

We show that the generalized Fermat equations with signatures (5,5,7), (5,5,19), and (7,7,5) (and unit coefficients) have no non-trivial primitive integer solutions. Assuming GRH, we also prove the nonexistence of non-trivial primitive…

In this paper, first, we prove that the Diophantine system \[f(z)=f(x)+f(y)=f(u)-f(v)=f(p)f(q)\] has infinitely many integer solutions for $f(X)=X(X+a)$ with nonzero integers $a\equiv 0,1,4\pmod{5}$. Second, we show that the above…

This paper studies integer solutions to the Diophantine equation A+B=C in which none of A, B, C have a large prime factor. We set H(A, B,C) = max(|A|, |B|, |C|), and consider primitive solutions (gcd}(A, B, C)=1) having no prime factor p…

The paper deals with the following system of nonlinear difference equations \begin{equation*} x_{n+1}=ax_{n}^{2}y_{n}+bx_{n}y_{n}^{2},\ y_{n+1}=cx_{n}^{2}y_{n}+dx_{n}y_{n}^{2},\ n\in \mathbb{N}_{0}, \end{equation*} where the initial values…

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…

We derive an upper bound for the least number of variables needed to guarantee that a system of t quadratic forms (t>=2) over a field F has a nontrivial zero. In particular, if F is a local field, then 2t^2+3 variables insure the existence…