Bisecting binomial coefficients
Loading...
Authors
Ionaşcu, Eugen J.
Martinsen, Thor
Stănică, Pantelimon
Subjects
Binomial coefficients
subset sum problem
diophantine equations
subset sum problem
diophantine equations
Advisors
Date of Issue
2016-10-10
Date
October 10, 2016
Publisher
Monterey, California: Naval Postgraduate School
Language
Abstract
In this paper, we deal with the problem of bisecting binomial coefficients. We find
many (previously unknown) infinite classes of integers which admit nontrivial bisections,
and a class with only trivial bisections. As a byproduct of this last construction, we
show conjectures Q2 and Q4 of Cusick and Li [7]. We next find several bounds for the
number of nontrivial bisections and further compute (using a supercomputer) the exact
number of such bisections for n ≤ 51.
Type
Article
Description
Series/Report No
Department
Applied Mathematics
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funding
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.