Pith. sign in

REVIEW

Compatibility of equations with truncated Newton's binomials

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1406.5406 v1 pith:U4INXDGB submitted 2014-06-19 math.GM

Compatibility of equations with truncated Newton's binomials

Anatoly A. Grinberg This is my paper
classification math.GM
keywords equationsbinomialbinomialscontainingintegersnewtonparametersresolvability
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.