Results 111 to 120 of about 983 (218)

On sums of k-generalized Fibonacci and k-generalized Lucas numbers as first and second kinds of Thabit numbers [PDF]

Notes on Number Theory and Discrete Mathematics
Let (Fᵣ⁽ᵏ⁾)ᵣ≥2-k and (Lᵣ⁽ᵏ⁾)ᵣ≥2-k be generalizations of the Fibonacci and Lucas sequences, where k≥2. For these sequences the initial k terms are 0,0,...,0, 1 and 0,0,...,2,1, and each subsequent term is the sum of the preceding k terms.
Hunar Sherzad Taher, Saroj Kumar Dash
doaj   +1 more source

AN AUTHENTICATION METHOD BASED ON A DIOPHANTINE MODEL OF THE COIN BAG PROBLEM

Applied Computer Science
 The article presents the so-called coin bag problem, which is modeled by linear Diophantine equations. The problem in question involves assessing the contents of a set of coins based on its weight.
Krzysztof NIEMIEC, Grzegorz BOCEWICZ
doaj   +1 more source

Computing all integer solutions of a genus 1 equation [PDF]

The Elliptic Logarithm Method has been applied with great successto the problem of computing all integer solutions of equations ofdegree 3 and 4 defining elliptic curves. We extend this methodto include any equation f(u,v)=0 that defines a curve of genus
Stroeker, R.J., Tzanakis, N.
core   +1 more source

A note on equivalent systems of linear diophantine equations [PDF]

Zeitschrift für Operations Research, 1973
Another constructive proof is presented for the fact that a system of linear equations with integer coefficients in bounded integer variables is equivalent to a single equation, which is a linear combination of the original ones. The equation is obtained in a number of steps; in each step two equations are replaced by a single one.
openaire   +3 more sources

Elementary Methods for Solving Diophantine Equations [PDF]

, 2019
U ovom radu proučit ćemo elementarne metode za rješavanje diofantskih jednadžbi. Prvi dio rada bazira se na linearnim diofantskim jednadžbama i Euklidovom algoritmu i njegovoj važnosti u rješavanju ovog tipa jednadžbi. Osim toga, u radu su opisane metode
Tokić, Vedrana
core  

Reducible Diophantine Equations and Their Parametric Representations [PDF]

, 1955
1. Reducible diophantine equations. The present paper will provide a general method for obtaining the complete parametric representation for the rational integer solutions of the multiplicative diophantine equation1.1 for some specified range of k, where
E. Rosenthall
core   +1 more source

О ЛИНЕЙНЫХ ДИОФАНТОВЫХ УРАВНЕНИЯХ И СПОСОБАХ ИХ РЕШЕНИЯ

Vestnik KRAUNC: Fiziko-Matematičeskie Nauki, 2016
В работе рассматриваются способы решения линейных диофантовых уравнений как в частном случае с двумя неизвестными, так и в общем случае с несколькими неизвестными.
Кодзоков, А.Х., Бесланеев, З.О., Нагоров, А.Л., Тхамоков, М.Б.   +3 more
doaj   +1 more source

Solutions to some diophantine equations adapted to a computer program [PDF]

, 1993
This thesis provides a computer program for the solution of Diophantine equations. The linear Diophantine equation of the form y1c1+y2c2 + yncn = e and the non-linear Diophantine equation x2 + ym = z2n and x2-dy2 = n are considered in this paper.
Mendiola, Maria Lourdes P., Lacanilao, Connie A.   +1 more
core  

Existence of KAM tori for presymplectic vector fields

Electronic Journal of Differential Equations, 2020
We prove the existence of a torus that is invariant with respect to the flow of a vector field that preserves the presymplectic form in an exact presymplectic manifold.
Sean Bauer, Nikola P. Petrov
doaj  

Discrete Particle Swarm Optimization in the numerical solution of a system of linear Diophantine equations

Dyna, 2014
El presente artículo propone utilizar una versión discreta del bien conocido algoritmo metaheurístico de optimización por enjambre de partículas, DPSO, para solucionar numéricamente un sistema de ecuaciones Diofánticas lineales.
Iván Amaya, Luis Gómez, Rodrigo Correa
doaj