BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//23.229.142.224//NONSGML kigkonsult.se iCalcreator 2.26.9//
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:IEEE Boston
X-WR-CALDESC:Serving Eastern Massachusetts\, and throughout New England
X-FROM-URL:http://ieeeboston.org
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:STANDARD
DTSTART:20191103T020000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RDATE:20201101T020000
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20190310T020000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RDATE:20200308T020000
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:ai1ec-4919@ieeeboston.org
DTSTAMP:20190717T131015Z
CATEGORIES;LANGUAGE=en-US:All Meetings
CONTACT:
DESCRIPTION:IEEE Computer Society and GBC/ACM\nMIT Room 32-D463 (Star)\nThi
s talk will be webcast on the MIT CSAIL Youtube channel – click here: \nUn
derstanding the Riemann Hypothesis\nSundar Sundaramurthy\n\nThere is a clo
se connection between the roots of Riemann’s zeta function and prime numbe
rs. Prime numbers play an important role in cryptography. The Riemann Hypo
thesis is the most important unsolved problem in all of mathematics. It wa
s hypothesised more than 150 years ago. The reason it is not proven yet is
because of the complex nature of analysis in the fourth dimension. In thi
s talk we will try to understand the hypothesis and give possible directio
ns for solving it. For clarity\, we will be using a graphical method using
Labview software. We will also make a geometric construction to get the c
oncept clear. A basic understanding of complex variable theory is required
for the audience. Currently\, supercomputer resources are used to prove o
r disprove the Riemann hypothesis using brute force techniques. The Clay I
nstitute in Cambridge\, Massachussets has offered 1M$ in money to whoever
gives a proof to this hypothesis.\nSundar M. Sundaramurthy is the Chief Te
chnical Officer at Navin Enterprises LLC\, an electronics consulting compa
ny in Massachusetts. Sundar has been a technical staff at MIT Lincoln Labo
ratory working in DSP algorithms and architectures. He has published many
technical papers and has taught at many of the universities in New England
. He obtained his B.E. (Electronics and Communications Engineering) from U
niversity of Madras in 1973\, M.S.(by research) from Indian Institute of T
echnology\, Chennai in 1975 and Ph.D. from Concordia University\, Montreal
in 1979.\nThis joint meeting of the Boston Chapter of the IEEE Computer S
ociety and GBC/ACM will be held in MIT Room 32-D463 (the Star conference r
oom on the 4th floor of the Stata Center\, building 32 on MIT maps). You
can see it on this map of the MIT campus.\nUp-to-date information about th
is and other talks is available online at http://ewh.ieee.org/r1/boston/co
mputer/. You can sign up to receive updated status information about this
talk and informational emails about future talks at http://mailman.mit.edu
/mailman/listinfo/ieee-cs\, our self-administered mailing list.
DTSTART;TZID=America/New_York:20190523T190000
DTEND;TZID=America/New_York:20190523T200000
LOCATION:MIT Room - 32-D463 (Star)
SEQUENCE:0
SUMMARY:Understanding the Riemann Hypothesis
URL:http://ieeeboston.org/event/understanding-the-riemann-hypothesis/
X-COST-TYPE:free
X-WP-IMAGES-URL:thumbnail\;http://ieeeboston.org/wp-content/uploads/2019/05
/23-May-Computer-Society.jpg\;150\;116\,medium\;http://ieeeboston.org/wp-c
ontent/uploads/2019/05/23-May-Computer-Society.jpg\;150\;116\,large\;http:
//ieeeboston.org/wp-content/uploads/2019/05/23-May-Computer-Society.jpg\;1
50\;116\,full\;http://ieeeboston.org/wp-content/uploads/2019/05/23-May-Com
puter-Society.jpg\;150\;116
X-ALT-DESC;FMTTYPE=text/html:\\n\\n\\n\\n\\nIEEE Computer
Society and GBC/ACM

\nMIT Room 32-D463 (Star)

\nThis talk will b
e webcast on the MIT CSAIL Youtube channel – click here:

\nUnde
rstanding the Riemann Hypothesis

\nSundar Sundaramurthy

\n

\nThere is a close connection between
the roots of Riemann’s zeta function and prime numbers. Prime numbers play
an important role in cryptography. The Riemann Hypothesis is the most imp
ortant unsolved problem in all of mathematics. It was hypothesised more th
an 150 years ago. The reason it is not proven yet is because of the comple
x nature of analysis in the fourth dimension. In this talk we will try to
understand the hypothesis and give possible directions for solving it. For
clarity\, we will be using a graphical method using Labview software. We
will also make a geometric construction to get the concept clear. A basic
understanding of complex variable theory is required for the audience. Cur
rently\, supercomputer resources are used to prove or disprove the Riemann
hypothesis using brute force techniques. The Clay Institute in Cambridge\
, Massachussets has offered 1M$ in money to whoever gives a proof to this
hypothesis.

\nSundar M. Sundaramurthy is the Chief Technical Officer
at Navin Enterprises LLC\, an electronics consulting company in Massachus
etts. Sundar has been a technical staff at MIT Lincoln Laboratory working
in DSP algorithms and architectures. He has published many technical paper
s and has taught at many of the universities in New England. He obtained h
is B.E. (Electronics and Communications Engineering) from University of Ma
dras in 1973\, M.S.(by research) from Indian Institute of Technology\, Che
nnai in 1975 and Ph.D. from Concordia University\, Montreal in 1979.

\n
This joint meeting of the Boston Chapter of the IEEE Computer Society a
nd GBC/ACM will be held in MIT Room 32-D463 (the Star conference room on t
he 4th floor of the Stata Center\, building 32 on MIT maps). You can
see it on this map of the MIT campus.

\nUp-to-date information a
bout this and other talks is available online at http://ewh.ieee.org/r1/bo
ston/computer/. You can sign up to receive updated status information abou
t this talk and informational emails about future talks at http://mailman.
mit.edu/mailman/listinfo/ieee-cs\, our self-administered mailing list.

\n
X-TAGS;LANGUAGE=en-US:Computer
END:VEVENT
END:VCALENDAR