When a question is protected, it gets a placard below it detailing what "Protected Question" means:     This question is protected to prevent "thanks!", "me too!", or spam answers by new users. To answer it, you must have earned at least 10 reputation on this site.   While it is true that it mentions you have to earn at least 10 reputation on this site, it's a little unclear what that means, considering there's the caveat . That is, association bonuses don't count. You have to actually earn 10 rep for this account while using this account.  My request is to simply add some clarification, like:     This question is protected to prevent "thanks!", "me too!", or spam answers by new users. To answer it, you must have earned at least 10 reputation on this site (association bonuses don't count).   EDIT: The dupe target is just a discussion question about the topic; mine is an explicit feature request calling for action from the developers. This is enough differentiation to remain open.
For context, see .  In essence:     "This question is protected to prevent "thanks!", "me too!", or spam answers by new users. To answer it, you must have earned at least 10 reputation (not including the ) on this site."   Suggested addition to existing message is in bold.
How do I log in to my personal Windows 10 using a FIDO2 key? I'd like to user a FIDO2 key to log into Windows 10. There are various guides explaining how to add a key to a Microsoft web account, or to Windows 10 sign in options, but neither result in showing up as an option when I try logging into Windows.  How can I configure windows to use my FIDO2 key to log in? Why wouldn't the `which` command work for `cd`? I can't find the executable for `cd` either! I tried which cd and it didn't give a path but instead returned the exit code 1 (checked with echo $?). The coreutil cd itself is working, so the executable should be there, right? I also ran a find for cd, but there was no executable file shown. How is it implemented then?  Update:  I don't know if I should ask this in another post but since I think it is good here, I'm expanding (?) the post... So the answer was actually quite simple, there's no executable for that — because it's a builtin — But I've found some builtins (bash shell in Fedora) have the executable files! So builtin -> no executable isn't right I suppose? Maybe an answer explaining what builtins actually are (builtin commands?), which actually is the matter here, rather than focusing more on cd... Some good links posted previously indicate that builtins are not programs... so what are they? How do they work? Are they just functions or threads of the shell? Why does the natural ring homomorphism induce a surjective group homomorphism of units? I'm trying an old problem here:   Suppose $n\mid m$, and I have a natural ring homomorphism $\varphi\colon \mathbb{Z}/m\mathbb{Z}\to\mathbb{Z}/n\mathbb{Z}$ defined by $\varphi(j)=j\mod{n}$. I can verify that this is a ring homomorphism, but why does it induce a surjective group homomorphism on the unit groups $(\mathbb{Z}/m\mathbb{Z})^\times\to(\mathbb{Z}/n\mathbb{Z})^\times$?  My question in particular is why is it surjective? I take $k\in(\mathbb{Z}/n\mathbb{Z})^\times$. Then there exist integers $s,t$ such that $sn+tk=1$. Since $n\mid m$, I can also write $m=na$. So multiplying through I get $sm+tka=a$. I'm lost here. How can I find a unit in $(\mathbb{Z}/m\mathbb{Z})^\times$ which maps to $k$ to show surjectivity? The square roots of different primes are linearly independent over the field of rationals What is the correct (most efficient) way to define the main() function in C and C++ — int main() or void main() — and why? And how about the arguments? If int main() then return 1 or return 0?  There are numerous duplicates of this question, including:       — For C++, with a very good answer indeed.     Related: The selected task "{0}" no longer exists. To see the current tasks, click Refresh When I start my task scheduler on Windows 7 I get a dialog with the following error:     The selected task "{0}" no longer exists.  To see the current tasks,   click Refresh     Also there's a UUID, that is displayed as the name and when I try to delete it I cannot, it just hangs around.  Is there a fix for this? How can an int be cast to an enum in C#? I am trying to INSERT INTO a table using the input from another table. Although this is entirely feasible for many database engines, I always seem to struggle to remember the correct syntax for the SQL engine of the day (, , , , and ).  Is there a silver-bullet syntax coming from an SQL standard (for example, ) that would allow me to insert the values without worrying about the underlying database? Resizing point on zoom out Missing new file in Ubuntu 13.04 The New file operation is missing in Ubuntu 13.04. How can I fix it?  I have only &quot;New Folder&quot;. How can I add the New File option again? Find $f$ if $$ f(x)+f\left(\frac{1}{1-x}\right)=x $$ I think, that I have to find x that $f(x) = f\left(\frac{1}{1-x}\right)$ I've tried to put x which make $x = \frac{1}{1 - x}$, but this equation has no roots in real numbers. Does ReLU layer work well for a shallow network? Show that there exists a unique $v_0 \in H^1(0,1)$ such that $u(0)=\int_0^1(u'v_0'+uv_0), \forall u \in H^1(0,1)$ Close vote review audit flawed - fails without casting vote Why are all the textures in my file pink? How do I study the "correlation" between a continuous variable and a categorical variable? "Delete this answered question?" when the only answer is deleted Looks like there's a small bug in the UI: I posted a question here on meta.SE which ended up being just something dumb I was doing and no use to anyone in the future. At first I posted an answer saying what the dumb thing was, but then I realized that the whole thing had no value, so I deleted the answer, and then deleted the question — whereupon it asked me:  Delete this answered question? We do not recommend deleting questions with answers because doing so deprives future readers of this knowledge. Repeated deletion of answered questions can result in your account being blocked from asking. Are you sure you wish to delete?  (Screenshot below) Probably shouldn't ask (or add to the tally) if the only answers are deleted ones... We know  speedup brute-force attacks two times faster in block ciphers (e.g brute-forcing 128-bit keys take $2^{64}$ operations, not $2^{128}$). That explains why we are using 256-bit keys to encrypt top secrets. But  on AES shows brute-forcing AES-256 take $2^{100}$ operations. Does this attack work with Grover's search to make AES cipher quantum unresistant? build argument lists containing whitespace In bash one can escape arguments that contain whitespace.  foo "a string"   This also works for arguments to a command or function:  bar() {     foo "$@" }  bar "a string"   So far so good, but what if I want to manipulate the arguments before calling foo?  This does not work:  bar() {     for arg in "$@"     do         args="$args \"prefix $arg\""     done      # Everything looks good ...     echo $args      # ... but it isn't.     foo $args      # foo "$args" would just be silly }  bar a b c   So how do you build argument lists when the arguments contain whitespace? Finding $\lim\limits_{x\to1^-}\Bigl(\prod\limits_{n=0}^{\infty}\Bigl(\frac{1+x^{n+1}}{1+x^n}\Bigr)^{x^n}\Bigr)$ Compute : $$L=\lim_{x\to 1^-} \left(\prod_{n=0}^{\infty} \left(\frac {1+x^{n+1}}{1+x^n}\right)^{x^n}\right)$$   My try:   Writing out the first few terms I noticed that the limit can be expressed as $$L=\lim_{x\to 1^-} \frac 12\left(\prod_{n=1}^{\infty} (1+x^n)^{x^{n-1} -x^n}\right)$$ $$L=\frac 12\lim_{x\to 1^-} \left(\prod_{n=1}^{\infty} (1+x^n)^{x^{n-1}}\right)^{1-x}$$  Converting to exponential form I get $$L=\frac 12 \exp {\left(\lim_{x\to 1^-} (1-x)\sum_{n=1}^{\infty} \left(x^{n-1}\ln(1+x^n)\right)\right)}$$  And got stuck here. I did try to use approximation $\ln x\sim x$ hereon to get final answer as $\frac {\sqrt e}{2}$ but I think it was improper to use approximation and hence I believe that the answer I got is flawed. I also noticed that the form I obtained is quite similar to be used for a Riemann Sum but I didn't get a way to tackle the problem using that way.  Can someone please help me with this problem....