I had 5 outlets moved to under my cabinets. The Electrician put a junction box over the old outlets. I now need to install backsplash. Can the tile guy cover the box with the backsplash?
The outlet for my range hood was misplaced. It needs to be 4 inches to the side. I can make the junction and move the wiring to the new location but I really don't want to have the empty plate exposed.   The wire is not long enough to reach the required location, so I will make a junction in the existing box, and add a new box at the correct location.  Is there any acceptable circumstance where I could tile over the "old" in-wall junction box?  I'm guessing not, but I figured I'd ask.  EDIT: I should clarify, based on the answers below... I know for a fact that this outlet is the only line on this entire circuit, all the way back to the panel. I am asking explicitly if there is any way to acceptably splice the wiring without exposing a junction box.
I exported a map and everything looks fine when viewing the PDF. But when printing it on my plotter, all the text disappears. The scale bar would bring but the text associated to the scale bar wouldn't. The title block also disappears. I've tried messing around with the settings. I've checked/unchecked &quot;Embed All Document Fonts&quot; and &quot;Convert Marker Symbols to Polygons&quot;. I'm not sure what I'm doing wrong here. What's weird is I exported this map a few weeks ago and it printed just fine. Today, I needed to make a change to the map and exported it out, and now I am experiencing this issue. I must have changed one of the export settings in the past few weeks but I'm not sure what it is. Has anyone experienced this? The world I've been playing crashed recently and took the level.dat with it, so I've recreated it, however I have no idea what my seed used to be, and I really don't want to end up with another corrupted game world from exploring with the wrong seed.  How can I recover the seed which was used to generate my world? Convergence of the series $\sum_n \frac{n^{\log(n)}}{\log(n)^n}$ I have a rough outline of a proof. Is this correct?  $$\sum_{n \geq 2} \frac{n^{\log(n)}}{\log(n)^n} \to a \in \mathbb{R} \iff  \sum_{n \geq 2} 2^n \frac{(2^n)^{\log(2^n)}}{\log(2^n)^{2^n}} \to b \in \mathbb{R}$$ via dyadic criterion (or Cauchy condensation test).  Analyzing the right-hand side:  $$\sum_{n \geq 2} 2^n \frac{(2^n)^{\log(2^n)}}{\log(2^n)^{2^n}} = \sum_{n \geq 2} 2^n \frac{(2^n)^{n\log2}}{(n\log2)^{2^n}} = \sum_{n \geq 2} \frac{(2^n)^{n\log2 + 1}}{(n\log2)^{2^n}} = \sum_{n \geq 2} \frac{2^{n^2\log2 + n}}{(n\log2)^{2^n}} = (\ast). $$  We know for some sufficiently large $N$, $n \log 2 \ge 2$ for all $n\ge N$, so we can bound the series above by:  $$(\ast) \leq C_N + \sum_{n \geq N} \frac{2^{n^2\log2 + n}}{2^{2^n}} = \sum_{n \geq N} 2^{n^2\log2 + n - 2^n} = (\ast\ast),$$  where $C_N$ is the finite sum of the original series until $N$. And once again, for sufficiently large $M$, $m^2\log2+m - 2^m \leq -m^2$ for all $m \ge M$. Hence  $$ (\ast\ast) \leq C_{\max(N,M)} + \sum_{n \geq \max(N,M)} 2^{-n^2} &lt; \infty.$$  We then use the $p$-test to conclude that the sequence does converge. How to calculate relatedness in haplodiploid organisms (mainly full sisters and full brothers)? I have tried to calculate the relatedness for haplodiploid organisms, but cannot understand the calculations behind full sister and full brother.  (taken from  I have managed to solve the other cases. Since female will have ZZ:  female will share 1/2 of her genes with daughter female will share 1/2 of her genes with son female will share 1/2 of her genes with mother female will share 1/2 of her genes with father  Since male will have only Z:  male will share 1 (100%) of his genes with his daughter male won't share anything with his son (unfertilized eggs leads to male in haplodiploidy system) male will share 1(100%) of his genes with his mother male won't share anything with his father (unfertilized eggs leads to male in haplodiploidy system)  Even though I figured out how others work, I wasn't able to calculate r for fullsister fullbrother? How can it be 3/4,1/4,1/2,1/2? Which OpenType Math fonts are available? What OpenType math fonts are there available for usage in TeX/LaTeX, e.g. with the unicode-math package?  Here is a MWE which you can use to show off the font.  \documentclass{article} \pagestyle{empty}  \usepackage{amsmath} \DeclareMathOperator\Res{Res} \newcommand*\diff{\mathop{}\!\mathup{d}}  \usepackage{amsthm} \newtheorem{theorem}{Theorem}  \usepackage{unicode-math}  %%% % Set up you text and math fonts %%%  \begin{document}  \begin{theorem}[Residue theorem]   Let $f$ be analytic in the region $G$ except for the isolated   singularities $a_1,a_2,\dots,a_m$. If $\gamma$ is a closed   rectifiable curve in $G$ which does not pass through any of the   points $a_k$ and if $\gamma\approx 0$ in $G$, then   \[     \frac{1}{2\pi i} \int\limits_\gamma f\Bigl(x^{\mathbf{N}\in\mathbb{C}^{N\times 10}}\Bigr)     = \sum_{k=1}^m n(\gamma;a_k)\Res(f;a_k)\,.   \] \end{theorem}  \begin{theorem}[Maximum modulus]   Let $G$ be a bounded open set in $\BbbC$ and suppose that $f$ is a   continuous function on $G^-$ which is analytic in $G$. Then   \[     \max\{\, |f(z)|:z\in G^- \,\} = \max\{\, |f(z)|:z\in \partial G \,\}\,.   \] \end{theorem}  First some large operators both in text: $\iiint\limits_{Q}f(x,y,z) \diff x \diff y \diff z$ and $\prod_{\gamma\in\Gamma_{\bar{C}}}\partial(\tilde{X}_\gamma)$;\ and also on display \[   \iiiint\limits_{Q}f(w,x,y,z) \diff w \diff x \diff y \diff z   \leq   \oint_{\partial Q} f'\Biggl(\max\Biggl\{   \frac{\Vert w\Vert}{\vert w^2+x^2\vert};   \frac{\Vert z\Vert}{\vert y^2+z^2\vert};   \frac{\Vert w\oplus z\Vert}{\vert x\oplus y\vert}   \Biggr\}\Biggr)\,. \]  \end{document}   Here is a similar MWE for ConTeXt.  The images in the answer will only be shown for LaTeX output but the ConTeXt output looks very similar.  %%% % Set up you text and math fonts %%%  \setupmathlabeltext[Res=Res] \definemathcommand[Res][nolop]{\mfunctionlabeltext{Res}} \definemathcommand[diff]{\mathop{}\!\mfunctionlabeltext{diff}}  \defineenumeration   [theorem]   [text={Theorem},    style=italic,    title=yes,    titlestyle=normal,    distance=0pt,    titleleft={(},    titleright={).~},    alternative=serried,    width=fit]  \starttext    \starttheorem[title={Residue theorem}]     Let $f$ be analytic in the region $G$ except for the isolated     singularities $a_1,a_2,\dots,a_m$. If $\gamma$ is a closed     rectifiable curve in $G$ which does not pass through any of the     points $a_k$ and if $\gamma\approx 0$ in $G$, then     \startformula       \frac{1}{2\pi i} \int\limits_\gamma f\Bigl(x^{{\mathbf N}\in\mathbb{C}^{N\times 10}}\Bigr)       = \sum_{k=1}^m n(\gamma;a_k)\Res(f;a_k)\,.     \stopformula   \stoptheorem    \starttheorem[title={Maximum modulus}]     Let $G$ be a bounded open set in $\mathbb{C}$ and suppose that $f$ is a     continuous function on $G^-$ which is analytic in $G$. Then     \startformula       \max\{\, |f(z)|:z\in G^- \,\} = \max\{\, |f(z)|:z\in \partial G \,\}\,.     \stopformula   \stoptheorem    First some large operators both in text:   $\iiint\limits_{Q}f(x,y,z) \diff x \diff y \diff z$   and   $\prod_{\gamma\in\Gamma_{\bar{C}}}\partial(\tilde{X}_\gamma)$;\   and also on display   \startformula     \iiiint\limits_{Q}f(w,x,y,z) \diff w \diff x \diff y \diff z     \leq     \oint_{\partial Q} f'\Biggl(\max\Biggl\{     \frac{\Vert w\Vert}{\vert w^2+x^2\vert};     \frac{\Vert z\Vert}{\vert y^2+z^2\vert};     \frac{\Vert w\oplus z\Vert}{\vert x\oplus y\vert}     \Biggr\}\Biggr)\,.   \stopformula  \stoptext Is it really possible to break the speed of light by flicking your wrist with a laser pointer? is there a way to get the option "Organize Desktop by Name" in Ubuntu 19.10 same as in 18.04? G is the product of its Sylow subgroups I want to prove the following:     If every Sylow subgroup of $G$ is a normal subgroup, then $G$ is isomorphic to the product of its Sylow subgroups.   So far, I have gotten to realize that for every prime factor $p_i$ of $|G|$, there is exactly one Sylow subgroup and that these form a partition of $G$. However, I am having trouble finding the isomorphism between $G$ and the product which I will call $G_1 \times \ldots \times G_r$. My idea was just to use the mapping $(g_1, \ldots, g_r) \mapsto g_1\ldots g_r$, which is a bijection, but I don't see whether it is a homomorphism. In general, not all elements of $G_i$ commute with elements of $G_j$, so one cannot simply change the order of the elements in the product. Bad match with a gaming group, how to leave? I have sometimes joined groups whose play style didn't work for me. At some point it became clear that as much as I wanted to enjoy the game I couldn't. And I was probably undermining the fun at the table for others too.  What is the best way to leave the group? Quietly or with a few explanations? Announce it in person or by email/phone/forum? Is it OK to recruit players from the group for another game? I frequently cross this issue, and always have to google for an answer. Does anyone have a permanent fix for BADSIG errors from apt-get?     W: GPG error:    lucid   Release: The following signatures were   invalid: BADSIG 54422A4B98AB5139   Oracle Corporation (VirtualBox archive   signing key) Do virtual particles actually physically exist? Intel Corporation Device [8086:0d4f] is not supported on Ubuntu 18.04.3 I am currently unable to install ubuntu server 18.04.03 LTS on the latest intel NUC10i7FNH.  Ubuntu always states both network adapters as unclaimed. The previous version (NUC8i7BEH) has the same network controller I219-V and worked like a charm.  *-network:0 UNCLAIMED      description:  Network controller      product: Intel Corporation      vendor: Intel Corporation      physical id: 14.3      ...   Without network it is not even possible to follow most suggestions how to get it enabled, because it is impossible to fetch new packages from internet.  Here are some more information as requested:  The output from: modprobe -v e1000e &amp;&amp; dmesg | grep e10   [ 3447.889394] e1000e: Intel(R) PRO/1000 Network Driver - 3.2.6-k [ 3447.889395] e1000e: Copyright(c) 1999 - 2015 Intel Corporation.   The output from: sudo lspci -knn  00:1f.6 Ethernet controller [0200]: Intel Corporation Device [8086:0d4f]     Subsystem: Intel Corporation Device [8086:2081] 01:00.0 PCI bridge [0604]: Intel Corporation JHL7540 Thunderbolt 3 Bridge [Titan Ridge 2C 2018] [8086:15e7] (rev 06)    For me this looks somehow, as the kernal driver would not be in use :-/  Here are a few more information i got from playiung around with 19.10 desktop version.  [    0.000000] Linux version 5.3.0-29-generic (buildd@lcy01-amd64-024) (gcc version 9.2.1 20191008 (Ubuntu 9.2.1-9ubuntu2)) #31-Ubuntu SMP Fri Jan 17 17:27:26 UTC 2020 (Ubuntu 5.3.0-29.31-generic 5.3.13)   output from lshw:    *-network:0        Beschreibung: Kabellose Verbindung        Produkt: Intel Corporation        Hersteller: Intel Corporation        Physische ID: 14.3        Bus-Informationen: pci@0000:00:14.3        Logischer Name: wlp0s20f3        Version: 00        Seriennummer: c8:09:a8:9c:cd:e0        Breite: 64 bits        Takt: 33MHz        Fähigkeiten: pm msi pciexpress msix bus_master cap_list ethernet physical wireless        Konfiguration: broadcast=yes driver=iwlwifi driverversion=5.3.0-29-generic firmware=48.4fa0041f.0 ip=192.168.178.109 latency=0 link=yes multicast=yes wireless=IEEE 802.11        Ressourcen: iomemory:600-5ff irq:16 memory:6023114000-6023117fff   The output from: modprobe -v e1000e &amp;&amp; dmesg | grep e10  [    2.357430] e1000e: Intel(R) PRO/1000 Network Driver - 3.2.6-k [    2.357430] e1000e: Copyright(c) 1999 - 2015 Intel Corporation. [    2.357616] e1000e 0000:00:1f.6: Interrupt Throttling Rate (ints/sec) set to dynamic conservative mode [    2.562796] e1000e 0000:00:1f.6 0000:00:1f.6 (uninitialized): registered PHC clock [    2.634139] e1000e 0000:00:1f.6 eth0: (PCI Express:2.5GT/s:Width x1) 1c:69:7a:60:44:f0 [    2.634140] e1000e 0000:00:1f.6 eth0: Intel(R) PRO/1000 Network Connection [    2.634258] e1000e 0000:00:1f.6 eth0: MAC: 13, PHY: 12, PBA No: FFFFFF-0FF [    2.634991] e1000e 0000:00:1f.6 eno1: renamed from eth0 [    5.103285] checking generic (4000000000 e10000) vs hw (4000000000 10000000) [   15.806697] e1000e: eno1 NIC Link is Up 1000 Mbps Full Duplex, Flow Control: None    output from lspci:  00:1f.6 Ethernet controller [0200]: Intel Corporation Ethernet Connection (10) I219-V [8086:0d4f]     DeviceName:  LAN     Subsystem: Intel Corporation Ethernet Connection (10) I219-V [8086:2081]     Kernel driver in use: e1000e     Kernel modules: e1000e What is the inverse of the $\mbox{vec}$ operator? There is a well known  operator $\mbox{vec}$ in matrix analysis.   I've vectorized my matrix equations, did some transformation of vectorized  equations and now I want to get back to the matrix form. Is there special operator for it? Variation of the Kempner series – convergence of series $\sum\frac{1}{n}$ where $9$ is not a digit of $1/n$. It is easy to argue that the  converges:  $$  \sum\limits_{\substack{n \text{ s.t. 9 is}\\\text{ not a digit} \\\text{ of } n}}  \frac{1}{n} &lt; \infty$$  Let $E \subset \Bbb N_{&gt;0}$  the subset of the positive integers  such that $9$ is not a digit of the decimal expansion of $1/n$ (the decimal expansion is not allowed to have a trailing infinite sequence of "$9$"s. For instance $0.24999...$ is not allowed).  Here are the  that don't belong to $E$ : $11,13,17,19,21,23,29,31,34,38,41,…$ (not known by the OEIS, by the way).  My question is:     Does the series    $$ \sum\limits_{n \in E} \frac{1}{n} \tag 1$$ converge?   My attempt is :   Let $1/n = 0,a_1 a_2 \dots a_k \overline{b_1 b_2 \dots b_m}$ with $n \in E$. Since $1/n$ has no digit "9", we have at most $9^{k+m}$ possibilities for the $a_i$'s and $b_j$'s. Moreover, $1/n ≥ 0,00...0\overline{00...01}≥1/10^{k+m}$. But then I can only bound my series $(1)$ from below, by some real number. So, this is not a clue for the divergence of the series. Apparently, the numbers of the form $n=10k+1$ don't belong to $E$. Maybe we can find sufficiently many numbers that have $9$ in the decimal representation of their reciprocals, so that $(1)$ could converge...   Any comment will be appreciated ! Require v8 only contrib module with v9 patch Confidence interval around binomial estimate of 0 or 1 What is the best technique to calculate a confidence interval of a binomial experiment, if your estimate is that $p=0$ (or similarly $p=1$) and sample size is relatively small, for example $n=25$? Can't run a shell script So I have this script:  #!/bin/bash # Flips the screen (hopefully)  syntax_error=0 orientation=0  current_orientation="$(xrandr -q --verbose | grep 'connected' | egrep -o  '\) (normal|left|inverted|right) \(' | egrep -o '(normal|left|inverted|right)')" case $current_orientation in         normal)                 current_orientation=0         ;;         left)                 current_orientation=1         ;;         inverted)                 current_orientation=2         ;;         right)                 current_orientation=3         ;; esac  if [ $current_orientation -eq 0 ]; then         orientation=2 fi  if [ $current_orientation -eq 2 ]; then         orientation=0 fi method=evdev  # LENOVO S10-3t CHANGE ==&gt; Hard Coded my device number to 11!!!!!!!!  device=11  swap=0 invert_x=0 invert_y=0 real_topx=0 real_topy=0 real_bottomx=4020 real_bottomy=4020  case $orientation in         0)                 swap=0                 invert_x=0                 invert_y=0                 topx=$real_topx                 topy=$real_topy                 bottomx=$real_bottomx                 bottomy=$real_bottomy         ;;         1)                 swap=1                 invert_x=1                 invert_y=0                 topx=$real_topx                 topy=$real_topy                 bottomx=$real_bottomy                 bottomy=$real_bottomx         ;;         2 )                 swap=0                 invert_x=1                 invert_y=1                 topx=$real_topx                 topy=$real_topy                 bottomx=$real_bottomx                 bottomy=$real_bottomy         ;;         3 )                 swap=1                 invert_x=0                 invert_y=1                 topx=$real_topx                 topy=$real_topy                 bottomx=$real_bottomy                 bottomy=$real_bottomx         ;; esac  if [ $method = "evdev" ]; then         xinput set-prop "$device" "Evdev Axes Swap" $swap         xinput set-prop "$device" "Evdev Axes Swap" $swap         xinput set-prop "$device" "Evdev Axis Inversion" $invert_x $invert_y         xinput set-prop "$device" "Evdev Axis Calibration" $topx $bottomx $topy $bottomy         if [ $orientation = 2 ]; then                            xrandr -o inverted         fi         if [ $orientation = 0 ]; then                 xrandr -o normal         fi fi  #   It's for flipping screen in my Lenovo S10-3t. I copied it from the netbook's wiki page, and added the #!/bin/bash at the top. The filename is flipscreen.sh. How can I make it work? Proof that disjoint cycles commute Does the 14 day self-isolation period in the UK end if a travel-corridor starts during the 14-day self-isolation period? Defining the Complex numbers I posted this question nearly 10 days ago, but am still really not satisfied with the answers I got, I have no prior education in abstract algebra, group theory, or other abstractions, and most of the answers I got involved defining sets, groups and other things I am unfamiliar with, my question was,  How does one know the notion of real numbers is compatible with the axioms defined for complex numbers, ie how does one know that by defining an operator '$i$' with the property that $i^2=-1$, we will not in some way contradict some statement that is an outcome of the real numbers.  For example if I defined an operator x with the property that $x^{2n}=-1$, and $x^{2n+1}=1$, for all integers n, this operator is not consistent when used compatibly with properties of the real numbers, since I would have $x^2=-1$, $x^3=1$,thus $x^5=-1$, but I defined $x^5$ to be equal to 1.  How do I know I wont encounter such a contradiction based upon the axioms of the complex numbers.  I reiterate here again, Please don't use terminology, or abstract math, that hasn't been taught in say a thorough collage level calculus 1 course.  Here's a link to the same question I asked 8 or so days ago: