Compatibility of equations with truncated Newton's binomials
pith:U4INXDGBopen to challenge →
classification
math.GM
keywords
equationsbinomialbinomialscontainingintegersnewtonparametersresolvability
read the original abstract
The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of equations containing binomials from two and three integers are investigated. Conditions of resolvability of the equations are specified based on the characteristics of their parameters.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.