Results 31 to 40 of about 565 (158)
The Computing of Pythagoras Triples in Symbolic 2-Plithogenic Rings [PDF]
This paper is dedicated to finding a general algorithm for generating different solutions for Pythagoras' non-linear Diophantine equation in four variables π₯ 2 + π¦ 2 = π§ 2 in symbolic 2-plithogenic rings, which are known as Pythagoras triples.
Abuobida Mohammed A. Alfahal +3 more
doaj
Cryptography Using Linear Diophantine Equation
: This study is focused on the encrypting and decrypting of messages using the Linear Diophantine Equation: where , that is the integers and are relatively prime.
Mark Kenneth C. Engcot
core +1 more source
On Pythagoras Triples in Symbolic 3-Plithogenic Rings [PDF]
The objective of this paper is to find necessary and sufficient conditions for a symbolic 3-plithogenic triple (π‘0 + π‘1π1 + π‘2π2 + π‘3π3, π 0 + π 1π1 + π 2π2 + π 3π3, π0 + π1π1 + π2π2 + π3π3 ) to be a Pythagoras triple, i.e.
Abuobida Mohammed A. Alfahal +3 more
doaj
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
Application of the group action approach to solving linear Diophantine equations [PDF]
The article substantiates a method for solving linear Diophantine equations using the theory of group actions. The purpose of this paper is to introduce actions of certain groups on the set of linear Diophantine equations and to study their ...
Chistov, Ivan Sergeevich +1 more
doaj +1 more source
On the Conditions for Symbolic 3-Plithogenic Pythagoras Quadruples [PDF]
The objective of this paper is to find the necessary and sufficient conditions for a symbolic 3-plithogenic quadruple (π‘0 + π‘1π1 + π‘2π2 + π‘3π3, π 0 + π 1π1 + π 2π2 + π 3π3, π0 + π1π1 + π2π2 + π3π3, π0 + π1π1 + π2π2 + π3π3 ) to be a Pythagoras quadruple, i.e.
Abuobida Mohammed A. Alfahal +3 more
doaj
Small solutions of linear Diophantine equations
Given a system of linear diophantine equations and let (*) \(Ax=B\) be its matrix form, where \(A=(a_{ij})\) is a \(m\times n\), \(x=(x_k)\) and \(B=(a_{k,n+1})\) are \(m\times 1\) matrices. Further, given integers \(1\leq j_1< \cdots < j_m\leq n+1\), let \(d_{j_1,\ldots, j_m} = \det (a_{i,j_r}),\) \(1\leq i,r\leq m\), \(X=\sup \{| d_{j_1,\ldots, j_m}|:
I. Borosh, M. Flahive, B. Treybig
openaire +1 more source
Three Diophantine equations concerning the polygonal numbers [PDF]
Many authors investigated the problem about the linear combination of two polygonal numbers being a perfect square, i.e., the Diophantine equation mPβ(x)+nPβ(y)=zΒ², where Pβ(x) denotes the x-th k-polygonal number and m, n are positive integers.
Yong Zhang, Mei Jiang, Qiongzhi Tang
doaj +1 more source
Geometry of the Minimal Solutions of a Linear Diophantine Equation [PDF]
12 pages; To appear in SIAM J.
openaire +2 more sources
Spectrum sensing based on high/low sensing times
Cognitive Radio spectrum sensing is one of the important technique to utilize the unused specturm for secondary user signal transmission without interference with the primary users of the spectrum.
Ramamurthy Garimella +1 more
doaj +1 more source

