BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Michael Filaseta (University of South Carolina)
DTSTART:20200603T190000Z
DTEND:20200603T192500Z
DTSTAMP:20260423T011158Z
UID:CANT2020/39
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2020/39/
 ">Two excursions in digitally delicate primes</a>\nby Michael Filaseta (Un
 iversity of South Carolina) as part of Combinatorial and additive number t
 heory (CANT 2021)\n\n\nAbstract\nIn 1978\, Murray Klamkin asked whether th
 ere are prime numbers such that \nif any digit in the prime is replaced by
  any other digit\, the resulting number is composite.  \nIn 1979\, several
  examples were published together with a proof by Paul Erdős\nthat infini
 tely many such primes exist.  Following the terminology of Jackson Hopper\
 nand Paul Pollack\, we call such primes ``digitally delicate."  \nThe smal
 lest digitally delicate prime is 294001.  In this talk\, we discuss some o
 f the history \nsurrounding digitally delicate primes\, implications of pr
 ior work\, and recent work by the speaker \nwith Jeremiah Southwick and Ja
 cob Juillerat.\n
LOCATION:https://researchseminars.org/talk/CANT2020/39/
END:VEVENT
END:VCALENDAR