Robert...RobertStanforth wrote: Mon Jul 29, 2019 7:43 amThis question would be better asked in the solutions thread for this problem on the main site.RishadanPort wrote: Mon Jul 29, 2019 7:34 am ok I solved this problem...
I am really wondering tho, why H(1000), H(1 000 000), and H(100 000 000) all look so similar... Can anyone explain? feel free to send me private message.
I have hesitated for almost a year to make this comment but, in my experience,
PE.net, years ago, used to offer GR8 Give and Take re solutions but...
Anymore I see it as reduced to what youngsters call
"Shouting Out," pretty much blindly...
An example is hardly a proof, especially only one example, but...
Here is a solutions thread comment re
PE Problem 202 --
That's a pretty simple, humble question, with no response in almost a year...25 May 2019, 22:24
Could someone explain how to use inclusion exclusion to speed up the solution? I get the principle behind it, but I cannot figure out how to get the formulas that actually give the counts for the numbers that are divisible by a prime number and are also congruent to 2 (mod 3).
I've asked questions on solution threads myself and
Never gotten an answer... I have gotten
GR8 assistance via PE.chat PMs...
