BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//ooo ZNANOST! - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:ooo ZNANOST!
X-ORIGINAL-URL:https://ern.um.si/?lang=en
X-WR-CALDESC:Events for ooo ZNANOST!
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20260101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20260318T160000
DTEND;TZID=UTC:20260318T170000
DTSTAMP:20260517T091200
CREATED:20250507T142613Z
LAST-MODIFIED:20260507T143230Z
UID:10000791-1773849600-1773853200@ern.um.si
SUMMARY:Excursions into the Mathematical Universe: The Essentials of Primality Testing
DESCRIPTION:A series of popular science lectures titled “Excursions into the Mathematical Universe.” The lectures are primarily intended for students of secondary schools in the Primorska region\, but they are also open to the general public. Researchers and university lecturers will present ancient and modern mathematical concepts and their applicability in various fields of science\, natural sciences\, and social sciences in an accessible way. \n\nThe Essentials of Primality Testing \nImagine that you have to determine whether a given one-hundred-digit odd natural number is prime. This task may sound like a bad joke in a mathematics class\, but the answer is crucial for modern cryptography. A straightforward procedure would be to check\, for every natural number ddd greater than 1 and less than the square root of the given number nnn\, whether ddd divides nnn. This would require approximately 105010^{50}1050 division operations. Even if each such operation took only 1 nanosecond\, we would be waiting for the answer for about 103310^{33}1033 years\, which makes this approach inefficient. \nAn efficient procedure (or algorithm) is one that requires p(log⁡n)p(\log n)p(logn) operations\, where p(x)p(x)p(x) is a polynomial. Fortunately\, in practice there exist very fast probabilistic algorithms\, such as the Miller–Rabin test\, which determine with high probability whether a number is prime. In this lecture\, we will look at some of these procedures and the basic ideas behind them. \nAbout the lecturer: Aleksander Simonič earned his PhD in analytic number theory in 2022 at the University of New South Wales (Australia). After completing his doctorate\, he worked there as a researcher and lecturer\, teaching various mathematics courses to students of the Australian Defence Force Academy. He is currently employed as an assistant at the Faculty of Mathematics\, Natural Sciences and Information Technologies of the University of Primorska\, where his research focuses on L-functions and where he teaches two number-theory courses. He is a passionate lover of classical music and long walks. \n\n\nFurther below\, you are kindly invited to read and view the following materials related to the event: \n\nThe invitation with the program is available at this link.\nEvent materials are available at this link.\nA recording of the event is available at this link.\nPhotos from the event:
URL:https://ern.um.si/dogodek/excursions-into-the-mathematical-universe-the-essentials-of-primality-testing/?lang=en
LOCATION:Koper\, Univerza na Primorskem\, Fakulteta za matematiko\, naravoslovje in informacijske tehnologije\, Glagoljaška ulica 8\, Koper\, 6000\, Slovenija
CATEGORIES:Mathematics
ATTACH;FMTTYPE=image/png:https://ern.um.si/wp-content/uploads/2024/08/UP-FAMNIT-004.png
END:VEVENT
END:VCALENDAR