Search Results

You are looking at 1 - 10 of 115 items for :

  • "number theory" x
  • Refine by Access: All Content x
Clear All

problems in the additive number theory Acta Math. Hungar. 72 35 – 44 10.1007/BF00053695 .

Restricted access

Leta 1,a 2, ...,a n be relative prime positive integers. The Frobenius problem is to determine the greatest integer not belonging to the set {Σj=1 n a j x j :x∈Z + n}. The Frobenius problem belongs to the combinatorial number theory, which is very rich in methods. In this paper the Frobenius problem is handled by integer programming which is a new tool in this field. Some new upper bounds and exact solutions of subproblems are provided. A lot of earlier results obtained with very different methods can be discussed in a unified way.

Restricted access
Restricted access

Comparative prime-number theory. II

Comparison of the progressions ≡1 modk and ≡l modk,l≢1 modk

Acta Mathematica Hungarica
Authors: S. Knapowski and P. Turán
Restricted access

Comparative prime-number theory. III

Continuation of the study of comparison of the progressions ≡1 mokk and ≡l modk

Acta Mathematica Hungarica
Authors: S. Knapowski and P. Turán
Restricted access

Comparative prime-number theory. IV

Paradigma to the general case,k=8 and 5

Acta Mathematica Hungarica
Authors: S. Knapowski and P. Turán
Restricted access

Comparative prime-number theory. V

Some theorems concerning the general case

Acta Mathematica Hungarica
Authors: S. Knapowski and P. Turán
Restricted access

Comparative prime-number theory. VI

Continuation of the general case

Acta Mathematica Hungarica
Authors: S. Knapowski and P. Turán
Restricted access

Comparative prime-number theory. VIII

Chebyshev's problem fork=8

Acta Mathematica Hungarica
Authors: S. Knapowsiki and P. Turán
Restricted access