{"id":24017,"date":"2025-02-23T07:00:31","date_gmt":"2025-02-23T04:00:31","guid":{"rendered":"https:\/\/w3.bilkent.edu.tr\/en\/?p=24017"},"modified":"2025-03-01T15:49:59","modified_gmt":"2025-03-01T12:49:59","slug":"math-seminar-summation-formulas-in-analytic-number-theory-tomos-parry-700pm-february-28-2025-en","status":"publish","type":"post","link":"https:\/\/w3.bilkent.edu.tr\/en\/math-seminar-summation-formulas-in-analytic-number-theory-tomos-parry-700pm-february-28-2025-en\/","title":{"rendered":"MATH Seminar: \u201cSummation Formulas in Analytic Number Theory\u201d, Tomos Parry, 7:00PM February 28 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>\u201cSummation formulas in analytic number theory\u201d<\/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 \u2013 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\u2019ll prove the above formula, apply it in the case of the divisor function, and show how it leads to Voronoi\u2019s summation formula. This talk will be more involved than the more \u201coverview\u201d style of the last talk, to which we\u2019ll 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) \u201cSummation formulas in analytic number theory\u201d 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\/en\/math-seminar-summation-formulas-in-analytic-number-theory-tomos-parry-700pm-february-28-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":[12],"tags":[],"class_list":["post-24017","post","type-post","status-publish","format-standard","hentry","category-oldposts"],"_links":{"self":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/24017","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/comments?post=24017"}],"version-history":[{"count":1,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/24017\/revisions"}],"predecessor-version":[{"id":24018,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/24017\/revisions\/24018"}],"wp:attachment":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/media?parent=24017"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/categories?post=24017"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/tags?post=24017"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}