Show that $\left( \frac{q}{p} \right) \equiv q^{(p-1) / 2} \mod p$, where $\left( \frac{q}{p} \right)$ is the Legendre Symbol

Show that if $p$ is any odd prime then $$\left( \frac{q}{p} \right) \equiv q^{\frac{p-1}{2}} \mod p.$$ stating any theory that you use. In particular, you may assume the existence of a primitive element in $G_p$.  Here $\left( \frac{q}{p} \right)$ is the Legendre Symbol and $G_p$ is the group of elements $g \mod p$ such that $\gcd(g,p) = 1$. I said that for some $a \in \mathbb{Z}$, we have $$a \equiv q^{(p-1) / 2} \mod p \implies a^2 \equiv q^{(p-1)} \equiv 1 \mod p$$ by Fermat's little theorem. And so, by definition of the Legendre symbol, we have that if $q$ is a quadratic residue mod $p$ then $\left( \frac{q}{p} \right) \equiv q^{(p-1) / 2} \mod p$. I'm now stuck on how to show that it is $\equiv -1 $ if it isn't a quadratic residue. Obviously the hint with primitive elements comes into play somehow, but I can't see how it does. Can someone help me please.


Cite in the caption of a graphic but not in \listoffigures?

Sometimes I'd like to cite the reference in the caption of a graphic. But I want to avoid that this citation is displayed in the \listoffigures. How can I achieve that?  Fore example with this code:  \begin{figure}[htb] \centering \includegraphics{overview_pyramid.png} \caption{Overview pyramid \cite{LM2010}}\label{fg:overview_pyramid} \end{figure}


Can I have a reference with spacing using bibtex? Like \cite{Author Year}

Can I have a bibtex entry with space in its key reference? Like below:  @article{Author 2000,   title={Boring book},   author={Boring Guy},   journal={Boring Subject},   year={2000},   publisher={Bororing Pub.} }   So my tex source can look like this and be recognized:  ...the subject was well studied in \cite{Author 2000}.   Currently, if I run bibtex in this way I get an error:  White space in argument---line 67 of file file.aux  : \citation{Author  :                2000}   I understand what is the problem in this error, and I realise I can fix it going to my entries and changing it to an entry without the spacing. However, I was wondering if there was another solution.  Can I cite references containing spacing? Like \cite{Author 2000}


Does the Black Panther suit give extra speed?

So in Civil War, the Black Panther suit seems to give the suit holder some extra speed, because the guy was running as fast as Bucky and Captain America.  So does it give extra speed? If so, how does that work?


The difference between alerts and banners is that alerts require user input to disappear, whereas banners go away on their own. Is there a way to close all notification alerts at once?   In the example below, there are 6 alerts from one application. I'd like to be able to OPTION-click "Close" or hit a keyboard shortcut to dismiss all of them. Ideally, I'd be able to dismiss all alerts on a per application basis. But I'd settle for the ability to dismiss alerts universally.


If $X, d$ is a connected metric with at least two points, prove it is uncountable.

I was able to prove the theorem by contradiction, showing that if $X$ is a countable set, we can take $r_0 = min\{d(p, q) < r : \forall p, q \in X\}$ and so there exists an $N_r(p)$ such that it will not contain any point $q \in X : q \neq p$ in its neighborhood. Thus $p$ is not a limit point of $X$, nor is any other point. Then these $X$ is the union of singletons and since open, disjoint subsets of a metric are separated, so is $X$.  Is my proof entirely correct? Were there any incorrect terms used?   I was asking for proof-verification, not for an answer. I need to know if my proof is right.


How to remove apps from "all downloaded" in Play Store

In the new Android Market/Play Store (3.5.15) they have now got a list of "all downloaded" apps.   I have had an android phone for a good 2/3 years now and the list is huge, plus sightly more questionable apps which should have been lost in the ether of the internet have now been dredged back up to haunt me.  Can I remove apps from here?  Thanks


I recently posted a question on StackOverflow. However, it was flagged as duplicate. The reason mentioned in the comments was that another, different question, has the same answer. Is that right? Does the same answer make two different questions duplicate?


How do you evaluate the integral $\int\frac{x^2-1}{(x^4+3 x^2+1) \tan^{-1}\left(\frac{x^2+1}{x}\right)}\,dx$?

i'm required to evaluate this integral. I've tried factorizing but it doesn't lead me to anywhere.   $$\int\frac{x^2-1}{(x^4+3 x^2+1) \tan^{-1}\left(\frac{x^2+1}{x}\right)}\,dx$$  I've also tried letting $u = \frac{x^2+1}{x}$, $du/dx$ gets me $1-\frac{1}{x^2}$ but it doesn't seem to be working either.  Hope to receive some advise/ solutions on how to start tackling the question


uncontinuous sequence function convergent uniforme

i wanted to know if there is some example of uncontinuous function converging uniformly to a continuous function.  Does a function converge uniformly to a bounded function must be bounded too ?


Let $f:(a,b)\to\mathbb{R}$ and assume that there is $C>0$ and $\alpha>1$ such that $|f(x)-f(y)|\leqslant C|x-y|^{\alpha},\forall x,y\in(a,b)$ Prove that $f$ is constant in $(a,b)$. Prove that $\underset{x\to y}{\lim}\frac{f(x)-f(y)}{x-y}=0$ Ie $(\forall\epsilon>0)(\exists\delta>0):|x-y|<\delta\implies|\frac{f(x)-f(y)}{x-y}|<\epsilon$ Suppose that $|x-y|<1$. Then by the stated inequality, $\frac{|f(x)-f(y)|}{|x-y|}\leqslant\frac{|f(x)-f(y)|}{|x-y|^{\alpha}}\leqslant C\iff\frac{|f(x)-f(y)|}{|x-y|}\leqslant C$. I need to show that this is smaller than $\epsilon$ but I'm not too sure where to go from here.


Can I use F-test to compare two linear models (not nested)

I have two models of the following form  lmod1 <- lm(response ~ predictor1 + log(predictor2))  lmod2 <- lm(response ~ predictor1 + predictor2)   The question is, can I use an F-test to compare these two models? Which model provides a better fit to the data? The question is from the Faraway's Linear Models with R, by the way.  I will add the R code I used and the results, so its easier to discuss something specific.  NOTE: I am told that Acetic and H2S are, in the data, in the log form, so in the second model I eliminate the log by doing $10^{predictor}$.  I understand more or less what the F-statistic and F-test means, but I fail to see the nuance of being able to use it or not for certain comparisons. Regarding the second part of the question (what is the better fit), I would say that it is the first model, due to having a higher $R^{2}$.  I have read something related to using anova and F-test for nested models, which this is not (I think).  data("cheddar", package="faraway") lmod <- lm(taste ~ Acetic + H2S + Lactic, cheddar) lms <- summary(lmod) lms   ## This is the first model (with log in H2S and Acetic) ## Call: ## lm(formula = taste ~ Acetic + H2S + Lactic, data = cheddar) ##  ## Residuals: ##     Min      1Q  Median      3Q     Max  ## -17.390  -6.612  -1.009   4.908  25.449  ##  ## Coefficients: ##             Estimate Std. Error t value Pr(>|t|)    ## (Intercept) -28.8768    19.7354  -1.463  0.15540    ## Acetic        0.3277     4.4598   0.073  0.94198    ## H2S           3.9118     1.2484   3.133  0.00425 ** ## Lactic       19.6705     8.6291   2.280  0.03108 *  ## --- ## Signif. codes:  0 '***' 0.001 '**' 0.01 '*' 0.05 '.' 0.1 ' ' 1 ##  ## Residual standard error: 10.13 on 26 degrees of freedom ## Multiple R-squared:  0.6518, Adjusted R-squared:  0.6116  ## F-statistic: 16.22 on 3 and 26 DF,  p-value: 3.81e-06   data("cheddar", package="faraway") cheddar_org <- cheddar cheddar_org$Acetic <- 10^cheddar_org$Acetic cheddar_org$H2S <- 10^cheddar_org$H2S  lmod_org <- lm(taste ~ Acetic + H2S + Lactic, cheddar_org) lm_org_s <- summary(lmod_org) lm_org_s  ##  ## Call: ## lm(formula = taste ~ Acetic + H2S + Lactic, data = cheddar_org) ##  ## Residuals: ##      Min       1Q   Median       3Q      Max  ## -17.2569  -8.3010  -0.7964   7.7366  26.2558  ##  ## Coefficients: ##               Estimate Std. Error t value Pr(>|t|)    ## (Intercept) -2.032e+01  1.185e+01  -1.715   0.0982 .  ## Acetic       3.554e-06  3.070e-06   1.158   0.2575    ## H2S          1.103e-09  8.076e-10   1.366   0.1838    ## Lactic       2.890e+01  8.828e+00   3.274   0.0030 ** ## --- ## Signif. codes:  0 '***' 0.001 '**' 0.01 '*' 0.05 '.' 0.1 ' ' 1 ##  ## Residual standard error: 11.57 on 26 degrees of freedom ## Multiple R-squared:  0.546,  Adjusted R-squared:  0.4936  ## F-statistic: 10.42 on 3 and 26 DF,  p-value: 0.0001108


How to repeat SMS message alerts indefinitely until read?

I would like to enable repeated audible alerts of new SMS messages on an iPhone 6.  Specifically, I want the alert to be repeated indefinitely until I read the message.  This is because it is inconvenient for me to carry my phone with me around the house, but it is important for me to hear an alert when I return -- perhaps an hour or later -- to the room in which my phone is stored.


How much meat should I serve per person?

Catering a small event tomorrow for twenty people. Serving beef brisket, pulled pork, and veggie lasagna. Question is how much brisket & pork should  allow for each person? also serving  three sides, rolls, etc.


I have 2 problems.    1) I want to move the logo image and box to the center. I don't know why it doesn't work...  I think I've used everything including align, but it doesn't move. I solved the menus with a flex.  2) I want the borderline of menus and box to be the same size. The overlapping parts have different sizes of lines.  Thank you reading.

About Me

My Language

Photos

Login


Why is the set of all infinite binary sequences uncountable but the set of all natural numbers are countable?

From Cantor's diagonalization argument, the set B of all infinite binary sequences is uncountable. Yet, the set A of all natural numbers are countable.   Is there not a one-to-one mapping from B to A? It seems all natural numbers can be represented as a binary number (in base 2) and vice versa.


Why do we replace $c$ (speed of light) with $v$ in de Broglie's equation?

Deriving de Broglie's equation (as per my text and teacher) involves equating $E = mc^2$ with $E = h\nu$, where $\nu$ is the frequency. It goes like : $$mc^2 = h\nu$$ $$mc^2 = \frac{hc}{\lambda}$$ $$mc = \frac{h}{\lambda}.$$ Then we replace $c$ with the velocity of the particle to apply it generally i.e. $$mv = \frac{h}{\lambda}.$$ My doubt is exactly about this step. As far as I have read before and after learning this equation, I understood that $c$ in $E = mc^2$ was mainly used as a constant which can equate energy and mass rather than something relating energy, mass and velocity of the particle. Thus replacing $c$ with $v$ makes no sense as it would have contradicted the equivalence of $E=mc^2$ in the first place. Can someone explain how $c$ can be replaced with $v$ without contradicting $E = mc^2$, or just simply point out what is wrong with my thought process?


An example for a homomorphism that is not an automorphism

Let $K/F$ be a field extension, I know that if $K/F$ is a finite extension then a simple argument from linear algebra shows that since every homomorphism of fields from $K$ to $K$ that fixes $F$ is 1-1 it is also onto, i.e. an automorphism of $K$.  Can someone please give an example that this is not the case if $K/F$ is not a finite extension ?


Is there a way to see what were the Candidate Execution Plans generated by the Query Optimizer?

The Query Optimizer creates more than one possible execution plan. How can I see all the plans generated before the executed one was chosen?   :     The Query Optimizer must analyze the possible plans and choose the one   with the lowest estimated cost.   Please, notice that I'm not talking about , I'm talking about candidate execution plans, the ones that were generated but not selected to be executed.  According to Benjamin Nevarez's article :     The generation of candidate execution plans is performed inside the   Query Optimizer using transformation rules, and the use of heuristics   limits the number of choices considered in order to keep the   optimization time reasonable. Candidate plans are stored in memory   during the optimization, in a component called the Memo.   Would it be possible to visualize the candidate plans rendered the way we can ?


I want to print the binary value of a given float just by directly accessing the memory I used this code to access the value of an int   int var = 34;  int *ptr;  ptr = &var;   printf("\nDirect access, variable var value = var = %d", var);   i am wondering how to access the memory amount of a float and print it


Git: Revert a single file to its last commit

I want to revert a file to its state on its last commit.  I have modified, added and committed other files.  But there is that one file that I didn't stage.   I want to revert it's state (only the state of that file) to the last commit that that file was committed.  In other words, I just want to ignore the last changes made to that file and restore it to the last point it participated in a commit.


Sharepoint Site doesn't open on Safari 8.0.2

I upgrated my software and Safari 8.0 installed with the update. My sharepoint site can open in Safari 8.0. But I upgrated Safari 8.0 to Safari 8.0.2. But my sharepoint site can't open.  I searched this issue on the net. The problem stems from the windows authentication.   Should I need to make an amendment to the SharePoint side? Have you any information the issue?


Searching for a short story about metallic lungs

I read a short story sometimes ago on Reddit, it really stuck with me but I cannot find it anymore.  The story is told by a sentient being in a universe where people have to fill their lungs in some sort of air fountains and everything in this world is powered by air.  The narrator realize at some point that the pressure difference between the reservoir and the atmosphere is decreasing and they all will eventually die or stop moving due to this. It is an allegory on the eventual death of the universe due to increasing entropy.  Does anyone know what this is?


Should we be informed that non-SE employees have access to profile info?

I came across  in which a moderator noted that a user had a "same IP diff email". I was under the impression that our e-mail was  or used for the purposes explained in the input field help tip:    I also don't see where the  states that moderators have access to view it. [ It's in the first paragraph of the "How We Use Information We Collect" section. --Ed. ] If this is the case, I think users should know this and moderators have different tools to determine duplicate user accounts. Edit: it was mentioned in  and  that mod's have visibility, but it doesn't seem like it's very publicized. I'm finding this out after using the site after 3 years (perhaps I was a bit naive).


What is a 17th-century affectionate term for "Mother"?

I'm writing a ghost story, and (in an admittedly well-worn trope) a child ghost is looking for its mother; however, how would a 17th-century child affectionately refer to its mother? In short, what would the 17th-century version of "Mummy" be? The child would be British; middle-class (or its equivalent then); moderately educated; and home-schooled, the Bible being the main text book.


How to remove lines included in one file from another file?

I have two lists, a complete list and a partial list. I want a bash script that will search the complete list for any lines that are in the partial, if there are, they will be removed from the complete list. Can anyone help?


How to solve this integral: $\int_0^\infty{\frac{ln x}{x^2+2x+4}}\cdot dx$

I have been trying to solve this integral:- $$\int_0^\infty{\frac{\ln x}{x^2+2x+4}}\cdot dx$$ But I have been unsuccessful so far. I have tried integration by parts ( taking $1/(x^2+2x+4)$ as the second function does not work because it ends of as tan-inverse function which is more compicated to integrate.) taking $\ln x$ as the second function was interesting, I ended up in this dead end:- $$\begin{align} I&=\int_0^\infty{\frac{\ln x}{x^2+2x+4}}\cdot dx \\ &= \left[ {\frac{x\ln x -x}{x^2+2x+4}}\right]_0^\infty + \int_0^\infty \frac{2(x+1)(x\ln x-x)}{(x^2+2x+4)^2}\cdot dx \\&= 2\int_0^\infty \frac{(x^2+2x+4-(x+4))(\ln x-1)}{(x^2+2x+4)^2}\cdot dx \\ &= 2\int_0^\infty\frac{\ln x}{x^2+2x+4}\cdot dx - 2\int_0^\infty\frac{1}{x^2+2x+4}\cdot dx -2\int_0^\infty \frac{(x+4)(\ln x-1)}{(x^2+2x+4)^2}\cdot dx \\&= 2I - \left[\frac{1}{\sqrt{3}} \tan^{-1}{\frac{x+1}{\sqrt{3}}} \right]_0^\infty - 2\int_0^\infty \frac{(x+4)(\ln x-1)}{(x^2+2x+4)^2}\cdot dx \end{align}$$ the function in the second step limits to $0$ so I didn't mention it in the third step. Now I have quartic polynomial at the bottom and don't know how to proceed. I have also tried trigonometric substitution ($ x=\tan\theta$) If possible please try to end this process, I am a high school student so please keep that in mind if you show another method :)


How to prove Chebyshev's result: $\sum_{p\leq n} \frac{\log p}{p} \sim\log n $ as $n\to\infty$?

I saw reference to this result of Chebyshev's: $$\sum_{p\leq n} \frac{\log p}{p} \sim \log n \text{ as }n \to \infty,$$ and its relation to the Prime Number Theorem. I'm looking into  I was wondering if anyone could give me a sense for how difficult or involved the usual proof is.  I don't really need to see the whole thing in detail, more wondering about the general difficulty/complexity of the result. Thanks!


I want an image of 320x80 size so that whenever I put this image above any image it will create a blur effect. Just like a translucent mirror. Below is the sample image of iPhone app.  Here the navigation bar is blurred and what happens there is that when I scroll down the content below this nav bar gets blurred.   Is this possible to create an image like this? Which can blur everything behind it at run time (what ever the content it has behind it, not static but dynamic)  P.S. I know how to blur an image but that will be static


Example of a function $f : A \times B \to X$ that isn't continuous but every $f_a : B \to X, f_b : A \to X$ is

Let's say that we have a function $f : A \times B \to X$. For every $a \in A$ we get a function  $$ f_a : B \to X, \ f_a(b) = f(a, b),$$  and for every $b \in B$ we get $f_b : A \to X$ in similar fashion. It isn't hard to show that continuity of $f: A \times B \to X$ (in product topology) implies continuity of every $f_a, f_b$. But I suspect that converse isn't true, just because I have never seen such theorem. I'll be grateful for some easy examples of such behavior (or a theorem disproving my hunch).


Convert 12-hour date/time to 24-hour date/time

I have a tab delimited file where each record has a timestamp field in 12-hour format:     mm/dd/yyyy hh:mm:ss [AM|PM].   I need to quickly convert these fields to 24-hour time:     mm/dd/yyyy HH:mm:ss.   What would be the best way to do this? I'm running on a Windows platform, but I have access to sed, awk, perl, python, and tcl in addition to the usual Windows tools.


When I shuffle several sublists they come out in the same order.  I'm sure I can reseed it with a random number each time, but everything I read implies that I shouldn't have to. Code:  test=[list(range(10))]*5 import random for x in test:     random.shuffle(x)  print(test)   Results:  [[0, 8, 9, 6, 1, 2, 7, 4, 5, 3], [0, 8, 9, 6, 1, 2, 7, 4, 5, 3], [0, 8, 9, 6, 1, 2, 7, 4, 5, 3], [0, 8, 9, 6, 1, 2, 7, 4, 5, 3], [0, 8, 9, 6, 1, 2, 7, 4, 5, 3]]   Why isn't shuffle producing different orders?


Standard pre-defined macros in LaTeX: where to find them all

I hope this question is not a duplicate, but I couldn't find anything here on tex.stackexchange.   What I want is the place where all the macros already defined in LaTeX are. For example I know that the command \hrulefill is defined as   \def\hrulefill{\leavevmode\leaders\hrule\hfill\kern\z@}   (I got this form ), but where can I find all the possible commands defined already for all the LaTeX classes (such as the sectioning commands \chapter, \part and so on)?


So I'm trying to make a code where you make an array with inputs and the outputs aren't quite right?

Ok so this is my code:  import java.util.Scanner; public class Bubble {      public static void main(String[] args) {         String prefix;         int arr[];         Scanner reader = new Scanner(System.in);         System.out.println("What size would you like your array to be?");         int arrSize = reader.nextInt();         arr = new int[arrSize];         for(int i = 1; i==arrSize; i++) {             if((i % 10)==1 && i != 11) {                 prefix = "st";             }else if((i % 10)==2 && i != 12) {                 prefix = "nd";             }else if((i % 10)==3 && i != 13) {                 prefix = "rd";             }else{                 prefix = "th";             }              System.out.println("What would you like the"+ i + prefix +"number in the array to be?");             int arrNum = reader.nextInt();          }         System.out.println(arr);     }  }   Now when I press run I get this:  What size would you like your array to be?  Then I put in an integer, say 3, then I get this:  [I@55f96302  It stays the same no matter what integer i use.


public class arithmcalc {  public static void main(String[] args) {     int operand1;     int operand2;     char operator;     Scanner sc = new Scanner(System.in);     System.out.println("enter operan1 operand2 and operator one by one");     operand1 = sc.nextInt();     sc.nextLine();     operand2 = sc.nextInt();     sc.next();     operator = sc.findInLine(".").charAt(0);      int result = 0;      switch (operator) {         case '+':             result = operand1 + operand2;             break;         case '-':             result = operand1 - operand2;             break;         case '*':             result = operand1 * operand2;             break;         case '/':             result = operand1 / operand2;         default:             System.out.println("illegal operand");     }   } }   Exception in thread "main" java.lang.NullPointerException at javaapplication67.arithmcalc.main(arithmcalc.java:24)


Why are many English contractions considered okay to use in contraction-form, but believed to "sound wrong" when used individually?

Some popular examples:  Don't you know any better?   Now use that with out the contractions:  Do not you know any better?   Want to bet that many English speakers would find this weird or wrong sounding? The contraction-form is generally accepted by many by how it "sounds", but the non-contraction-form is deemed to be strange use. Furthermore:  Won't you come to bed? Will not you come to bed?  Wasn't he lying? Was not he lying?  Can't it be funny? Can not it be funny?  Doesn't that offend? Does not that offend?  Couldn't pigs fly? Could not pigs fly?   People, I've heard at least, argue that it's wrong used this way (should be, "Could pigs not fly"), so why is it "right" in contraction-form and "wrong" in non-contraction-form?


I have the following exercise :   Let $p_1,...,p_n$ be distinct primes.Consider $L= \mathbb{Q}(\sqrt{p_1},...,\sqrt{p_n})$.   Find all the intermediate subfields $K$ such that $[K:\mathbb{Q}]=2$  I have already proved that $[L:\mathbb{Q}]= 2^n$  I know that if $K$ is an intermediate subfield such that $[K:\mathbb{Q}] =2$ then $[L:K] = 2^{n-1}$.   I also know that  $\sqrt{p_i}\notin \mathbb{Q}(\sqrt{p_1},...,\sqrt{p_{i-1}})$ so :  $[\mathbb{Q}(\sqrt{p_1},...,\sqrt{p_{i-1}},\sqrt{p_i}): \mathbb{Q}(\sqrt{p_1},...,\sqrt{p_{i-1}})]=2 $.   But I am not seeing how to find the ones that have degree 2 over $\mathbb{Q}$


I just installed Ubuntu desktop 13.04 in my computer, dual boot with windows 7.  How to install mp3 plugin? Because I want to listen to music and watch movie, but the player requires plugin? How to solve this problem?


How can I prevent dough from wrapping around a dough hook?

I have a 5.5qt KitchenAid stand mixer with the burnished spiral ("pigtail") dough hook. This is not the C-hook. When I make a small amount (for example, using 250g of flour or approximately 2 cups) of standard-hydration dough, instead of kneading, the dough will wrap itself around the dough hook and spin in the bowl. I'm using speed 2.  Pulling the dough off the hook and allowing it to relax for 5 minutes will make it knead again for a bit (but not long, a minute or two at most).  Oiling the dough hook helps some, but the oil of course comes off, then it sticks again.  I've adjusted the height per the manual, so that's set correctly.  Other than switching to the coated dough hook (which is currently being shipped to me) or making a larger batch, is there anything else to do to prevent the dough from sticking to the hook?


Counting the Number of Simple Paths in Undirected Graph

How can I go about determining the number of unique simple paths within an undirected graph? Either for a certain length, or a range of acceptable lengths.  Recall that a simple path is a path with no cycles, so I'm talking about counting the number of paths with no cycle.


I am a German citizen visiting my girlfriend in the US for 2 x 50 days a year under the VWP. Can I work remotely and will I have to pay US Taxes?

I am a German citizen visiting my girlfriend in the US for 2 x 50 days a year under the Visa Waiver Programme (VWP). I already read that some immigration officers might make problems here due to the duration, if there are not at least 6 months between those 2 visits. But I believe 6 months should be feasible.   Now: Can I work remotely (telecommuting) for my German employer under the Visa Waiver Programme? I have an indefinite work contract with my German employer and would work via email and skype, mostly. The employer is ok with this. I have absolutely no intention to settle on US soil, my life centre is in Germany. But how to prove that?  Additionally, if I earn money in the US for more than 30 days, I need to pay US taxes, as far as I understand. That means I need to disclose that I am working to border officers, or do I not? I d be afraid I else might become a tax criminal and tax crimes are major offenses with jail time and all.  If I work for more than 30 days telecommuting, do I need to pay taxes in Germany and the US? That would be a heavy tax burden.


For non-algebraically closed field $k$ and integer $n>1$, there is a polynomial in $n$-variables over $k$ having only one zero in $k^n$

Let $k$ be a field which is not algebraically closed and $n>1$ be an integer . Then does there exist $f\in k[X_1,...,X_n]$ such that $Z(f) (:=\{(a_1,...,a_n)\in k^n : f(a_1,...,a_n)=0\}) =\{0\}$ ?  My Work : I was thinking like this : Considering $k$ as a sub-field of its algebraic closure $\bar k$, we have $k \subsetneq \bar k$ . Also, there is an irreducible polynomial $g(X) \in k[X]$ such that deg $g(X)>1$ . May be we could somehow apply Hilbert Nullstelensatz to $\bar k$, but I am not sure .   I can easily do it for a finite field $k$; in that case just take  $f(X_1,...,X_n)=\sum_{(y_1,...,y_n)\in k^n \setminus \{0\} } \prod_{i=1}^n (1-(X_i-y_i)^{q-1})$ , where $|k|=q$ .  I can also do it if $[\bar k : k] $ is finite and $n=2$ . By Artin-Schreier theorem () , we will have $[\bar k : k]=2$ . Let $u\in \bar k \setminus k$, then the minimal polynomial of $u$ over $k$ has degree 2, and let $\bar u$ be another root of the minimal polynomial of $u$ over $k$ . Then $f(X_1,X_2)=(X_1+uX_2)(X_1+\bar u X_2)$ satisfies our required condition . Even in this case when $\bar k$ is a finite extension over $k$, I don't know what happens if $n>2$ .  Please help . Thanks in advance


I'm making a table where columns are labelled with the property and the units it's measured in:  Length (m)  ||||  Force (N) |||| Safety Factor (unitless)  ||| etc...  I'd like not to write "unitless" on several columns...and I'm quite surprised I can't seem to find a symbol for it. Any suggestions?


SQL Server Replace Command with WIldcard

I am in need of some help. Thanks to fellow user davids, I was able to get certain things working within SQL Server and am in need of some more help. Here is what I am trying to do:  UPDATE Table1 SET keyfield=(REPLACE(REPLACE(Column1,'http://*/folder/',''),'.avi','')) UPDATE Table2 SET keyfield=(REPLACE(REPLACE(Column2,'http://server2/folder/',''),'.mpg',''))   Can anyone help me out or point me in the right direction to get the wildcard to work? This particular column, the * is an IP Address and it will change all the time. Granted I will know the IP's ahead of time and can probably do it one by one, but I would prefer to have it automatically replace. Thanks in advance!


Can animated dead have weapons and armour?

If I have put the time into creating some skeletons or zombies using the spell Animate Dead. Kept them active expending 3rd level spell slots can I equip them with items, like armour and weapons?  Also if I equip a weapon they don't normally use do they get disadvantage?  (Hoping for a zombie with splint and a Great axe :D)


How to switch between console mode and GUI in 17.10 in X.Org mode?

This is related to this question about . I tried the highly-upvoted answer, which sounds like it is correct, but it does not work for me.  I am currently running Ubuntu 17.10 with the X.Org session (due to sometimes relying on X-tools, like x2x). This is in contrast to the OP in the other question, who seems to run the default Wayland session.  When pressing Ctrl-Alt-F3 on this machine, not a lot happens. The desktop freezes, the mouse vanishes, and, most importantly, I don't get a virtual terminal. Pressing Ctrl-Alt-F2 returns me successfully to my running session.  , they cite the release notes, which state that        GDM has replaced LightDM as the default display manager. The login screen now uses virtual terminal 1 instead of virtual terminal 7.      In addition they note that the currently running session moved to tty2 and unused virtual terminals are available after that.  So, why does this work under Wayland, but only partially with the fallback X.Org session? After all, the move of the currently running session to tty2 seems to have worked. But how do I get to a virtual console?


Accessing the same variable from multiple classes

I have a class that contains some variables.Let's name it "Var" class. In "Var" class i have some variables like int width ,int height and so on. Some classes need this variables in order to work, also this variables are changing. My problem is, when i am creating an object of "Var" class in diffrent classes , each object contains its own int width and int height, and i dont want that.So, how to access variables from "Var" class from multiple classes?


Finding medical records for Richmond State Hospital patient?

My 2nd great-grandmother, Margaret Elizabeth Armegust or Arbingast, was born 22 Sept 1837 in Ohio and died 24 July 1929 at the Richmond State Hospital, Wayne, Indiana, United States.  She lived for a time in Sparta, Noble, Indiana and Stock, Harrison, Ohio. She was married to John B. Miller on 22 Oct 1859 in Noble and they had at least five children: James, Samuel, Elias, Julia, and John.  I am searching for records from the State Hospital to learn of her diagnosis and treatment.


How do I cange the cycle settings for Multiple objects - Blender?

I need two renders and for the second one I do not need the gloss for multiple objects on the floor. It would be difficult to deselect the gloss property for every object for 50 different objects. Is there a way to apply cycle property change from one active object to all selected?  Also is there an easier way to extract just the reflections from a glossy surface, currently I am using different renders and the difference matte in the compositor.  I'm new to blender.


I'm working with 6 LEDs in series, which are rated at:   3V Typical / 3.2V Maximum 20mA.   My power supply is:   19V 3A Maximum   According to my calculations:   I'd need a 50 ohm resistor at 3V I'd be in the negative at 3.2V.   Because my target resistance with the LEDs alone would be below the maximum LED voltage specification, do I need any sort of resistor at all?  Is this the appropriate use case for a 0 ohm resistor?  I plugged in the array last night for around 20 seconds or so, and the wiring seemed to get rather hot which is a bit worrisome... The LEDs however, didn't appear to be brighter than when connecting one at the appropriate resistance.


What is the best platform/website/youtube channel to learn how to animate a pixar style 3d animated human character (useing mesh not sch


Where and how does the Bleach anime diverge from the manga?

I've seen almost all of the Bleach anime (at least what's been released dubbed), and I'm now interested in reading the manga. However, when the manga closely follows the anime I've already seen, I tend to get bored quickly. Thus, I'd want to pick up the manga at a point right before the anime began to diverge.  At what point in the manga is this?


Can you attach front panniers to shocks?

I'm going on a bike trip and need the extra storage supplied by front panniers. But my bike has front suspension. I can replace the fork with a solid one but that will increase my costs. Is it  A) possible, B) a good idea,  to attach panniers to forks w suspension?


Restrict an APT repo to a single architecture?

I have this warning each time I run apt update on Ubuntu 20.04.2 : N: Skipping acquire of configured file 'universe/binary-i386/Packages' as repository 'http://miktex.org/download/ubuntu focal InRelease' doesn't support architecture 'i386'  I know that I need the i386 arch for certain packages, but I would like to know if it is possible to prevent apt to scan the i386 release of the miktex Is it possible to do that?


How would a plant sprout and grow in a zero gravity environment?

Have any experiments been carried out involving sprouting and growing plants in a zero gravity environment? If so, what was the outcome? How did the plants sprout out of the soil without gravity? Did they grow outward or toward light sources?


Refused entry to UK, not sure what to do

I'm a writer and theater/film director who has been traveling nearly all my life without incident. In February, I decided to pull up stakes in NYC and move to London. I am a freelancer and I'm working with three different organizations in NYC so I wasn't working illegally in the UK. I was, however, seeing if there might be some opportunities in London, ie. meeting with Artistic Directors of various theatre companies to see if they might be interested in producing my work.   In April, I was invited to a conference in San Diego and then a film festival in Switzerland. I didn't think it would be a problem if I went and then bummed around in France for a few days since I hadn't broken any laws and had left the UK well under my six month leave to stay. Well, when I tried to return to London, I was denied entry at Luton. The border control officer said I didn't have enough funds for a two month stay and put a black cross over a stamp in my passport. They put me in a detention room until the next flight back to Lyon, which was the following morning. I don't know anyone in Lyon so I ended up going to a friend's place in Paris.   After a few days of not knowing what to do, a friend suggested that perhaps I should try going back to London on the Eurostar since border control is in Paris. I wondered if I ought to go to the British Embassy but was deterred by something on their website that says that a visitors visa could take up to three weeks (I can't sit around here in Paris for three weeks) and anyway, the decision ultimately is with the border control, so I decided to take a chance on the Eurostar. I bought myself a return ticket in two weeks to Paris just so I had something to show.   Well, the UK border control denied me entry after giving me a third degree. They accused me of lying and seeking work in the UK. They also insisted that the amount of money I had was not enough to live on for two weeks. So I'm back at my friend's place in Paris, wondering what to do.   Is it possible for me to ever get back to the UK? I had to cancel one meeting and I'm wondering if I have to cancel going to the Sheffield DocFest. (Two of my projects were accepted to programs there.)   Should I apply for a visa from the British Embassy? Will this really take three weeks? When I started to say something about obtaining a visa, the border control officer cut me off and said, "Why are you going to the Embassy? This has nothing to do with the Embassy. We make the decisions."


Who took care of Naruto when he was young?

In episode 350, we see that the Third Hokage took on to take care of Naruto. But towards the beginning of the anime Naruto is seen to be living alone.   Did Naruto live with the Third? If so, why did he leave there?


I have a Java 8 application running on a remote Linux server and need to attach a JConsole to it for debugging purposes.  From my local machine I set up a tunnel to the remote machine:   ssh -fN -L 9999:localhost:9999 myuser@1.11.11.111   On the remote machine I run the application with the following system properties:  java -Dcom.sun.management.jmxremote.port=9999 \ -Dcom.sun.management.jmxremote.authenticate=false \  -Dcom.sun.management.jmxremote.ssl=false \ -Dcom.sun.management.jmxremote.local.only=false \ -cp foo.jar:config com.foo.bar.Main config/blah.properties   but when I start the JConsole I get Secure connection failed.     If I click on "Insecure connection" I get    How can I get around this?


I would like to know what usually follows after each proposition in sentences with the word "work". These are what I understand so far: I work for my boss. ( usually for certain person ) I work in a accounting corporation. (usually for business area ) I work at Samsung. ( usually for specific name of company ) Could you please tell me if I understand rightly?


If black holes can swallow any object, and can radiate energy, then how could black holes join each other and can form bigger black holes?


I am studying the book Equations and Inequalities by Herman et al, and am stuck on the following exercise:  Determine: $S = \frac{1}{2}{n \choose 0} + \frac{1}{3}{n \choose 1} + \cdots + \frac{1}{n+2}{n \choose n}$   The hint says to consider $(n+2)(n+1)S$.  Doing so, I get:  $(n+2)(n+1)S = \frac{1}{2}{n+2 \choose 0} + \frac{1}{3}{n+2 \choose 1} + \cdots + \frac{1}{n+2}{n+2 \choose n}$,  but I don't see how this is any easier to solve.  I wonder if somebody might help by expanding on the given hint, and maybe offering their suggestions as to how to use it properly.  Thanks.


What could be the reason covid19 death data shows strong periodic trends?

The covid19 death data for US shows strong periodic trends. It does not make sense to me that people die periodically.   What could be the reason to having such data? I thought it might be the reporting artifacts, for example, people always update data at Monday, but the period seems to be 3-4 days.


expand a list to list of lists by a variable length

Say I have a list   my_input_list = [22,33,56,1]   and from a variable target_len I want to make (exclusive, sorted) sublists of that length  target_len = 2 #my_output_list_not_sorted = [[22,33][22,56][22,1][33,56][33,1][56,1]] my_output_list = [[22,33][22,56][1,22][33,56][1,33][1,56]]   or   target_len = 3 #my_output_list_not_sorted = [[[22,33,56][22,33,1][33,56,1]] my_output_list = [[22,33,56][1,22,33][1,33,56]]   Is there a neat way to do this?  I'm OK to sort my_input_list first if needed.  Thanks!


What package should I use to typeset units?

I know there are a few packages related to typesetting units:   unitsdef units, which can be seen as a "base package" used by unitsdef SIunits siunitx, which is the successor to SIunits maybe others? like cjwunits and hepunits   What is the difference between them? Do they also work inside Math mode? And, more importantly, which one should I use?  Suggestion for people trying to answer this question: show some examples of how to typeset both simple and complex units. For instance, try typesetting these items:   100 Celsius 3 x 10^5 km/s gravitational constant is measured in N m^2/kg^2 10 kHz = 1 s^{-4} sin(x) meters   I think these examples cover most needs when writing scientific texts: simple measurements (value + simple unit), values written in scientific notation, simple fractional units, complex fractional and squared units, units without any value accompanying them, units with arbitrary exponents, and arbitrary math code instead of a simple value.


I realize everyone uses 'four times', 'five times'... in case of denoting something repeating more than three times. Even 'thrice' is currently gradually going extinct.  But did English ever possess single-word expression that denoted 'four times', or any for higher number, or was 'thrice' always the highest single-word adverb to denote a number of times something repeats?


Using bootstrap, I try to place a button in the center, I achieve it by finely adjust the grid column by column

       <button type="submit" class="btn btn-success">Sign in</button>

   I tried text-center and block-center, they did not work properly.  How to get it done in a straight forward way?


High speed does not kill. Does acceleration do it ? or jerk?

In a  the OP asked why high speed will not kill us. The , highly upvoted, stated very first that      Speed doesn't kill us, but acceleration does.   The  (also well upvoted) concurs:     The danger comes from acceleration, not velocity.   Is that true?  Two comments by  and  somewhat debunk it. but they are only comments. They could not be answers, as the question ""  was not about acceleration. I wrote this question, and my answer to it (below), before I had read these comments. Like many users, I do skip a lot of comments. When I finally saw these comments already made, I wondered whether I should persist with this question. The point seems important enough to justify it, considering the high popularity of this topic.


Repeated measures ANOVA vs. factorial ANOVA with subject factor: understanding "error strata" and Error() term in aov

Consider repeated measures ANOVA (RM-ANOVA) with one within-subject factor A and several measurements per subject for each level of A.  It is closely related to two-way ANOVA with two factors: A and subject. They use identical decomposition of the sum of squares into four parts: A, subject, A⋅subject, and residual. However, two-way ANOVA tests the effect of A by comparing SS of A with the residual SS, while RM-ANOVA tests the effect of A by comparing SS of A with the A$\cdot$subject interaction SS.   Why the difference?    Does this difference automatically follow from the repeated-measures structure of the data, or is it some convention?  Does this difference between two-way ANOVA and RM-ANOVA correspond to testing two different nulls? If so, what exactly are they and why would we use different nulls in these two cases? Two-way ANOVA's test can be understood as an F-test between two nested models: the full model, and the model without A. Can RM-ANOVA be understood in a similar way?   (If there is only one measurement per subject for each level of A, then the distinction sort of disappears because A$\cdot$subject and residual variation cannot be disentangled: )    Demonstration  I will use toy data d2 generated in . The same webpage shows correct syntax for RM-ANOVA.  # Discarding between-subject factors and leaving only one within-subject factor d = d2[d2$Xb1=='CG' & d2$Xb2 == 'f', c(1,4,6)]   (See reproducible version .) Data look like that:       id Xw1     Y 1    s1   A  28.6 2    s1   A  96.6 3    s1   A  64.8 4    s1   B 107.5 5    s1   B  77.3 6    s1   B 120.9 7    s1   C 141.2 8    s1   C 124.1 9    s1   C  88.0 10   s2   A  86.7 ...   Here is two-way ANOVA: summary(aov(Y ~ Xw1*id, d))               Df Sum Sq Mean Sq F value   Pr(>F)     Xw1           2  95274   47637  16.789 3.73e-07 *** id           19  31359    1650   0.582    0.913     Xw1:id       38  71151    1872   0.660    0.929     Residuals   120 340490    2837                    Here is RM-ANOVA: summary(aov(Y ~ Xw1 + Error(id/Xw1), d))  Error: id           Df Sum Sq Mean Sq F value Pr(>F) Residuals 19  31359    1650                 Error: id:Xw1           Df Sum Sq Mean Sq F value   Pr(>F)     Xw1        2  95274   47637   25.44 9.73e-08 *** Residuals 38  71151    1872                       Error: Within            Df Sum Sq Mean Sq F value Pr(>F) Residuals 120 340490    2837               Note the identical SS decomposition, but two-way ANOVA tests Xw1 against the residual, while RM-ANOVA tests Xw1 against the Xw1:id interaction.  Why?  This question is related to . If we try using Error(id) instead of Error(id/Xw1) in the example above, then Xw1 will get tested against Xw1:id interaction lumped together with the residual variation.  (The same issue arises in factorial RM-ANOVA with multiple within-subject factors, where each factor or interaction is tested against its own "error term" aka "error stratum". These error strata are always given by the corresponding interaction with the block/plot/subject variable id.)


'Drop us a line' - letter or phone call?

According to , dropping someone a line means sending them a short message.  Is this correct? I always thought it meant phoning someone, the line referring to a telephone line.


Show that $f(x)=||x||^p, p\ge 1$  is convex function on $\mathbb{R}^n$. I have tried to use Holder's inequality, but I still cannot solve this problem. Could you help me with this problem? Thank you so much.


Why do some people say or write an historical but not an ham sandwich or an hint?


The question is as below:      Show that each vertex $v$ of a tree $T$ appears $deg(v)-1$ times in the Prüfer encoding of $T$, where $deg(v)$ is the degree of $v$ in $T$.   For this, I think there are 3 scenarios a leaf should be considered for: (1) when it is a leaf as part of a tree; (2) a leaf that has been discarded; (3) the remaining edge. I feel like this will result in a short proof which is only two (or so) statements long, but at the same time, feel it is too simple.   EDIT: I've had a look at this again and narrowed it down to 2 cases:   Case 1: The vertex $v$ in question has $deg(v)\ge2$. $v$ then loses its neighbours as the algorithm is applied repeatedly until $v$ becomes a leaf itseelf. At this point, $v$ is attached to another neighbour, leaving an edge. This means the algorithm can no longer be applied and we have obtained the final Prüfer Encoding for the tree $T$.  Case 2: The vertex $v$ has $deg(v)\ge 2$. It loses its neighbours as the algorithm is applied repeatedly but is deleted itself at some point in the process.   Have I gone about this wrong?  Thank you.


How to prove convergence of the Arithmetic-Geometric Mean sequence?

Let $$a_0>b_0>0 $$and consider the infinite sequences $$\{a_n\}, \{b_n\}$$ where  $$a_{n+1}=\frac{a_n+b_n}{2}$$ and $${b_{n+1}}={(a_nb_n)}^{1/2} $$ for $n\geq0$.  Prove that the infinite sequences $\{a_n\}$, $\{b_n\}$ are convergent.  Can anyone guide me for this question? Thanks!


How do I install an application from a .dmg disk image?

I've downloaded Firefox and it's now sitting on my desktop as Firefox.dmg. When I double click on Firefox.dmg it opens up a window with Firefox in it so I can use it - does this mean the application has been installed?    Community Wiki'd the question because I think it's a worthwhile question to have on the site for pointing people to, it's not exactly intuitive to do and not a question I think I deserve any rep from.


What is the difference between PKCS#5 padding and PKCS#7 padding

One runtime platform provides an API that supplies PKCS#5 padding for block cipher modes such as ECB and CBC. These modes have been defined for the triple DES, AES and Blowfish block ciphers. The other platform API only provides PKCS#7 padding.  Are PKCS#5 padding and PKCS#7 padding compatible?


When will Nvidia CUDA toolkit be updated to version 11?

For latest TensorFlow version 2.4 the Nvidia CUDA toolkit is required in version 11. However, the official Ubuntu repo does only include CUDA toolkit version 10: $ sudo apt install nvidia-cuda-toolkit Reading package lists... Done Building dependency tree Reading state information... Done nvidia-cuda-toolkit is already the newest version (10.1.243-3). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.  I know one can install CUDA (toolkit) directly from Nvidia deb packages, but I would rather stick to the official Ubuntu repo, if possible. Is there any estimation when the latest CUDA toolkit version 11 will be released in the official Ubuntu repo?


Divisibility Rules for Bases other than $10$

I still remember the feeling, when I learned that a number is divisible by $3$, if the digit sum is divisible by $3$. The general way to get these rules for the regular decimal system is asked/answered here: . Now I wonder, what divisibility rules an alien with $12$ (or $42$) fingers would come up with?  So let $n=\sum_k c_k b^k$ be the representation with base $b$. Looking at some examples shows indicate that $n$ is divisible by $b-1$, if $\sum_k c_k$ is. This seems to be a poor man's extension to the decimal divisibility by $9$ rule.  The answer to the above mentioned question, says that "One needn't memorize motley exotic divisibility tests. ". Motley exotic divisibility tests are very welcome here!


I need to create documents containing lots of small bits of R code, which are not to be sent to R via knitr. Ideally, it should work very much like code is formatted here at Stackexchange. It should be set in ttfamily and not break across lines. I'm not sure that a gray background is necessary. I'd prefer not to use \begin{environment} and \end{environment}, because that's cumbersome when the code is just a couple words.  It seems like the trickiest part might be that some special characters should loose their specialness. Specifically, "$" and "_", which are commonly used in R code shouldn't have to be escaped.  There is a solution to a similar question , but that's taking the \begin{}\end{} approach, so it won't work here.  Something like \code{my code} would work better. I have the beginnings of a macro with this:  \newcommand{\nbcode}[1]{\mbox{\texttt{#1}}}   It'd be great if the solution to this is a package I haven't heard of.


Why does 1 vector $\vec{v_1}$ in $\mathbb{R}^n$ that is linearly independent imply that $\vec{v_1} \neq \vec{0}$?

Why does 1 vector $\vec{v_1}$ in $\mathbb{R}^n$ that is linearly independent imply that $\vec{v_1} \neq \vec{0}$ ?


NullPointerException when calling method from another fragment in activity

I'm very disappointed.  In my activity where i also start the fragment, i have a fragment view, and i call the method from another fragment by using the findFragmentById and then the fragmentview id.   onCreate in my activity:          frgmntView = (FrameLayout) findViewById(R.id.frgmntView);          mFrgmntManager = getSupportFragmentManager();          gmm = (GlobalMultiMenu) mFrgmntManager.findFragmentById(R.id.frgmntView);          startMenu();   And another void where i call the method:  public void startMenu() {             mFrgmntTransaction = mFrgmntManager.beginTransaction();             mFrgmntTransaction.setCustomAnimations(R.anim.fade_in, R.anim.fade_out);             mFrgmntTransaction.replace(R.id.frgmntView, new GlobalMultiMenu()).commit();             actualFrgmnt = 0;              gmm.updateBottomItems();              isDoingTurn = false;         }   But this returns null pointer, please help. Thanks


here is the query i am using:  bilan1 = [select id,valider__c,poste__c,Statut__c,Poste__r.Date_dernier_bilan__c, date_bilan__c, moyenne_du_bilan__c from Bilan_de_positionnement__c where poste__c in: collID and date_bilan__c =:Poste__r.Date_dernier_bilan__c  order by date_bilan__c asc];   i get this error:   Variable does not exist: Poste__r.Date_dernier_bilan__c   when i remove the condition and date_bilan__c =:Poste__r.Date_dernier_bilan__c the error disappears even though the Poste__r.Date_dernier_bilan__cfield is fetched in the query meaning that the variable  Poste__r.Date_dernier_bilan__c does exist, am i messing something ?


How to find unknown correlation coefficients in a correlation matrix from known correlation coefficients?

I have a correlation matrix A given below. Here A should be a positive-definite matrix so that we can perform Cholesky decomposition of A.  1.0,  0.5,  0.6,  0.7  0.5,  1.0,  ??,   ??  0.6,  ??,   1.0,  ??  0.7,  ??,   ??,   1.0   How to find the unknown correlation coefficients in A such that A will remain as positive-definite matrix without changing the given coefficients?


I can't understand why root user take huge CPU load, since there is no special processes running. top -c


how to change input method with ime command

I want to know how to change input method using the command line. Any ideas? Sorry for my english.  I have tried this:  C:\Users\admin>adb shell shell@android:/ $ ime list -a ime list -a com.huawei.inputmethod.hwpal/.PinyinIME:   mId=com.huawei.inputmethod.hwpal/.PinyinIME mSettingsActivityName=com.huawei.i nputmethod.hwpal.SettingsActivity   mIsDefaultResId=0x7f080000   Service:     priority=0 preferredOrder=0 match=0x108000 specificIndex=-1 isDefault=false     ServiceInfo:       name=com.huawei.inputmethod.hwpal.PinyinIME       packageName=com.huawei.inputmethod.hwpal       labelRes=0x7f0c0000 nonLocalizedLabel=null icon=0x0       enabled=true exported=true processName=com.huawei.inputmethod.hwpal       permission=android.permission.BIND_INPUT_METHOD       flags=0x0 org.apelikecoder.bulgariankeyboard/.BulgarianIME:   mId=org.apelikecoder.bulgariankeyboard/.BulgarianIME mSettingsActivityName=org .apelikecoder.bulgariankeyboard.BulgarianIMESettings   mIsDefaultResId=0x0   Service:     priority=0 preferredOrder=0 match=0x108000 specificIndex=-1 isDefault=false     ServiceInfo:       name=org.apelikecoder.bulgariankeyboard.BulgarianIME       packageName=org.apelikecoder.bulgariankeyboard       enabled=true exported=true processName=org.apelikecoder.bulgariankeyboard       permission=android.permission.BIND_INPUT_METHOD       flags=0x0 com.thihaayekyaw.frozenkeyboard/com.example.android.softkeyboard.SoftKeyboard:   mId=com.thihaayekyaw.frozenkeyboard/com.example.android.softkeyboard.SoftKeybo ard mSettingsActivityName=com.example.android.softkeyboard.FKSettings   mIsDefaultResId=0x0   Service:     priority=0 preferredOrder=0 match=0x108000 specificIndex=-1 isDefault=false     ServiceInfo:       name=com.example.android.softkeyboard.SoftKeyboard       packageName=com.thihaayekyaw.frozenkeyboard       enabled=true exported=true processName=com.thihaayekyaw.frozenkeyboard       permission=android.permission.BIND_INPUT_METHOD       flags=0x0 shell@android:/ $ ime enable com.example.android.softkeyboard.SoftKeyboard ime enable com.example.android.softkeyboard.SoftKeyboard Error: Unknown id: null shell@android:/ $


Prove that $\lfloor 2x \rfloor + \lfloor 2y \rfloor \geq \lfloor x \rfloor + \lfloor y \rfloor + \lfloor x+y \rfloor$ for all real $x$ and $y$.  How should I solve this?  I can't think of a way with casework and I can't really simplify it more.  Thanks in advance for posting a proof!


I am fairly new to photography and I have read many "beginners guides" and watched youtube tutorials. One thing that remains elusive to me is how to properly pick what f-stop to use.   I use a 35mm, 55mm f1.8, and a 24-70mm f4 lens with my Sony A7.   For portraits, I generally try to pick lower f-stop like between (1.8-6f). For more general use like taking pictures of animals I usually pick between (6f-10f).   The issue I primarily run into is that when I take a picture with a lower f-stop, it looks great in my viewfinder. However when I go home to load it on a larger screen, I find that a lot of elements I am trying to capture is actually out of focus.   How do I know how much room I have to play with before a subject goes out of focus? It seems to change with f stop, how close I am to the subject(s), and the focal length I am using.   I understand the concept that I am basically focusing on a "slice" of space in front of me and when I lower the f-stop, this slice of space becomes narrower. I can't figure it out and I end up getting disappointed when I view the pictures on a large screen.


Would order 1AU metric expansion of space begin if the solar system were not inside a galaxy?

In  I describe the >30 years of laser ranging between lasers on Earth and the retroreflector arrays on the Moon. Amazingly, after comparing this data to simulation of all of the orbital mechanics and tidal effects, the residual is only a few centimeters.   If $\text{H}_D$ is about 70 $\text{km}\ \text{s}^{-1} \text{Mpc}^{-1}  $ (or about 2.3E-18 $\text{sec}^{-1}$), then with a semi-major axis of 3.84E+08 meters, over 37 years the effect would be of order 1 meter. Since these measurements are consistent with zero to the level of a few centimeters, this is taken as experimental evidence that metric expansion is not taking place locally compared to the rate seen between galaxies.  If I understand correctly this is "suppression" is due to the large amount of mass in our galaxy, even though it is thousands of light years away. So I am wondering - if a similar experiment were done in a similar solar system associated with an isolated star alone in an intergalactic region, what does current theory predict - would metric expansion be detected, or would the mass of the one star be enough to suppress it?  Then what if it were just a planet and a moon without the mass of the star, or even two smaller masses?  I'm looking for an answer at a level similar to  and , where time was taken to note the the specific relevant concepts and work from the paper linked in the first answer.


I detect a lot of mistakes only when I read the paper printed. For some mysterious reason, I do not see these errors on my screen.  So I used to print a lot, and only to type-check. I use double-sided printing of course but there are still plenty of space wasted ; with LaTeX big margins (among other things), I have to print more pages than necessary.  I am wondering if there is a document class designed to save paper by optimizing the space. Perhaps a class which will set the text in several columns, put some minimal margins, reduces space between titles, ... Of course, the result will be ugly but it is just to type-check, not to publish.  I know I could set myself settings in order to achieve exactly what I want. But the idea is to have to change only the document class from article or book to this saving paper class when you are at the type-check stage.   Do someone know such class?


I try to add a center dot with \circ but it fails to compile. How to use maths symbol in text mode? The error message is   ovak, slovenian, spanish, swedish, turkish, turkmen, ukrainian, uppersorbian,  welsh, loaded. (/usr/local/texlive/2012/texmf-dist/tex/latex/base/article.cls Document Class: article 2007/10/19 v1.4h Standard LaTeX document class (/usr/local/texlive/2012/texmf-dist/tex/latex/base/size10.clo)) (./untitled-1.aux) ! Missing $ inserted. <inserted text>              $


How to find out seasonality in Time Series Data without looking at the graph?

I've a data which has multiple time series. I want to find the seasonality in the data based on a number as it won't be feasible to check the seasonality by checking the plot. There are around 2505 time series.  I explored, but was unable to find any good solution/ approach?  Can any expert help me out with this!


an/prm-10 grid dip question - how the voltage can be negative at the grid?

I am trying to repair a recently bought AN/PRM-10 grid dip. I have replaced some electron tubes by new ones and (almost?) everything seems to be OK regarding the voltages at the pins of the electron tubes, according to the one-to-last page of the manual that can be downloaded  (bottom of the page). For the convenience of the readers, I've attached here a copy of this page, and of the schematic of the grid dip.       As everything is OK for all the other electron tubes, I am interested only in the V-201 acorn electron tube. According to the document, the voltage at pin 3 should be -10V AC (this is of course a mistake and should read -10V DC). If I measure this voltage with an electronic tester, it gives me -11V DC (so far so good). If I invert the ground and positive terminal of the tester, surprise ! it gives me +4V DC (and not the expected +11V DC). The same occurs if I measure the voltage with an analogue voltmeter. I have two questions:   why is not the voltage +11V when I exchange the terminals of the tester ? I don't understand how can the voltage at pin 3 be negative with respect to the ground, as according to the schematic, I see no voltage source that can bring this potential below ground.


Do I have to buy minecraft to get a new account on a PC that already has minecraft installed? I am teetering on and off on this question. Searched the web probably 1,000,000,000 times but can't find this specific question's answers.


install an older version of xcode on mac lion 10.7

I want to install xcode on vmware image mac os x lion 10.7 .. I went to app store but it won't let me download because it's the latest version which not compatible with lion 10.7 .. I don't have an developer account ..  So, is there any way to install an old xcode ?


Always On Synchronous Commit Mode With Large Delays

For SQL Server Enterprise's Always On availability groups in Synchronous Commit mode, is there some amount of latency that can't be exceeded?  For example, can it work between very distant data centers, such as between the US and Europe?


Dividing streets layer into 2 mile segments?

I have a streets layer which I want to divide into 2 mile segments. I have searched and read enough for days but there is no information on how to do this. The split command allows you to select and divide the poly-line which is manual. It is practically impossible for me to do it for a streets layer which has tens of thousands of poly-lines.   Is there any tool, script or combinations of tools I can use to achieve this?


Examples of continuous functions $f : \mathbb{R} \to \mathbb{R}$

What are some nice examples of continuous functions $f : \mathbb{R} \to \mathbb{R}$ where the images of open sets are not open, and the images of closed sets are not closed?


c++ Undefined symbols for architecture x86_64 for template inheritance classes

I looked at the other questions already asked on SO regarding this same error message. They say to make sure my definition matches my implementation, and it does (I think). I have multiple classes, linkedListType (base template class), unorderedLinkedList (derived template class), main for testing it and a few others (can post snippets if needed).   When compiling it, I get this error:  Undefined symbols for architecture x86_64:   "linkedListType<int>::deleteAtIndex(int&)", referenced from:       deleteKthElement(unorderedLinkedList<int>&) in main.cpp.o   "linkedListType<int>::getInfoAtIndex(int)", referenced from:       printKthElement(unorderedLinkedList<int>&) in main.cpp.o       deleteKthElement(unorderedLinkedList<int>&) in main.cpp.o   "linkedListType<int>::linkedListType()", referenced from:       unorderedLinkedList<int>::unorderedLinkedList() in main.cpp.o   "linkedListType<int>::~linkedListType()", referenced from:       unorderedLinkedList<int>::~unorderedLinkedList() in main.cpp.o   "unorderedLinkedList<int>::deleteNode(int const&)", referenced from:       vtable for unorderedLinkedList<int> in main.cpp.o   "unorderedLinkedList<int>::insertLast(int const&)", referenced from:       vtable for unorderedLinkedList<int> in main.cpp.o   "unorderedLinkedList<int>::insertFirst(int const&)", referenced from:       vtable for unorderedLinkedList<int> in main.cpp.o   "unorderedLinkedList<int>::deleteSmallest()", referenced from:       vtable for unorderedLinkedList<int> in main.cpp.o   "unorderedLinkedList<int>::deleteAllOccurrences(int&)", referenced from:       vtable for unorderedLinkedList<int> in main.cpp.o   "unorderedLinkedList<int>::deleteFirstOccurrence(int&)", referenced from:       vtable for unorderedLinkedList<int> in main.cpp.o   "linkedListType<int>::printListReverse() const", referenced from:       reversePrint(unorderedLinkedList<int>&) in main.cpp.o   "linkedListType<int>::print() const", referenced from:       print(unorderedLinkedList<int>&) in main.cpp.o   "linkedListType<int>::length() const", referenced from:       printKthElement(unorderedLinkedList<int>&) in main.cpp.o       deleteKthElement(unorderedLinkedList<int>&) in main.cpp.o   "unorderedLinkedList<int>::search(int const&) const", referenced from:       vtable for unorderedLinkedList<int> in main.cpp.o   Looking at the first one (deleteAtIndex):   linkedListType.h:  template<class Type> class linkedListType { public:    ...    void deleteAtIndex(int& desiredIndex); }   linkedListType.cpp:   template<class Type> void linkedListType<Type>::deleteAtIndex(int& desiredIndex) {     nodeType<Type> *temp = getNodeAtIndex(desiredIndex);     nodeType<Type> *priorNode = getNodeAtIndex(desiredIndex-1);     priorNode->link = temp->link;     delete temp; }   main.cpp:  // a convenience function in main.cpp... both 'getInfoAtIndex' and 'deleteAtIndex' only exist in the base class void deleteKthElement(unorderedLinkedList<int> &ull){      int elem;     cout << "Enter an integer specifying the index to delete (0 - " << ull.length() - 1 << "): ";     cin >> elem;     int info = ull.getInfoAtIndex(elem);     cout << "Info at index (" << elem << "): " << info << endl;     ull.deleteAtIndex(elem);     cout << "Node deleted." << endl; }   I have no idea why these functions are giving me these errors.


How to efficiently move the decimal point in a number until reaching some threshold

Say I have a double x, whose value is > 0 and < 1 million. I want to move its decimal point left until it is > 1 million and < 10 million. So for example, 23.129385 becomes 2313938.5.  What I'm doing now is just multiplying by 10 until reaching the stopping condition. However I'm performing this algorithm a lot so if I can optimize it somehow it would be helpful. A constant time solution, irrelevant of the magnitude of x, is obviously ideal but so far I haven't been able to come up with one.


Blocking Adobe Flash plugin, will not run items on various webpages. Does Adobe Flash support?


$(n-1)! \equiv 0 \pmod n$, Wilson's Theorem version for non prime moduli

The question is to prove the following:     If $n>4$ is composite, then $(n-1)! \equiv 0 \pmod n$   My attempt to prove so is the following:     Since $n$ is not prime, the prime factors of $n$ lies in $(n-1)!$ yielding a term of $kn$ for some integer $k$. Hence, it is divisible by $n$ as desired.   The proof seems too short, did I prove it correctly?


dpkg error: "trying to overwrite file, which is also in..."

For example:  $ sudo apt-get install curl Reading package lists... Done Building dependency tree Reading state information... Done You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies: bsh : Depends: libjline-java but it is not going to be installed groovy : Depends: libjline-java but it is not going to be installed rhino : Depends: libjline-java but it is not going to be installed E: Unmet dependencies.   Try 'apt-get -f install' with no packages (or specify a solution).   I get the same or similar errors when I attempt to install clojure1.3, leiningen, and several other packages.   When I try the suggestion made in the error message, this is what happens:  $ sudo apt-get -f install  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following packages were automatically installed and are no longer required:   diffstat linux-headers-3.2.0-26-generic linux-headers-3.2.0-26 dh-apparmor dkms html2text libmail-sendmail-perl libsys-hostname-long-perl Use 'apt-get autoremove' to remove them. The following extra packages will be installed:   libjline-java Suggested packages:   libjline-java-doc The following NEW packages will be installed:   libjline-java 0 upgraded, 1 newly installed, 0 to remove and 0 not upgraded. 23 not fully installed or removed. Need to get 0 B/72.0 kB of archives. After this operation, 129 kB of additional disk space will be used. Do you want to continue [Y/n]? Y (Reading database ... 226243 files and directories currently installed.) Unpacking libjline-java (from .../libjline-java_1.0-1_all.deb) ... dpkg: error processing /var/cache/apt/archives/libjline-java_1.0-1_all.deb (--unpack):  trying to overwrite '/usr/share/java/jline.jar', which is also in package scala 2.9.2-400 Errors were encountered while processing:  /var/cache/apt/archives/libjline-java_1.0-1_all.deb E: Sub-process /usr/bin/dpkg returned an error code (1)  $ sudo apt-get upgrade Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt-get -f install' to correct these. The following packages have unmet dependencies:  bsh : Depends: libjline-java but it is not installed  groovy : Depends: libjline-java but it is not installed  rhino : Depends: libjline-java but it is not installed E: Unmet dependencies. Try using -f.


Each time I try to install SteamCMD via apt it responds with: Package steamcmd is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source E: Package 'steamcmd' has no installation candidate  I have a Raspberry Pi running Ubuntu 20.04.


Is there a multiple function composition operator?

Is there a commonly-accepted operator which defines multiple function composition? I have not been able to find one on any of the related Wikipedia pages. In one of my proofs, I've been finding it very tiresome to continually write the following: $$ f_n\circ f_{n-1}\circ\cdots\circ f_0 $$ And I would really appreciate finding out if there is a common notation for what I'm trying to do. The above notation only works for a sequence of functions; I imagine there's probably a way of using this composition operator to compose over an arbitrary ordered set, sort of like $\bigcup_{i\in I}A_i$ allows a union over any (not necessarily countable) indexing set $I$, but without the ordering condition.  I'd use foldl1 (.), but that doesn't seem very appropriate for math homework.    I feel like I should add why I feel like one is necessary, on top of the additional expressiveness we gain from being able to compose over arbitrary ordered sets. The problem itself defines $F_n$ as the above repeated-composition function; indeed, we can define $F_n$ in a recursive manner with $F_0=f_0$ and $F_{n+1}=f_{n+1}\circ F_n$. However, the issue remains because in my proof I frequently need to expand $F_n$ (for instance, calculating $F_n'$), in which case such an operator would come in handy.


I'm trying to write "T(n/3)" within an align block, but I'm not getting the behavior I expect. When I enter this:  \documentclass{article} \usepackage[utf8]{inputenc}  \begin{document}  \begin{align}      T(n) = 3T(\frac{n}{3}) + 2n -3  \end{align}  \end{document}   I get this output from Overleaf:    I didn't get this issue when I used aligns and fracs before in the same document. For example, this one worked just as intended:  \begin{align} S &= \frac{1}{2} + &\frac{1}{4} + &\frac{2}{8} +&\frac{3}{16} + &\frac{5}{32} + &\frac{8}{64} + &\frac{13}{128} + \dots\\ \frac{1}{2}S &= &\frac{1}{4} + &\frac{1}{8} + &\frac{2}{16} +&\frac{3}{32} + &\frac{5}{64} + &\frac{8}{128} + \dots\\ S-\frac{1}{2}S &= \frac{1}{2}+ &\frac{0}{4} + &\frac{1}{8} + &\frac{1}{16} +&\frac{2}{32} + &\frac{3}{64} + &\frac{5}{128} + \dots\\ &= \frac{1}{2} + \frac{S}{4}\\ &\implies 4S-2S=2+S\\ &\implies S=2 \end{align}   yielding:


regular expression in python to check if syntax

I am making a basic syntax checker for a language i am trying to make. The lexical analyzer passes something to the function isIfStmt() to check if its valid like:  #IF#RPAREN...#LPAREN#NEWLINE...#VAR#ASSTOP#RPAREN...#LPAREN#NEWLINE...#END#SPACE#IF   This is the python code i wrote:  def isIfStmt(ifStmt):     ifObj = re.match(r'\#IF\#LPAREN(.*)\#RPAREN(.*)\#END\#SPACE\#IF', ifStmt)     print(ifObj) if not isLogicExp(ifObj.group(1)):     return False if not isStmtList(ifObj.group(2)):     return False if ifObj==None:     return False return True   The isLogicExp function checks if the logical expression supplied is correct. and isStmtList checks if the code inside is a valid set of simple statements that might include another if. The problem is that this regular expression matches the last #LPAREN and I want it to match the one that is for the first left parenthesis in the if stmt line. But it matches the last one in the argument supplied. if() a=(10)  if i change the regex tor'\#IF\#LPAREN[^\NEWLINE]\#RPAREN(.*)\#END\#SPACE\#IF'it doesn't work either.  If I try to use the non-greedy approach with #RPAREN, it has a problem that between the parenthesis, there can be more in the logicalExp inside. I tries using the non-greedy approach with #NEWLINE as,  r'\#IF\#LPAREN(.*)\#RPAREN?(#NEWLINE)(.*)\#END\#SPACE\#IF'   But it's not working either. I still match the last #RPAREN


Why doesn't Zorn's lemma apply to $[0,1)$?

Consider the real interval $[0,1)$, this is partially ordered set (totally ordered actually). This set has a upper bound like $1$, and according to Zorn's Lemma each partially ordered set with a upper bound should have at least one maximal element. However, in this set there is no maximal element, i.e., element that is greater than every element of the set because you can be as close as to $1$. I am should I don't understand Zorn's Lemma. Please Help!!


Power rule step. Where does equation of the difference of two numbers raised to the same power come from?

I am looking at a proof of the power rule and I see this:  $x^n - a^n = (x-a)(x^{n-1} + x^{n-2}*a + {...} + xa^{n-2} + a^{n-1})$  Where does this come from?  It's used in this proof which I'm trying to understand:    What is it called?


It is proposed to colour the squares of a $4 \times 4$ board black and white, so that there are exactly two black squares and two white squares in each row or column.   In how many ways can this be done?  I've tried this finding out the number of ways column 1 and 2 can be done which is $36 = 6 \cdot 6$ as $\binom{4}{2}$ since the second column doesn't get in the way of the first.  Then I hit a road block. Can anyone provide a hint?


Adding newmode with Xrandr - "800x480_60.00"

I have 5-inch a 800x480 tft connected to the LVDS connector on a Portwell WADE-8020 mini-ITX embedded system board. I would like to build a XMBC/Kodi box for streming my music from my freenas PC with the tft showing what is been played, I got as fare as this...   sudo xrandr --newmode "800x480_60.00"  29.50  800 824 896 992  480 483 493 500 -hsync +vsync`enter code here   then,  sudo xrandr --addmode LVDS1 800x480_60.00   now that I get the correct resolution, I now have a black band on the top of the screen.  sudo xrandr --output LVDS1 --set "scaling mode"  "Full aspect"   However this did not solve the issue, also I know I need to amend the /bin/sh file with this from googling so I don't need to keep doing this at every boot. But I don't know how to as I'm very new to Linux.  #!/bin/sh xrandr --newmode "800x480_60.00"  29.50  800 824 896 992  480 483 493 500 -hsync +vsync xrandr --addmode LVDS1 800x480_60.00


Should we drop the coloring of opinions in Meta?

Currently, like in Stack Overflow when an answer in meta gets a lot of downvotes it gets greyed out. This makes answers harder to read.     While the motivation for this is clear in Stack Overflow I'm not sure what purpose of it in Meta is, since upvotes and downvotes do no represent effort and usefulness but agreement or disagreement with the opinion stated.  Why is this visual cue in place in meta. Is it useful? and should we drop it?  (I'm providing my own opinion but obviously - this being meta and all - I'm very interested in ideas)


slds-form-element_horizontal change distribution of label and field

Is it possible to change the distribution of the label (default is  33/66%) in a horizontal form?    How can I have these label inline without let them going to new line?


Second PhD vs PostDoc - Math vs Theoretical Physics

I'm about to complete my PhD in mathematics. I've been working with Group theory (Representations). Besides the PhD I also did a master's in theoretical physics (I took much more courses than necessary to earn the degree and all of them were in advanced level, and did really well). The thing is: I would like to work in Theoretical Physics, and I'd like to use my Math background and apply it to theoretical physics. I love both subjects and I think they are like brothers in a sense. So my question is:  1) Should I apply for a second PhD (In physics)? For me it would be the worst option, since I'd have to spent a lot of time in things that I already know, and I don't see the point of writing another thesis. I heard that in Europe some universities "hire" PhD students as Research Assistants, so maybe this wouldn't be so bad. What you think?  2) Apply for a PostDoc position in theoretical physics? This is the best option in my opnion, but I don't know if physics departments welcomes mathematicians applying for PostDocs positions, Do they?  Observe that this question is not answered in another post, my question is specific to math/theoretical physics research. Besides I'm not thinking in getting a second PhD to "learn" physics, I am asking about what is more reasonable when considering to do research both in math and in physics.


Why does a flash freeze a picture even if I use a shutter speed like 1/10 sec?  I don't understand it, because the light will hit the sensor the whole time, not just when the flash is fired.


Does $AA^T=I$ imply that $A^TA=I$?  The wiki article defines the orthogonal group as:  $$o(n,\Bbb C) = \{ A\in M_n(\Bbb C): AA^T=A^TA=I \}$$  My book writes:  $$o(n,\Bbb C) = \{ A\in M_n(\Bbb C): AA^T=I \}$$  I couldn't show it just by manipulationg:  $$AA^T=I\implies AA^TA=A\implies A^TAA^T=A^T\implies A^T=A^T$$  and so on, never helped. Thanks. I haven't done much linear algebra


I have three servers with own databases, and database schemas are same. Let's call them servers A, B and C.  All three servers will be operational, which means that all three servers will serve for its region.  Data from servers B and C need to be replicated on server A, so that server A will contains data from all servers, but other two servers contain just own data.  I need to implement some replication solution to achieve this goal, and I am asking if it is possible to have two publishers (server B and C) and one server with two subscription (server A)? Is there any better solution? Which replication model will be the best?


I got a problem when I want to color the region bounded by curves \sigma^{(0)}, \sigma^{(1)}, \sigma^{(0)}. I use the command  \draw[fill=red!30, opacity=.5] (h2)--(h3)--(h4)--cycle;   but it is colored only the triangle formed by 3 vertices v_0, v_1, v_2. Like in the image below:    This is my code  \documentclass[12pt]{article}  \usepackage{epsfig,psfrag}  \usepackage{amsmath,amsxtra,amssymb,latexsym,amscd,amsthm} \usepackage[linesnumbered,ruled,vlined]{algorithm2e} \usepackage{graphicx} \setlength{\textwidth}{6.2in} \setlength{\oddsidemargin}{0.3in} \setlength{\evensidemargin}{0in} \setlength{\textheight}{8.7in} \setlength{\voffset}{-.7in} \setlength{\headsep}{26pt} \setlength{\parindent}{10pt}  \usepackage{epic} \usepackage{curves}  \usepackage{tikz, tikz-3dplot, pgfplots} \usepackage{tkz-graph} \usetikzlibrary{calc,arrows.meta} \usetikzlibrary{shapes.geometric,calc} \usetikzlibrary[positioning,patterns] \usetikzlibrary{decorations.markings} \usetikzlibrary{arrows}   \usetikzlibrary{arrows,calc,shapes,decorations.pathreplacing} \usepackage{tikz-cd}   \usepackage{young} \usepackage[vcentermath]{youngtab}  \begin{document} \begin{tikzpicture}   [decoration={markings,mark=at position 0.5 with {\arrow{>}}},    witharrow/.style={postaction={decorate}},    shorten <>/.style={shorten <=#1,shorten >=#1},    dot/.style={radius=2pt}   ]     % ellipse   \begin{scope}     \fill            (-2,0) coordinate (h1) circle[dot] node[left](k1){$q$}           (2,0) coordinate (h2) circle[dot] node[below](k2){$v_0$}           (4,2) coordinate (h3) circle[dot] node[above](k3){$v_2$}           (5,-2) coordinate (h4) circle[dot] node[below](p3){$v_1$}           (0,0) coordinate (a3)  node[left](p3){}            (5,0.5) coordinate (b3)  node[right]{}           (1,-0.5) coordinate (c3) node[right]{};        \draw[bend right=20,witharrow]  (h1) to node [anchor=south]{$\alpha(v_0)$} (h2);             \draw[bend left=30,witharrow]  (h1) to node [anchor=south]{$\alpha(v_2)$} (h3);               \draw[bend right=30,witharrow]  (h1) to node [anchor=north]{$\alpha(v_1)$} (h4);               \draw[bend right=30,witharrow]  (h2) to node [anchor=south]{$\sigma^{(1)}$} (h3);             \draw[bend left=20,witharrow]  (h2) to node [anchor=north]{$\sigma^{(2)}$} (h4);            \draw[bend left=25,witharrow]  (h3) to node [anchor=west]{$\sigma^{(0)}$} (h4);  \draw ($0.5*(a3)+0.5*(b3)$) circle[x radius=6,y radius=4];     \node at ($(a3)+(6,2.5)$) (X3) {$X$};           \draw[fill=red!30, opacity=.5] (h2)--(h3)--(h4)--cycle;     \end{scope}           \end{tikzpicture} \end{document}   How can I fix this problem? Can any one give me some idea?


I have created a JavaFX aplication in intelliJ and now I would like to generate the .exe file of my project and I can't figure it out how can I do that.  I have learned how to generate the .jar file from Project Structure -> artifacts but I couldn't open it.


14.04 Automatically restart binary if it stops

I have a binary file that stops running every few weeks, you can simply start it again and it runs for another few weeks. The software is not perfect but it would be perfect enough if it restarted automatically.  What is the best way to set something up to automatically check if the binary is running and start it if it is not?


Restroing Array Children values via JSON

I have some variables xx=0 , yy=7 stored in array called variables , where variables=[xx,yy] , now i stored these values in a json file , and after parsing back the variables array , I want to restore each variable value ( assign value back ) , what is the perfect way to do this , assuming this example is very simple cause i really have large list of variables.


Where do I ask about the cheapest way to print a single copy of a book?

I have the following question that I'd like to post somewhere:  What is the cheapest way to print a single copy of a public domain book? The Shabara Bhashya is an important text of Hindu philosophy, containing the traditional proof that Hinduism is true, but unfortunately it's out of print.  It's in the public domain and available as , but I'd like a physical copy of it.  My question is, what is the cheapest way to print a single copy of a book like this? I've found sites where you can print a single copy of a book if you upload a text PDF of the book, but in this case the PDF consists of image scans, not text.  (And OCR would produce a garbled mess, as there are a lot of Indian words in the book.)  So is there any way to print a public-domain book if you have have a PDF consisting of scanned images?  Now if the Stackexchange network had a "Service Recommendations" site, similar to Hardware Recommendations and Software Recommendations, that would be the ideal place.  But there isn't such a site.  So my question is, are there any sites where my question would be on-topic?


JavaScript: splitting letters followed by digits

I want to split a string contains letters followed by digits, the separator should be the next letter.  'C3B1A60' ===> ['C3', 'B1', 'A60']  I've tried to use SPLIT with RegEx and it worked fine except it produces empty string in between:  var splits = 'C3B1A60'.split(/([A-Z]\d+)/); // [ '', 'C3', '', 'B1', '', 'A60', '' ]   I know I can workaround to remove them, but is there a straightforward way of doing it?!


How to Access two different programs from PATH, both having same name in Windows 10?

I added addresses of python 2.7, and Anaconda 4.1.1(Python 3.5) to PATH variable in Windows 10, whenever I run "python" from cmd, program which was added earlier is executed.How can I access both of them depending on my choice without altering name of either


How to delete a file that's no longer in the directory?

So I downloaded a music file but I was surprised when I saw it had no extension and it was 0kB. I decided to delete it but then I got that terrible error message saying that the file is no longer in the folder I see it is in!!!   I don't think my hardware is so weak that it can't refresh my Explorer Window...   So what I first had in mind was to use admin rights cmd to delete the file as shown in this video:  (yes, I had that problem before, on Windows 7 and that solved it for me).   But on Windows 8.1 I can't see short filenames for ANY file, not just the corrupt one. (Is that a bug or is it supposed to be so? My corrupt file has a dot in its name -- a disallowed character, I believe?)  What can I do to delete this file?   I tried creating and then deleting it, a new version of the same file was created again what is wrong with that?


Is there any way to run .jar files in android without rooting phone? I used jbed and some other apps but they instantly stopped unexpectedly after clicking.


Is it possible to boot from a USB flash drive on a Toshiba Tecra A2?

Is it possible to boot a Toshiba Tecra A2 from a USB flash drive?  BIOS shows no boot option for USB. I haven't yet found any way to do it, but I might be missing some option.


Question regarding when identity map between any two matrices is continuous

This question was asked in my real analysis quiz and I couldn't correctly solve it  .  Question :  Let X be set with the property that for any  two matrices $d_1$ and $d_2$ on X , the identity map id:$(X, d_1) \to (X, d_2) $ is continuous . Then which of the following are true ?   X must be singleton .  X can be any finite set .  X cannot be infinite .  X may be infinite but not uncountable .   I took $d_1 =d_2$ and and X =$\mathbb{R}$ . So , (a) , (c) ,(d) are contracdicted . But I am not able to think on how to approach (b) . Please tell . Answer :    2,4  So , By looking at answer there is some mistake in taking $d_1= d_2$ and X =$\mathbb{R}$ as (d) is given correct . But whats the problem ? Any help would be really appreciated .


Texshop / bibtex errors in docs that used to work

I'm running Mac OS 10.13.1 (High Sierra) and Texshop Version 3.89. I opened Texshop for the first time in about 4 months today, and started to work on a document. I use Zotero to generate my BibTex file, also as usual. But I keep getting the following error:  This is BibTeX, Version 0.99d (TeX Live 2015) The top-level auxiliary file: My_Paper.aux I found no \citation commands---while reading file My_Paper.aux I found no \bibdata command---while reading file My_Paper.aux I found no \bibstyle command---while reading file My_Paper.aux (There were 3 error messages)   I thought I was doing something wrong because I was rusty, so I went back to a paper I wrote 2 years ago that definitely worked. There, I saved the .tex, .cls, .bib, and .pdf files, but when I ran the .tex file, I got the same error.  Is this a problem with TexShop under High Sierra, or is there something else I have to update to get these old papers to run?  As a minimum working example, this .tex file works in Overleaf, but gives me the error above in Texshop:  \documentclass[letterpaper,12pt]{article}  \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{lmodern} \usepackage{setspace} \doublespacing  \usepackage[english]{babel} \usepackage{csquotes}  \usepackage[notes,backend=biber]{biblatex-chicago} \bibliography{paperbib}   \begin{document} \title{Academic Paper:\protect\\With a Subtitle} \author{Joan Q. Public} \maketitle  Blah blah blah.   Blah blah Einstein's Theory\autocite{einstein} which predicted blah.  The New York Times\footcite{nyt} reported blah blah.   \printbibliography  \end{document}   Thanks in advance for any insight!


How to make firefox tab bar look like on Windows?

How to remove that top bar with page name and place tab bar instead of it?  How to transform this   into this?


Why do hotel rooms often have no central light?

When I stay at ordinary hotels in the United States it seems there is rarely or never any central light. The entryway usually has an overhead light, but the room itself usually just has lamps, so to light up the room I have to go around turning on lamps (in the dark). By contrast, in private homes usually each room has a central light and there is a switch by the door, so as you enter you can flip the switch and the room lights up. Why do hotels use lamps and have no central overhead light?


Is "TABLESAMPLE BERNOULLI(1)" not very random at all?

Whenever I need to return a random record from my tables and performance matters, instead of:  SELECT column FROM table ORDER BY random() LIMIT 1;   I always do:  SELECT column FROM table TABLESAMPLE BERNOULLI(1) LIMIT 1;   This is much faster but it seems like it's not very random? It looks like a lot of the same records get returned when using this method repeatedly. Is it just me or is this method much less random (and less useful because of that)?


Information Propagation at the Speed of Light

Imagine a thought experiment: You have a rod 10 ft or 10 light nanoseconds long. On each side you have perfectly synchronized super high-speed cameras looking at the surface of the rod.  You rotate the rod from the left. On the left side the camera records that the rod started to rotate at T-left= 0. On the right side (other side), when would the other camera see the start of rotation? What would T-right be at the start of rotation as recorded by the right hand camera?  If we were to communicate the information of the start of rotation via a beam of light, it would take 10 ns to get to the other camera. So, T-right would equal 10 ns. Would communicating the same information via a physical rod beat a beam of light? Wouldn't that violate the idea that C is the absolute speed limit on everything, including information (outside of quantum entanglement)? Are there relativistic time dilation effects at play here? Would the rotation propagate through the rod in a wave form?  This is just a thought experiment, so let's assume that the rod is made from an absolutely rigid material and there are no spring effects or other purely mechanical effects.


loc.getProvider() == "gps" not working properly

My piece of code is                   String gps = "gps";             if (loc.getProvider() == gps){                 forCampaignCopy.setText(loc.getProvider());                 locationManager.removeUpdates(locationListener); //to stop using the sensor             }             else{                 forCampaignCopy.setText(loc.getProvider());             }   When I run the debugger, it stops at the if statement and I can see that loc.getProvider() says gps (since that is the provider im using), however it then jumps to the else statement but prints out "gps". Why is this happening?


How do I persist query string throughout a user session without using a cookie?

Is there a better way using javascript to persist url query string throughout user session in client side other than using cookie?  url:   http://site.com/?q=query


Coming from Eclipse and having been used to duplicate lines all the time, it's pretty strange finding out that Xcode has no such function. Or does it?  I know it's possible to change the system wide keybindings but that's not what I'm after.


A High Voltage AC or a High Voltage DC which is more dangerous for human?

Not going too High Potential.  Say a 200V supply.   If somebody accidentally touches the bare terminals of supply, for which case ( AC or DC ), the effect on the person will be more dangerous.   And in which particular case more precaution should be taken ?


Okay, so this thing, is for me very strange. It still might be very obvious, but I started with blender 4 days ago.  So what is happening is that when I am rendering my animation, I have a white wall and ground where the scene grid is.  Here is a screenshot when in render mode:   And here it is in material mode:   I would really like to remove this, and I have tried for hours now with no success. I tried to unlink "world" from the scene but then it got all dark when rendered.  If you have any idea of what could be causing this?  (I am making an animated minecraft intro)  Edit: I was told to do alt + h and then the wall and the ground was visible in material mode as well. Here is a screenshot.    But I can't find a way to delete it...  :/


How to space columns evenly in a table with multicolumns?

A hopefully very simple question. Why does the multicolumn in my example below screw up the spacing between the columns below? Obviously I would want columns A, B, and C to be spaced evenly (as they are if I comment the multicolumn-row). How to achieve this?  \documentclass{scrbook} \usepackage{booktabs} \usepackage{multirow}  \newcommand{\crule}[1]{\multispan{#1}{\hspace*{\tabcolsep}\hrulefill\hspace*{\tabcolsep}}}  \begin{document}  \begin{table}[!t]     \caption{bla.}      \begin{tabular*}{\textwidth}{@{}l@{\extracolsep\fill}c@{\extracolsep\fill}c@{\extracolsep\fill}c@{}}     \toprule         & \multicolumn{3}{c}{sample number}\\         & \crule{3}\\ % definition should still include some neg. vspace after that         & 1 & 2 & 3\\     \midrule     some longer text here  & A    & B   & C\\     \bottomrule     \end{tabular*}     \end{table} \end{document}   results in


Window menus stick under window name. How to fix this?

After experimenting with desktop environments and uninstalling and installing unity desktop all window menus are sticking under the window name    Switching the window menu behavior has no effect.  Is there a way to fix this?


Prove that every group of order 15 is abelian?

I had seen this proof at many places, but  everywhere sylows theorem is used.   So is their any way to solve it without using sylows theorem?


Can a character or monster move a grappled enemy to another space in its reach without dragging them?

The rules on "", specifically the "Moving a Grappled Target" section of the PHB (page 195) reads:     When you move, you can drag or carry the grappled creature with you, but your speed is halved, unless the creature is two or more sizes smaller than you   I wondered if monsters like the death kiss (VGM page 124), that can grapple creatures within a large reach (in this case, 15 feet) can move a grappled creature from a space in its reach to another space in its reach, without dragging it. Is this possible?


What do you call the process of combining two words to create a new one?

Two very well established examples I can think of are:    (i.e. Guess + Estimate)  (i.e. Chill + Relax)   I guess I am meaning the process where two words are artificially combined into one, rather than when two words are combined to describe a new concept or item (e.g. Hatstand or lamppost). I suppose the distinction is blurry, but is there a word nonetheless?


Accumulation points of accumulation points of accumulation points

Let $A'$ denote the set of accumulation points of $A$. Find a subset $A$ of $\Bbb R^2$ such that $A, A', A'', A'''$ are all distinct.  I can find a set $A$ such that $A$ and $A'$ are distinct, but not one where $A,A',A'',A'''$ are all distinct.


Why is electric flux zero if my point charge is outside of a sphere?

I am currently studying Gauss Law and Electric flux , during one of my exercises they ask me to find the electric flux of a sphere with radius  5 cm and my  point charge is 10 cm to the left of the center of this sphere. Why is it that the electric flux is 0 if the  Electric field is not 0?


Is there a term for a word that serves as its own antonym?

For example:   "transparent" can mean both "obvious" and "hidden"  "aught" can mean both "all" and "nothing"    Is there a term for a word which has multiple definitions that are antonyms?


What to do when witches appear early in the game?

A long time ago I played an older version of Minecraft. Back then witches didn't spawn naturally, so you couldn't find them unless you found a hut. Now I'm playing again, but sometimes when I go down a cave I find one or two witches, and it's really hard to find them back.   So, what is the best you can do to kill witches, specially when two spawn at the same time and you don't have milk?


Is this possible? That is, posts that I've commented on in the past.


Localisation of the the roots of a polynomial

Let $P(x)=a_nx^n+...a_x+a_0$ be a polynomial with complex coefficients. Prove that any root of $P$ has the property: $$|z| <\left(1+\left(\sum_{k=0}^{n-1} \left(\frac{|a_k|}{|a_n|}\right)^3\right)^{\frac{1}{2}}\right)^{\frac{2}{3}}$$ I have been trying to solve this "hard" inequality on roots for weeks. I searched in articles for localisation of roots. This inequality looks hard. I found it in a maths magazine!


Why a combination of tail+grep+cut doesn't work?

I wanted to grep some logs, while tailing them, and print only a part of each line, since the lines are too long.  I can't figure out why the combination I use doesn't work; the procedure follows:  echo 'Jun 29 16:27:00 someip rails[pid]: Killed a transaction Jun 29 16:28:00 someip rails[pid]: Killed a transaction' > /tmp/test  # Shows the lines tail -f /tmp/test | grep Killed  # Shows the lines grep Killed /tmp/test | cut -c -43  # Shows the lines cat /tmp/test | grep Killed | cut -c -43  # Doesn't show them tail -f /tmp/test | grep Killed | cut -c -43   Why doesn't the last combination work?