BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SRMAP Events - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://events.srmap.edu.in
X-WR-CALDESC:Events for SRMAP Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260601T090000
DTEND;TZID=Asia/Kolkata:20260610T170000
DTSTAMP:20260604T032220
CREATED:20260526T062544Z
LAST-MODIFIED:20260526T062544Z
UID:145888-1780304400-1781110800@events.srmap.edu.in
SUMMARY:NCC Annual Training Camp–III
DESCRIPTION:The NCC Battalion of SRM University-AP is organising an Annual Training Camp-III from June 01 – 10\, 2026 at SRM University-AP. The rigorous training camp is designed to instil discipline\, leadership\, unity and patriotism among the cadets. \nThe key activities at the camp will include drill practices\, physical training and yoga\, weapon training\, field craft and map reading and cultural competitions. A total of 600 cadets will be participating in this camp\, including 53 cadets from our SRM AP.
URL:https://events.srmap.edu.in/event/ncc-annual-training-camp-iii/
LOCATION:SRM University-AP
CATEGORIES:Departmental Events,Events,Homepage Events,NCC Event,Students Affairs Events
ATTACH;FMTTYPE=image/png:https://events.srmap.edu.in/wp-content/uploads/2026/05/NCC-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260601T100000
DTEND;TZID=Asia/Kolkata:20260605T163000
DTSTAMP:20260604T032220
CREATED:20260526T074216Z
LAST-MODIFIED:20260526T074252Z
UID:145895-1780308000-1780677000@events.srmap.edu.in
SUMMARY:5-Day Technical Workshop
DESCRIPTION:The Department of Computer Science and Engineering is organising a five-day technical workshop on “Lab Xcelerate: Enhancing Technical and Operational Skills for Laboratories” from June 01 – 05\, 2026. Dr Priyanka\, Associate Professor and Associate HoD\, Department of Computer Science and Engineering and Dr Vinnakota Saran Chaitanya\, Assistant Professor\, Department of Computer Science and Engineering will be the resource persons for the workshop. \nClick to Register – https://forms.gle/JPjxVQ2ZfsfqtY9FA
URL:https://events.srmap.edu.in/event/5-day-technical-workshop/
LOCATION:CV 302 (Tiered Classroom)\, Level 3\, CV Raman Block
CATEGORIES:CSE Events,Departmental Events,Events,Homepage Events,Workshop
ATTACH;FMTTYPE=image/png:https://events.srmap.edu.in/wp-content/uploads/2026/05/Lab-Xcelerate.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260604T150000
DTEND;TZID=Asia/Kolkata:20260604T160000
DTSTAMP:20260604T032220
CREATED:20260603T052528Z
LAST-MODIFIED:20260603T052528Z
UID:145903-1780585200-1780588800@events.srmap.edu.in
SUMMARY:Department Colloquium on Primes in the Interval ([kx\,(k+1)x])
DESCRIPTION:The Department of Mathematics is organising a Department Colloquium on the topic “Primes in the Interval ([kx\,(k+1)x]) (Joint work with R. Higa and R. Sugawara)” by Prof. Hiroki Aoki\, Associate Professor\, Department of Mathematics\, Faculty of Science and Technology\, Tokyo University of Science on June 04\, 2026. \nAbstract \nBertrand’s postulate: “For any natural number $n$\, there always exists a prime greater than $n$ and less than $2n$” was first conjectured in 1845 by Bertrand and proven by Chebyshev in 1852. Later\, Ramanujan made the proof considerably simpler\, and Erd\"{o}s gave a completely elementary and concise proof in 1932. Then\, is a slightly shorter interval in this postulate still valid? Here we consider the following proposition $P(k)$ for a natural number $k$: $P(k)$: “For a sufficiently large natural number $n$\, there always exists a prime between $kn$ and $(k+1)n$.” Here we say it Bertrand-type prime distribution theorem. In modern high-level mathematics\, by using the Prime Number Theorem (PNT)\, we can show that $P(k)$ is true for any $k$ easily. In addition\, we know an elementary proof of PNT\, although it is complex and long. However\, it is not at all clear whether a concise\, or even completely elementary\, proof exists for general $k$\, such as the one given by Ramanujan and Erd\”{o}s for Bertrand’s postulate. Previous research had suggested that a completely elementary proof of $P(k)$ based on the method of Erd\”{o}s is impossible when $k \ge 5$ (Balliet\, 2015). However\, by adding some new idea\, we find a completely elementary proof of $P(k)$ for $k \le 15 $  some new idea. \nThis colloquium provides an excellent opportunity to learn about recent advances in Number Theory and interact with an internationally renowned mathematician. All faculty members\, research scholars\, postdoc researchers\, and students are cordially invited to attend and participate in the discussion.
URL:https://events.srmap.edu.in/event/department-colloquium-on-primes-in-the-interval-kxk1x/
LOCATION:JC-304\, J C Block
CATEGORIES:Departmental Events,Events,Homepage Events,Math Events
ATTACH;FMTTYPE=image/png:https://events.srmap.edu.in/wp-content/uploads/2026/06/math-colloquim.png
END:VEVENT
END:VCALENDAR