Knowledge

Cohn's irreducibility criterion

Source 📝

913:. Moreover, they proved that this bound is also sharp. In other words, coefficients larger than 49598666989151226098104244512918 do not guarantee irreducibility. The method of Filaseta and Gross was also generalized to provide similar sharp bounds for some other bases by Cole, Dunn, and Filaseta. 593: 398: 235: 638: 274: 911: 727: 433: 71: 467: 851: 831: 880: 802: 696: 667: 118: 1072: 966: 476: 281: 127: 1197:
Cole, Morgan; Dunn, Scott; Filaseta, Michael (2016). "Further irreducibility criteria for polynomials with non-negative coefficients".
775:
A further generalization of the theorem allowing coefficients larger than digits was given by Filaseta and Gross. In particular, let
1148: 748: 1001: 769: 1255: 764:. It is clear from context that the "A. Cohn" mentioned by Polya and Szegő is Arthur Cohn (1894–1940), a student of 961: 917: 941: 1010: 949: 75: 38: 598: 240: 17: 757: 1250: 1015: 885: 701: 407: 45: 1028: 1144: 1127: 1068: 1052: 743: 446: 1206: 1177: 1108: 1020: 933: 836: 807: 856: 778: 672: 643: 42: 739: 1227: 1092: 1088: 761: 470: 103: 1244: 921: 98: 765: 82: 1232: 1182: 1165: 993: 34: 1141:
Mathematicians Fleeing from Nazi Germany: Individual Fates and Global Impact
1056: 1113: 1096: 1210: 1032: 121: 79: 1024: 948:
form the representation of a prime number in that base. This is the
588:{\displaystyle p(x)=a_{k}x^{k}+a_{k-1}x^{k-1}+\cdots +a_{1}x+a_{0}} 393:{\displaystyle f(x)=a_{m}x^{m}+a_{m-1}x^{m-1}+\cdots +a_{1}x+a_{0}} 230:{\displaystyle p=a_{m}10^{m}+a_{m-1}10^{m-1}+\cdots +a_{1}10+a_{0}} 940:
is an irreducible polynomial with integer coefficients that have
804:
be a polynomial with non-negative integer coefficients such that
74:—that is, for it to be unfactorable into the product of lower- 1143:. Princeton, N.J.: Princeton University Press. p. 346. 738:
The base 10 version of the theorem is attributed to Cohn by
944:
1, then there exists a base such that the coefficients of
439:
The theorem can be generalized to other bases as follows:
1128:
Arthur Cohn's entry at the Mathematics Genealogy Project
27:
Sufficient condition for a polynomial to be unfactorable
888: 859: 839: 810: 781: 704: 675: 646: 601: 479: 449: 410: 284: 243: 130: 106: 48: 952:and its truth or falsity remains an open question. 905: 874: 845: 825: 796: 721: 690: 661: 632: 587: 461: 427: 392: 268: 229: 112: 65: 1049:Aufgaben und Lehrsätze aus der Analysis, Bd 2 8: 1164:Filaseta, Michael; Gross, Samuel S. (2014). 1065:Problems and theorems in analysis, volume 2 994:"Prime Numbers and Irreducible Polynomials" 916:An analogue of the theorem also holds for 93:The criterion is often stated as follows: 1181: 1112: 1097:"On an irreducibility theorem of A. Cohn" 1014: 890: 889: 887: 858: 838: 809: 780: 706: 705: 703: 674: 645: 612: 600: 579: 563: 538: 522: 509: 499: 478: 448: 412: 411: 409: 384: 368: 343: 327: 314: 304: 283: 254: 242: 221: 205: 180: 164: 151: 141: 129: 105: 50: 49: 47: 987: 985: 983: 981: 977: 853:49598666989151226098104244512918, then 18:A. Cohn's irreducibility criterion 1067:. Vol. 2. Springer. p. 137. 752:while the generalization to any base 7: 1228:"A. Cohn's irreducibility criterion" 1139:Siegmund-Schultze, Reinhard (2009). 1063:Pólya, George; Szegő, Gábor (2004). 1047:Pólya, George; Szegő, Gábor (1925). 768:who was awarded his doctorate from 633:{\displaystyle 0\leq a_{i}\leq b-1} 1166:"49598666989151226098104244512918" 833:is prime. If all coefficients are 25: 967:Perron's irreducibility criterion 749:Problems and Theorems in Analysis 269:{\displaystyle 0\leq a_{i}\leq 9} 33:is a sufficient condition for a 1101:Canadian Journal of Mathematics 31:Cohn's irreducibility criterion 936:of this criterion is that, if 900: 894: 869: 863: 820: 814: 791: 785: 716: 710: 685: 679: 656: 650: 489: 483: 422: 416: 294: 288: 60: 54: 1: 1002:American Mathematical Monthly 906:{\displaystyle \mathbb {Z} } 770:Frederick William University 722:{\displaystyle \mathbb {Z} } 428:{\displaystyle \mathbb {Z} } 66:{\displaystyle \mathbb {Z} } 1272: 595:is a polynomial such that 1183:10.1016/j.jnt.2013.11.001 918:algebraic function fields 1170:Journal of Number Theory 1061:English translation in: 942:greatest common divisor 669:is a prime number then 462:{\displaystyle b\geq 2} 1114:10.4153/CJM-1981-080-0 962:Eisenstein's criterion 950:Bunyakovsky conjecture 907: 876: 847: 827: 798: 734:History and extensions 723: 692: 663: 634: 589: 463: 429: 394: 276:) then the polynomial 270: 231: 114: 67: 1211:10.4064/aa8376-5-2016 1091:; Filaseta, Michael; 908: 877: 848: 846:{\displaystyle \leq } 828: 826:{\displaystyle f(10)} 799: 756:is due to Brillhart, 724: 693: 664: 635: 590: 464: 430: 395: 271: 232: 115: 68: 1051:. Springer, Berlin. 886: 882:is irreducible over 875:{\displaystyle f(x)} 857: 837: 808: 797:{\displaystyle f(x)} 779: 702: 691:{\displaystyle p(x)} 673: 662:{\displaystyle p(b)} 644: 599: 477: 447: 408: 282: 241: 128: 104: 46: 1256:Theorems in algebra 992:Murty, Ram (2002). 903: 872: 843: 823: 794: 719: 698:is irreducible in 688: 659: 630: 585: 459: 425: 404:is irreducible in 390: 266: 227: 110: 63: 1074:978-3-540-63686-1 113:{\displaystyle p} 78:polynomials with 16:(Redirected from 1263: 1237: 1215: 1214: 1199:Acta Arithmetica 1194: 1188: 1187: 1185: 1161: 1155: 1154: 1136: 1130: 1125: 1119: 1118: 1116: 1107:(5): 1055–1059. 1085: 1079: 1078: 1060: 1044: 1038: 1036: 1018: 998: 989: 912: 910: 909: 904: 893: 881: 879: 878: 873: 852: 850: 849: 844: 832: 830: 829: 824: 803: 801: 800: 795: 728: 726: 725: 720: 709: 697: 695: 694: 689: 668: 666: 665: 660: 639: 637: 636: 631: 617: 616: 594: 592: 591: 586: 584: 583: 568: 567: 549: 548: 533: 532: 514: 513: 504: 503: 468: 466: 465: 460: 434: 432: 431: 426: 415: 399: 397: 396: 391: 389: 388: 373: 372: 354: 353: 338: 337: 319: 318: 309: 308: 275: 273: 272: 267: 259: 258: 236: 234: 233: 228: 226: 225: 210: 209: 191: 190: 175: 174: 156: 155: 146: 145: 120:is expressed in 119: 117: 116: 111: 72: 70: 69: 64: 53: 21: 1271: 1270: 1266: 1265: 1264: 1262: 1261: 1260: 1241: 1240: 1226: 1223: 1218: 1196: 1195: 1191: 1163: 1162: 1158: 1151: 1138: 1137: 1133: 1126: 1122: 1093:Odlyzko, Andrew 1089:Brillhart, John 1087: 1086: 1082: 1075: 1062: 1046: 1045: 1041: 1025:10.2307/2695645 1016:10.1.1.225.8606 996: 991: 990: 979: 975: 958: 930: 884: 883: 855: 854: 835: 834: 806: 805: 777: 776: 736: 700: 699: 671: 670: 642: 641: 608: 597: 596: 575: 559: 534: 518: 505: 495: 475: 474: 445: 444: 406: 405: 380: 364: 339: 323: 310: 300: 280: 279: 250: 239: 238: 217: 201: 176: 160: 147: 137: 126: 125: 102: 101: 91: 44: 43: 28: 23: 22: 15: 12: 11: 5: 1269: 1267: 1259: 1258: 1253: 1243: 1242: 1239: 1238: 1222: 1221:External links 1219: 1217: 1216: 1189: 1156: 1149: 1131: 1120: 1080: 1073: 1039: 1009:(5): 452–458. 976: 974: 971: 970: 969: 964: 957: 954: 929: 926: 902: 899: 896: 892: 871: 868: 865: 862: 842: 822: 819: 816: 813: 793: 790: 787: 784: 735: 732: 731: 730: 718: 715: 712: 708: 687: 684: 681: 678: 658: 655: 652: 649: 629: 626: 623: 620: 615: 611: 607: 604: 582: 578: 574: 571: 566: 562: 558: 555: 552: 547: 544: 541: 537: 531: 528: 525: 521: 517: 512: 508: 502: 498: 494: 491: 488: 485: 482: 471:natural number 458: 455: 452: 437: 436: 424: 421: 418: 414: 402: 401: 400: 387: 383: 379: 376: 371: 367: 363: 360: 357: 352: 349: 346: 342: 336: 333: 330: 326: 322: 317: 313: 307: 303: 299: 296: 293: 290: 287: 265: 262: 257: 253: 249: 246: 224: 220: 216: 213: 208: 204: 200: 197: 194: 189: 186: 183: 179: 173: 170: 167: 163: 159: 154: 150: 144: 140: 136: 133: 109: 90: 87: 62: 59: 56: 52: 26: 24: 14: 13: 10: 9: 6: 4: 3: 2: 1268: 1257: 1254: 1252: 1249: 1248: 1246: 1235: 1234: 1229: 1225: 1224: 1220: 1212: 1208: 1204: 1200: 1193: 1190: 1184: 1179: 1175: 1171: 1167: 1160: 1157: 1152: 1150:9781400831401 1146: 1142: 1135: 1132: 1129: 1124: 1121: 1115: 1110: 1106: 1102: 1098: 1094: 1090: 1084: 1081: 1076: 1070: 1066: 1058: 1054: 1050: 1043: 1040: 1034: 1030: 1026: 1022: 1017: 1012: 1008: 1004: 1003: 995: 988: 986: 984: 982: 978: 972: 968: 965: 963: 960: 959: 955: 953: 951: 947: 943: 939: 935: 927: 925: 923: 922:finite fields 919: 914: 897: 866: 860: 840: 817: 811: 788: 782: 773: 771: 767: 763: 759: 755: 751: 750: 745: 741: 733: 713: 682: 676: 653: 647: 627: 624: 621: 618: 613: 609: 605: 602: 580: 576: 572: 569: 564: 560: 556: 553: 550: 545: 542: 539: 535: 529: 526: 523: 519: 515: 510: 506: 500: 496: 492: 486: 480: 472: 456: 453: 450: 442: 441: 440: 419: 403: 385: 381: 377: 374: 369: 365: 361: 358: 355: 350: 347: 344: 340: 334: 331: 328: 324: 320: 315: 311: 305: 301: 297: 291: 285: 278: 277: 263: 260: 255: 251: 247: 244: 222: 218: 214: 211: 206: 202: 198: 195: 192: 187: 184: 181: 177: 171: 168: 165: 161: 157: 152: 148: 142: 138: 134: 131: 123: 107: 100: 96: 95: 94: 88: 86: 84: 81: 77: 73: 57: 40: 36: 32: 19: 1231: 1202: 1198: 1192: 1173: 1169: 1159: 1140: 1134: 1123: 1104: 1100: 1083: 1064: 1048: 1042: 1006: 1000: 945: 937: 931: 915: 774: 753: 747: 737: 443:Assume that 438: 99:prime number 92: 83:coefficients 30: 29: 1251:Polynomials 1205:: 137–181. 766:Issai Schur 39:irreducible 1245:Categories 1233:PlanetMath 1037:(dvi file) 973:References 35:polynomial 1176:: 16–49. 1011:CiteSeerX 841:≤ 772:in 1921. 625:− 619:≤ 606:≤ 554:⋯ 543:− 527:− 454:≥ 359:⋯ 348:− 332:− 261:≤ 248:≤ 196:⋯ 185:− 169:− 89:Statement 1095:(1981). 1057:73165700 956:See also 934:converse 928:Converse 758:Filaseta 1033:2695645 762:Odlyzko 237:(where 122:base 10 80:integer 1147:  1071:  1055:  1031:  1013:  760:, and 76:degree 37:to be 1029:JSTOR 997:(PDF) 920:over 744:Szegő 740:Pólya 640:. If 469:is a 97:If a 1145:ISBN 1069:ISBN 1053:OCLC 932:The 742:and 473:and 1207:doi 1203:175 1178:doi 1174:137 1109:doi 1021:doi 1007:109 746:in 124:as 41:in 1247:: 1230:. 1201:. 1172:. 1168:. 1105:33 1103:. 1099:. 1027:. 1019:. 1005:. 999:. 980:^ 924:. 818:10 212:10 178:10 149:10 85:. 1236:. 1213:. 1209:: 1186:. 1180:: 1153:. 1117:. 1111:: 1077:. 1059:. 1035:. 1023:: 946:p 938:p 901:] 898:x 895:[ 891:Z 870:) 867:x 864:( 861:f 821:) 815:( 812:f 792:) 789:x 786:( 783:f 754:b 729:. 717:] 714:x 711:[ 707:Z 686:) 683:x 680:( 677:p 657:) 654:b 651:( 648:p 628:1 622:b 614:i 610:a 603:0 581:0 577:a 573:+ 570:x 565:1 561:a 557:+ 551:+ 546:1 540:k 536:x 530:1 524:k 520:a 516:+ 511:k 507:x 501:k 497:a 493:= 490:) 487:x 484:( 481:p 457:2 451:b 435:. 423:] 420:x 417:[ 413:Z 386:0 382:a 378:+ 375:x 370:1 366:a 362:+ 356:+ 351:1 345:m 341:x 335:1 329:m 325:a 321:+ 316:m 312:x 306:m 302:a 298:= 295:) 292:x 289:( 286:f 264:9 256:i 252:a 245:0 223:0 219:a 215:+ 207:1 203:a 199:+ 193:+ 188:1 182:m 172:1 166:m 162:a 158:+ 153:m 143:m 139:a 135:= 132:p 108:p 61:] 58:x 55:[ 51:Z 20:)

Index

A. Cohn's irreducibility criterion
polynomial
irreducible
Z [ x ] {\displaystyle \mathbb {Z} }
degree
integer
coefficients
prime number
base 10
natural number
Pólya
Szegő
Problems and Theorems in Analysis
Filaseta
Odlyzko
Issai Schur
Frederick William University
algebraic function fields
finite fields
converse
greatest common divisor
Bunyakovsky conjecture
Eisenstein's criterion
Perron's irreducibility criterion




"Prime Numbers and Irreducible Polynomials"
American Mathematical Monthly

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.