What happens if I pocket my last c/m along with striker? Opponent's n C/m are still on board.   Will I win with minimum n points? Will it be a double-due? Will I lose the game?
This is intended to be a canonical question regarding possible endings of the game.  For each question, assume a single proper strike was made, and note where an improper strike would change the game outcome (beyond an additional point for the opponent).  If the Queen has been covered:     What happens if I pocket my last C/m and the Striker? What happens if I pocket my opponent's last C/m? What happens if I pocket my opponent's last C/m and the Striker? What happens if I pocket both players' last C/m? What happens if I pocket both players' last C/m and the Striker?     If the shot covers the Queen:     What happens if I pocket my last C/m and the Queen? What happens if I pocket my last C/m, the Queen and the Striker? What happens if I pocket my opponents' last C/m and the Queen? What happens if I pocket my opponents' last C/m, the Queen and the Striker? What happens if I pocket both players' last C/m and the Queen? What happens if I pocket both players' last C/m, the Queen and the Striker?     If the Queen is left on the board:     What happens if I pocket my last C/m, leaving the Queen? What happens if I pocket my last C/m and the Striker, leaving the Queen? What happens if I pocket my opponent's last C/m, leaving the Queen? What happens if I pocket my opponent's last C/m and the Striker, leaving the Queen? What happens if I pocket both players' last C/m, leaving the Queen? What happens if I pocket both players' last C/m and the Striker, leaving the Queen?
Passport validity requirement to enter USA for travelling I need to compute the improper integral $$ \int_{-\infty}^{\infty}\frac{x^{2}}{\cosh\left(x\right)}\,{\rm d}x $$ using contour integration and possibly principal values.  Trying to approach this as I would normally approach evaluating an improper integral using contour integration doesn't work here, and doesn't really give me any clues as to how I should do it. This normal approach is namely evaluating the contour integral $$ \oint_{C}{\frac{z^2}{\cosh\left(z\right)}\mathrm{d}z} $$ using a semicircle in the upper-half plane centered at the origin, but the semicircular part of this contour integral does not vanish since $\cosh\left(z\right)$ has period $2\pi\mathrm{i}$ and there are infinitely-many poles of the integrand along the imaginary axis given by $-\pi\mathrm{i}/2 + 2n\pi\mathrm{i}$ and $\pi\mathrm{i}/2 + 2n\pi\mathrm{i}$ for $n \in \mathbb{Z}$. The residues of the integrand at these simple poles are $-\frac{1}{4}\mathrm{i}\pi^{2}\left(1 - 4n\right)^{2}$ and $\frac{1}{4}\mathrm{i}\left(4\pi n + \pi\right)^{2}$, so that even when we add up all of the poles, we have the sum $4\pi^{2}\mathrm{i}\sum_{n = 0}^{\infty}\,n$, which clearly diverges.  Any hints would be greatly appreciated. Granting access only to standby database One of the physical standby databases in my environment is open in read-only mode and used for reporting purposes . I want to give users access only to this particular standby, not to primary db.   The best approach I found so far is to create AFTER LOGON ON DATABASE trigger which checks v$instance (or maybe v$database), and throws error for depends on  values of host_name/instance_role columns  .   I wonder if there is a better way to do it. Do airlines have to check the visa status before selling a ticket? How to specifically use ntfsundelete to recover directory This is a followup on my original post  which may be deleted in the future.  In the process of backing up my audio books, I "permanently" removed a folder (with subfolders) that I had already exclusively moved to that drive. It's path is /media/gratis/Seagate Expansion Drive/Audiobooks/Jason Dark. The sole folder in that should be called John Sinclair; but I'm not sure about that.  Which tool offers the best chances to recover those files? I haven't written plenty on that drive afterwards; so I hope for the best. It's not that other methods failed; I just cant get my head around what to do and I want to be cautious. It's a NTFS Drive.  According to testdisk it has an "EFI GPT" Partition table.  Disk /dev/sdb - 5000 GB / 4657 GiB - CHS 608001 255 63, sector size=512 - Seagate Expansion Desk, FW:9401   Information According to "Disks" (Ubuntu Standard Software):  NTFS; GUID Partition Table; [...] Partition Type: Microsoft Reserved   Attempt 1: First off, ntfsprogs seems to no longer be in repos (those mentioned by another user); but it is already installed on my machine so no problems there. I always get the error:     Access is denied because the NTFS volume is already exclusively opened. The volume may be already mounted, or another software may use it which could be identified for example by the help of the 'fuser' command. You can use force option to avoid this check, but this is not recommended and may lead to data corruption.   Although I only just plugged it in and even quit Nautilus by force (nautilus -q).   Therefore, I ran sudo ntfsundelete /dev/sdb2 -f. That gave me a list of a bunch of files, 205013 to be exact. Now, what I want is the content of the directory .../Audiobooks/Jason\ Dark/ to be restored. What do I have to do? It's contents are .m4b &amp; .opus files and folders, of course. Reset the password in Ubuntu / Linux Bash in Windows I have installed Linux Bash on Windows 10 (available from Microsoft), but I've forgotten my password.  I've searched for a solution but I only find suggestions that involve doing something before the system boots, like accessing recovery mode, but that will not work in this case as this Ubuntu is just an application within a Windows system and doesn't have its own boot process.  How can I reset my password? How to write an RSS feed with Java? I'm using Java, and need to generate a simple, standards-compliant RSS feed. How can I go about this? Purely "algebraic" proof of Young's Inequality states that if $a, b \geq 0$, $p, q &gt; 0$, and $\frac{1}{p} + \frac{1}{q} = 1$, then $$ab\leq \frac{a^p}{p} + \frac{b^q}{q}$$ (with equality only when $a^p = b^q$).  Back when I was in my first course in real analysis, I was assigned this as homework, but I couldn't figure it out.  I kept trying to manipulate the expressions algebraically, and I couldn't get anywhere.  But every proof that I've seen since uses calculus in some way to prove this.  For example, a common proof is based on this  and integration.  The proof on Wikipedia uses the fact that $\log$ is concave, which I believe requires the analytic definition of the logarithm to prove (correct me if I'm wrong).  Can this be proven using just algebraic manipulations?  I know that that is a somewhat vague question, because "algebraic" is not well-defined, but I'm not sure how to make it more rigorous. But for example, the proof when $p = q = 2$ is something I would consider to be "purely algebraic":  $$0 \leq (a - b)^2 = a^2 + b^2 - 2ab,$$ so $$ab \leq \frac{a^2}{2} + \frac{b^2}{2}.$$ Regular expression: match start or whitespace Remove all content using pure JS Prove that$$\overbrace{\binom n 0 + \binom n 1 + \binom n 2 + \cdots + \binom{n}{\frac{n-1} 2}} + \overbrace{\binom n {\frac{n+1} 2} + \cdots + \binom n {n-1} + \binom n n} = 2^n. $$   Background:  This problem came from the following link:    and I didn't understand why that was true in which no one on the page has proved it to be so. and i was wondering what was the proof on that Why can’t the Doctor’s companions understand babies and horses? The Doctor claimed to speak both horse and baby. The reason human companions can understand every language is because the TARDIS translates. So why can't anyone else understand babies and horses? Security Review - CRUD/FLS Checks for every SOQL Query I know this sounds like a standard question, so please bear with me.  Recently our Security Reviews fail due to CRUD/FLS violations. The highlighted codelines include almost every SOQL Query in the application.  Our approach is usually as follows:   In case of displaying data on VF pages we either use sObjects fields or use the platform methods to check the accessibility of the fields In case of domain logic triggered by the user (e.g. by clicking a button on a VF page) we have a helper class that checks every field to be updated before doing the DML operation.   Up until recently this approach has worked fine (and passed pervious Security Reviews). As mentioned above the latest Security Review results seem to require us to check every field in a SOQL query for accessibility even if it is never displayed back to the user.    Let's suppose the following program flow as an example:   Query an object with some fields Perform some modification on said fields Perform an update on the sObject to save the modification using a helper class which checks for the required CUD/FLS rights for the modified fields   As I see it there is no need for checking field accessibility in step 1 in that case (since nothing is displayed back to the user and the dml operation is already protected). Is that correct or am I missing something? So is it really required to do an accessibility check for every SOQL Query in the code?  Another question would be how to handle background operations in that case like data purging. These have either to be running in system mode (which causes issues during the Security Review) or require the job to be started by a user with the appropriate access rights (which can be error prone and is not that user friendly). Is there any best practice regarding that.  Unfortunately I could not find a question targeting exactly that issue. Most of the questions I have found are related to how to perform that check (like  or ). So please apologize in case the question was already answered (I would really appreciate a link to the answer then).    Thanks for your time and help.  Mathias the following code will only make the qed not appear in the second proof. However, it it possible to make the qed symbol never appear at the end of the proofs without having to specify it locally every time?  \documentclass{article} \usepackage{amsthm} \begin{document} \begin{proof} This has the QED symbol. \end{proof} \begin{proof}\renewcommand{\qedsymbol}{} This hasn't. \end{proof} \begin{proof} And this has it again. \end{proof} \end{document} Simulating data to fit a mediation model Prove by induction: $$\frac1{n+1} + \frac1{n+2} + \cdots +\frac1{3n+1} &gt; 1$$  adding $1/(3m+4)$ as the next $m+1$ value proves pretty fruitless. Can I make some simplifications in the inequality that because the $m$ step is true by the inductive hypothesis, the 1 is already less than all those values? I am trying to assign an image texture to an Image Texture node in 2.80. Very simple script - I'm just starting to learn how this stuff works.  This is what I have. It creates an image and and IT node, but it doesn't assign the one to other. Can anybody help? I've searched around, but can't find it in another question.  import bpy  #create blank image bpy.ops.image.new(name="TestImg", width=1024, height=1024)  #add image texture to object, to hold baked lighting mat = bpy.context.view_layer.objects.active.active_material image_node = mat.node_tree.nodes.new('ShaderNodeTexImage')  #assign image to image texture node image_node.image = "TestImg"   Thanks in advance. TeXShop and Mac preview crashing when opening latex/beamer built pdfs After updating to Sierra 10.12.4 last week, TeXShop crashes:   when opening an existing .tex document that has a pdf associated to it immediately after compiling a new document, i.e. as soon as a pdf is created.   Furthermore, preview crashes opening almost any pdf that has been created with TeXShop. There is virtually nothing on the internet about it, and the only solution seems to be a complete reinstall of MacOSX (so as to reinstall the supposedly broken preview), which I'd like to avoid if at all possible.  Someone else has described a similar issue, but has not received any responses ().  I would be very grateful for some help, as I can neither produce work, nor look at any at the moment. Many thanks! Adding/updating field to polygon feature class that lists bordering (neighbor) polygons? I have a dataset of zipcodes.  I want to add a new field "NEIGHBORS" that includes bordering polygons in a comma delimited manner such as attached image: Add the Same Modifier to Multiple Objects at Once?