It appears my left shift key is permanently down on my MBP. All keys trigger capital letters, and numbers print out the symbols, I have to hold down esc when booting to prevent it from booting into safe mode...  I have taken the key off and cleaned underneath but that hasn't helped matters. If I open the visual keyboard I can see that the right shift responds to my presses but the left one does not, which leads me to think it is the one that is bust.  Is there any way for me to disable this key? I can make do with just using the right hand shift, obviously the laptop is practically un-usable with shift always being on...
This is an attempt to write a canonical QA for this issue, as per the Meta post:   I expect it to be periodically edited with the goal of becoming a comprehensive information resource.  I have a MacBook Pro that has a key(Shift, Return,   Command, P, etc.) that doesn’t respond when pressed or is stuck in the down position.    It's possible that my favorite beverage was spilled (or some other liquid damage).  It's also possible that I have no idea what happened.  It was working yesterday and suddenly today it's no longer working.  Is there any way to bypass or remap the key?  Can I  have the system ignore it completely?  (This question can also apply to external USB keyboards or the Bluetooth keyboards)
In Windows XP we can search for files that contain a defined keyword (inside all files types).  Windows 7 can look inside files for a keyword, but only for text files. (*.doc, *.txt, *.inf, ...), not (*.conf, *.dat, *.*, ...).   don't contain any filter I can use for this.  How is this possible? I want to run a command when there are only 10 entities left. I know you can use /execute unless entity to detect when all matching mobs have died, but it doesn't work if you want to run a command when there are for example 10 entities left.  A command like /execute if entity @e[limit=10] does not work, it also triggers if there is only one entity.  Such a counting system could also be used to determine once there is only one player left in an arena, meaning they have won a battle or similar. Moving a magnet close to a conductor induces a current. If it consists of a superconducting material with resistance $R=0$, then my textbook says:     Then the induced current will continue to flow even after the induced emf has disappeared.   This makes sense physically - there is no resistance to stop charge flow. But then the book draws this conclusion:     Thanks to this persistent current, it turns out that the flux through the loop is exactly the same as it was before the magnet started to move, so the flux through a loop of zero resistance never changes.   If the flux $\Phi$ never changes in a superconductor, from Faraday's law this means - from what I have learned - that no electromotive force $\mathcal{E}$ is induced:  $$\mathcal{E}=-\frac{\mathrm{d} \Phi}{\mathrm{d}t}=0 \:\:\:\:\text{ when }\frac{\mathrm{d} \Phi}{\mathrm{d}t}=0$$  My conclusion is therefor: There would never be induced any current at all. Current can never be induced in a superconductor loop. Is this the case or am I misunderstanding my book? Sorry if I keep asking for proof checks. I'll try to keep it to a minimum after this. I know this has a well-known proof. I understand that proof as well but I thought I'd do a proof that made sense to me and seemed, in some ways, simpler. Trouble is I'm not sure if it's totally correct. It's quite short though. I was just hoping someone could look it over and see if it is a valid proof. Thank you!  Lemma: Every Cauchy sequence is bounded.  Proof: Let $(a_{n})$ be Cauchy. We choose $ 0&lt;\epsilon_{0}$. So $ \forall \; n&gt;m\geq N_{0}$ we have that $\vert a_{n}-a_{m} \vert &lt; \epsilon_{0}$. Therefore $(a_{n})$ is bounded for all $ m \geq N_{0} $ by $ \epsilon_{0} $. Since $ \mathbb{N}_{N_{0}}$ is finite, it is bounded. So, for all $ m&lt;N_{0} $, $ (a_{n})$ is bounded. Therefore $(a_{n})$ is bounded.  I realize I haven't said what the bounds are but I think that's sort of irrelevant. So long as we know it's bounded. Any help is much appreciated! AMD driver does not work on kernel 3.19.0-26 What nutrients can humans absorb in the mouth? For instance, I realise being able to absorb simple sugars in the mouth is pivotal in the rapid action of oral glucose gel. Thus I was wondering what nutrients in general can be absorbed directly within the mouth, and at what speed? Drupal SA-CORE-2014-005 - How to tell if my server / sites were compromised? I just updated all my sites using the patch method of resolving the Drupal SA-CORE-2014-005 exploit. I just read reports that just yesterday there is someone from a Russian IP infiltrating drupal sites.     My main concerns are now:   How do I tell if my sites have been comprised? What should I search for in my apache access logs to detect if my site was a victim or not? So far what are these hackers doing to comprised sites? Are these solutions of $2 = x^{x^{x^{\:\cdot^{\:\cdot^{\:\cdot}}}}}$ correct? In a few large projects i have been working on lately it seems to become increasingly important to choose one or the other (XML or Annotation). As projects grow, consistency is very important for maintainability.   My questions are: what are the advantages of XML-based configuration over Annotation-based configuration and what are the advantages of Annotation-based configuration over XML-based configuration? IIS7 - The request filtering module is configured to deny a request that exceeds the request content length Proving a simple graph is a connected graph Does any proof exist that a simple graph with $n$ vertices such that the least vertex degree is $\geq \frac{n-1}{2}$ is a connected graph? (i.e. does such a proof have a name?) I had two drives partitioned the same and running two RAID partitions on each.  One died and I replaced it under warranty for the same model.  While trying to partition it, the first partition can only start on sector 2048, instead of 63 that was before. Drive have different geometry as previous and remaining ones. (Fewer heads/more cylinders)  Old drive:  $ sudo fdisk -c -u -l /dev/sdb   Disk /dev/sdb: 2000.4 GB, 2000398934016 bytes 255 heads, 63 sectors/track, 243201 cylinders, total 3907029168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x000aa189     Device Boot      Start         End      Blocks   Id  System /dev/sdb1   *          63   174080339    87040138+  83  Linux /dev/sdb2       174080340   182482334     4200997+  82  Linux swap / Solaris /dev/sdb3       182482335  3907024064  1862270865   fd  Linux raid autodetect   Remanufactured drive received from warranty:  $ sudo fdisk -c -u -l /dev/sda  Disk /dev/sda: 2000.4 GB, 2000398934016 bytes 81 heads, 63 sectors/track, 765633 cylinders, total 3907029168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x000d0b5d     Device Boot      Start         End      Blocks   Id  System /dev/sda1            2048  ...   Why is that? limsup of intersection of events as a subset of intersection of limsups Let $A_1, A_2, \ldots$ and $B_1, B_2, \ldots$ be two sequences of events in some probability triple $(\Omega, \mathcal{F}, \mathbf{P})$. Now, it is true that $\left(\limsup_n A_n\right) \cap \left(\limsup_n B_n\right) \supseteq \limsup_n (A_n \cap B_n)$, and I can think of many different cases where this relation holds true for equality (e.g., let $A_n = B_n$, or $A_n = B_n^c$, or $B_n = \emptyset$, or $B_n = \Omega$). However, I cannot think of any case where $\left(\limsup_n A_n\right) \cap \left(\limsup_n B_n\right) \supset \limsup_n (A_n \cap B_n)$ holds for strict inclusion.  My proof for the relation is simple. Since $A_n \cap B_n \subseteq A_n$ and $A_n \cap B_n \subseteq B_n$, then we can perform some set algebra as follows:  $$\bigcup_{k=n}^\infty (A_k \cap B_k) \subseteq \bigcup_{k=n}^\infty A_k$$ $$\bigcap_{n=1}^\infty \bigcup_{k=n}^\infty (A_k \cap B_k) \subseteq \bigcap_{n=1}^\infty \bigcup_{k=n}^\infty A_k$$  Then we can use the same logic for $B_n$, and come to the conclusion as stated in the beginning. How to wipe and install ubuntu? When writing large numbers, should a comma be inserted? I know that it is common to write the number 'ten thousand' as a numeral with a comma delimiting the 10 and the 000 like so: 10, 000  However, I have never seen a comma used for numbers less than 10,000, such as 8000 where, I assume using a comma would look like: 8,000.  Are there any rules relating to when a comma should be inserted into a numeral?  N.b. I live in the UK, so answers pertaining to UK English are preferred. Why does the following code in C work?  const char* str = NULL; str = "test"; str = "test2";   Since str is a pointer to a constant character, why are we allowed to assign it different string literals?  Further, how can we protect str from being modified?  It seems like this could be a problem if, for example, we later assigned str to a longer string which ended up writing over another portion of memory.  I should add that in my test, I printed out the memory address of str before and after each of my assignments and it never changed.  So, although str is a pointer to a const char, the memory is actually being modified.  I wondered if perhaps this is a legacy issue with C? What is the command to open the shutdown dialog? I've got the following two tables (in MySQL): Phone_book +----+------+--------------+ | id | name | phone_number | +----+------+--------------+ | 1  | John | 111111111111 | +----+------+--------------+ | 2  | Jane | 222222222222 | +----+------+--------------+  Call +----+------+--------------+ | id | date | phone_number | +----+------+--------------+ | 1  | 0945 | 111111111111 | +----+------+--------------+ | 2  | 0950 | 222222222222 | +----+------+--------------+ | 3  | 1045 | 333333333333 | +----+------+--------------+  How do I find out which calls were made by people whose phone_number is not in the Phone_book? The desired output would be: Call +----+------+--------------+ | id | date | phone_number | +----+------+--------------+ | 3  | 1045 | 333333333333 | +----+------+--------------+ I am trying to save a GeoJSON file in QGIS as EPSG:4326, but it keeps being saved as CRS84.   EPSG:4326 and CRS84 are the same except CRS84 saves coordinates as long, lat - and EPSG:4326 saves them as lat, long.   When I open the saved file in QGIS it's read as EPSG:4326, but really the file is CRS84. I know this because when I open the GeoJSON file in notepad it's listed as CRS84, and when I load the file in Shapely it's recognized as CRS84.   What's going on here?  I've tried this on both QGIS 3.6.3 and QGIS 3.4.8 with the same result. This occurs in the  released recently to the public. When someone posts a code block in their question or answer, the code block is cut off on the right hand side, and I can't scroll to the right to view the rest of it. How can I view these code blocks?