[HN Gopher] Decomposing factorial of 300K as the product of 300K...
       ___________________________________________________________________
        
       Decomposing factorial of 300K as the product of 300K factors larger
       than 100K
        
       Author : gus_massa
       Score  : 45 points
       Date   : 2025-04-08 18:28 UTC (4 hours ago)
        
 (HTM) web link (gus-massa.blogspot.com)
 (TXT) w3m dump (gus-massa.blogspot.com)
        
       | pvg wrote:
       | HN thread for the Tao piece
       | https://news.ycombinator.com/item?id=43506238
        
       | hansvm wrote:
       | A mathy construction like in the article is probably important
       | for the full conjecture, but isn't this concrete case just an
       | instance of the bin-covering problem? Your discrete items are the
       | log of each prime factor (included according to its
       | multiplicity), set the lower threshold to log(100k), and if you
       | get any solution with 300k or more factors, you can redistribute
       | the extra factors arbitrarily.
        
         | madcaptenor wrote:
         | Tao agrees with you:
         | https://terrytao.wordpress.com/2025/03/26/decomposing-a-fact...
        
           | btilly wrote:
           | In the same thread Tao commented
           | https://terrytao.wordpress.com/2025/03/26/decomposing-a-
           | fact... which shows work from Andrew Sutherland that got the
           | 100k limit after about a day.
           | 
           | As impressed as I am with this solution, it didn't get to be
           | the first to solve the problem.
        
       ___________________________________________________________________
       (page generated 2025-04-08 23:00 UTC)