On a PAL xbox system - I can run some NTSC games. Is there a way to know which NTSC game will run on the PAL console just by its cover?
I just bought a  game (Forza 4) for my Xbox 360 (bought in the US). When I tried to play the game, it wouldn't load because of region issue. Is there a legal way to solve this (no crack)?
If a question is in all-uppercase or all-lowercase, our quality filters should automatically reject it Proposal If a question on an English-language Stack Exchange site does not contain at least one uppercase and one lowercase letter, our quality filter should reject it. (We can make exceptions for sites which don't use a mixed-case alphabet, such as .) Justification The quality filter currently rejects neither all-uppercase nor all-lowercase posts. I've checked. The best Stack Exchange users use mixed case. If an asker is too lazy to use their Shift key, their question tends not to be of very good quality. Don't take my word for it. You can see proof. Sam Saffron helped me write  which lets you see with your very own eyes that what I am saying is true. Single-case askers tend to ask poor-quality questions such as:      In addition, posts which use only uppercase or only lowercase — even if they aren't riddled with typos or grammatical errors — tend to be hard to read. Capitalization aids readability. Why is this proposal not a duplicate? This proposal is not a duplicate of the older proposal . This is because it also deals with all-lowercase questions. All-lowercase questions are 50 times more common than all-caps questions.  Stack Overflow gets only about 100 all-uppercase questions per year; see .  Yet it gets about 5,000 all-lowercase questions per year; see . (These statistics are for Stack Overflow only; the rest of our network wasn't considered.) I suspect that the older proposal was declined for two reasons:  All-uppercase questions are rare.  Therefore, the effort required to block all-uppercase questions is too much.   This proposal is better. For just a bit more effort, the Stack Exchange developers can get a much richer reward. Conclusion What do you think of my proposal? Agree? Disagree? Thoughts? PS: This idea is modified and adapted from  by Stack Exchange user Gilles. My dear sir Gilles, I thank you. Note There's even a  which automatically detects questions with all-caps titles and alerts interested users and moderators. I want to enable telnet on Windows 10.  I only see a telnet client but not a telnet server.  There is a web page telling me to open server manager and do a lot of stuff.  But, I don't have a server manager.  Please help!  I want to enable telnet. Does the proof of Bolzano-Weierstrass theorem require axiom of choice? When selecting the terms of subsequence from each bisections, I thought axiom of choice might be required. But I'm not so sure whether or not, so please tell me. [edited] I'm sorry for the lack of explanation. I want to prove this statement: Let $a_1, a_2, \ldots \in \mathbf{R}$, and $(a_n)_{n\in\mathbf{N}}$ is bounded, then $(a_n)$ has some convergent subsequence.  The proof is as follows. Since $(a_n)$ is bounded, for all $n\in\mathbf{N}$,   $a_n \in I = [b, c]$.  Now, let $I_0 = I$ and if $I_n = [b_n, c_n]$,  we define $d_n = (b_n+c_n)/2$ and  if infinite terms of $(a_n)$ is included in $[b_n, d_n]$(resp. $[d_n, c_n]$), we will define  $I_{n+1} = [b_n, d_n]$(resp. $[d_n, c_n]$).If both intervals contain infinite terms, let $I_{n+1}$ be $[d_n, c_n]$. For all $n\in \mathbf{N}$, infinite numbers of $m \in \mathbf{N}$ exist such that $a_m \in I_n$ suffices. We take the sequence of natural numbers $(n(k))_{k\in\mathbf{N}}$which suffices $n(0) &lt; n(1) &lt; \cdots &lt; n(k) &lt; \cdots$ following this procedure: Now we have already selected $a_{n(1)}, \ldots, a_{n(k)}$, there are infinite numbers of $m\in \mathbf{N}$ which suffices $n(k)&lt;m, a_m \in I_{k+1}$, so let's take the minimum m out of it. Applying this process recursively, we obtain a infinite convergent subsequence(?). I think intuitively, by only repeating this process we can't obtain countable infinite terms of subsequence because we have to repeat infinite times. Choosing C++ debugger on linux Can I use the "Scan" button with SANE? I have an HP Deskjet with integrated scanner. It has a "Scan" button on its top, but this button does not interact with the xsane program on my Debian machine: To get a page scanned, I have to initiate the scanning process from xsane.  Is there a setting (or a scan program) that allows me to press the scan button and cause the program to scan a page? If I press the "include alpha-button" in the Mix-Color-Node, I get white borders. Otherwise i've got a perfect alpha but no blue background. Let $f$ be defined on $\mathbb{R}$ by $f(x) = e^{-1/x^2}$ for $x$ not equal to $0$. and $f(0)= 0$. Prove that $f^{(n)}(0)=0$ for all $n = 1, 2,3$ ...  Do I need to use Taylor expansion from calculus class?  Any hint would be appreciated. All of my Firefox add-ons have been disabled suddenly, how can I re-enable them? Are smaller p-values more convincing? Number of possible permutations of n1 1's, n2 2's, n3 3's, n4 4's such that no two adjacent elements are same? Given $n_1 $ number of  $1 $'s,  $n_2 $ number of  $2 $'s,  $n_3 $ number of  $3 $'s,  $n_4 $ number of  $4 $'s.  form a sequence using all these numbers such that two adjacent numbers should not be same.  I have tries lot of things but nothing worked.  can somebody tell me how to solve this problem? How to dynamically create a local variable? This is problem 31b) from Dummit and Foote chapter 14.2. I am looking for a hint on how to attack the problem, since I have been thinking about it for a couple of hours but I don't even know where to start. The problem says:  Let $K$ be a finite extension of $F$ of degree $n$. Let $\alpha$ be an element of $K$. Prove that the minimal polynomial for $\alpha$ over $F$ is the same as the minimal polynomial for the linear transformation $T_{\alpha}$. In this problem, $T_{\alpha}$ is an $F$-linear transformation of $K$ that arises from $\alpha$ acting by left multiplication on $K$.  I appreciate any helpful suggestions on how to start attacking the problem or any possible hint. Thanks! dpkg:error:parsing file '/var/lib/dpkg/status' near line 1146 package 'python-minimal' How can I recover my external hard drive's free space? I had these partitions on an external hard drive:  /dev/disk2 (external, physical):    #:                       TYPE NAME                    SIZE       IDENTIFIER    0:      GUID_partition_scheme                        *2.0 TB     disk2    1:                        EFI EFI                     209.7 MB   disk2s1    2:                  Apple_HFS Android                 63.9 GB    disk2s2    3:                  Apple_HFS RiptideHUP              968.0 GB   disk2s3    4:       Microsoft Basic Data RiptideF                967.8 GB   disk2s4   My aim was to delete disk2s2 and then resize disk2s3 to occupy the leftover space by deleting disk2s2.  I deleted disk2s2 using this command:  diskutil  erasevolume  "Free Space"  ""  /dev/disk2s2   Now, to resize the volume, I used:  diskutil  resizevolume  /dev/disk2s3  R   However, I got this error:  Started partitioning on disk2s3 RiptideHUP Error: -69743: The new size must be different than the existing size   I did a bit of research and realised the free space was created before disk2s3 RiptideHUP so it cannot resize itself. Is there still a way I can reclaim the Free Space?  NOTE: Using diskutil list now shows:  /dev/disk2 (external, physical):    #:                       TYPE NAME                    SIZE       IDENTIFIER    0:      GUID_partition_scheme                        *2.0 TB     disk2    1:                        EFI EFI                     209.7 MB   disk2s1    2:                  Apple_HFS RiptideHUP              968.0 GB   disk2s3    3:       Microsoft Basic Data RiptideF                967.8 GB   disk2s4 In the Lord of the Rings it is said     "In Eregion long ago many Elven-rings were made, magic rings as you   call them, and they were, course, of various kinds: some more potent   and some less. The lesser rings were only essays in the craft before   it was full-grown, and to the Elven-smiths they were but trifles — yet   still to my mind dangerous for mortals. But the Great Rings, the Rings   of Power, they were perilous.”   [LotR I 2 (60)]   There is a clear distinction here between the 20 Rings of Power in the Ring Rhyme (the 7,9,3,and 1) and these other rings. What happened to the "lesser rings"? Turning water pump on/off using Arduino Uno R3 I'm trying to build a simple system to turn a water pump every 24 hours for 10-20 seconds. I have 5V pump. When I connect it to 5V, GND it works but when I connect it to pin 12 (or any other digital pin) and GND it does not work. Here's my sample sketch:  int led = 12;  void setup() {                   Serial.begin(9600);   pinMode(led, OUTPUT);      }  void loop() {   digitalWrite(led, HIGH); }   What am I doing wrong? I'm using a /tellraw command to display some kind of menu to the player. How can I react to the clickEvent without posting something in the chat? When I try using the scoreboard, I get an output in my chat like this Set score of &lt;objective&gt; for player &lt;playername&gt; to &lt;value&gt;. The same thing happens, when trying /setblock, /entitydata or /trigger Is there any way, I can execute a command which commandblocks can detect without writing a success/fail message in the chat?  the only commands without a "real" response message I found were /say, /tell and /tellraw. But all of these are impossible to detect(also, they write something else in the chat). Html form in email I have a laptop which I'm going to return due to battery defects. As I have already configured everything on this laptop, I'd like to migrate the installation on the new laptop (when I'll get it). The one to replace has a 128 GB eMMC, and two USB 3 ports. So, I was thinking to   Boot from a Linux live USB from port 1 Make an image with dd of the eMMC, saving it to a external HDD on port 2 Do the reverse on the new laptop   My question is, will it work fine with Windows? Does migrating this way have any issues? Would I be able to restore the installation if the new laptop is a different model with at least 128 GB? Best way for a 'forgot password' implementation?