Results 251 to 260 of about 8,614,380 (320)

Integer solutions of binomial coefficients

The Mathematics Teacher, 2016
Context and underlying structure explain why the formula for binomial coefficients always produces an integer ...
Nicholas J. Gilbertson
semanticscholar   +2 more sources

Integer solutions to bankruptcy problems with non-integer claims

TOP, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vito Fragnelli   +2 more
semanticscholar   +3 more sources

Density of integer solutions to diagonal quadratic forms

open access: yes, 2006
.Let Q be a non-singular diagonal quadratic form in at least four variables. We provide upper bounds for the number of integer solutions to the equation Q = 0, which lie in a box with sides of length 2B, as B → ∞.
T. Browning
semanticscholar   +3 more sources

Positive integer solutions of some Diophantine equations in terms of integer sequences

Afrika Matematika, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Keskin, Z. Şiar
semanticscholar   +2 more sources

On Integer Solutions to Linear Equations

Annals of Combinatorics, 2008
A magic square is an n × n matrix with non-negative integer entries, such that the sum of the entries in each row and column is the same. We study the enumeration and P-recursivity of these in the case in which the sum along each row and column is fixed, with the size n of the matrix as the variable.
William Griffiths
semanticscholar   +2 more sources

Optimal Integer Solutions to Industrial Cutting Stock Problems

INFORMS Journal on Computing, 1999
The “textbook” treatment of the cutting stock problem, using a method termed column generation, solves the problem as if one is allowed to use fractional amounts of patterns. In practice, one can typically run only an integer quantity of a pattern. Dyckhoff was the first to propose an integer linear programming formulation for the problem of getting a
Z. Degraeve, L. Schrage
semanticscholar   +2 more sources

On the nonnegative integer solutions of the equation Fn ± Fm = ya

Quaestiones Mathematicae. Journal of the South African Mathematical Society, 2021
In this paper, we study the titular Diophantine equation for a fixed positive integer y ≥ 3 in nonnegative integers m, n, and a. We show that the nonnegative integer solutions (n, m, a) are finite in number, and we provide a bound for them.
O. Kihel, Jesse Larone
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy