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.

  Hoạt động tuần
Xuất bản mới
La Văn Thịnh, Hoàng Thế Tuấn, On the Mittag–Leffler Stability of Mixed-Order Fractional Homogeneous Cooperative Delay Systems, Vietnam Journal of Mathematics, Volume 54, pages 773–789 (2026)
Đỗ Minh Thắng, Sonja Hannibal, Arnulf Jentzen, Non-convergence to global minimizers in data driven supervised deep learning: Adam and stochastic gradient descent optimization provably fail to converge to global minimizers in the training of deep neural networks with ReLU activation, Journal of Mathematical Analysis and Applications, 564 (2026) 130724
Le Thi Hong Hanh, Dương Trọng Luyện, Nguyễn Minh Trí, Nontrivial Solutions to Boundary Value Problems for Semilinear $\Delta ^{\alpha ,\beta }_{\alpha _1,\beta _1}$-Differential Equations, Analysis and PDE in Developing Countries, Trends in Mathematics (TM, volume 17) (2026) pp 27–35, Birkhäuser/Springer, Cham, 2026 ISBN: 978-3-032-14210-8; 978-3-032-14211-5