This site is supported by donations to The OEIS Foundation.

User talk:Fred Schneider

From OeisWiki
Jump to: navigation, search

Hello. I don't know that you will see this, but I'm working on A093550(10) and curious about how far along you were, if you recall. Perhaps, in fact, you researched it to the end, in which case either of us could submit the term (I would need to comment that you are responsible in that case). It seems more likely you simply gave your trio at the primepuzzles site as the first found and not the smallest, or as one that was only researched up to a point -- either with or without your expectation that it is smallest. It's mostly just a point of curiosity if it's this kind of partial, but it may tell me what my research is or isn't likely to find (I'm researching by maximin factor, so unless this is identical to your approach your partial result would not affect my research).James G. Merickel 09:59, 30 July 2015 (UTC) That is, I am setting the prospective trio member with largest smallest prime and looking at all possibilities of these (in bounds you helped set) for whether the other two for each between multiples of 4 fit the criterion.James G. Merickel 10:06, 30 July 2015 (UTC) I have one i5 computer fully committed to this problem using 5 windows (1 for each class mod 5 of the prime index of the largest factor of the fixed product). I also have one window (different computer) working the start of the research for A093550(11), with what I feel is a reasonably conservative bound of 10^22 (I have doubts, but if it doesn't pan out I can use the ranges covered in a modification of the ordinary search with little time waste). I am also wondering if you know anything here.James G. Merickel 10:52, 30 July 2015 (UTC) Using PARI, btw.James G. Merickel 10:55, 30 July 2015 (UTC)