Can my deck have fewer cards after sideboard?
MTG: Sideboard if maindeck has more than 60 cards
Derivation of the general forms of partial fractions How to read the content of a file to a string in C? How come the PHP private class var is not private? I have a new computer with a Seagate ST500DM002 SATA internal hard drive.  I am trying to install Ubuntu 11.10 64-bit on it but the installer does not recognize/detect/see the hard drive. When I reach the Installation type step, the panel which is supposed to show devices and partitions looks empty.  sudo fdisk -l shows only /dev/sda1, the USB drive from which I am running the installation. I have already tried the following two solutions without any success:   sudo apt-get remove dmraid Switch the SATA mode in the BIOS from IDE to AHCI   I am sure it's not a hardware related problem as I have already successfully installed another operating system on the same computer.  The output of sudo lshw -class storage -class disk follows:    *-ide UNCLAIMED                 description: IDE interface        product: ASMedia Technology Inc.        vendor: ASMedia Technology Inc.        physical id: 0        bus info: pci@0000:06:00.0        version: 01        width: 32 bits        clock: 33MHz        capabilities: ide msi pm pciexpress cap_list        configuration: latency=0        resources: ioport:d040(size=8) ioport:d030(size=4) ioport:d020(size=8) ioport:d010(size=4) ioport:d000(size=16) memory:fe400000-fe4001ff   *-storage        description: SATA controller        product: 6 Series/C200 Series Chipset Family 6 port SATA AHCI Controller        vendor: Intel Corporation        physical id: 1f.2        bus info: pci@0000:00:1f.2        logical name: scsi1        version: 05        width: 32 bits        clock: 66MHz        capabilities: storage msi pm ahci_1.0 bus_master cap_list emulated        configuration: driver=ahci latency=0        resources: irq:44 ioport:f0b0(size=8) ioport:f0a0(size=4) ioport:f090(size=8) ioport:f080(size=4) ioport:f060(size=32) memory:fe705000-fe7057ff      *-cdrom           description: DVD-RAM writer           product: DVDRAM GH22NS70           vendor: HL-DT-ST           physical id: 0.0.0           bus info: scsi@1:0.0.0           logical name: /dev/cdrom           logical name: /dev/cdrw           logical name: /dev/dvd           logical name: /dev/dvdrw           logical name: /dev/scd0           logical name: /dev/sr0           version: EX00           capabilities: removable audio cd-r cd-rw dvd dvd-r dvd-ram           configuration: ansiversion=5 status=nodisc   *-scsi:0        physical id: 1        bus info: usb@1:1.2        logical name: scsi6        capabilities: emulated scsi-host        configuration: driver=usb-storage      *-disk           description: SCSI Disk           physical id: 0.0.0           bus info: scsi@6:0.0.0           logical name: /dev/sda           size: 14GiB (16GB)           capabilities: partitioned partitioned:dos           configuration: signature=0004e5a4   *-scsi:1        physical id: 2        bus info: usb@1:1.3        logical name: scsi7        capabilities: emulated scsi-host        configuration: driver=usb-storage      *-disk           description: SCSI Disk           product: Storage Device           vendor: USB Mass           physical id: 0.0.0           bus info: scsi@7:0.0.0           logical name: /dev/sdb           capabilities: removable         *-medium              physical id: 0              logical name: /dev/sdb   Any idea on what I could do to fix this problem? After I saw that post i wanted to solve the first one which is $a\mid b^2,b^2\mid a^3,a^3\mid b^4,b^4\mid a^5\cdots$ Prove that $a=b$  Now i started by proving that $a$ and $b$ have same prime divisors,proving that is trivial,after doing so I checked do those factors have to have the same power.I tried with $$a=p^2,b=p^3$$ I noticed it exactly goes for 3 terms,or that $a^3\mid b^4$ doing $$a=p^{n-1},b=p^n\\p^{n-1}\mid p^{2n}\\p^{2n}\mid p^{3n-3}\\p^{3n-3}\mid p^{4n}\\p^{4n}\mid p^{5n-5}\\\cdots\\p^{n(n-1)}\mid p^{n(n-1)}\\p^{n(n-1)}\mid p^{n(n+1)}\\p^{n(n+1)}\not\mid p^{(n-1)(n+1)}$$ Now yeah I guess that would be a proof,but wouldn't setting $n=n+1$ infinitely many times make every term dividable? What is the probability of a biased coin coming up heads given that a liar is claiming that the coin came up heads? A biased coin is tossed.   Probability of Head - $\frac{1}{8}$  Probability of Tail - $\frac{7}{8}$  A liar watches the coin toss. Probability of his lying is $\frac{3}{4}$ and telling the truth is $\frac{1}{4}$. He says that that the outcome is Head. What is the probability that the coin has truly turned Head?  My Attempt:  I used the formula: $$P(A \mid B) = \frac{P(A\cap B)}{P(B)}$$  $\ \ \ \ \ \ $P(it is head GIVEN liar said it's head) = P(it's head AND liar said it's head) / P(liar said it's head)  or, P(it is head GIVEN liar said it's head) = $\frac{ \frac{1}{8} \frac{1}{4} }{ \frac{7}{8}\frac{3}{4} + \frac{1}{8}\frac{1}{4} }$ [using a probability tree will be helpful here]  or, P(it is head GIVEN liar said it's head) = $\frac{1}{22}$  The Question: Is the method I used wrong in any way? Some others I have talked to are saying the answer will be $\frac{1}{4}$. Their reasoning is this: since the liar lies 3 times out of 4 and he said it is head, then the probability of it being head is 1/4. So who is right? What will be the answer? Short description of the scoping rules? What exactly are the Python scoping rules?  If I have some code:  code1 class Foo:    code2    def spam.....       code3       for code4..:        code5        x()   Where is x found?  Some possible choices include the list below:   In the enclosing source file In the class namespace In the function definition In the for loop index variable Inside the for loop   Also there is the context during execution, when the function spam is passed somewhere else. And maybe  pass a bit differently?  There must be a simple reference or algorithm somewhere.  It's a confusing world for intermediate Python programmers. Does construction of a Lightsaber require use of the Force? It's true that Lightsaber construction is a mandatory skill for a trained Force user, but I am not sure about it in reverse.  @DVK has commented on  that:     Grievous wasn't a Jedi (or a Force Sensitive) at all. He couldn't construct one.   I always thought that a Lightsaber was a normal piece of technology which even non-Force users could construct, and you only need Force sensitivity to master  Lightsaber skills. But, I could be wrong.  Does construction of a Lightsaber require use of the Force? If yes, what role does the Force play in the construction of a Lightsaber? We have to prove that  "the product of two numbers ending in 6 also ends with 6" mathematically.  I have no clue how to start. I don't want you to prove it for me! but some hints would be very helpful as I'm totally stuck on how to start this prove. How to describe "object" arguments in jsdoc? I recently upgraded from Ubuntu 11.10 to 12.04. If it makes any difference, my system is a Dell Inspiron 1520.   I encounter a problem whenever I shutdown or restart; it kills all running processes (as far as I can tell), but once I get past the shutdown text screen and the screen goes black,  my computer doesn't power off. The fans still run and the screen is still on, etc. I have to hold down the power button in order to complety shut down.   Does anyone know how to resolve this problem? Inner border over images with CSS? Is there any way to bring an egg to its natural state (not boiled) after you cook it? This is probably a stupid question, but I'm curious now after I opened the refrigerator looking for eggs to make a cake and there was only one and it was cooked. Is there any way to undo that, whether at home or an industrial way? How do you post to an iframe? How do you post data to an iframe? My boss gave me a task with completion date suppose 31 March, 2017and I completed on 28 February, 2017. Is it in time or before time. I know this proof is somewhat similar, or related to the Baire's Category Theorem but I can't seem to figure out how to do it.  The Baire Category theorem asserts that if X is a complete metric space or a locally compact Hausdorff space (my case), then the complement of a countable union of nowhere dense sets is always nonempty.  How can I use this on the proof? Javascript variables keep track to their copies? Would you please tell me which of the following terms is correct? If both are correct, are they equal?     I have no [...] I don't have any [...] Remotely uninstall apps? I have tried through the Google Play store and it does not seem possible from there, but does anyone know if it is possible to remove an application remotely?   In other words, if I do not have direct access to my phone, can I make use of some website, app or service to uninstall an app without being able to interact with the phone directly. Parsing XML, JSON, and newer data file formats in UNIX using command line utilities The Unix environment has some excellent tools for parsing text in various forms. However, of late, the data is not in the traditional (historical) formats (CSV, TSV, record-based or some other delimiter-based) it used to be before. Data these days is exchanged in structured formats like XML/JSON.  I know there are some good tools like sed, awk and Perl which can chew down nearly any form of data out there. However, to work with this sort of structured data, often one has to write a complete program, and, given the little time available to extract information, one has to sit down and figure out the whole logic of what one wants to query and put it down programmatically. Sometimes this is not OK – basically because the information extracted from those files acts as inputs for further work; also because of the time it takes to search for the appropriate solution and code it up. A command line tool is needed with sufficient switches to find, query and dump data.  I'm looking for tools that take a XML/JSON or other forms of structured data and dump it into other formats like csv, etc., so that from there one could use other commands to get any information out of it.  Are there any command line utilities you know of which do this kind of a job? Are there already awk/Perl scripts available to this?