A Transformation to Solve Indefinite Quadratic Equations in Integers
نویسنده
چکیده
The paper proposes a new method, called the Fast Quadratic Transform (FQT), to solve the general indefinite two-variable quadratic equation in integers. The paper presents the new approach, discusses its properties, and provides a comparative evaluation with the classical technique. The FQT is demonstrated to be markedly superior for all cases in which it applies, including examples for more than sixty percent of the discriminants through two hundred.
منابع مشابه
The Solution of Fully Fuzzy Quadratic Equations Based on Restricted Variation
Firstly, in this paper, we apply the Fuzzy Restricted Variation Method to achieve an analytical and approximate unsymmetrical fuzzy solution for Fully Fuzzy Quadratic Equation. In this application, after finding the real root of 1-cut of $tilde{A}tilde{X}^{2}+tilde{B}tilde{X}+tilde{C}=tilde{D}$, initial guess is always chosen with possible unknown parameters that leads to highly accurate soluti...
متن کاملSimultaneous Quadratic Equations with Few or No Solutions
In this paper, we completely solve the simultaneous Diophantine equations x − az = 1, y − bz = 1 provided the positive integers a and b satisfy b−a ∈ {1, 2, 4}. Further, we show that these equations possess at most one solutions in positive integers (x, y, z) if b − a is a prime or prime power, under mild conditions. Our approach is (relatively) elementary in nature and relies upon classical re...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملQuadratic $alpha$-functional equations
In this paper, we solve the quadratic $alpha$-functional equations $2f(x) + 2f(y) = f(x + y) + alpha^{-2}f(alpha(x-y)); (0.1)$ where $alpha$ is a fixed non-Archimedean number with $alpha^{-2}neq 3$. Using the fixed point method and the direct method, we prove the Hyers-Ulam stability of the quadratic $alpha$-functional equation (0.1) in non-Archimedean Banach spaces.
متن کاملIdentification and signatures based on NP-hard problems of indefinite quadratic forms
We prove NP-hardness of equivalence and representation problems of quadratic forms under probabilistic reductions, in particular for indefinite, ternary quadratic forms with integer coefficients. We present identifications and signatures based on these hard problems. The bit complexity of signature generation and verification is quadratic using integers of bit length 150.
متن کامل