The least almost-prime in an arithmetic progression
Người báo cáo: Ngô Trung Hiếu
Time: 9:30 -- 11: 00, March 18, 2026
Venue: Room 612, A6, Institute of Mathematics-VAST
Abstract: Given an integer sequence, a basic quest in number theory is to count numbers in this sequence with interesting multiplicative properties, such as primes and almost-primes. Towards this goal, sieve methods are designed to combinatorially extract simple divisibility properties of a sequence and combine with analytic tools for estimating sums and integrals to yield the desired arithmetic information. In this talk, I will introduce fundamental sieve methods to count primes and almost-primes. I will describe our recent progress in estimating the least almost-prime in an arithmetic progression. This is joint work with Hà Minh Dũng and Hoàng Đức Anh.
Tin tức nổi bật
Hoạt động tuần
Hội thảo sắp diễn ra
23/03/26, Hội nghị, hội thảo:
Workshop on Graphs and Beyond
02/04/26, Hội nghị, hội thảo:
Hội thảo Phương trình vi phân và ứng dụng
23/04/26, Hội nghị, hội thảo:
Hội thảo TỐI ƯU VÀ TÍNH TOÁN KHOA HỌC lần thứ 24
Xuất bản mới
Florian Bridoux,
Christophe Crespelle,
Phan Thị Hà Dương,
Adrien Richard,
Dividing sum of cycles in the semiring of functional digraphs,
Natural Computing, Vol. 25, No. 1, 2026.
.
Giang Trung Hiếu,
Nguyễn Minh Trí,
Đặng Anh Tuấn,
On some Sobolev and Pólya-Szegö type inequalities with weights and applications,
Journal of Mathematical Analysis and Applications, Volume 561, Issue 2, 15 September 2026, 130591
.
Ha Dung M,
Hoàng Đức Anh,
Ngô Trung Hiếu,
On the least almost-prime in an arithmetic progression,
Mathematika 72 (2026), no. 2, Paper No. e70080.
.