Cross product in 4 dimensions
Is the vector cross product only defined for 3D?
If $\sum (a_n)^2$ converges and $\sum (b_n)^2$ converges, does $\sum (a_n)(b_n)$ converge? If $\sum (a_n)^2$ converges and $\sum (b_n)^2$ converges, does $\sum (a_n)(b_n)$ converge?  Could someone help me to solve this or at least give me a hint?, I have tried using Cauchy's criterion, the Dirichlet test for convergence, etc, but I can´t prove it.Honestly I don´t know where to start. Any help will be appreciated. Should I really pay off my entire credit card balance each month or should I maintain some balance? I've recently changed to the new Minecraft launcher, and I have noticed a change in the .minecraft folder layout. I can no longer install mods just by copying it over into the versions/1.6.1 jar file, as this file refreshes every time it is launched.  For those who don't know what I am talking about, here is the new layout:    I am specifically trying to install Optifine, which does work with 1.6.1. Where do I drag in the mod files now? I can't seem to find a jar file that is suited to it, except in the version folder, but as I stated above, this refreshes every time.  After copying a recent version and renaming it in the version folder, I get this error in the development console:   Unexpected exception refreshing version list java.lang.IllegalArgumentException: Version '1.6.1' is already tracked     at net.minecraft.launcher.updater.VersionList.addVersion(VersionList.java:91)     at net.minecraft.launcher.updater.LocalVersionList.refreshVersions(LocalVersionList.java:44)     at net.minecraft.launcher.updater.VersionManager.refreshVersions(VersionManager.java:47)     at net.minecraft.launcher.Launcher$2.run(Launcher.java:164)     at java.util.concurrent.Executors$RunnableAdapter.call(Unknown Source)     at java.util.concurrent.FutureTask$Sync.innerRun(Unknown Source)     at java.util.concurrent.FutureTask.run(Unknown Source)     at java.util.concurrent.ThreadPoolExecutor.runWorker(Unknown Source)     at java.util.concurrent.ThreadPoolExecutor$Worker.run(Unknown Source)     at java.lang.Thread.run(Unknown Source) Picking a lock typically requires a DC 15 Dexterity check (Basic rules, p. 49). Likewise for manacles (p. 50), which can alternately be escaped with a DC 20 Dexterity check or broken with a DC 20 Strength check. But what happens if you fail?  The general rules for ability checks state (p. 58):     If the total equals or exceeds the DC, the ability check is a success—the creature overcomes the challenge at hand. Otherwise, it’s a failure, which means the character or monster makes no progress toward the objective or makes progress combined with a setback determined by the DM.   As a DM, how can I handle this in practice? In our last session, the players wanted to get inside a locked building to rescue people trapped inside. Picking the lock seemed like an easy enough task for the rogue, but unluckily he failed the check, and I wasn’t prepared for the consequences. There wasn’t much time pressure and no obvious reason why he couldn’t try again, so I allowed another attempt, but it just didn’t feel right.  I’m sure that similar situations will come up again, so I’d like some advice on how to deal with checks so that they don’t just turn into a tedious exercise of rolling until you succeed. I presume that  was left out of the game for good reason, but I’m not sure what to do instead. I suspect that this was a good occasion to use “progress with a setback” but that’s a fairly new thing for D&amp;D and I’m not sure how to go about it. I’m unsure when I should use setbacks versus lack of progress, and in the latter case I’m unsure when I should allow players to try again versus requiring a different approach.  For example, suppose that a manacled player tries to pick the lock and fails the DC 15 Dexterity check. Now, the player could try to pick it again, or he could try one of the other escape methods, or he could wait for somebody else to rescue him, or he could simply succeed with some setback like a minor injury. How do I choose how to proceed? Or do I let the players choose? I am trying to use a Bluetooth headset on an Ubuntu PC. I am able to connect phone to pc via BT. I can stream music to PC. But cannot hear call audio. I have checked in Android phone logs, and BT sco link is established. But when making a call or virtual call (play audio through sco path in Android phone) the audio is not audible in PC headset. SCO packets are NOT appearing in btmon logs either. Anyone successfully done this?  version- ubuntu 16.04 Installed- bluez, ofono, pulseaudio pactl sink: Name- bluez_sink.22_22_8E_DE_B9_2B,             Name: alsa_output.pci-0000_00_1b.0.iec958-stereo pactl source: Name-bluez_sink.22_22_8E_DE_B9_2B.monitor               Name: alsa_input.pci-0000_00_1b.0.analog-stereo KeyListener not working Can't view deleted questions via Android app Are we slightly lighter during the day and slightly heavier at night, owing to the force of the Sun's gravity? What is the benefit of Krivine's notation? I saw some people uses Krivine's notation for function application when presenting the syntax for the $\lambda$-calculus.  For example, the $\lambda$-term $\lambda f . \lambda x . \lambda y . f\ x\ y$ (with the normal convention that function application associates to the left, so it actually means $\lambda f . \lambda x . \lambda y . ((f\ x)\ y)$) is written $\lambda f . \lambda x . \lambda y . (f)\ x\ y$ (with a similar convention that it actually means $\lambda f . \lambda x . \lambda y . ((f)\ x)\ y$).  I do not see the point of having another pair of parentheses around the innermost $f$.  Why do people use Krivine's notation instead of the usual one? Let $S$ and $W$ be subsets of a vector space $V$. Show that if $S$ is a subset of $W$, then $\mathrm{span}(S)$ is a subspace of $\mathrm{span}(W)$ Let $S$ and $W$ be subsets of a vector space $V$. Show that if $S$ is a subset of $W$, then $\mathrm{span}(S)$ is a subspace of $\mathrm{span}(W)$.  Ok I'm finally understanding what each of these things mean.. but I'm running out of ideas on how to actually show it without using arbitrary vector space examples like Rn. Since sets and subspaces are kind of new its hard to figure out how to write correct proofs with them.   I can see how if $V = \mathbb{R}^3$ and $S = \{(1,1,1)\}$ and $W = \{(1,1,1), (1,1,2)\}$ then $\mathrm{span}(S) = R1(line), span(W) = R2(plane)$ and that R1 is a subspace of R2... im just having trouble showing this officially when all vector spaces and sets are completely in general....  I could get as far as writing out $S=(u_1,u_2,\dots,u_n)$, $u_i \in V$ and same with $W$, but I can't really figure out what else to do in this sort of proof. $$\lim_{n\to \infty}\frac1{2n}\log\left({2n \choose n}\right)$$  Now, $\log(n!) = \Theta (n\log(n))$ so I think we could write,   $$\lim_{n\to\infty}\frac{1}{2n}\left(\log\left(2n!\right) - \log\left(n!^2\right)\right) = \frac{1}{2n}\left(\log\left(2n!\right) - 2\log\left(n!\right)\right) $$  $$\lim_{n\to\infty}\frac{1}{2n}\left(2n\log\left(2n\right) - 2n\log\left(n\right)\right) $$  $$\log\left(2n\right) - \log\left(n\right) = \log(2)$$  Is this legitimate? I feel this might be wrong since, the $\Theta$ notation conceals a constant factor. Are there any places to leave luggage in Brussels, for short and/or long periods of time? When should I use "when" and "while"? But you can't find anything while you're crying.   But you can't find anything when you're crying.   I'll tell you about it while Frank saddles the horse.   I'll tell you about it when Frank saddles the horse.     When should I use when, and when while? Are these sentences correct? Why can't light escape from a classical black hole? Would Dr Hannibal Lecter allow himself to be a consultant with Clarice if Miggs hadn't behaved improperly to her? Provide an easily discoverable way to get the full URL to an answer Why can't I use a type argument in a type parameter with multiple bounds? I recently installed an SSD and AFAIK Ubuntu makes a weekly FSTrim on SSD's that support it.  Is there a log file of this trims? If we map every integer to a string that represents a rational number, and produce a number different from all the ones listed, we are essentially following Cantor's algorithm. But why does it not apply? Is it because we can't be certain that the number produced is a rational number? How did Harry become a Horcrux?