Results 41 to 50 of about 565 (158)
Diophantine Equations Related with Linear Binary Recurrences
Summary: In this paper we find all solutions of four kinds of the Diophantine equations \[ x^2 \pm V_t xy-y^2 \pm x=0 \text{ and } x^2 \pm V_txy-y^2 \pm y=0, \] for an odd number \(t\), and, \[ x^2 \pm V_txy+y^2-x=0 \text{ and } x^2 \pm V_txy+y^2-y=0, \] for an even number \(t\), where \(V_n\) is a generalized Lucas number.
Kilic, Emrah, Akkus, Ilker, Omur, Nese
openaire +5 more sources
Using Matrices to Balance Chemical Reactions and Modeling the Implications of a Balanced Reaction
This paper explores an alternative way to balancing equations of chemical reactions and understanding why it is necessary to use balanced equations in science.
Emilee Barrett
doaj +1 more source
Algorithms for the Solution of Systems of Linear Diophantine Equations [PDF]
Two algorithms for the solution of linear Diophantine systems, which well restrain intermediate expression swell, are presented. One is an extension and improvement of Kannan and Bachem’s algorithm for the Smith and the Hermite normal forms of a nonsingular square integral matrix.
Tsu-Wu J. Chou, George E. Collins
openaire +1 more source
On $k$-Pell numbers which are sum of two Narayana's cows numbers [PDF]
For any positive integer $k\geq2$, let $(P_n^{(k)})_{n\geq2-k}$ be the $k$-generalized Pell sequence which starts with $0,\cdots,0,1$ ($k$ terms) with the linear recurrence P_n^{(k)} = 2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots+P_{n-k}^{(k)}\quad\text{for} n\
Kouèssi Norbert Adédji +2 more
doaj +1 more source
Classifying three-character RCFTs with Wronskian index equalling 0 or 2
In the modular linear differential equation (MLDE) approach to classifying rational conformal field theories (RCFTs) both the MLDE and the RCFT are identified by a pair of non-negative integers [n,l].
Arpit Das +2 more
doaj +1 more source
Diophantine Equation in Logarithms
The main work of these pages is written by myself under the supervisor of Dr. Omar Kihel, pertaining to continued fractions and applications , linear form in logarithms and the solutions of Diophantine equation Fn1 + Fn2 + Fn3 + Fn4 = 6a .
Tian, Zhao
core
Non-Linear Diophantine Equation
This paper is an important study about these Non-Linear Equation which have integer solution exists. i.e., Non-Linear Diophantine Equation, which have named by the famous Greek Mathematician Diophantus of Alexandria. In this paper we have focused to solve Non-Linear Diophantine Equations.
Jeetendra kumar -, S. N. Adhikary -
openaire +1 more source
Penerapan Kombinatorik pada Persamaan Diophantine Linier
In this paper we apply combinatoric principle on linear diophantine equation. The method being used on this research is theoritic method. Generally, the linear diophantine equation is a polynomial equation. The form of equation being solved in this paper
A’lailliyyin1, A’lailliyyin +2 more
core +1 more source
Counting monochromatic solutions to diagonal Diophantine equations
Counting monochromatic solutions to diagonal Diophantine equations, Discrete Analysis 2021:14, 47 pp. An important subfield of Ramsey theory concerns questions of the following type: for which systems of equations $E_1,\dots,E_k$ in variables $x_1,\dots,
Sean Prendiville
doaj +1 more source
On the Number of Nonnegative Solutions to the Inequality a1 +....ar < n [PDF]
In this paper, we present a simple and fast method for counting the number of nonnegative integer solutions to the equality a1x1+a2x2+: : :+arxr = n where a1; a2; :::; ar and n are positive integers.
Farzaneh , A. +3 more
core

