Claims

../

2001_01_15_granville_selfridge: Granville and Selfridge prove that t_n equals the largest prime factor P(n) whenever P(n) exceeds sqrt(2n)+1, and that t_n is at most 3 sqrt(n/2)+1 otherwise; refereed.

2022_11_22_bui_pratt_zaharescu: Bui, Pratt and Zaharescu show that t_n is at most n^c on the same proportion of integers as the largest prime factor is, with upper and lower bounds on t_n; refereed, and the site's curator labels the problem solved.

---