mersenneforum.org Search Results
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 4 of 4 Search took 0.01 seconds. Search: Posts Made By: R. Gerbicz
 Forum: Programming 2021-10-11, 16:47 Replies: 24 Views: 2,979 Posted By R. Gerbicz That looks like good, maybe not the best example,... That looks like good, maybe not the best example, there omega(n1)=omega(n2)=1, it was Sardonicus's tiny number. As said S2 should be sorted.
 Forum: Programming 2021-10-10, 20:05 Replies: 24 Views: 2,979 Posted By R. Gerbicz It's nice that you've coded it. Try it for... It's nice that you've coded it. Try it for n=6402373705728000, that is 18!, it is missing a bunch of divisors, the first is 7, as I've looked all of these larger factorials are missing some...
 Forum: Programming 2021-10-06, 19:55 Replies: 24 Views: 2,979 Posted By R. Gerbicz Say d1=4 from S1 then the divisors that using... Say d1=4 from S1 then the divisors that using this d1 is just: 1*d1 3*d1 9*d1 27*d1 for example we are at d=3*d1 and this was the smallest divisor, then the next smallest (using this d1) will be...
 Forum: Programming 2021-10-04, 15:38 Replies: 24 Views: 2,979 Posted By R. Gerbicz That is too much in memory, and running time if... That is too much in memory, and running time if you request only (say) 4 batches of divisors. There is a meet in the middle solution that is using (basically) only O(log(n)*(B+sqrt(D))) bits of...
 Showing results 1 to 4 of 4

All times are UTC. The time now is 10:37.

Thu Mar 30 10:37:24 UTC 2023 up 224 days, 8:05, 0 users, load averages: 0.66, 0.73, 0.74