BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Nathan McNew (Towson University)
DTSTART:20260716T140000Z
DTEND:20260716T142500Z
DTSTAMP:20260710T111634Z
UID:CANT2026/45
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2026/45/
 ">Matchable numbers</a>\nby Nathan McNew (Towson University) as part of Co
 mbinatorial and additive number theory seminar (CANT 2026)\n\nLecture held
  in Science Center in the CUNY Graduate Center (4th floor).\n\nAbstract\nW
 e say a natural number is matchable if there is a bijection from the set o
 f $\\tau(n)$ divisors of $n$ to the set $[1\,2\,\\ldots\,\\tau(n)]$\, wher
 e corresponding numbers are relatively prime. We show that the set of matc
 hable numbers has an asymptotic density\, which we compute\, and we show t
 hat every squarefree number is matchable. We also present some related uns
 olved problems. This is joint work with Carl Pomerance.\n
LOCATION:https://researchseminars.org/talk/CANT2026/45/
END:VEVENT
END:VCALENDAR