If you go to the Wolfram Alpha link for the revised formula, it cannot understand the formula provided -- it says "Interpreting as: 2+( f(y)) * 1 = n". From the discussion, this formula does not help in factoring the large numbers (e.g. over 200 digits). Also, the formula provides an equation you have to search for solutions to it such that (a) both values are integer and (b) both values are prime.
All the formula is saying is "graph the multiplication of two values such that they equal the RSA modulus". Because Wolfram Alpha gave answers that matched prime factors for small primes (with an RSA modulus of 15 digits or less), he's assuming that he's found a way to factor any RSA modulus.
Hoping to remove pirated versions of Microsoft Office from the Internet, the software company has sent several DMCA takedowns to Google, listing copies of its open source competitor Open Office as copyright infringements.
Since this is restricted to Bing search engine it probably hasn't cost Open Office any downloads yet.
I have been forced to make a difficult decision: to become complicit in crimes against the American people or walk away from nearly ten years of hard work by shutting down Lavabit. After significant soul searching, I have decided to suspend operations. I wish that I could legally share with you the events that led to my decision. I cannot. I feel you deserve to know what’s going on--the first amendment is supposed to guarantee me the freedom to speak out in situations like this. Unfortunately, Congress has passed laws that say otherwise.
"I just want to be a good engineer." -- Steve Wozniak, co-founder of Apple Computer, concluding his keynote speech at the 1988 AppleFest