A New Sifting function J ( ) n+ 1. prime distribution. Chun-Xuan Jiang P. O. Box 3924, Beijing , P. R. China
|
|
- Frederica Gibbs
- 5 years ago
- Views:
Transcription
1 A New Siftig fuctio J ( ) + ω i prime distributio Chu-Xua Jiag. O. Box 94, Beijig 00854,. R. Chia jiagchuxua@vip.sohu.com Abstract We defie that prime equatios f (, L, ), L, f (, L ) (5) are polyomials (with iteger coefficiets) irreducible over itegers, where,, L are all prime. If siftig fuctio J ( ) 0 + ω = the (5)has fiite prime solutios. If J ( ) 0 + ω the there are ifiitely may primes,, L such that f, L f are primes. We obtai a uite prime formula i prime distributio + ( N, + ) = {, L, N : f, L, f are primes} J + ( ωω ) N = (deg fi ) ( + o()). (8) + +! φ ( ω) log N i= A ew siftig fuctio is accurate sieve fuctio. Usig siftig fuctio we prove about 600 prime theorems [6]. Siftig fuctio provides proofs of the prime theorems which are simple eough to uderstad ad accurate eough to be useful.
2 Mathematicias have tried i vai to discover some order i the sequece of prime umbers but we have every reaso to believe that there are some mysteries which the huma mid will ever peetrate. Leohard Euler It will be aother millio years, at least, before we uderstad the primes. aul Erdös Suppose that Euler totiet fuctio φ( ω) =Π( ) = as ω, () where ω =Π is called primorial. Suppose that ( ω, h i ) =, where i =, L, φ( ω). We have prime equatios = ω+, L, = ω+ h () φ ( ω) φ( ω) where = 0,,, L. ()is called ifiitely may prime equatios (IME). Every equatio has ifiitely may prime solutios. We have ( N) h = ( o()). i = +, () φω ( ) i N i hi(mod ω) where h i deotes the umber of primes i N i i = ω+ h i = 0,,, L, ( N) the umber of primes less tha or equal to N. We replace sets of prime umbers by IME. () is the fudametal tool for provig the prime theorems i prime distributio. Let ω = 0 ad φ (0) = 8. From () we have eight prime equatios = 0+, = 0+ 7, = 0+, 4 = 0+, 5 = 0+ 7, 6 = 0+ 9, 7 = 0+, 8 = 0+ 9, = 0,,, L (4) Every equatio has ifiitely may prime solutios. THEOREM. We defie that prime equatios f (, L, ), L, f (, L, ) (5)
3 are polyomials (with iteger coefficiets) irreducible over itegers, where,, L are primes. If siftig fuctio J ( ) = 0 the (5) has fiite prime solutios. If J + ( ω) 0 the there exist ifiitely may primes, L, such that each f is a prime. ROOF. Firstly, we have siftig fuctio [-] + + ω J ( ω) =Π[( ) χ( )], (6) where χ ( ) is called sieve costat ad deotes the umber of solutios for the followig cogruece Π f ( q, L, q ) 0 (mod ), (7) i= where q =, L,, L, q =, L,. i J ( ) + ω deotes the umber of sets of, L, prime equatios such that f(, L, ), L, f(, L, ) are prime equatios. If J ( ) 0 + ω = the (5) has fiite prime solutios. If J ( ) 0 + ω usig χ ( ) we sift out from () prime equatios which ca ot be represeted,, L, the residual prime equatios of () are,, L prime equatios such that f(, L, ), L, f(, L, ) are prime equatios. Therefore we prove that there exist ifiitely may primes,, L such that f (, L, ), L, f(, L, ) are primes. Secodly, we have the best asymptotic formula [,,4,6] + ( N, + ) = {, L, N : f, L, f are primes} J + ( ωω ) N = (deg fi ) ( + o()). (8) + +! φ ( ω) log N i= (8)is called a uite prime formula i prime distributio. Let =, = 0, J ( ω) φω ( ) =. From (8) we have prime umber theorem N ( N, ) = { N: is prime } = ( + o()).. (9) log N
4 Number theorists believe that there are ifiitely may twi primes, but they do ot have rigorous proof of this old cojecture by ay method. All prime theorems are cojectures except the prime umber theorem, because they do ot prove that prime equatios have ifiitely may prime solutios. We prove the followig cojectures by this theorem. Example. Twi primes +, (00BC). From (6) ad (7) we have siftig fuctio J ( ω) = Π( ) 0. Sice J ( ) 0 ω i () exist ifiitely may prime equatios such that + is a prime equatio. Therefore we prove that there are ifiitely may primes such that + is a prime. Let ω = 0 ad J (0) =. From (4) we have three prime equatios = 0+, = 0+ 7, = J( ω) ω N ( N,) = { N : + prime } = ( o()) φ ( ω) log N + N = Π ( o()). + ( ) log N I 996 we proved twi primes cojecture [] Remar. J ( ) ω deotes the umber of prime equatios, ω N ( + o()) the umber of solutios of primes for every prime φ ( ω) log N equatio. Example. Eve Goldbach s cojecture N = +. Every eve umber N 6 is the sum of two primes. 4
5 From (6) ad (7) we have siftig fuctio J( ω) =Π( ) Π 0. N Sice J ( ω) 0 as N i () exist ifiitely may prime equatios such that N is a prime equatio. Therefore we prove that every eve umber N 6 is the sum of two primes. J( ω) ω N ( N, ) = { N, N prime } = ( o()). φ ( ω) log N + N = Π ( o()) Π +. ( ) N log N I 996 we proved eve Goldbach s cojecture [] Example. rime equatios, +, + 6. From (6) ad (7) we have siftig fuctio J ( ω) =Π( ) 0, 5 J ( ) ω is deotes the umber of prime equatios such that + ad + 6 are prime equatios. Sice J ( ω) 0 i () exist ifiitely may prime equatios such that + ad + 6 are prime equatios. Therefore we prove that there are ifiitely may primes such that + ad + 6 are primes. Let ω = 0, J(0) =. From (4) we have two prime equatios = 0+, = J ( ω) ω N ( N,) = { N : +, + 6are primes} = ( + o()). φ ( ω) log N Example 4. Odd Goldbach s cojecture N = + +. Every odd umber N 9 is the sum of three primes. 5
6 From (6) ad (7) we have siftig fuctio J( ω) =Π( + ) ) Π 0 N. + Sice J ( ω) 0 as N i () exist ifiitely may pairs of ad prime equatios such that N is a prime equatio. Therefore we prove that every odd umber N 9 is the sum of three primes. J( ωω ) N ( N,) = {, N : N prime } = ( o()) φ ( ω) log N +. N =Π + ( ()) Π o +. ( ) N + log N Example 5. rime equatio = +. From (6) ad (7) we have siftig fuctio ( ) J ( ω) =Π + 0 J ( ω ) deotes the umber of pairs of ad prime equatios such that is a prime equatio. Sice J ( ) 0 ω i () exist ifiitely may pairs of ad prime equatios such that is a prime equatio. Therefore we prove that there are ifiitely may pairs of primes ad such that is a prime. J( ωω ) N ( N, ) = {, N : + prime } = ( o()). 4 φ ( ω) log N + Note. deg ( ) =. Example 6 []. rime equatio = +. From (6) ad (7) we have siftig fuctio J, ( ω) =Π ( ) χ( ) 0 6
7 where χ ( ) = ( ) if χ ( ) = otherwise. (mod ) ; χ ( ) = 0 if / (mod ) ; Sice J ( ω) 0 i () there are ifiitely may pairs of ad prime equatios such that is a prime equatio. Therefore we prove that there are ifiitely may pairs of primes ad such that is a prime. ( J ( ω) ω N N,) = {, N : + prime} = ( + o()). 6φ ( ω) log N 4 Example 7 []. rime equatio = + ( + ). From (6) ad (7) we have siftig fuctio J ( ω) =Π ( ) χ( ) 0 where χ ( ) = ( ) if (mod 4) ; χ ( ) = ( ) if (mod8) ; χ ( ) = 0 otherwise. Sice J ( ω) 0 i () there are ifiitely may pairs of ad prime equatios such that is a prime equatio. Therefore we prove that there are ifiitely may pairs of primes ad such that is a prime. J( ωω ) N ( N,) = {, N : prime } = ( o()). 8 φ ( ω) log N + Example 8 [4-0]. Arithmetic progressios cosistig oly of primes. We defie the arithmetic progressios of legth., = + d, = + d, L, = + ( ) d,(, d) =. (0) ( N,) = { N :, + d, L, + ( ) d are primes} 7
8 ( ) J ωω N = ( + o()).. φ ( ω) log N If J ( ω ) = 0 the (0) has fiite prime solutios. If J ( ) 0 ω the there are ifiitely may primes such that,, L are primes. To elimiate d from (0) we have =, = ( j ) ( j ), j. j From (6) ad (7) we have siftig fuctio J ( ω) = Π ( ) Π( )( + ) 0 < Sice J ( ω) 0 i () there are ifiitely may pairs of ad prime equatios such that, L, are prime equatios. Therefore we prove that there are ifiitely may pairs of primes ad such that,, L are primes. { } = ( N,), N : ( j ) ( j ) prime, j ( ) J ωω N = ( + o()) φ ( ω) log N ( + ) N = Π Π ( + o()). < ( ) ( ) log N Example 9. It is a well-ow cojecture that oe of, +, + is always divisible by. To geeralize above to the primes, we prove the followig cojectures. Let be a square-free eve umber.., +, +, where ( + ). From (6) ad (7) we have J () = 0, hece oe of, +, + is always divisible by. 4., +, +, L, +, 8
9 where 5( + b), b=,. From (6) ad (7) we have J (5) = 0, hece oe of 4, +, +, L, + is always divisible by 5. 6., +, +, L, +, where 7( + b), b=,4. From (6) ad (7) we have J (7) = 0, hece oe of 6, +, +, L, + is always divisible by , +, +, L, +, where ( + b), b=,4,5,9. From (6) ad (7) we have J () = 0, hece oe of 0, +, +, L, + is always divisible by. 5., +, +, L, +, where ( + b), b=,6,7,. From (6) ad (7) we have J () = 0, hece oe of, +, +, L, + is always divisible by. 6 6., +, +, L, +, where 7 ( + b), b=,5,6,7,0,,,4,5. From (6) ad (7) we have J (7) = 0, hece oe of 6, +, +, L, + is always divisible by , +, +, L, +, where 9 ( + b), b= 4,5,6,9,6.7. From (6) ad (7) we have J (9) = 0, hece oe of 8, +, +, L, + is always divisible by 9. Example 0. Let be a eve umber. i., +, i=,,5, L,+, From (6) ad (7) we have J ( ω) 0. Therefore we prove that there exist i ifiitely may primes such that, + are primes for ay. i., +, i=, 4,6, L,. From (6) ad (7) we have J ( ω) 0. Therefore we prove that there exist i ifiitely may primes such that, + are primes for ay. 9
10 Example. rime equatio = + From (6) ad (7) we have siftig fuctio J ω =Π +. ( ) ( ) 0 Sice J ( ω) 0 i () there are ifiitely may pairs of ad prime equatios such that is prime equatios. Therefore we prove that there are ifiitely may pairs of primes ad such that is a prime. J( ωω ) N ( N,) = {, N : prime } = ( o()). φ ( ω) log N + I the same way we ca prove = + which has the same siftig fuctio. Siftig fuctio is accurate sieve fuctio. Usig it we ca prove ay irreducible prime equatios i prime distributio. There are ifiitely may twi primes but we do ot have rigorous proof of this old cojecture by ay method [0]. As strog as the umerical evidece may be, we still do ot eve ow whether there are ifiitely may pairs of twi primes []. All prime theorems are cojectures except the prime umber theorem, because they do ot prove the simplest twi primes. They cojecture that the prime distributio is radomess [-5], because they do ot uderstad theory of prime umbers. Acowledgemets The Author would lie to express his deepest appreciatio to M. N. Huxley, R. M. Satilli, L. Schadec ad G. Weiss for their helps ad supports. Refereces [] Chu-Xua Jiag, O the Yu-Goldbach prime theorem, Guagxi Scieces (Chiese) (996), 9-. [] Chu-Xua Jiag, Foudatios of Satilli s isoumber theory, art I, Algebras Groups ad Geometries, 5(998), 5-9. [] ChuXua Jiag, Foudatios of Satilli s isoumber theory, art II, Algebras Groups ad Geometries, 5(998),
11 [4] Chu-Xua Jiag, Foudatios Satilli s isoumber theory, I: Fudametal ope problems i scieces at the ed of the milleium, T. Gill, K. Liu ad E. Trell (Eds) Hadroic ress, USA, (999), [5] Chu-Xua Jiag, roof of Schizel s hypothesis, Algebras Groups ad Geometries, 8(00), [6] Chu-Xua Jiag, Foudatios of Satilli s isomuber theory with applicatios to ew cryptograms, Fermat s theorem ad Goldbach s cojecture, Iter. Acad. ress, 00, MR004c: 00, [7] Chu-Xua Jiag,rime theorem i Satilli s isoumber theory, 9(00), [8] Chu-Xua Jiag, rime theorem i Satilli s isoumber theory (II), Algebras Groups ad Geometries, 0(00), [9] Chu-Xua Jiag, Disproof s of Riema s hypothesis, Algebras Groups ad Geometries, (005), Riema.pdf [0] Chu-Xua Jiag, Fiftee cosecutive itegers with exactly prime factors, Algebras Groups ad Geometries, (006), 9-4. [] Chu-Xua Jiag, The simplest proofs of both arbitrarily log arithmetic progressios of primes, preprit, 006. [] D. R. Heath-Brow, rimes represeted by x + y, Acta Math., 86 (00), -84. [] J. Friedlader ad H. Iwaiec, The polyomial x + y 4 captures its primes, A. Math., 48(998), [4] E. Szemerédi, O sets of itegers cotaiig o elemets i arithmetic progressios, Acta Arith., 7(975), [5] H. Fursteberg, Ergodic behavior of diagoal measures ad a theorem of Szemerédi o arithmetic progressios, J. Aalyse Math., (997), [6] W. T. Gowers, A ew proof of Szemerédi s theorem, GAFA, (00), [7] B. Kra, The Gree-Tao theorem o arithmetic progressios i the primes: A ergodic poit of view, Bull. Amer. Math. Soc., 4(006), -. [8] B. Gree ad T. Tao, The primes cotai arbitrarily log arithmetic
12 progressios, A. Math., 67(08), [9] T. Tao, The dichotomy betwee structure ad radomess, arithmetic progressios, ad the primes, I: roceedigs of the iteratioal cogress of mathematicias (Madrid. 006), Europ. Math. Soc. Vol , 007. [0] B. Gree, Log arithmetic progressios of primes, Clay Mathematics roceedigs Vol. 7, 007, [] H. Iwaice ad E. Kowalsi, Aalytic umber theory, Amer. Math. Soc., rovidece, RI, 004 [] R. Cradall ad C. omerace, rime umbers a computatioal perspective, Sprig-Verlag, New Yor, 005. [] B. Gree, Geeralisig the Hardy-Littlewood method for primes, I: roceedigs of the iteratioal cogress of mathematicias (Madrid. 006), Europ. Math. Soc., Vol. II, 7-99, 007. [4] K. Soudararaja, Small gaps betwee prime umbers: The wor of Goldsto-itz-Yildirim, Bull. Amer. Math. Soc., 44(007), -8. [5] A. Graville, Harald Cramér ad distributio of prime umbers, Scad. Actuar. J, 995() (995), -8.
Diophantine Equation. Has Infinitely Many Prime Solutions
Diophatie Equatio + L+ λ + λ λ + L+ Has Ifiitely May rime Solutios Chu-Xua iag. O. Box 9, Beijig 0085,. R. Chia liukxi @ public. bta. et. c Abstract By usig the arithmetic fuctio we prove that Diophatie
More informationThe Simplest Proofs of Both Arbitrarily Long. Arithmetic Progressions of primes. Abstract
The Simplest Proofs of Both Arbitrarily Lo Arithmetic Proressios of primes Chu-Xua Jia P. O. Box 94, Beiji 00854 P. R. Chia cxjia@mail.bcf.et.c Abstract Usi Jia fuctios J ( ω ), J ( ω ) ad J ( ) 4 ω we
More informationRiemann Paper (1859) Is False
Riema Paper (859) I Fale Chu-Xua Jiag P O Box94, Beijig 00854, Chia Jiagchuxua@vipohucom Abtract I 859 Riema defied the zeta fuctio ζ () From Gamma fuctio he derived the zeta fuctio with Gamma fuctio ζ
More information(I.C) THE DISTRIBUTION OF PRIMES
I.C) THE DISTRIBUTION OF PRIMES I the last sectio we showed via a Euclid-ispired, algebraic argumet that there are ifiitely may primes of the form p = 4 i.e. 4 + 3). I fact, this is true for primes of
More informationCramérs Conjecture. Roupam Ghosh B.Sc.(Computer Science), 2007 University of Pune Pune, India.
Cramérs Cojecture arxiv:1009.109v1 [math.gm] 3 Sep 010 Roupam Ghosh B.Sc.Computer Sciece, 007 Uiversity of Pue Pue, Idia Email: roupam.ghosh@gmail.com September 7, 010 Abstract I this paper we prove the
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationFermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.
Departmet of Mathematical Scieces Istructor: Daiva Puciskaite Discrete Mathematics Fermat s Little Theorem 43.. For all a Z 3, calculate a 2 ad a 3. Case a = 0. 0 0 2-times Case a 0. 0 0 3-times a a 2-times
More informationFIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser
FIR Filters Lecture #7 Chapter 5 8 What Is this Course All About? To Gai a Appreciatio of the Various Types of Sigals ad Systems To Aalyze The Various Types of Systems To Lear the Skills ad Tools eeded
More informationOn a Smarandache problem concerning the prime gaps
O a Smaradache problem cocerig the prime gaps Felice Russo Via A. Ifate 7 6705 Avezzao (Aq) Italy felice.russo@katamail.com Abstract I this paper, a problem posed i [] by Smaradache cocerig the prime gaps
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More information素数分布中蒋函数 蒋春暄. 应该是 ν (log N ) k, 不是 ν 2 (log N ) k 他们 66 页论文没有直接讨论素
素数分布中蒋函数 蒋春暄 777 年最伟大数学家 Euler 说 : 数学家还没有发现素数序列中的一些规则 我们有理由相信它是一个人类智慧尚未洞悉的奥秘 0 世纪最伟大数学家 Erdös 说 : 至少还需要 00 万年, 我们才能真正理解素数 说明素数研究多么困难! 多么复杂! 但是我的兴趣就是要研究没有人研究的问题 用我的思路 我的方法进行研究 不管这个问题多么困难 这篇论文是把我过去对素数研究作一个总结,
More informationEISENSTEIN S CRITERION, FERMAT S LAST THEOREM, AND A CONJECTURE ON POWERFUL NUMBERS arxiv: v6 [math.ho] 13 Feb 2018
EISENSTEIN S CRITERION, FERMAT S LAST THEOREM, AND A CONJECTURE ON POWERFUL NUMBERS arxiv:174.2885v6 [math.ho] 13 Feb 218 PIETRO PAPARELLA Abstract. Give itegers l > m >, moic polyomials X, Y, ad Z are
More informationAn analog of the arithmetic triangle obtained by replacing the products by the least common multiples
arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationHow many prime numbers are there?
CHAPTER I: PRIME NUMBERS Sectio : Types of Primes I the previous sectios, we saw the importace of prime umbers. But how may prime umbers are there? How may primes are there less tha a give umber? Do they
More information+ au n+1 + bu n = 0.)
Lecture 6 Recurreces - kth order: u +k + a u +k +... a k u k 0 where a... a k are give costats, u 0... u k are startig coditios. (Simple case: u + au + + bu 0.) How to solve explicitly - first, write characteristic
More informationTRIGONOMETRIC POLYNOMIALS WITH MANY REAL ZEROS AND A LITTLEWOOD-TYPE PROBLEM. Peter Borwein and Tamás Erdélyi. 1. Introduction
TRIGONOMETRIC POLYNOMIALS WITH MANY REAL ZEROS AND A LITTLEWOOD-TYPE PROBLEM Peter Borwei ad Tamás Erdélyi Abstract. We examie the size of a real trigoometric polyomial of degree at most havig at least
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationGPF SEQUENCES Lisa Scheckelhoff CAPSTONE PROJECT
MATHEMATICS BONUS FILES for faculty ad studets http://www2.ou.edu/~mcaragiu/bous_files.html GPF SEQUENCES Lisa Schecelhoff CAPSTONE PROJECT Sprig 2006 Departmet of Mathematics OHIO NORTHERN UNIVERSITY
More informationOn Some Properties of Digital Roots
Advaces i Pure Mathematics, 04, 4, 95-30 Published Olie Jue 04 i SciRes. http://www.scirp.org/joural/apm http://dx.doi.org/0.436/apm.04.46039 O Some Properties of Digital Roots Ilha M. Izmirli Departmet
More informationRamanujan s Famous Partition Congruences
Ope Sciece Joural of Mathematics ad Applicatio 6; 4(): - http://wwwopescieceoliecom/joural/osjma ISSN:8-494 (Prit); ISSN:8-494 (Olie) Ramauja s Famous Partitio Cogrueces Md Fazlee Hossai, Nil Rata Bhattacharjee,
More informationSuper congruences concerning Bernoulli polynomials. Zhi-Hong Sun
It J Numer Theory 05, o8, 9-404 Super cogrueces cocerig Beroulli polyomials Zhi-Hog Su School of Mathematical Scieces Huaiyi Normal Uiversity Huaia, Jiagsu 00, PR Chia zhihogsu@yahoocom http://wwwhytceduc/xsjl/szh
More informationObjective Mathematics
. If sum of '' terms of a sequece is give by S Tr ( )( ), the 4 5 67 r (d) 4 9 r is equal to : T. Let a, b, c be distict o-zero real umbers such that a, b, c are i harmoic progressio ad a, b, c are i arithmetic
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationSOLVING THE CONGRUENT NUMBER PROBLEM IS SOLVING THE ELLIPTIC CURVE PROBLEM
Joural of Pure ad Applied Mathematics: Advaces ad Applicatios Volume 17, Number, 017, Pages 77-87 Available at http://scietificadvaces.co.i DOI: http://dx.doi.org/10.1864/jpamaa_71001178 SOLVING THE CONGRUENT
More informationLecture 1. January 8, 2018
Lecture 1 Jauary 8, 018 1 Primes A prime umber p is a positive iteger which caot be writte as ab for some positive itegers a, b > 1. A prime p also have the property that if p ab, the p a or p b. This
More informationRELATING THE RIEMANN HYPOTHESIS AND THE PRIMES BETWEEN TWO CUBES
RELATING THE RIEMANN HYPOTHESIS AND THE PRIMES BETWEEN TWO CUBES COPIL, Vlad Faculty of Mathematics-Iformatics, Spiru Haret Uiversity, vcopilmi@spiruharetro Abstract I this paper we make a evaluatio for
More informationProc. Amer. Math. Soc. 139(2011), no. 5, BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS
Proc. Amer. Math. Soc. 139(2011, o. 5, 1569 1577. BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS Zhi-Wei Su* ad Wei Zhag Departmet of Mathematics, Naig Uiversity Naig 210093, People s Republic of
More informationProof of Fermat s Last Theorem by Algebra Identities and Linear Algebra
Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More informationOn Divisibility concerning Binomial Coefficients
A talk give at the Natioal Chiao Tug Uiversity (Hsichu, Taiwa; August 5, 2010 O Divisibility cocerig Biomial Coefficiets Zhi-Wei Su Najig Uiversity Najig 210093, P. R. Chia zwsu@ju.edu.c http://math.ju.edu.c/
More informationand each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More informationTHE ZETA FUNCTION AND THE RIEMANN HYPOTHESIS. Contents 1. History 1
THE ZETA FUNCTION AND THE RIEMANN HYPOTHESIS VIKTOR MOROS Abstract. The zeta fuctio has bee studied for ceturies but mathematicias are still learig about it. I this paper, I will discuss some of the zeta
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationThe 4-Nicol Numbers Having Five Different Prime Divisors
1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 14 (2011), Article 11.7.2 The 4-Nicol Numbers Havig Five Differet Prime Divisors Qiao-Xiao Ji ad Mi Tag 1 Departmet of Mathematics Ahui Normal Uiversity
More informationOn the Foundamental Theorem in Arithmetic. Progession of Primes
On the Foundamental Theorem in Arithmetic roession of rimes Chun-Xuan ian. O. Box 9 Beijin 008. R. China jianchunxuan@vip.sohu.com Abstract Usin ian function we prove the foundamental theorem in arithmetic
More informationClassroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in
Classroom I this sectio of Resoace, we ivite readers to pose questios likely to be raised i a classroom situatio. We may suggest strategies for dealig with them, or ivite resposes, or both. Classroom is
More information( N) Chun-Xuan Jiang. P. O. Box 3924, Beijing , P. R. China
ang s functon n ( ) n prme dstrbuton Chun-Xuan ang P O Box 94, Bejng 00854, P R Chna jcxuan@snacom Abstract: We defne that prme equatons f( P,, Pn ),, f ( P, Pn ) (5)are polynomals (wth nteger coeffcents)
More informationEntire Functions That Share One Value with One or Two of Their Derivatives
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 223, 88 95 1998 ARTICLE NO. AY985959 Etire Fuctios That Share Oe Value with Oe or Two of Their Derivatives Gary G. Guderse* Departmet of Mathematics, Ui
More informationUnit 6: Sequences and Series
AMHS Hoors Algebra 2 - Uit 6 Uit 6: Sequeces ad Series 26 Sequeces Defiitio: A sequece is a ordered list of umbers ad is formally defied as a fuctio whose domai is the set of positive itegers. It is commo
More informationON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS
ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationCALCULUS BASIC SUMMER REVIEW
CALCULUS BASIC SUMMER REVIEW NAME rise y y y Slope of a o vertical lie: m ru Poit Slope Equatio: y y m( ) The slope is m ad a poit o your lie is, ). ( y Slope-Itercept Equatio: y m b slope= m y-itercept=
More informationMATH 6101 Fall Problems. Problems 11/9/2008. Series and a Famous Unsolved Problem (2-1)(2 + 1) ( 4) 12-Nov-2008 MATH
/9/008 MATH 60 Fall 008 Series ad a Famous Usolved Problem = = + + + + ( - )( + ) 3 3 5 5 7 7 9 -Nov-008 MATH 60 ( 4) = + 5 48 -Nov-008 MATH 60 3 /9/008 ( )! = + -Nov-008 MATH 60 4 3 4 5 + + + + + + +
More informationREGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS
REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]
More informationMATH 6101 Fall 2008 Series and a Famous Unsolved Problem
MATH 60 Fall 2008 Series ad a Famous Usolved Problem Problems = + + + + = (2- )(2+ ) 3 3 5 5 7 7 9 2-Nov-2008 MATH 60 2 Problems ( 4) = + 25 48 2-Nov-2008 MATH 60 3 Problems ( )! = + 2-Nov-2008 MATH 60
More information1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.
.3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationDifferent kinds of Mathematical Induction
Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationSection 7 Fundamentals of Sequences and Series
ectio Fudametals of equeces ad eries. Defiitio ad examples of sequeces A sequece ca be thought of as a ifiite list of umbers. 0, -, -0, -, -0...,,,,,,. (iii),,,,... Defiitio: A sequece is a fuctio which
More informationM17 MAT25-21 HOMEWORK 5 SOLUTIONS
M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationSantilli s Isoprime Theory
Santilli s Isoprime Theory Chun-Xuan. Jiang P. O. Box 94, Beijing 00854 P. R. China jiangchunxuan@vip.sohu.com Dedicated to the 0-th anniversary of harmonic mechanics Abstract We establish the Santilli
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationLargest families without an r-fork
Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationThe Riemann Zeta Function
Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we
More informationTHE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours
THE 06-07 KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: hours Let x, y, ad A all be positive itegers with x y a) Prove that there are
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationk-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction
Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k)
More information2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.
CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.
More informationAn application of the Hooley Huxley contour
ACTA ARITHMETICA LXV. 993) A applicatio of the Hooley Huxley cotour by R. Balasubramaia Madras), A. Ivić Beograd) ad K. Ramachadra Bombay) To the memory of Professor Helmut Hasse 898 979). Itroductio ad
More informationM A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationPerfect Numbers 6 = Another example of a perfect number is 28; and we have 28 =
What is a erfect umber? Perfect Numbers A erfect umber is a umber which equals the sum of its ositive roer divisors. A examle of a erfect umber is 6. The ositive divisors of 6 are 1,, 3, ad 6. The roer
More informationSOME NEW OBSERVATIONS ON MERSENNE NUMBERS AND PRIMES
SOME NEW OBSERVATIONS ON MERSENNE NUMBERS AND PRIMES Euclid observed several thousad years ago i his boo The Elemets that - 1+=3 1++4=7 1++4+8=15 1++4+8+16=31 1++4+8+16+3=63 1++4+8+16+3+64=17 1++4+8+16+3+64+18=55
More informationSequences of Definite Integrals, Factorials and Double Factorials
47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology
More information(I.D) THE PRIME NUMBER THEOREM
(I.D) THE PRIME NUMBER THEOREM So far, i our discussio of the distributio of the primes, we have ot directly addressed the questio of how their desity i the atural umbers chages as oe keeps coutig. But
More informationINEQUALITIES BJORN POONEN
INEQUALITIES BJORN POONEN 1 The AM-GM iequality The most basic arithmetic mea-geometric mea (AM-GM) iequality states simply that if x ad y are oegative real umbers, the (x + y)/2 xy, with equality if ad
More informationMa 530 Infinite Series I
Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li
More informationAddition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c
Notes for March 31 Fields: A field is a set of umbers with two (biary) operatios (usually called additio [+] ad multiplicatio [ ]) such that the followig properties hold: Additio: Name Descriptio Commutativity
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationAsymptotic Formulae for the n-th Perfect Power
3 47 6 3 Joural of Iteger Sequeces, Vol. 5 0, Article.5.5 Asymptotic Formulae for the -th Perfect Power Rafael Jakimczuk Divisió Matemática Uiversidad Nacioal de Lujá Bueos Aires Argetia jakimczu@mail.ulu.edu.ar
More informationDr. Clemens Kroll. Abstract
Riema s Hypothesis ad Stieltjes Cojecture Riema s Hypothesis ad Stieltjes Cojecture Dr. Clemes Kroll Abstract It is show that Riema s hypothesis is true by showig that a equivalet statemet is true. Eve
More informationFactors of sums and alternating sums involving binomial coefficients and powers of integers
Factors of sums ad alteratig sums ivolvig biomial coefficiets ad powers of itegers Victor J. W. Guo 1 ad Jiag Zeg 2 1 Departmet of Mathematics East Chia Normal Uiversity Shaghai 200062 People s Republic
More informationNEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE
UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece
More informationDiscrete Math Class 5 ( )
Discrete Math 37110 - Class 5 (2016-10-11 Istructor: László Babai Notes tae by Jacob Burroughs Revised by istructor 5.1 Fermat s little Theorem Theorem 5.1 (Fermat s little Theorem. If p is prime ad gcd(a,
More informationPROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7).
PROBLEM SET 5 SOLUTIONS 1 Fid every iteger solutio to x 17x 5 0 mod 45 Solutio We rove that the give cogruece equatio has o solutios Suose for cotradictio that the equatio x 17x 5 0 mod 45 has a solutio
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationOn triangular billiards
O triagular billiars Abstract We prove a cojecture of Keyo a Smillie cocerig the oexistece of acute ratioal-agle triagles with the lattice property. MSC-iex: 58F99, 11N25 Keywors: Polygoal billiars, Veech
More informationInfinite Series and Improper Integrals
8 Special Fuctios Ifiite Series ad Improper Itegrals Ifiite series are importat i almost all areas of mathematics ad egieerig I additio to umerous other uses, they are used to defie certai fuctios ad to
More informationSome remarks for codes and lattices over imaginary quadratic
Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract
More informationGaps between Consecutive Perfect Powers
Iteratioal Mathematical Forum, Vol. 11, 016, o. 9, 49-437 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1988/imf.016.63 Gaps betwee Cosecutive Perfect Powers Rafael Jakimczuk Divisió Matemática, Uiversia
More informationECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002
ECE 330:541, Stochastic Sigals ad Systems Lecture Notes o Limit Theorems from robability Fall 00 I practice, there are two ways we ca costruct a ew sequece of radom variables from a old sequece of radom
More informationMath 2112 Solutions Assignment 5
Math 2112 Solutios Assigmet 5 5.1.1 Idicate which of the followig relatioships are true ad which are false: a. Z Q b. R Q c. Q Z d. Z Z Z e. Q R Q f. Q Z Q g. Z R Z h. Z Q Z a. True. Every positive iteger
More informationarxiv: v1 [math.nt] 5 Jan 2017 IBRAHIM M. ALABDULMOHSIN
FRACTIONAL PARTS AND THEIR RELATIONS TO THE VALUES OF THE RIEMANN ZETA FUNCTION arxiv:70.04883v [math.nt 5 Ja 07 IBRAHIM M. ALABDULMOHSIN Kig Abdullah Uiversity of Sciece ad Techology (KAUST, Computer,
More informationA collocation method for singular integral equations with cosecant kernel via Semi-trigonometric interpolation
Iteratioal Joural of Mathematics Research. ISSN 0976-5840 Volume 9 Number 1 (017) pp. 45-51 Iteratioal Research Publicatio House http://www.irphouse.com A collocatio method for sigular itegral equatios
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty
More informationPolynomial and Rational Functions. Polynomial functions and Their Graphs. Polynomial functions and Their Graphs. Examples
Polomial ad Ratioal Fuctios Polomial fuctios ad Their Graphs Math 44 Precalculus Polomial ad Ratioal Fuctios Polomial Fuctios ad Their Graphs Polomial fuctios ad Their Graphs A Polomial of degree is a
More informationSEQUENCES AND SERIES
Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces
More informationPERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z
PERIODS OF FIBONACCI SEQUENCES MODULO m ARUDRA BURRA Abstract. We show that the Fiboacci sequece modulo m eriodic for all m, ad study the eriod i terms of the modulus.. Prelimiaries Defiitio. A geeralized
More informationA generalization of Morley s congruence
Liu et al. Advaces i Differece Euatios 05 05:54 DOI 0.86/s366-05-0568-6 R E S E A R C H Ope Access A geeralizatio of Morley s cogruece Jiaxi Liu,HaoPa ad Yog Zhag 3* * Correspodece: yogzhag98@63.com 3
More informationUnit 4: Polynomial and Rational Functions
48 Uit 4: Polyomial ad Ratioal Fuctios Polyomial Fuctios A polyomial fuctio y px ( ) is a fuctio of the form p( x) ax + a x + a x +... + ax + ax+ a 1 1 1 0 where a, a 1,..., a, a1, a0are real costats ad
More information