Results 131 to 140 of about 2,595 (231)

Time-varying Feedback Systems Design Via Diophantine Equation Order Reduction

, 2007
Diophantine equation plays an important role in the design and synthesis of feedback compensators. Many methods have been developed to solve the Diophantine equation.
Wu, Shr-Hua
core  

On the Diophantine equation x2−4pm=±yn

, 2012
Let m and n be positive integers and p any odd prime. In this paper we consider the Diophantine equation x2−4pm=±yn in positive integers x and y where (x,y)=1, and we show that under some not very restrictive conditions, this equation has only finitely ...
Abu Muriefah, Fadwa S., AL-Rashed, Amal
core   +1 more source

On the Diophantine Equation CZ2 = X5 + Y5

, 2011
In this work we determine an infinit sequence of different values of C for which the diophantine equation Cz2 = x5 + y5 has no coprime non-trivial ...
Aldén, Erik, Söderlund, Gustaf
core  

Diophantine equation mX^2 - nY^2 = + - 1

, 2016
V prvem poglavju diplomskega dela zajamemo osnovne teorije verižnih ulomkov. Posebej opišemo končne, neskončne in periodične verižne ulomke. V drugem poglavju diplomskega dela obravnavamo Pellovo enačbo oz.
Vizjak, Mateja
core  

Some solutions of diophantine equation x3+y3=pk z3 [PDF]

, 2011
Diophantine equation is an algebraic equation in two or more variables in which solutions to it are from some predetermined classes and it is one of the oldest branches of number theory.
See, Kok Leong
core  

On a variant of Pillai's problem involving <i>S</i>-units and Fibonacci numbers. [PDF]

Bol Soc Mat Mex, 2022
Ziegler V.
europepmc   +1 more source

On the diophantine equation Fn + Fm = 2a

, 2016
In this paper, we find all the solutions of the title Diophantine equation in positive integer variables (n, m, a), where Fk is the kth term of the Fibonacci sequence.
Luca, Florian, Bravo, Jhon J.
core  

Undecidable diophantine equations [PDF]

Bulletin of the American Mathematical Society, 1980
openaire   +2 more sources

Brocard's problem and variations

, 2013
This thesis examines the work which has been done on Brocard’s problem which is to study solutions to n! + 1 = x², and related problems of the form n! = f(x) or n! = f(x, y), where f is a polynomial with integer coefficients.
Liu, Yi
core  

On prime powers in linear recurrence sequences. [PDF]

Ann Math Quebec, 2023
Odjoumani J, Ziegler V.
europepmc   +1 more source