EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
11-XX Number theory
11Dxx Diophantine equations
11D75 Diophantine inequalities

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 29 of 29

On the Frobenius number of a modular Diophantine inequality

José Carlos Rosales, P. Vasco (2008)

Mathematica Bohemica

We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality $a x mod b \leq x$ , with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.

On the Frobenius number of a proportionally modular Diophantine inequality.

Delgado, M., Rosales, J.C. (2006)

Portugaliae Mathematica. Nova Série

On the number of prime factors of a finite arithmetical progression

T. N. Shorey, R. Tijdeman (1992)

Acta Arithmetica

On the number of solutions of the generalized Ramanujan-Nagell equation $x ² - D = 2^{n + 2}$

Maohua Le (1991)

Acta Arithmetica

On the numbers of solutions of weighted unit equations

J. H. Evertse, K. Györy (1988)

Compositio Mathematica

On the Representation of Integers by Binary Cubic Forms of Positive Discriminant.

J.-H. Evertse (1983)

Inventiones mathematicae

On the representation of integers by binary cubic forms of positive discriminant (Erratum).

J.H. Evertse (1984)

Inventiones mathematicae

On the sums ... .

K. Ramachandra (1973)

Journal für die reine und angewandte Mathematik

One Erdös style inequality

Tomáš J. Kepka, Petr C. Němec (2019)

Commentationes Mathematicae Universitatis Carolinae

One unusual inequality is examined.

Currently displaying 21 – 29 of 29

Previous Page 2