{"id":33780,"date":"2025-02-23T07:00:28","date_gmt":"2025-02-23T04:00:28","guid":{"rendered":"https:\/\/w3.bilkent.edu.tr\/tr\/?p=33780"},"modified":"2025-03-01T15:42:03","modified_gmt":"2025-03-01T12:42:03","slug":"math-semineri-summation-formulas-in-analytic-number-theory-tomos-parry-1900-28-subat-2025-en","status":"publish","type":"post","link":"https:\/\/w3.bilkent.edu.tr\/tr\/math-semineri-summation-formulas-in-analytic-number-theory-tomos-parry-1900-28-subat-2025-en\/","title":{"rendered":"MATH Semineri: \u201cSummation Formulas in Analytic Number Theory\u201d, Tomos Parry, 19:00 28 \u015eubat 2025 (EN)"},"content":{"rendered":"<p>You are cordially invited to the Number Theory Seminar organized by the Department of Mathematics.<\/p>\n<p>Speaker: Tomos Parry (Bilkent)<\/p>\n<p>&#8220;Summation formulas in analytic number theory&#8221;<\/p>\n<p>Abstract: Let \u03c0(x) be the number of primes up to x. If you want to count primes then you can write the count as an integral in the complex plane<\/p>\n<p>x \u03c0()=\u222b_(2-i\u221e)^(2+i\u221e)\u2592\u3016P(s) x^s\/s ds\u3017 where P(s)=\u2211_p\u25921\/p^s<\/p>\n<p>Analysing the complex analytic properties on the RHS then lets you say something about the arithmetic problem on the LHS &#8211; this is the classical proof of the Prime Number Theorem.<\/p>\n<p>This seminar is the second of 5-6 seminars in this mini seminar series. Last week we showed how the above is an example of Mellin inversion and this week we&#8217;ll prove the above formula, apply it in the case of the divisor function, and show how it leads to Voronoi&#8217;s summation formula. This talk will be more involved than the more &#8220;overview&#8221; style of the last talk, to which we&#8217;ll return next week.<\/p>\n<p>Date: Friday, Feb 28, 2025<br \/>\nTime: 19:00<br \/>\nPlace: SB-Z11<\/p>\n","protected":false},"excerpt":{"rendered":"<p>You are cordially invited to the Number Theory Seminar organized by the Department of Mathematics. Speaker: Tomos Parry (Bilkent) &#8220;Summation formulas in analytic number theory&#8221; Abstract: Let \u03c0(x) be the number of primes up to x. If you want to count primes then you can write the count as an [\u2026] <\/p>\n<div class=\"clear\"><\/div>\n<p><a class=\"more_link clearfix\" href=\"https:\/\/w3.bilkent.edu.tr\/tr\/math-semineri-summation-formulas-in-analytic-number-theory-tomos-parry-1900-28-subat-2025-en\/\" rel=\"nofollow\">Read More<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[22],"tags":[],"class_list":["post-33780","post","type-post","status-publish","format-standard","hentry","category-eskipostlar"],"_links":{"self":[{"href":"https:\/\/w3.bilkent.edu.tr\/tr\/wp-json\/wp\/v2\/posts\/33780","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/w3.bilkent.edu.tr\/tr\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/w3.bilkent.edu.tr\/tr\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/tr\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/tr\/wp-json\/wp\/v2\/comments?post=33780"}],"version-history":[{"count":1,"href":"https:\/\/w3.bilkent.edu.tr\/tr\/wp-json\/wp\/v2\/posts\/33780\/revisions"}],"predecessor-version":[{"id":33781,"href":"https:\/\/w3.bilkent.edu.tr\/tr\/wp-json\/wp\/v2\/posts\/33780\/revisions\/33781"}],"wp:attachment":[{"href":"https:\/\/w3.bilkent.edu.tr\/tr\/wp-json\/wp\/v2\/media?parent=33780"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/tr\/wp-json\/wp\/v2\/categories?post=33780"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/tr\/wp-json\/wp\/v2\/tags?post=33780"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}