In short, no. There's a reason that General Number Sieve is only used for numbers bigger that 10^80 and Elliptic Curve Method (ECM) is used instead. If number is smaller, than you don't benefit from the better complexity. This invalidates your point, because it might happen that your hardware is fast enough to factor a number using ECM and not fast enough to do the same with GNFS. So practically speaking, you don't have any assurance that what you have is fast or slow. Of course, it might happen that you actually manage to factor some big numbers, in that case you have the empirical proof you sought.
You say "Western" while in fact these all are English artifacts. AFAIK, in French there is no direct translation of "software", which is called "logiciel" - a piece of things that deals with logic. The examples are countless. Don't make the same mistake as we do, labeling together all languages from your region as Asian, without distinguishing.
If you're in a place where being woman is disadvantageous, would you call such disadvantage "racist"? Clearly it fits your description. If you think it's wrong, then I agree with you. If you think it's racist, then no way, it isn't and you just don't know the words you use.
I'm not the OP, but I suspect that what was means was backporting features to py2.7, which presumably use some new Python 3 which haven't been built in the old language version.
Does that imply there are no people but Americans and Europeans? Why don't you simply check where is she from? It's quite easy to check that she has polish name, speaks fluent polish, so I guess she is in fact polish. But why did you feel it's important to mention America here?
No, what is meant by that, is that multiplying 2 by 3 takes about the same time as multiplying 432434232 by 1213213213. Not only bounded time, about the same.
To be honest, this is false too. You need functions with values that can be multiplied by scalars. If you just have ordered set, then you can't account for this constant from the definition. Alternatively, you could say that values of the function need to be from a normed vector space (but I'm not sure if it can be extended furthermore. Maybe normed C-module?)
Yeah, you really could have. It also grinds me when people will say "it's O(n), not O(n^(3/2))", because the former is a subset of later, not to mention talking about worst case/average case/best case. Big O notation has nothing to do with probabilities, literally nothing.
Using Euclid's algorithm (not Euler's) is certainly not the easiest way of checking for divisibility by 3 - a number is divisible by 3 if and only if it's sum of digits is divisible by 3. You can repeat the process until you have one digit.
Some even speculate Fermat didn't write this note. Most of his works were collected by his son who is suspected of adding this commentary to a conjecture that was considered many times by Fermat.
Sorry for blunt words, but that's bullshit. If there is no proof a client is secure from malicious server, then this system is useless from the security point of view. You can have open source solution, but you might be running tweaked version.
There are so many places on the world where $2000 a month is more than most people get. Of course they didn't pay that much. I would probably consider it seriously given that currently I get about $800 and that is still considered average.
Getting enterprise certificate is not easy and requires manual approval from Apple for registered company. I can imagine that getting another one can be hard, if ever possible.