Some results for the irreducibility of truncated binomial expansions

dc.contributor.authorJakhar, A.
dc.contributor.authorSangwan, N.
dc.date.accessioned2020-11-18T05:16:06Z
dc.date.available2020-11-18T05:16:06Z
dc.date.issued2018
dc.description.abstractFor positive integers k and n with k⩽n−1, let Pn,k(x) denote the polynomial ∑j=0k(nj)xj, where (nj)=[Formula presented]. In 2011, Khanduja, Khassa and Laishram proved the irreducibility of Pn,k(x) over the field Q of rational numbers for those n,k for which 2≤2k≤n<(k+1)3. In this paper, we extend the above result and prove that if 2≤2k≤n<(k+1)e+1 for some positive integer e and the smallest prime factor of k is greater than e, then there exists an explicitly constructible constant Ce depending only on e such that the polynomial Pn,k(x) is irreducible over Q for k≥Ce.en_US
dc.identifier.citationJournal of Number Theory, 192, pp. 143-149en_US
dc.identifier.otherhttps://doi.org/10.1016/j.jnt.2018.04.001
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0022314X18301203
dc.identifier.urihttp://hdl.handle.net/123456789/1745
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.subjectIrreducible polynomialsen_US
dc.subjectTruncated binomialen_US
dc.subjectbinomial expansionsen_US
dc.subjectirreducibilityen_US
dc.subjecttruncateden_US
dc.titleSome results for the irreducibility of truncated binomial expansionsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Need to add pdf.odt
Size:
8.04 KB
Format:
OpenDocument Text
Description:

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: