Sufficient conditions for solvability of linear Diophantine equations, and Frobenius numbers

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Samsonadze, Eteri
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915793095098368
author Samsonadze, Eteri
author_facet Samsonadze, Eteri
contents The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius numbers $g(a_1,a_2,...,a_n)$, for some particular cases,. Besides, a new recurrent method of studying the problem of solvability of a linear Diophantine equation in non-negative integers is proposed. This recurrent method is used for the problem of finding Frobenius numbers $g(a_1,a_2,...,a_n)$ for any $n\geq 3$; the example is given for the case $n=5$.
format Preprint
id arxiv_https___arxiv_org_abs_2408_17266
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Sufficient conditions for solvability of linear Diophantine equations, and Frobenius numbers
Samsonadze, Eteri
Number Theory
11D04, 11D07
The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius numbers $g(a_1,a_2,...,a_n)$, for some particular cases,. Besides, a new recurrent method of studying the problem of solvability of a linear Diophantine equation in non-negative integers is proposed. This recurrent method is used for the problem of finding Frobenius numbers $g(a_1,a_2,...,a_n)$ for any $n\geq 3$; the example is given for the case $n=5$.
title Sufficient conditions for solvability of linear Diophantine equations, and Frobenius numbers
topic Number Theory
11D04, 11D07
url https://arxiv.org/abs/2408.17266