My OS is Windows 7 (a localized version of this OS). I want to be able to enter any character in the applications mentioned in the title. I've tried some methods described on SE sites, including:    To be able to input characters using Unicode, run C:\Windows\regedit.exe, inside the application navigate to Computer -&gt; HKEY_CURRENT_USER -&gt; Control Panel -&gt; Input Method and right-click -&gt; New -&gt; Key and name the key(/folder) EnableHexNumpad. On the right-hand side of the application, the type, which is set to REG_SZ, is OK, but you need to set the value to 1: double-click under Name and enter the value 1 in the popup window that shows up. Then close the regedit.exe application and reboot the system for the changes to take effect.    But this does not work for me: Word 2007 intercepts Alt + keyboard plus and thinks I want to insert an equation. Notepad thinks that I want to pull down a menu from the top when I press Alt. And I've even tried inserting the + key with SHIFT+= after keeping the Alt key pressed by no luck. And it doesn-t seem to work in chrome and firefox either.  Thank you for your help.
This is in Windows, but answers for other operating systems can be handy to others.  Most guides say something to the effect of "hold down the Alt key and type in the code on the keypad".  This works fine for decimal codes (like 65 for 'A'), but not for  codes (like  for 'A').  Some applicatons provide other facilities that will allow hexadecimal Unicode character codes to be typed and then transformed.  Word allows you to type the code (such as 200f) and then convert it to Unicode by typing Alt-X.  I'm looking for a general method of doing this that will work with the standard input.
Do these new insights into prime numbers affect encryption security? reports:  Two mathematicians have uncovered a simple, previously unnoticed property of prime numbers [...]. Prime numbers, it seems, have decided preferences about the final digits of the primes that immediately follow them. Among the first billion prime numbers, for instance, a prime ending in 9 is almost 65 percent more likely to be followed by a prime ending in 1 than another prime ending in 9.  Do these insights make breaking keys based on primes more mathematically plausible in a shorter amount of time? How to lazy load images in ListView in Android I am using a ListView to display some images and captions associated with those images. I am getting the images from the Internet. Is there a way to lazy load images so while the text displays, the UI is not blocked and images are displayed as they are downloaded?   The total number of images is not fixed. How do I remove an element from a list by index in Python?  I found the list.remove method, but say I want to remove the last element, how do I do this? It seems like the default remove searches the list, but I don't want any search to be performed. dynamic does not contain a definition for a property from a project reference I have heard several pseudoscientific explanations about the  and find them hard to believe.  As a mathematician mainly focusing on functional analysis, I have a considerable interest in this matter. Although I still have no idea about it, I aim to truly understand it one day. For now, the question is:  Can the Heisenberg Uncertainty Principle be explained so that a non-scientist can at least get a correct idea of what it says and what not?  One of the most heard explanations is the one that says naïvely that while trying to determine the position of a particle you send energy (light) so you modify its speed, therefore making it impossible to determine the speed. If I understand well this should only be a some sort of metaphor to explain it, right? The RSA signature operation is basically the same as encrypting with the private key.  In particular, both operations use the same kind of keys.  Is it safe to use the same RSA keypair both for encryption / decryption and for signing / verification? Checking via ArcPy if ArcMap is in edit session? How do I keep running a Service the whole time? I have this statement and I need to say if it is true or false:  Let $\{a_n\}$ be a real sequence.  $$\lim_{n\to +\infty} a_n = 0 \quad \implies \quad \sum_{n=1}^{\infty}(-1)^na_n \quad \text{converges}$$  I know, from the Leibniz criterion that:     If $a_n \to 0$, $a_n$ is decreasing and positive then $\sum_{n=1}^{\infty}(-1)^na_n$ converges   From this fact I believe that the statement is false but I couldn't come up with an infinitesimal sequence that isn't decreasing and for that reason is divergent. I tried some function with $sin(\frac{1}{n})$ without any luck. Any help would be very appreciated, thank you! So I can start from len(collection) and end in collection[0].  I also want to be able to access the loop index. What is a StackOverflowError? What is a StackOverflowError, what causes it, and how should I deal with them? How to install Telegram Why are date-based hats awarded too early? I just got the  hat which states "post or vote on December 21".  Does SE have a time machine now? Can I get SSD rw performance while keeing data security if I combine SSD & HDD in btrfs RAID1 I have 2 storage devices; classical slow HDD (750GB, /dev/sda) and faster SSD (128GB, /dev/sdb). Currently I have installed Ubuntu &amp; Mint on same btrfs partition on SSD (/dev/sdb5). My btrfs pool consists of /dev/sdb5.  What I want to achieve is data replication on HDD while keeping SSD performance: Something like this:  For read case it would be ideal for procedure to go like this:   read from SSD check checksum if it verifies.. awesome, give me the data if not, fetch data from HDD and perform error correction through duplicate data   I'd manually run (some tool I'm not sure which one... btrfs check --repair perhaps?) every month or so to check HDD checksums and correct them via SSD data against bitrot.  For write case:   write to SSD sync to HDD when write requirements are low, thus not slowing down the system.   Is this possible and how would I do it?  Bottom line is, I like btrfs and would like it to duplicate data across HDD &amp; SSD drive automatically while keeping SSD excellent performance.   Using SSD as write cache is not an option since it's missing data duplication and security. How can I get a specific Floor in my Tower? I really really want a specific floor () in my Tiny Tower.  How does the game decide which exact business will go into the "Creative" floor?  Do I have to meet requirements (such as tower height) to unlock certain floors? Assuming file2 already exists, the command   &gt; file1 &lt; file2 cat   appears to be copying the content of file2 to file1.  But I cannot understand this structure.  I understand that "Nothing" is being directed to file1 (creating or erasing its content). Then the content of file2 is being directed to file1.  Why is cat after file2? How does it know to cat file2 if the operands are not in the correct order? Can you link external USB hard drives in a RAID-style system? Can file uploads time out in PHP? Hi im quite new to PHP, i have created a form for very large csv files to be uploaded to my server. Some one mentioned to me that the browser can time out due to the uploading file being to big, is this true? and if so, can it be prevented?  Thanks for your help! How do the tens­es and as­pects in English cor­re­spond tem­po­ral­ly to one an­oth­er? Non-na­tive speak­ers of­ten get con­fused about what the var­i­ous tens­es  and as­pects mean in English. With in­put from some of the folk here I've put to­geth­er a di­a­gram that I hope will pro­vide some clar­i­ty on the mat­ter.  I of­fer it as the first an­swer to this ques­tion. Con­sid­er it a liv­ing doc­u­ment. In­put is wel­come, and good sug­ges­tions will be  in­cor­po­rat­ed in­to the di­a­gram.    No­ta bene: What this is not is a dis­cus­sion of whether there are  more than two tens­es in English. , to which this ques­tion is not in­tend­ed to sup­ply ar­gu­ments one way or the oth­er.  Here, the aim is to pro­vide an overview of what con­struc­tions English-speak­ing peo­ple use for con­vey­ing in­for­ma­tion about ac­tions re­fer­ring to past, present, and fu­ture, and to pro­vide it first and fore­most to pre­cise­ly the peo­ple who are like­ly to use "tense" as a catch-all term in their search, rather than to lin­guists who know bet­ter.  Break­ing News There is now an ex­cel­lent ELU blog ar­ti­cle ti­tled  . It is high­ly rec­om­mend­ed read­ing. Hint on how to prove the identity $\sum_{0 \leq k \leq n } \binom{k}{m} = \binom{n + 1}{m + 1}$