Results 121 to 130 of about 580,253 (234)
On minimal solutions of linear Diophantine equations [PDF]
This paper investigates the region in which all the minimal solutions of a linear diophantine equation lie. We present best possible inequalities which must be satisfied by these solutions and thereby improve earlier results.
Henk, M. +2 more
core
Linear Congruences, Linear Diophantine Equations and Software Support [PDF]
Ključni pojmovi iz elementarne teorije brojeva koji su obrađeni u ovom radu su djeljivost, kongruencije i diofantske jednadžbe. U kontekstu djeljivosti, bitno je spomenuti pojam najvećeg zajedničkog djelitelja koji se računa pomoću Euklidovog algoritma ...
Seletković, Nikola
core
On the Problem of Solution of Non-Linear (Exponential) Diophantine Equation
Sudhanshu Aggarwal +3 more
semanticscholar +1 more source
Solutions of higher-order standard linear diophantine equations [PDF]
Orientador: Simão Nicolau StelmastchukDissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação CientíficaResumo: Neste trabalho temos como objetivo o estudo das equações diofantinas ...
Araujo, Juscimar da Silva, 1989-
core
Diophantine equation and word problems [PDF]
Tato bakalářská práce se zabývá diofantickými rovnicemi a slovními úlohami. Práce je členěna do čtyř kapitol. První kapitola popisuje historii Diofanta z Alexandrie a obsahuje úvod do problematiky diofantických rovnic.
Fischerová, Kateřina
core
DIOPHANTINE PROPERTIES OF LINEAR RECURSIVE SEQUENCES II [PDF]
Let Gn be a linear recursive sequence of integers and P (y) be a polynomial with integer coefficients. In this paper we are given a survey on results on the solutions of diophantine equation Gn = P (y).
Attila Pethö, Pethő, Attila
core
On a variant of Pillai's problem involving <i>S</i>-units and Fibonacci numbers. [PDF]
Ziegler V.
europepmc +1 more source
Continuant, caterpillar, and topological index Z. III. Graph-theoretical algorithm for and interpretation of solving linear Diophantine equations [PDF]
The conventional algorithm for solving the linear Diophantine equation in two variables is greatly improved graph-theoretically by using the Z-caterpillars, namely, by substituting all the relevant series of integers with the caterpillar graphs whose ...
Hosoya, Haruo, ほそや, はるお
core
Positive and negative solutions of linear Diophantine equation with two variables [PDF]
Let and be integers where and , we call a linear Diophantine equation with two variables. It is known that the equation has a solution if and only if can be divided by the greatest common divisor of and .
บูรพา, สิงหา +1 more
core

