Results 31 to 40 of about 4,479,316 (202)
Unification and equation solving in nilpotent groups and monoids [PDF]
Unification and equation solving have been considered for groups [44], semigroups [43], abelian groups [39] and abelian semigroups [25], [33], [68], [69]. In this thesis we consider partially commutative groups and monoids. Nilpotency provides us with a
Burke, Edmund Kieran
core +6 more sources
Geometry of the Minimal Solutions of a Linear Diophantine Equation [PDF]
Let $a_1,\ldots,a_n$ and $b_1,\ldots,b_m$ be fixed positive integers, and let ${\mathcal S}$ denote the set of all nonnegative integer solutions of the equation $x_1a_1+\cdots +x_na_n=y_1b_1+\cdots +y_mb_m$. A solution $(x_1,\ldots,x_n,y_1,\ldots,y_m)$ in ${\mathcal S}$ is called minimal if it cannot be expressed as the sum of two nonzero solutions in $
openaire +3 more sources
A Study of Symbolic 2-Plithogenic Split-Complex Linear Diophantine Equations in Two Variables [PDF]
The equation 𝐴𝑋 + 𝐵𝑌 = 𝐶 is called symbolic 2-plithogenic linear Diophantine equation with two variables if 𝐴, 𝐵, 𝑋, 𝑌, 𝐶 are symbolic 2-plithogenic split-complex integers.
Rama Asad Nadweh +3 more
doaj
On a few Diophantine equations, in particular, Fermat's last theorem
This is a survey on Diophantine equations, with the purpose being to give the flavour of some known results on the subject and to describe a few open problems.
C. Levesque
doaj +1 more source
Elementary Deduction Problem for Locally Stable Theories with Normal Forms [PDF]
We present an algorithm to decide the intruder deduction problem (IDP) for a class of locally stable theories enriched with normal forms. Our result relies on a new and efficient algorithm to solve a restricted case of higher-order associative ...
Mauricio Ayala-Rincón +2 more
doaj +1 more source
The Mathematical Safe Problem and Its Solution (Part 2)
Introduction. The problem of mathematical safe arises in the theory of computer games and cryptographic applications. The article considers numerous variations of the mathematical safe problem and examples of its solution using systems of linear ...
Sergii Kryvyi, Hryhorii Hoherchak
doaj +1 more source
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
Mulatu Numbers Which Are Concatenation of Two Fibonacci Numbers
Let (M_k) be the sequence of Mulatu numbers defined by M_0=4, M_1=1, M_k=M_(k-1)+M_(k-2) and (F_k) be the Fibonacci sequence given by the recurrence F_k=F_(k-1)+F_(k-2) with the initial conditions F_0=0, F_1=1 for k≥2.
Fatih Erduvan, Merve Güney Duman
doaj +1 more source
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
The Frobenius Number for Jacobsthal Triples Associated with Number of Solutions
In this paper, we find a formula for the largest integer (p-Frobenius number) such that a linear equation of non-negative integer coefficients composed of a Jacobsthal triplet has at most p representations.
Takao Komatsu, Claudio Pita-Ruiz
doaj +1 more source

