On Cayley algorithm for double partition
Number Theory
2023-10-03 v1 Combinatorics
Abstract
A double partition problem asks for a number of nonnegative integer solutions to a system of two linear Diophantine equations with integer coefficients. Artur Cayley suggested a reduction of a double partition to a sum of scalar partitions with an algorithm subject to a set of conditions. We show that when these conditions are not satisfied and the original algorithm fails its modification solves the reduction problem.
Cite
@article{arxiv.2310.00538,
title = {On Cayley algorithm for double partition},
author = {Boris Rubinstein},
journal= {arXiv preprint arXiv:2310.00538},
year = {2023}
}
Comments
18 pages