Results 81 to 90 of about 4,479,316 (202)
Random Diophantine equations in the primes II
Abstract Let d⩾2$d\geqslant 2$ and n⩾d$n\geqslant d$ with (d,n)∉{(2,2),(3,3)}$(d,n)\notin \lbrace (2,2),(3,3)\rbrace$. We consider homogeneous Diophantine equations of degree d$d$ in n+1$n+1$ variables and whether they have solutions in the primes.
Philippa Holdridge
wiley +1 more source
Diophantine Equations and Linear Recurrences [PDF]
Ph.D. Thesis defense.
openaire +1 more source
A problem in non-linear Diophantine approximation [PDF]
In this paper we obtain the Lebesgue and Hausdorff measure results for the set of vectors satisfying infinitely many fully non-linear Diophantine inequalities.
Stephen Harrap +5 more
core +1 more source
This paper introduces a digital adaptive control framework for large-scale multivariable systems, integrating matrix linear Diophantine equations with block pole placement.
Belkacem Bekhiti +4 more
doaj +1 more source
Real-world applications of number theory [PDF]
The above abstract has been extracted by the translator from the original article (J. Klaška, Real-world applications of number theory, South Bohemia Mathematical Letters, 25 no.
Rahim Rahmati-Asghar
doaj +1 more source
A novel approach to perturbative calculations for a large class of interacting boson theories
We present a method of calculating the interacting S-matrix to an arbitrary perturbative order for a large class of boson interaction Lagrangians. The method takes advantage of a previously unexplored link between the n-point Green's function and a ...
Kamil Brádler
doaj +1 more source
DETECTION OF DEADLOCKS IN PARALLEL PROGRAMS AS SOLUTION OF LINEAR DIOPHANTINE EQUATIONS
The method of detecting deadlocks in the distributed systems at the design stage of the system is considered. The system is presented in the form of a model through the formal specification by means of Petri nets.
Olga F. Babakhyan
doaj
Solution of an odds inversion problem [PDF]
Consider the problem of determining the possible numbers of balls of two different colors in an urn such that if two are drawn out at random, the odds that they are different colors are a given value. We present a general solution of this problem for all
Robert K. Moniot
doaj +1 more source
On Linear Diophantine Equations and Fibonacci Numbers
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
An Introduction to Diophantine Equations: A Problem-Based Approach [PDF]
summary:We study the Diophantine equations $(k!)^n -k^n = (n!)^k-n^k$ and $(k!)^n +k^n = (n!)^k +n^k,$ where $k$ and $n$ are positive integers. We show that the first one holds if and only if $k=n$ or $(k,n)=(1,2),(2,1)$ and that the second one holds if ...
Luca, Florian +7 more
core +1 more source

