Results 161 to 170 of about 4,224,396 (192)
Some of the next articles are maybe not open access.

A Diophantine Equation Concerning Linear Recurrences

Periodica Mathematica Hungarica, 1997
Let \(G_n ^{(1)}, \ldots, G_n ^{(\nu)}\) and \(H_n^{(1)}, \ldots, H_n ^{(\mu)}\) \((n=0, 1, 2,\ldots)\) be linear recurrence sequences of rational integers with order at least two. For fixed primes \(p_1 , \ldots , p_t \), let \(S\) be the set of integers of the form \(\pm p_1 ^{e_1 } \cdots p_t ^{e_t }\) \((e_i \geq 0)\). The author proves, under some
openaire   +2 more sources

Linear Diophantine Equations

2015
“I had a very strange dream last night,” Tweedledum said to Tweedledee. “I dreamt that we were not twins but quintuplets.” “What were the names of the others?” asked Tweedledee. “One of them was called Tweedledoo. I don't remember the other two, but they were also Tweedle-something. We had done something that was only possible in a dream. We made the
openaire   +1 more source

A Note on the Linear Diophantine Equation

The American Mathematical Monthly, 1941
(1941). A Note on the Linear Diophantine Equation. The American Mathematical Monthly: Vol. 48, No. 10, pp. 662-666.
openaire   +2 more sources

Solution of Systems of Linear Diophantine Equations

2001
Two new methods to solve linear systems of Diophantine equations are proposed - modular (CRT) and p-adic (Hensel). Each of them allows to obtain solutions of a system with the size n x m with the complexity O(nsm). For quasi-square systems, the p-adic method allows to obtain solution with the complexity O(n 3), and the modular method with complexity O ...
openaire   +2 more sources

A Forward Approach for Solving Linear Diophantine Equation

International Journal of Mathematical Education in Science and Technology, 2020
Yiu Kwong MAN
exaly  

A Linear Diophantine Equation

The American Mathematical Monthly, 1947
openaire   +1 more source

Solving a System of Linear Diophantine Equations With Lower and Upper Bounds on the Variables

Mathematics of Operations Research, 2000
Karen Aardal, Arjen K. Lenstra
exaly  

Home - About - Disclaimer - Privacy