> Net effect: frame-busting busted. Which might naturally lead you to wonder -- hey buster, can you bust the frame-busting buster? And, if so, where does it end?
Hi; I think answers are allowed to assume a fresh interpreter session (no variables hanging around from 'earlier'), is that right? And if so, is it written anywhere? I can't see anything in the Meta site about "ground rules for answers" or "unwritten rules" or anything related
@TessellatingHeckler Generally, I think the rule is only that your code needs to be able to run multiple times and still produce the correct output. (This is only relevant for ex. function submissions, not full programs.)
@TessellatingHeckler That depends. A function submission must be reusable, so if it modifies a global variable, it still has to work if you run it a second time.
Hmm; you shouldn't assume a variable exists. In a language where you can use uninitialized variables to initialize them, you can assume it doesn't already exist?
<subscript>PowerShell</subscript> :stares at floor: e.g. $n++ will make it an integer and start it counting from 0 but if $n was already defined as 120 in the shell before you ran your script, it would count from there and ruin your answer
@TessellatingHeckler Ah, that's okay if your submission is a full program, but not if it's a function that modifies global state (I don't know how PowerShell works, but if that makes a local variable and the function works when called multiple times in a row, then that's fine).
@Doorknob it's ok, I don't know how it works either :| but assignment to a variable makes it locally scoped, and won't update the global scope unless explicitly asked, so a script could be run again without a fresh shell. Great
@AlexA. Hm? Never heard of that. I don't think so. It's true that the Arabs took hold of Spain (or the land that now is Spain) for a good several centuries, and gave us a lot of words
Spanish just evolved from Latin, so it uses Latin letters
Convert Between American and British English Spellings
code-challenge test-battery natural-language
In this challenge, you will have to write two programs or functions. One will convert a list of words from their American English spelling to the British English equivalent, and the other to co...
@Sp3000 It works by getting arbitrarily close to a domain point, and seeing if the images are also close to each other. But in N you can't get "arbitrarily close" actually
@Sp3000 You can choose the metric, yes. That's why I asked Dennis. Some are equivalent, though. But on N, whichever metric used, there is no concept of "getting arbitrarily close", I think
@Sp3000 The most intuitive but rigorous definition (imho) of continuity at a point a is that for every sequence x(n) that converges to a, f(x(n)) must converge to f(a). In a discrete space, all convergent sequences are constant, so every function is continuous.
@LuisMendo For N (with 0), you can define d(n,m) = |1/n - 1/m| if both are positive and d(n, 0) = 1/n. With that metric, 0 is an accumulation point, so discontinuous functions are possible.
Reminds me of and old question in my first course of Analysis. Given a function f from a subset S of the real numbers to the real numbers; f is differentiable on S. Does that imply f is constant on S?
I think I failed on that one, thus I remember very well :-)
in the TNB transcript, these are the most common words that follow the word "please", starting with the most common: `are use review with a contact check make close combine just not don no roll remove tell read Too forgive stupid anyone The raise Now impress I do D let vote JoeZ Rusher post Am comment be user give my have leave undelete M ore Suddenly KevinL sandbox change everyone try say ping Questions p explain ask if edit the minutes stay quali fy look someone extract Oh P correct Unihedron notify point thanks send take delete submit verify feel Doorknob
I'm just trying to guess at values which give a result, but given the fact that 1) Legion is simplifying a lot of the results and 2) I don't even know these functions well, I doubt I'll get the intended answer
In arithmetic, an n-smooth number, where n is a given prime number, is mathematically defined as a positive integer that has no prime factors greater than n. For example, 42 is 7-smooth because all its prime factors are less than or equal to 7, but 44 is not 7-smooth because it also has 11 as a p...