Conflict between babel, hyperref and appendix package

While writing my thesis I use the hyperref and appendix packages like in the little example below.  test.tex  \documentclass{book} \usepackage{hyperref} \usepackage[titletoc]{appendix}  \begin{document}  \tableofcontents  \chapter{First chapter} \section{Chapter section} \chapter{Second chapter}  \begin{appendices} \input{extra} \end{appendices}  \end{document}   extra.tex  \chapter{First appendix} \section{Appendix section}   This example produces no errors. The end result is a content table with clickable links to all the chapters (including those in the appendices) and formatted the way I want it.  While compiling (pdfLaTeX) the following file is produced:  test.out  \BOOKMARK [0][-]{chapter.1}{First chapter}{}% 1 \BOOKMARK [1][-]{section.1.1}{Chapter section}{chapter.1}% 2 \BOOKMARK [0][-]{chapter.2}{Second chapter}{}% 3 \BOOKMARK [0][-]{Appendix.1.A}{Appendix First appendix}{}% 4 \BOOKMARK [1][-]{section.1.A.1}{Appendix section}{Appendix.1.A}% 5   My thesis is, of course, much larger (more chapters and more appendices). Although the structure is similar, compiling my thesis results in numerous cryptic errors (meaning I don't understand them). I've listed a few below. Commenting the hyperref package allows me to compile, but also disables the links and the bookmarks in the PDF document.  ! Missing \endcsname inserted. <to be read again>                     \penalty  l.46 ...@skip {}lage.1.D}{B\377lage Afkortingen}{}                                                   % 46 The control sequence marked <to be read again> should not appear between \csname and \endcsname.  ! Missing number, treated as zero. <to be read again>                     { l.46 ...@skip {}lage.1.D}{B\377lage Afkortingen}{}                                                   % 46 A number should have been here; I inserted `0'. (If you can't figure out why I needed to see a number, look up `weird error' in the index to The TeXbook.)  ! Extra \endcsname. \check@bm@number ...0\else \csname B_#1\endcsname                                                    \fi  l.46 ...@skip {}lage.1.D}{B\377lage Afkortingen}{}                                                   % 46 I'm ignoring this, since I wasn't doing a \csname.  ) ! Missing $ inserted. <inserted text>                  $ l.154 \begin{document}   The .out file of my thesis looks fine until you arrive at the appendix bookmarks.  ... \BOOKMARK [1][-]{section.5.4}{Optimalisatie}{chapter.5}% 32 \BOOKMARK [0][-]{chapter.6}{Conclusie}{}% 33 \BOOKMARK [0][-]{chapter*.28}{Bibliografie}{}% 34 \BOOKMARK [0][-]{B\penalty \@M \hskip \z@skip i\kern -0.02em j\penalty \@M \hskip \z@skip {}lage.1.A}{B\377lage Stopwoordlijsten}{}% 35 \BOOKMARK [1][-]{section.1.A.1}{Nederlandse stopwoorden}{B\penalty \@M \hskip \z@skip i\kern -0.02em j\penalty \@M \hskip \z@skip {}lage.1.A}% 36 \BOOKMARK [1][-]{section.1.A.2}{Engelse stopwoorden}{B\penalty \@M \hskip \z@skip i\kern -0.02em j\penalty \@M \hskip \z@skip {}lage.1.A}% 37  ...   I believe  is related to my problem, but I can't make head or tails of it (I'm still relatively new to LaTeX). Can anyone help me enable the links and bookmarks in my thesis?  Greetings,  Sander  EDIT  Adding the babel package to the example reproduces the problem.  \usepackage[dutch]{babel}


Can I use an M42 mount lens on a Minolta AF body?

I have an M42 mount Helios lens that I want to use on a Minolta AF mount body. I've found   online but wanted to verify it is the correct adapter before I purchased it.   The lens is a Helios 44M-2 and the body is a Minolta 300si.


C++ - Defining a specific template for a subclass

I would like to know if it is possible, like in java or c#, to define a subclass with a specific template type (overriding the superclass generic type). In my code I wanna do the following thing : class AbstractClass<T> class ASubClass : AbstractClass<int>  Here is my code (trying to learn c++ inheritance, I know code is wierd): ///// SUPER CLASS //// AbstractClass.h #ifndef ABSTRACTCLASS_H #define ABSTRACTCLASS_H #include <string>  template <typename T> class AbstractClass {     protected:         int m_X, m_Y;         T m_T;     public:         AbstractClass(int x, int y, const T& t);         virtual std::string getName() = 0; // virtual + = 0 means its abstract         virtual int getX();         int getY();         T getT();  }; #endif // ABSTRACTCLASS_H  AbstractClass.cpp     #include "AbstractClass.h"  template <typename T> AbstractClass<T>::AbstractClass(int x, int y, const T& t) : m_X(x), m_Y(y), m_T(t) { }  template <typename T> // have to define T everytime because even if its not called, it might be int AbstractClass<T>::getX() {     return m_X; }  template <typename T> int AbstractClass<T>::getY() {     return m_Y; }  template <typename T> T AbstractClass<T>::getT() {     return m_T; }  //// SUB CLASS //// ASubClass.h #ifndef ASUBCLASS_H #define ASUBCLASS_H #include <AbstractClass.h> #include <string>  class ASubClass : AbstractClass<int> {     private:         char* m_firstname;         char* m_lastname;     public:         ASubClass(int x, int y, const int& t, char* firstname, char* lastname);         std::string getName() override; // would also be abstract if this was not implemented         int getX() override; }; #endif // ASUBCLASS_H  ASubClass.cpp #include "ASubClass.h" #include <string>  ASubClass::ASubClass(int x, int y, const int& t, char* firstname, char* lastname)      : AbstractClass<int>(x, y, t), m_firstname(firstname), m_lastname(lastname) {  }  std::string ASubClass::getName() {     return std::string(m_firstname) + " " + m_lastname; }  int ASubClass::getX() {     return AbstractClass::getX() + m_Y; }  I am getting the following errors : D:\...\ASubClass.cpp|4|undefined reference to `AbstractClass<int>::AbstractClass(int, int, int const&)'|  and D:\...\ASubClass.cpp|13|undefined reference to `AbstractClass<int>::getX()'|  Is it possible in c++ to make java and c# generic type equivalences that work during build time and where we don't need to do checks during runtime ?


Canon Rebel T3 wont take the picture I want

I'm new to the camera and photography so I am sorry in advance...  With both lenses the camera came with (18-55 and 75-300) if I use the camera's magnifier or the lenses zoom for close up pics from near or far, the camera will take a picture from further away than what is shown on the screen.  Why?  Shouldn't it take whatever picture is shown on the screen?  Thx  Looking for beginner classes now...


A thief does not ______ the door.   Is the correct expression to fill the gap 'knock at' or 'knock on'?


How to build Blender as a Python module?

I have seen this question now many times and every question here and on other forum points to  experimental tutorial by . Now sadly a lot of answers are invalid right now because this central link is down. I couldn't find anything by Googling so if anybody has a fork of the tutorial or a second source that would be great? The link can't be gone for too long, I saw an answer with it 4 months ago.  The only other thing I have found is , but it also references the now missing tutorial. Any ideas how to find it?


Entropy is a measure on distributions, mutual information is a measure on RVs

In a lecture I read this statement, no explanation was given     "Unlike entropy, mutual information is a measure on random variables, not on distributions"   Can anyone explain what this means?  From the definition, both entropy and mutual information are defined in terms of the probabilities of random variables, so I have no understanding of it.  The statement is in this lecture,    p.10 in Exercise 3.2.10


Let $m,n$ be positive integers bigger than $1$. Show that $\mathbb{Z}_m \times \mathbb Z_n$ is cyclic if and only if $\gcd(m,n)=1$.    I have no idea on how to start. Anyone hints are much helpful.


Cannot use polyglossia/babel with biblatex in LuaTeX: etoolbox Toggle undefined

This is an example test.tex document. Both babel and polyglossia failed and produce the same error: \documentclass{book}  %\usepackage[vietnamese]{babel} \usepackage{polyglossia} \setdefaultlanguage{vietnamese}  \usepackage{biblatex}   \title{Sth}  \begin{document}  \maketitle  \end{document}   is the full log. And my config for VS Code: "latex-workshop.latex.recipes": [     {         "name": "lualatex->biber",         "tools": [             "lualatex",             // "biber",         ]     } ], "latex-workshop.latex.tools": [     {         "name": "lualatex",         "command": "lualatex",         "args": [             "--shell-escape",             "-synctex=1",             "-interaction=nonstopmode",             "-file-line-error",             "-pdf",             "%DOC%"         ]     },     {         "name": "biber",         "command": "biber",         "args": [             "%DOCFILE%"         ]     } ],  I installed all Vietnamese-related package I found using tlmgr search, notably babel-vietnamese and vntex, to no avail. When I use English language, it works. When I paste the exact document to Overleaf, it also works. So it's something on my part. How can I fix this?


Does a prime ideal map to a prime ideal?

I'm stuck in this problem.      Let $f: R \rightarrow S$ be a surjective homomorphism of rings with kernel $K$ and let $P$ be a prime ideal in $R$ containing $K$. Show that $f(P)$ is a prime ideal in $S$.    This problem has already been posted , but I want to prove it without the corresponding between prime ideals.   My try is here: Suppose $ab\in f(P)$. Then since f is surjective, there are $p,q\in R$ such that $f(p)=a,f(q)=b$. So, $f(pq)\in f(P)$, and since $K\subset P$, $pq\in P$.  Now, I want "$pq\in P$ implies $p\in P$ or $q\in P$", but in order to imply this property, not only P is prime, but also R is commutative. However, it is not guaranteed!  How to prove it? Thanks in advance.


My PBR Texture looks better in Viewport than in the Render

i'm rendering an Image of Bane's Mask in Blender. Its on a wet road, which looks high-res in viewport. This road looks very flat and dry after rendering in Cycles. Viewport result:  Render result:


I have a code like this, but I don't know why result variable have false value after execution the code  int x = 234; boolean result = (x<0250);   and also why the following code doesn't work properly?  System.out.println(0250);   it prints 168 !! why?!


Java Generics: Can you instantiate an object of type parameter inside class constructor?

In the code segment below, I want to create the array object inside the GenericStack class constructor. I understand why this is a problem. As per my understanding, "T" can be any class as far as the compiler is concerned. This class T can be an abstract class and hence cannot be instantiated. For example, java.lang.Number class is an abstract class and I could very well pass java.lang.Number for T. My question now is the following: Is there a way to tell the compiler (by some bounded parameters or perhaps something else) that the class that I am going to pass in place of T will be a concrete class that can be instantiated ? I know that I could easily create the array inside the main and then pass a reference but I find that to be a bit cluttered approach to implementing such requirement. public class GenericStack<T> {          //Data for the stack is an array but can be changed to list.     public static final int stackSize = 10;     private T[] stackData;     private int tos;      public GenericStack(int size) {         stackData = new T[size];  // This line will error out         tos = -1;     }      public T pop() {         try {             return stackData[tos--];         } catch (Exception e) {             System.out.println("Stack empty.Cannot POP from an empty stack.");             return null;         }     }      public void push(T stackObj) {         try {             stackData[++tos] = stackObj;         } catch (ArrayIndexOutOfBoundsException e) {             System.out.println("Stack is full. Cannot push a element into a full stack.");         }     }      public static void main(String[] args) {         GenericStack<Integer> intStack = new GenericStack<Integer>(GenericStack.stackSize);         GenericStack<String> stringStack = new GenericStack<String>(GenericStack.stackSize);     } }


How to generate MD5 hash value for multiple files in a folder using cmd

As mentioned in , the command:CertUtil -hashfile yourFileName MD5can be used to obtain the MD5 hash value for a particular file.  How can I find the MD5 hash values for multiple files in a folder using cmd?


Prevent line/paragraph breaks in contentEditable

When using contentEditable in Firefox, is there a way to prevent the user from inserting paragraph or line breaks by pressing enter or shift+enter?


I'm having trouble understanding the output of a piece of python code. mani=[] nima=[] for i in range(3)     nima.append(i)     mani.append(nima)  print(mani)  The output is [[0,1,2], [0,1,2], [0,1,2]]   I can't for the life of me understand why it is not [[0], [0,1], [0,1,2]]  Any help much appreciated.


I deleted some old questions of mine with no answers from stackoverflow.com. Is this OK?, as I don't want a question ban.


What is wrong with my proof showing the real numbers between 0<=x<1 are countable?

I am wondering what is wrong with my proof showing the real numbers are countable.  Create a set for every real number having 1 digit (10s position) with 0<=x<10 {0, 1, 2, ..., 9} / 10 = {0.0, 0.1, 0.2, 0.3, ..., 0.9} This set covers all numbers with 1 digit, but no number having 2 or more digits  Create a set for every real number having 2 digits (100s position) with 1 digit set and 10<=x<100 {0.0, 0.1, 0.2, ..., 0.9} $\cup$ {10, 20, 30, ..., 90} / 1000 $\cup$ {11, 12, 13, ..., 19, 21, 22, 23, ..., 29, 30, 31, 32, 33, ..., 39, ..., 99} / 100 = {0, 0.01, 0.02, 0.03, ..., 0.09, 0.1, 0.11, 0.12, 0.13, ..., 0.19, 0.2, ..., 0.99} = {0, 0.01, 0.02, 0.02, ..., 0.99} Were the bold number are from the one digit set (I am inserting an element of the one digit set into every 10th position) This set contains all 2 digit numbers, but is missing all sets containing 3 or more digits.  Create a set for every number having 3 digits (1000 position) with the 2 digit set and 100<=x<1000 {0.00, 0.01, 0.02, ..., 0.99} $\cup$ {100, 200, 300, ..., 900} / 100000 $\cup$ {110, 120, 130, ..., 190, 210, 220, 230, ..., 290, ..., 310, 320, 330, ..., 390, 410, ..., 990} / 10000 $\cup$ {101, 102, 103, ..., 109, 111, 112, 113, ..., 119, 121, 122, 123, ..., 129, 131, ..., 999} / 1000 = {0.0, 0.001, 0.002, 0.003, ..., 0.009, 0.01, 0.011, 0.012, ..., 0.019, 0.02, ..., 0.999} = {0, 0.001, 0.002, ..., 0.999} Were the bold number are from the one digit set (I am inserting an element of the two digit set into every 10th position) This set contains all 3 digit numbers, but is missing all sets containing 4 or more digits.   If I repeated this to infinity I would eventually arrive at a set containing all numbers with an infinite amount of digits after the decimal ($0.\overline{00}$ to $0.\overline{99}$). No number  would be missing except for any number with an more digits than infinity, which could easily be gotten by doing one or more rounds. The only problem I can see with this proof is if you defined the natural numbers as having a finite number of digits. However, that would contradict the idea of the natural numbers being  infinite (there are only a finite number of combinations for a set of finite numbers, which is 10^( the number of digits in your limit)), which suggests that at least one natural number has an infinite number of digits. I am very aware of cantors diagonal argument and think this proof shows a counter example. In the case of a real number, like pi mapping to a rational number I would think that since the natural numbers are infinite, I would expect there to be a number that has the exact same digits as pi. If I divide this number by 10^(n-1), were n = number of digits in pi I get pi. Again the only problem with this logic is in how you define the natural numbers. If these is the case then please tell me and point me to a source that defines this. Again I am not a mathematician and have a limited understanding of mathematics, so I am probably wrong here.


I need to switch themes based on URL paths and content types. I would have used ThemeKey, but it's not in a ready state. What are people using in Drupal 8 to do these things?


If one of the Ring-wraiths found the One Ring, shouldn't they be able to break free from Sauron's control?

We are told that Sauron achieved control over the nine men because they wore the nine rings of power and the ruling ring controls the other rings and their wearers.So, if a Nazgul would find the One Ring and find the will to use it, shouldn't they be able to break free of Sauron's influence?


I've noticed that the background text "Type a tag" at the bottom of the "Ask Question" page is cut off:        Reproduced in Microsoft Edge.


SciFi novel about scientists discovering "alternatives" to electromagnetism

I vaguely remember a SciFi novel from my younger days, where scientists discover "alternative" forms of power beside electromagnetism.  I do not remember the specific forms, but it was something along the lines of "electrogravity", "magnetogravity" etc. -- you get the idea. If I remember correctly, the effects of these power forms were basically psionic / magic in nature.  Unfortunately I remember very little of the actual plot, and couldn't put it into words with any coherency. Some treachery from within the group of scientists, perhaps some involvement of aliens? I cannot really remember. I just remember I enjoyed the story very much, and would like to re-read it.  The title could be "The fifth column" or similar -- then again I might be confusing two seperate novels.  I know that's not much, sorry. Anyone remembers this?


Icons of Meta.SE and Stack Apps have gone missing

I was just looking at someone's list of accounts (e.g., ) and noticed that the icon next to the "Meta Stack Exchange" account is showing the "broken image" sign instead of the correct icon (i.e., ).    Whoever took it ... please bring it back! :-) Same happens with the Stack Apps logo. Most of the other icons on that page seem to be served from cdn.sstatic.net (e.g., ). And indeed,  does bring up the correct image:


How to extract MS Office for Mac keys from my Mac OS X 10.6.8?

I have an old Mac Air 1,1 that has Office for Mac 2011 installed on it. I paid for the software and it installed the version on my machine. I don't have access to my live.microsoft.com account anymore and there's no way for me to get MicroSoft people/support to give me the keys again.  I need a way to extract the keys from my current installation of Office on my mac. For instance, in Windows, the keys used to be loaded in the registry at a certain place, under a certain key. Some programs could fetch them for you. Is there any such way I can do it for a Mac?


I'm assuming that if you don't select an answer for a question that you have asked within a certain time-span, that you will get no bounty. I asked the question shown in the image a couple months back.    Correct me if I'm wrong. And if I'm wrong, I'd like to see it implemented, because I think it's a good idea :)


So I just ordered a new phone (Honor 5x) I need to know can I install an early version of Nougat & when its released will it operate on my phone? Thanks!


I've seen many variants of this problem online, but not quite the same as this, so I don't believe this is a duplicate.  The famous differential equation problem models a skydiver jumping out of a plane as  $$m \frac{dv}{dt} = -mg-cv$$ where m is the mass of the skydiver, g is acceleration due to gravity (9.81 m/s) and c is the coefficient of air resistance.  Here is my question:     Suppose the skydiver exits the stationary helicopter at an altitude of 2000m and opens the parachute at 500m. For this exercise, the parachute opens instantaneously. Suppose m= 70kgs, the coefficient of air resistance is c = 14 for a free falling body and c = 105 after the parachute opens. When does the skydiver open the parachute? When does the Skydiver hit the ground?   So my attempt at a solution kinda starts like this, but this is where I get stuck:  Let's assume that s(t) is the distance the body falls in time t from its initial point of release, then $v = \frac{ds}{dt}$ and $a = \frac{dv}{dt} = \frac{d^2s}{dt^2}$. Thus we have a second order differential equation: $m \frac{d^2s}{dt^2} = -mg-c\frac{ds}{dt}$. By simply manipulation, we get $m \frac{d^2s}{dt^2} + c\frac{ds}{dt} = mg$. I originally started thinking of finding the integrating factor, however, this seems more complicated and won't help produce the equation that I need.  Would anyone be able to help? Much thanks in advanced!


If $f(x) = x$ if $x \in \mathbb{Q}$ and $f(x) = 0$ otherwise, is $f$ Riemann integrable?

Let $f$ be defined as:   $$ f(x) = \begin{cases}   x & \text{ if } x\in\mathbb{Q}; \\\\   0 & \text{ if }x\notin\mathbb{Q}. \end{cases}   $$   Is $f$ Riemann integrable on $[0,1]$? Prove it.   We know that the upper sum $U = x$ and lower sum $L=0$.    Since $\lim U\neq \lim L$, $f(x)$ is not Riemann integrable.   Is this sufficient for the proof?


Why is $\lim_{x \to \infty}\space \left(1 + \frac{1}{x}\right)^x\space {\neq}\space 1$?

I'm learning calculus, and I was given this information:  $$\lim_{x \to a} (f(x))^n = (\lim_{x \to a} f(x))^n$$ $$\lim_{x \to a}(f(x) + g(x)) = \lim_{x \to a} f(x) + \lim_{x \to a} g(x)$$ $$\lim_{x \to \infty}\frac{1}{x}=0$$ And I have to find this limit: $$\lim_{x \to \infty} \left(1 + \frac{1}{x}\right)^x$$ Why can't I just use my first rule to get: $$\left(\lim_{x \to \infty} \left(1 + \frac{1}{x}\right)\right)^x$$ then... $$\left(\lim_{x \to \infty} 1+\lim_{x \to \infty} \frac{1}{x}\right)^x$$ finally... $$(1 + 0)^x=1^x=1$$ I know the limit is actually equal to $e$ which is around $2.71828$, so why am I able to manipulate the limit to make it 1?


I have two date fields which are represented in a text field, code is shown below.    $(function() { $( "#Start_Date" ).datepicker({ dateFormat: 'dd-M-yy',    showOn: "button",    buttonImage: "../I/dateimg.png",     buttonImageOnly: true,    firstDay:1,    minDate: -0,    beforeShowDay: checkDisabled,    changeMonth: true,    changeYear: true,    beforeShow: function(input, inst)    {  inst.dpDiv.css({marginTop: -input.offsetHeight + 'px', marginLeft: input.offsetWidth-210 + 'px'});   }});   $( "#End_Date" ).datepicker({ dateFormat: 'dd-M-yy',    showOn: "button",    buttonImage: "../I/dateimg.png",     buttonImageOnly: true,    firstDay:1,    minDate: -0,    beforeShowDay: checkDisabled,    changeMonth: true,    changeYear: true,    beforeShow: function(input, inst)    {  inst.dpDiv.css({marginTop: -input.offsetHeight + 'px', marginLeft: input.offsetWidth-210 + 'px'});   }});    });   I also have a function used to compare the dates and return true whenever the start date is lesser than the end date. The function is shown below.     function CompairLeaveDate() {    var BlockStartDate = $('#Start_Date').val(); var ExplodeStartDate=BlockStartDate.split('-'); var dt1   = ExplodeStartDate[0]; var mon1  = ExplodeStartDate[1]; var yr1   = ExplodeStartDate[2];  var totalLength=js_MonthArray.length; var i=0;  var BlockEndDate = $('#End_Date').val(); var ExplodeEndDate=BlockEndDate.split('-'); var dt2   = ExplodeEndDate[0]; var mon2  = ExplodeEndDate[1]; var yr2  = ExplodeEndDate[2]; var y=document.getElementById("End_Date");  if(dt2 < dt1) {       document.getElementById('End_Date').focus();     y.style.border = '1px solid #ff6000';     document.getElementById("div_End_DateError").innerHTML=getErrorMsg(1100986);     document.getElementById("div_End_DateError").style.display = "";     return false; } else {     y.style.border = '';     document.getElementById("div_End_DateError").innerHTML ='';     document.getElementById("div_End_DateError").style.display = "none";         return true; } return true;     }   But i am not getting any output errors .Any help appreciated.


What does ring and cylinder symbol mean?

I'm seeing an odd symbol in a schematic provided in a datasheet for the power management chip ADP5091: a ring that goes through a cylinder. The cylinder is connected to the inductor (SW pin) and the ring is connected to the low side transistor of the boost converter. I've tried googling this symbol but unfortunately I can't find anything. Could someone please help me out with this? Thanks in advance!


Suppose a set of integers $A$ such that $\lvert A \rvert = 501$ and for any $a \in A$, $1 \le a \le 1000$. Show some $a,b \in A,$ $a \vert b$

$A$ is a set of integers and $\lvert A \rvert = 501$.   For any $a \in A$, $1 \le a \le 1000$.  Prove that there are integers $a,b \in A$, such that $a \vert b$. (a divides b)  The question doesn't specify it, but I assume that $a \neq  b$.  (Hint: Note that every integer $x$ can be uniquely presented as $x = y · 2 ^k$ where $k > 0$ and $y$ is odd. Consider the function $x \to y$)  Can I get some help?


$sql = "UPDATE users SET ? = ? WHERE user_id = ?"; $stmt = $db->prepare($sql); $stmt->bind_param("ssi", $obj->{'property'}, $obj->{'value'}, $id);   It says "Fatal error:  Call to a member function bind_param() on boolean"  $obj->{'property'} and $obj->{'value'} are strings. $id is int.  What I am doing wrong?


A question about the proof of "a symmetric matrix has real eigenvalues".

This question is in reference to  proof of the Spectral Theorem.   Let $A$ be a symmetric matrix. Take $u$ to be an orthonormal vector (such that $u^Tu=1$). Then if $u$ is an eigenvector of $A$, then $Au=\lambda u$. This implies that $\lambda=u^TAu$.   The article says that this proves that $\lambda$ is real. I don't follow why this is. Both $u$ and $A$ can contain complex entries! Why would $u^TAu$ have to be real?


Why not just hold a stock position during trading and wait for profit?

I've been reading about algorithmic trading, which involves using complicated mathematical and statistical models to profit from market inefficiencies. Usually the gains from each trade are small, but when added together, they can generate huge returns. But why don't these trading firms simply buy a good stock, and hold the position until they make a profit? (1) Pick a stock with good long-term fundamentals and strong short-term momentum. (2) Set the price target at 1% higher than the current price (1% is pretty easy to achieve, because of short-term price fluctuation and the fact that the stock has upwards momentum). (3) Buy the stock, and wait until the price hits the target. (4) Sell the stock, rinse and repeat. While gaining 1% per trade may not seem to be much, but when added together, they can generate huge profits. So why don't trading firms simply do this? It seems to be a much more easier strategy than using complicated algorithms to look for small arbitrage opportunities or whatever. EDIT: Someone asked a similar question on Quora, but the answers are not what I am looking for......


How does Anivia's passive interact with unique item passives, item activations, and summoner spells?

Does Anivia still retain unique item effects while in egg form, such as Thornmail? Can she activate items like Deathfire Grasp? What summoner spells can she use, if she can use any at all?


Is it possible to put some text on Windows 8 desktop without adding text on background image? Can I write something to text file and then ask windows to show it's content on desktop? How to do this?


We just started playing D&D we are huge noobs and have problems with the wizard. I'm a level 2 Wizard with 3 level 1 Spellslots. Now the rulebook says:      You prepare the list of wizard spells that are available for you to   cast. To do so, choose a number of wizard spells from your spellbook   equal to your Intelligence modifier + your wizard level (minimum of   one spell).   Does that mean I can prepare for example Magic Missile 5 times? So I can cast it 5 times before the next rest? Or can I only cast it 3 times because I have only 3 level 1 spell slots??


Is the value of "damage dealt/taken" calculated after resistances?

The basic rules say about :     Resistance and then vulnerability are applied after all other modifiers to damage. For example, a creature has resistance to bludgeoning damage and is hit by an attack that deals 25 bludgeoning damage. The creature is also within a magical aura that reduces all damage by 5. The 25 damage is first reduced by 5 and then halved, so the creature takes 10 damage.   The attack deals 25 damage, but the creature took 10 damage. Can I consider that the attack then dealt only 10 damage?   This came up with my Wizard, who has :     On a hit, the target takes 3d6 necrotic damage, and you regain hit points equal to half the amount of necrotic damage dealt.   and  (XGtE, p. 160):     You take 4d8 necrotic damage, and one creature of your choice that you can see within range regains a number of hit points equal to twice the necrotic damage you take.   We wonder what happens when the target has resistance or immunity to Necrotic damage. Is the HP gain calculated after the damage is resisted?  Related questions:


I broke apt while trying to upgrade from 19.04 to 20.04

O.S: Ubuntu 19.04 (disco) Running sudo do-release-upgrade i got the following message:  Checking for a new Ubuntu release Your Ubuntu release is not supported anymore. For upgrade information, please visit:  Please install all available updates for your release before upgrading.  Doing an apt upgrade i got this one:  The following packages have been kept back: libsnmp30  That package couldn't be updated because it required libsensors5 but existing packages were using libsensors4. So i ran multiple commands from internet that manually installed libsensors5 and removed libsensors4. Now i'm stuck on this error: You might want to run 'apt --fix-broken install' to correct these.  The following packages have unmet dependencies:   libgl1-mesa-dri : Depends: libsensors4 (>= 1:3.0.0) but it is not installable   libsnmp30 :  Depends: libsensors4 (>= 1:3.0.0) but it is not installable  E: Unmet dependencies.  Try 'apt --fix-broken install' with no packages (or specify a solution).  I've tried doing apt install libsensors4 but it doesn't let me as now i have v5. How can i fix this mess so i can finally upgrade?


Bevel modifier not working on SVG converted to mesh

I'm running Blender Version 2.83.0 (2.83.0 2020-06-03) on mac 10.15.5. I've been tinkering with modeling items and I can't make mesh modifier operations work for me.  I draw a path in Adobe Illustrator It looks like like the outline of seahorse. Export to SVG. Go blender. Import SVG convert to mesh extrude Boolean two cylinders  The last item want to do is break the edge with a bevel. It won't bevel. I've also tried to use the geometry tab to extrude the SVG curve and bevel it there before converting to mesh. However then it won't let me boolean the cylinders out. Any direction would be appreciated.


Different proofs of $\lim_{x\to \infty}\left(1+ \frac{1}{n}\right)^n =e$

I recently was teaching my friend about the number $e$. I introduced him the number by using the compound interest thing . Then I wrote down the general result -$$\lim_{x\to  \infty}\left(1+ \frac{1}{n}\right)^n =e$$ The he told me that yes it works for  $n=10,100,200,1000$. Beyond that his computer couldn't check . So he asked me for a formal mathematical proof of it . I thought of one but then that proof had natural logarithms - meaning they involved the number $e$ .I want to know the different ways through which this results can be proved , but without any use of $e$.


How to Insert Select statments in Case clause in SQL

SQL knowledge Beginner  I have a below table: ScoreTable  Name  Score  Reason  Subject  a1      0     NULL     NULL a2      -1    NULL     NULL a3      -3    fail     Maths a4      -3    fail     History a3       0    NULL     NULL   I want to write a query which will look some thing like below  Select DISTINCT Name, Result,     (If Result = -3        then Concat(Reason,' ',Subject))As FailedIn)   From ScoreTable  Expected Output:  Name  Score  FailedIn  a1      0     0 a2      -1    0 a3      -3    fail Maths a4      -3    fail History


Can you use SVG as Schema.org logo image filetype?

I couldn't find anything regarding what file types are acceptable for things like 's schema.org rendering of a logo in search results.   Since I've not yet implemented a site utilizing the schema stuff I'm wondering if a .SVG file can be used to retain resolution? All I've seen people use are .PNG and .JPG


Call generic extension method with a dynamic type

I'm trying to execute an extension method that returns and object of type T, but I'm trying to have type T dynamic based on a Header/Detail dynamic generic type.  This maybe a bit verbose...  using System; using System.Collections.Generic;  namespace Blah {     public interface IHeader     {         string Name { get; set; }         IDetail Detail { get; set; }     }      public interface IDetail     {         //Nothing the 'Real' implementation of this          //interface will have it's own properties.     }      public class GenericHeader : IHeader     {         public string Name { get; set; }         public IDetail Detail { get; set; }     }      public class RealHeader : GenericHeader     {         public new RealDetail Detail         {             get { return (RealDetail) base.Detail; }             set { base.Detail = value; }         }     }      public class RealDetail : IDetail     {         public string ThisImportantOnlyToRealDetail { get; set; }     }      public static class ExtensionHelpers     {         public static T ToObject<T>(this IDictionary<string, string> reader) where T : new()         {             //This maps the dictionary to Key Value Pairs of the Object's properties             //it then will return a object filled with the values             return new T();         }     }      public class MyRepo<THeader> where THeader : class, IHeader, new()     {         public THeader GetById(int ID)         {             THeader returnHeader = new THeader();             //Process to fill Header              var dictDetail = new Dictionary<string, string>();             //Process to fill Detail Dictionary              //Use extension method to create an Object              //based on Key Value Pairs from Dictionary             // !!!!!!!!!!!!!!!! This Is The Problem !!!!!!!!!!!!!!!!             // Can't use typeof for returnHeader.Detail, reflection?             returnHeader.Detail = dictDetail.ToObject<typeof(returnHeader.Detail)>();              return returnHeader;         }     }      public class Worker     {         public void DoWork()         {             var myRealRepo = new MyRepo<RealHeader>();             var myRealHeader = myRealRepo.GetById(123);              Console.WriteLine(myRealHeader.Detail.ThisImportantOnlyToRealDetail);         }     } }


I ran composer global require drush/drush:dev-master. I'm not sure how to  resolvirthis issue as it seems that the package isn't found anymore. Do I have to update somehow?  Your requirements could not be resolved to an installable set of packages.    Problem 1     - Installation request for drush/drush dev-master -> satisfiable by drush/drush[dev-master].     - drush/drush dev-master requires codegyre/robo ~1.0.0-beta1 -> satisfiable by codegyre/robo[1.0.0-beta1] but these conflict with your requirements or minimum-stability.  Installation failed, deleting ./composer.json.


What are the names of everyone in the four houses in Harry's year?

I'm currently making a mind map of the Harry Potter universe, but when I got to filling in the houses of Hogwarts, I realised that I barely know any names.  What are the names of everyone from Harry's year?


Should site-specific Twitter feeds be tweeting meta questions?

Like the title says: Should site-specific feeds be tweeting meta questions?  I say no. It doesn't serve much of a purpose, to be honest.   The twitterbot tends to tweet crap in general, but lets assume that it didn't for a second. It would be more worthwhile to tweet something sysadmin related from the main site than a request to blackhole a tag from meta.  If you feel that there is value to having meta posts tweeted, then I think there should be separate twitterbots/accounts for mains and metas.


$\sqrt{c+\sqrt{c+\sqrt{c+\cdots}}}$, or the limit of the sequence $x_{n+1} = \sqrt{c+x_n}$

(Fitzpatrick Advanced Calculus 2e, Sec. 2.4 #12)  For $c \gt 0$, consider the quadratic equation $x^2 - x - c = 0, x > 0$.  Define the sequence $\{x_n\}$ recursively by fixing $|x_1| \lt c$ and then, if $n$ is an index for which $x_n$ has been defined, defining  $$x_{n+1} = \sqrt{c+x_n}$$  Prove that the sequence $\{x_n\}$ converges monotonically to the solution of the above equation.  Note: The answers below might assume $x_1 \gt 0$, but they still work, as we have $x_3 \gt 0$.    This is being repurposed in an effort to cut down on duplicates, see here: .  and here: .


How soon can I reapply for another Schengen visa after using a granted visa to the Netherlands?

I am going to apply for a multiple-entry visa to Netherlands this coming May. If I will be given only a single entry how soon can I apply again for another Schengen visa because I am planning to go to Paris in July too?


How can I make my mouse auto-click every 5 seconds?

I want to click on something for hours. How can I make a script or use an application so the mouse will auto-click every 5 seconds or less?


How to use a path with spaces in the batch file?

I have a simple Win 10 batch script to open a bunch of folders within Explorer at system startup, however there's a problem with the last command's path containing whitespaces, as instead of opening a new Explorer window as expected, it opens a CMD window with the path as a system command: @ECHO OFF start C:\Users\Darek\Fallout2 start C:\Users\Darek\Fallout2\data\scripts start C:\Users\Darek\Pobrane_2 start "C:\Program Files (x86)\Microsoft Visual Studio\2019\Community\VC"  How do I write the last command so it works correctly?


How to print all printable ASCII chars in CLI?

How can I list all the printable ASCII characters in the terminal?


How to hide light object keeping the brightness alive?

How can i hide the plane keeping the brightness? OK i added a plane as emission light source, i dont want the plane to come in my scene, when i hide the plane brightness also disappears.


Construct a compact set with countably infinite limit points using $1/n + 1/m$ (Rudin, Cooke)

So I am having trouble proving that if  $$ K= \{0\} \cup \left\{\frac1n: n = 1,2,\ldots\right\} \cup \left\{\frac1n + \frac1m : n=m,m+1,\ldots; m=1,2,\ldots \right\} $$  then 0 and the points $\frac1m$ are the only limit points of $K$. Cooke proves this by saying that:  Since $x\geq0$ for all $x \in K$ and for any positive number $\epsilon$ there is only a finite set of number s in $K$ larger than $1+\epsilon$, it is clear that no negative number and no number larger than 1 can be a limit point of K. Hence we need only consider positive numbers $x$ satisfying $0\lt x \lt 1 $. If $x$ is such a number and $x$ is not one of the points $\frac1m$, let $p$ be such that $\frac1{1+p} \lt x \lt \frac1\epsilon$, and let $\epsilon=\frac12\min(x-\frac1{p+1},\frac1p - x)$.  The intersection of the set $K$ with the interval $(x-\epsilon,x+\epsilon)$ is contained in the set of points  $$ \left\{\frac1{p+1}+\frac1k:p+1\le k \lt \frac1\epsilon\right\} \cup \left\{\frac1m+\frac1n:m\le n \lt \frac1{p+1} - \frac1{p+2}; m=p+2, \ldots,2p+2\right\}, $$  which is a finite set. Therefore $x$ cannot be a limit point of $K$.  I understand why you take $\epsilon$ to be half of $\min$, and the using that every neighborhood around a limit point contains infinitely many points, but I don't understand why the intersection of $K$ with the interval $(x-\epsilon,x+\epsilon)$ is contained in the set mentioned above, and why it is finite. Is it a typo? $$ \left\{\frac1m+\frac1n:m\le n \lt \frac1{p+1} - \frac1{p+2}; m=p+2, \ldots,2p+2\right\}, $$  here I think n is meant to be an integer in order for the finite argument to work, but how can be  $$ n \lt \frac1{p+1} - \frac1{p+2}\:\:? $$ Here is how I fixed the typo to work: if  $$ \left\{\frac1m+\frac1n:m\le n \lt \frac1{p+1} - \frac1{p+2}; m=p+2, \ldots,2p+2\right\} $$  is changed to  $$ \left\{\frac1m+\frac1n: m\le n, \frac1n \ge \frac1{p+1} - \frac1{p+2}; m=p+2, \ldots,2p+2, n \in N\right\}, $$  then $m\le n \le (p+1)(p+2)$ which would be finite. Am  I understanding this argument correctly? I think there is a typo or error in Cooke's solution, as the original version can't seem to work.  I know there are other constructions that can be understood easily, but I would like to understand Cooke's proof of $\frac1n + \frac1m$ and see if there are are any typos or errors in the original solution. Thanks a lot.


Find all pairs of $a$ and $b$ such that $ab = a+b$

Problem  Find all pairs of $a$ and $b$ such that $ab = a+b, \: \: a,b \in \mathbb{Z}$ is true.  If I divide both sides by $ab$ I get $$1 = \frac{1}{b}+\frac{1}{a} $$ From this equation I can only find one pair that makes this equation true, and that is $a=b=2$. Is this really the only pair of integers? And is this enough of a "proof" or do I need something more, whatever that may be?


I keep seeing written usage of which in cases where the writer clearly intends it to be restrictive. For example:   "" "" (And other occurrences on the same page and in the same blog.)   I have been counting these as errors because it is my understanding that that is restrictive, and which is not.  Do I have this right?


Searching subversion history (full text)

Is there a way to perform a full text search of a subversion repository, including all the history?  For example, I've written a feature that I used somewhere, but then it wasn't needed, so I svn rm'd the files, but now I need to find it again to use it for something else. The svn log probably says something like "removed unused stuff", and there's loads of checkins like that.  Edit 2016-04-15: Please note that what is asked here by the term "full text search", is to search the actual diffs of the commit history, and not filenames and/or commit messages. I'm pointing this out because the author's phrasing above does not reflect that very well - since in his example he might as well be only looking for a filename and/or commit message. Hence a lot of the svn log answers and comments.


I am a 16 year old boy from Austria which want`s to start developing apps for ubuntu (mobile). Are there some links for a newbie like me? ^^   Sorry if I am new. Just wanna try to develop and take a deeper look into Ubuntu.  Cheers Elias


"I will call you back" instead of "I will call back you" Why?

Why "I will call you back" instead of "I will call back you"? Here "call back" is a phrasal verb, and "back" is a particle. Then why are we separating the particle?  Is there any rule for it?


How can I check if a given force (in vector form) is conservative or not?

How can I check if a given force is conservative or not? Is there a mathematical way of doing the same?


How to remove snap completely without losing the Chromium browser?

I am wondering whether or not there is a way to completely remove snap from Ubuntu 19.10 without losing the ability to install important applications like Chromium.   When I just recently updated to the newest Ubuntu release I realized that the installer programmatically reinstalled snap, although I had manually removed it before. Additionally the installer removed Chromium, which was installed via the repositories, and reinstalled it via snap.   As I don't want snap to be installed on my machines for various reasons my question is if anybody knows a safe way to remove it, and to get the Chromium DEB back to the sources?  Is there a PPA? Could I use a source of an Ubuntu flavor additionally, which didn't remove the Chromium Deb from its sources?


How to fix Fresh Ubuntu minimal server missing locale?

I just ordered plain Ubuntu 14.04.2 LTS min on vServer VX11 from Hetzner.de and after apt-get update I get this error  Fetched 65.6 MB in 3s (20.1 MB/s)       perl: warning: Setting locale failed. perl: warning: Please check that your locale settings:     LANGUAGE = "en_US:en",     LC_ALL = (unset),     LC_TIME = "et_EE.UTF-8",     LC_MONETARY = "et_EE.UTF-8",     LC_ADDRESS = "et_EE.UTF-8",     LC_TELEPHONE = "et_EE.UTF-8",     LC_NAME = "et_EE.UTF-8",     LC_MEASUREMENT = "et_EE.UTF-8",     LC_IDENTIFICATION = "et_EE.UTF-8",     LC_NUMERIC = "et_EE.UTF-8",     LC_PAPER = "et_EE.UTF-8",     LANG = "en_US.UTF-8"     are supported and installed on your system. perl: warning: Falling back to the standard locale ("C"). locale: Cannot set LC_ALL to default locale: No such file or directory Preconfiguring packages ...   This locale error happens with many commands. How to remove this error?


Using the definite article with comparatives and superlatives, for example "the sooner the better"

I would like to know the meaning of structures concerning the definite article "the"-"the"+comparative or superlative adjective(adverb) structures- to be more specific, these ones: the more...the better; the most... the best.   Examples:   the more...the better: the sooner the better. the most...the best:  We like this book the best.   If you can provide some information of this structure I would be grateful.


Solve $(a + b\sin(x))\sin(x) = p$ for $x$

This problem has baffled me. I have tried using $t = \tan(x/2)$ identities but end up with a 4 th order polynomial I cant solve.


Why does this expression evaluate true?  SimpleRoundTo(93.599, -2) > 93.6   When I use the SimpleRoundTo like this  ShowMessage(FloatToStr(SimpleRoundTo(93.599, -2)));   it shows 93.6.


In my Lm 393 comparator, my output is not coming proper square wave.picture is shown below. I have described about my circuit. I am using voltage comparator LM393 for comparing two signals, one signal is my reference signal which is a triangle wave, with voltages 2.08 volt generated by 555 timers above 200kHZ giving to the input terminal of inverting side of LM393 and input signal or modulating signal which voltage is less than 2.08 giving from function generator as a sinusoidal signal in the range of 1 Hz to 20kHz in the noninverting side of LM393. My question is when I am providing two signals it should be compared and give a square wave, but LM393 only taking triangle wave, sin wave is not going? In this picture below, I am referring to this circuit, please tell me what 's wrong in this circuit, when I am taking triangle wave from 555 timer ad providing into the comparator and another signal providing from the generator.


I'm working with 64 bits floating point arithmetic as defined by IEEE 754. The smallest subnormal number is: 2^-1074 = 5e-324 = 5 * 10^-16 * 10^-308     Adding the latter to realmin results in: 2^-1022 + 2^-1074 = 2.2250738585072014 * 10^-308 + 5 * 10^-16 * 10^-308 = (2.2250738585072014 + 0.0000000000000005) * 10^-308 = 2.2250738585072019 * 10^-308     When performing the addition in Python the result is slightly different. Here's the simple script:  import numpy as np  realmin = np.power(2.0, -1022) print( "realmin\t\t" + str(realmin) )  smallestSub = np.power(2.0, -1074) print( "smallest sub\t" + str(smallestSub) )  realminSucc = realmin + smallestSub print( "sum\t\t" + str(realminSucc) )   The output is:  realmin         2.2250738585072014e-308 smallest sub    5e-324 sum             2.225073858507202e-308   Why does it rounds the sum? There's space for one extra digit as shown by realmin output.


What's the downtime limit of a domain controller (DC)?

On my VMware  environment there are 10 VMs running. One of the VMs is the domain controller (). The other VMs are configured with a static DHCP and DNS IP address in their network settings.  How long is the downtime limit of my domain controller?


My application is "authorisation pending" after 7 days.  What can I do?  I visited Kurdistan on UK government business and declared it honestly.


Set up the depth of the subsection enumeration also in the Table of Contents

In order to set the level until which (sub)sections are numbered, a user can set up the counter secnumdepth. \setcounter{secnumdepth}{whatever}  The trick works completely fine. However, if you try to increase the depth of the enumeration (for example up to 4), the change is not reflected in the Table of Contents at the beginning of the document. Specifically, it continues to show just the old depth of Chapter-Section-Subsection. No subsubsections appear How to add the numeration automatically in the Table of Contents?


Kernel panic trying to boot 4.4.0-146-generic after apt upgrade on 16.04.6

I can't boot the 4.4.0-146-generic kernel because of a kernel panic. I'm running 16.04.6 on an Intel Core i7-7500U CPU @ 2.70GHz × 4. See image below:


mkdir: cannot create directory: No such file or directory

What's wrong with the commands below?  $ var1="~/Music/$(date +%d%m%y)" $ echo "$var1" ~/Music/240118 $ mkdir "$var1" mkdir: cannot create directory ‘~/Music/240118’: No such file or directory   However  $ mkdir ~/Music/240118   works.  Never thought I would ask such questions after years of using bash...


I have an innocent question.  What is time?  Can travelling near the speed of light make a person younger relative to others who don't? Then, is there any impact on the body (atoms, molecules etc) of the person who travels at almost light speed? If so, what is the nature of that effect?


Feature Request: ability to not load the deleted answers after hitting 10k

I find viewing everyone else's deleted answers kind of distracting, and sometimes it's hard to not pass judgement when viewing some of them. Any chance of getting an option to be able to just not load them?


Let $G$ be a group and suppose $G/Z(G)$ is cyclic. Prove that G is abelian. where $Z(G)$ is the center of the group. That is,   $$ G(Z) = \{a \in G \ | \ \forall x \in G: ax = xa\} $$  Any ideas?  So far what I have. Consider two arbitrary elements $a,b \in G$, and consider their left cosets $aG(Z)$ and $bG(Z)$. Suppose that $G/Z(G)$ is generated by $yZ(G)$, then $aG(Z) = (yZ(G))^n = y^nZ(G)$ for some $n$ and $bG(Z) = (yZ(G))^m = y^mZ(G)$ for some $m$. Hence $abZ(G) = aZ(G) \cdot bZ(G) = y^nZ(G) \cdot y^m Z(G) = y^ny^mZ(G) = y^{n+m}Z(G) = y^{m+n}Z(G) = y^my^nZ(G) = y^mZ(G) \cdot y^n Z(G) = bZ(G) \cdot aZ(G) = baZ(G)$.  So $abG(Z) = baG(Z)$.  Now consider $e = b^{-1}b$. Clearly $e \in Z(G)$. So we have  $ab = ab(b^{-1}b) = bax$ for some $x \in Z(G)$.   But how to proceed from here? And this the idea so far correct?


C++ Template class definition and declaration seperation

c++.why can't you separate the definition of your templates class from their declaration and put them inside a .cpp file? is there a workaround to allow the separation. And could anybody give my a source where I could also get more information with examples. Thanks


Recommended Tutorial Videos or Books on Feature Engineering Using Python

I will appreciate it if you guys can recommend for me a good hands-on tutorial videos or books on feature engineering using Python. I do not want videos or books that teach only the theory behind feature engineering but one that will show me some codes and how to do it. Thanks.


How do the combinations of http/https and naked/www in Google Search Console work?

When I added my site to  (previously Google Webmaster Tools?) it asked me to add combinations of my site, with http and https and no www and with www, so now I have four. I had to verify that I owned each one. My webserver redirects everything to the https + www version anyway.   http://example.com http://www.example.com https://example.com https://www.example.com   Now that I have four, which one do I click on to use and view stats for etc? For example, I can add a sitemap but do I do this four times or just to one of them? I can link one with Google Analytics, but again which one? Some of them are reporting stats and some aren't. It seems that the http://www.example.com version is the one getting indexed correctly even though I'm using https. It all seems like a huge mess. Can someone explain it please?  A lot has already been discussed here: . But it doesn't seem to clear up my question.


am new to salesforce need clarification on apex triggers

Am new to salesforce have clarification on apex trigger.Can we use trigger.new & trigger.old in both before & after triggers.Please explain.  Thanks, Karthik


$k^{2}+(k+1)^{2}$ being a perfect square for infinitely many $k$

Generally one can see that there are infinite number of solutions for this equation $$a^{2}+b^{2}=c^{2}$$ by taking multiples of the solution $3,4$ and $5$.   Can i use this as a fact to prove, that $k^{2} + (k+1)^{2}$ is a perfect square for infinitely many $k \in \mathbb{N}$? Any hints, suggestions would be helpful. If not, then how do i prove this fact!


How do i convert , p.ex, the string "C3" to it's char using javascript? i've tried charCodeAt, toString(16) and everything, doesn't work.  var justtesting= "C3"; //there's an input here var tohexformat= '\x' + justtesting; //gives wrong hex number  var finalstring= tohexformat.toString(16);    Thank you


If a group S has at least 7 elements of order 7, prove that S has at least 12 elements of order 7.

I think this involve's using LaGrange's Theorem, but I can't understand it. Initially, I thought each power of a 1 through n-1=6 will have an inverse of order 7, giving 12 with the 0-th power leftover. Any explanation appreciated! There's a similar thread to this, but can't make heads or tails of it.


If $Y$ is Poisson$(\lambda)$ distributed, how do we obtain this confidence interval for $\lambda$:  $$ \left (\frac{(\sqrt Y+\sqrt{Y + 1}-z_{(α⁄2)} )^2 - 1}{4},\  \frac{(\sqrt Y+\sqrt{Y  +1}+z_{(α⁄2)} )^2 - 1}{4} \right ) $$


Let $S$ be an integral extension ring of $R$. Then $S[x_1,\ldots, x_n]$ is an integral extension ring of $R[x_1,\ldots, x_n]$.

Let $S$ be an integral extension ring of $R$. Then $S[x_1,\ldots, x_n]$ is an integral extension ring of $R[x_1,\ldots, x_n]$?   My idea is to prove when $S[x_1]$ is an integral extension ring of $R[x_1]$ and then extends to case when $S[x_1, \dots, x_n]$ and $R[x_1, \dots, x_n]$.   To prove for all $S[x_1]$ is an integral extension of $R[x_1]$, it is sufficient to check $x_1$ is a root of some monic polynomial $f(x)\in R[x_1][x]$. However since $x_1=1\cdot x$ there exists a monic function $g(x)\in R[x]$ such that $g(1)=0$. And I don't know how to extend $g$ to $f$.


Which is correct: "To believe this is committing a fallacy" or "To believe this is to commit a fallacy"?  Context: "When a conditional expression and its consequent are both true, one cannot automatically infer its antecedent. To believe the contrary is  committing/to commit a fallacy known as affirming the consequent".  Edit: I changed "incurring/to incur" to "committing/to commit", but I'm still hearing proposals...


PPTP VPN on Ubuntu Server 12.10 fails to connect, with error: no ifupdown configuration found

I am trying to setup a PPTP VPN server on Ubuntu Server 12.10. I had a few errors and by observing the logs, I managed to solve them.  Now, I get this error, and it seems I am not able to find a solution to it.  Here is the out put of tail -n 30 /var/log/syslog | grep -i ppp:  Jan  7 22:55:17 MyServer pptpd[32719]: CTRL: Starting call (launching pppd, opening GRE) Jan  7 22:55:17 MyServer pptpd[32720]: CTRL (PPPD Launcher): program binary = /usr/sbin/pppd Jan  7 22:55:17 MyServer pptpd[32720]: CTRL (PPPD Launcher): local address = 192.168.0.1 Jan  7 22:55:17 MyServer pptpd[32720]: CTRL (PPPD Launcher): remote address = 192.168.0.234 Jan  7 22:55:17 MyServer pppd[32720]: Plugin /usr/lib/pptpd/pptpd-logwtmp.so loaded. Jan  7 22:55:17 MyServer pppd[32720]: pppd 2.4.5 started by root, uid 0 Jan  7 22:55:17 MyServer pppd[32720]: Using interface ppp0 Jan  7 22:55:17 MyServer pppd[32720]: Connect: ppp0 <--> /dev/pts/3 Jan  7 22:55:17 MyServer NetworkManager[1122]:    SCPlugin-Ifupdown: devices added (path: /sys/devices/virtual/net/ppp0, iface: ppp0) Jan  7 22:55:17 MyServer NetworkManager[1122]:    SCPlugin-Ifupdown: device added (path: /sys/devices/virtual/net/ppp0, iface: ppp0): no ifupdown configuration found. Jan  7 22:55:46 MyServer pptpd[32719]: CTRL: Reaping child PPP[32720] Jan  7 22:55:46 MyServer pppd[32720]: Hangup (SIGHUP) Jan  7 22:55:46 MyServer pppd[32720]: Modem hangup Jan  7 22:55:46 MyServer pppd[32720]: Connection terminated. Jan  7 22:55:46 MyServer NetworkManager[1122]:    SCPlugin-Ifupdown: devices removed (path: /sys/devices/virtual/net/ppp0, iface: ppp0) Jan  7 22:55:46 MyServer pppd[32720]: Exit.   Can anyone help me with this?  Edit As I said my server is Ubuntu Server 12.10. Client is Kubuntu 12.10. I have successfully set up a PPTP VPN server on CentOS 6, but I failed to do so on Ubuntu.


Shell - Customize the color of each line of a log file based on a pattern

I would like to change the way I display a big (~6000 lines) log file using wim, less or whatever, in order to simplify the problem checking.   I'd like to highlight some line of the log based on a patter (i.e. error, warning, info...) and/or hide some others.   Which tools could I use? Do I just need a shell script? It's important that after the process, I can read the output using less, vim, ... to perform search operations!  Edit:  a little piece of the log:  2016/10/25 12:19:24.403355 INFO <ServiceManager.cpp#2614 TID#3> Security object has NOT been parsed 2016/10/25 12:19:24.403369 INFO <ServiceManager.cpp#1263 TID#3> Service object sequence started 2016/10/25 12:19:24.403372 DBG <ServiceManager.cpp#1276 TID#3> preinvoke succeeded


Request for clarification on a flag decline

Just wondering if someone could clarify the reason as to why my flag was declined for an answer on  (I have added the link to the answer which has been deleted but anyone with moderator permissions on SO should be able to see the it).    I suspect that someone may have flagged the answer as spam in addition to my 'not an answer' flag as the answer was just randomly formatted text with a random comment from the person who submitted the answer under it also.  Is this the case (in which case the comment is misleading) or was there an error on my part here? :S


How to online resize the root partition? (ext4)

i've got a 1tb harddisk with 3 partitons:   fat32 /boot/efi ext4 / linux-swap   My ext4 partition has 700 GiB free so i would like to use some of that space (like 200 gib) for a Windows 8 partition.  How can i free some space if the partition is in use?  Thanks for all answers


Polymorphism vs Overriding vs Overloading

In terms of Java, when someone asks:      what is polymorphism?   Would overloading or overriding be an acceptable answer?  I think there is a bit more to it than that.   IF you had a abstract base class that defined a method with no implementation, and you defined that method in the sub class, is that still overridding?  I think overloading is not the right answer for sure.


SpringBoot JPA throws exception while making post request

Im making a small application where i can save user details using spring-boot. i created the entities and their corresponding repositories. When ever i make a post request to add a user the id of the user object which is null at the point of saving to the data base.This id is auto generated(Auto Increment) in MySQL. From the POST request i get 3 fields which are username,email,password. The User class contains fields id,username,email,password. I've added the annotations       @Id  @GeneratedValue(strategy = GenerationType.AUTO) @Column(name = "id") private Integer id;   for the id field. an the constructors are  public User() { }  public User(String username, String email, String password) {     this.username = username;     this.email = email;     this.password = password; }   This is the error im getting.   The debugging process   my  userService class      @Service     public class UserService implements UserServiceInterface {          @Autowired(required = true)         private UserRepository userrepository;          @Override         public User CreateNewUser(User user) {             return userrepository.save(user);         } }   my userController class       @RestController     public class UserController {          UserService us = new UserService();          @RequestMapping(value ="/user",method = RequestMethod.POST)         public void RegisterUser(                            @RequestParam(value="username") String username,                 @RequestParam(value="email") String email,                 @RequestParam(value="password") String password){             us.CreateNewUser(new User(username,email,password));         } }   Any reason why i cant POST to save data to database? how to overcome this?


Confirm email before registration - Wordpress

Dear Wordpress Experts,  I have been looking for a solution to tackle an easy sing up problem. I am impressed with Wrike.com sign up system, where they ask you only email ID at the first stage.  Here is how I am expecting wordpress sign up process to work:   Just input the email and click signup Confirmation email is sent to user to confirm email Once they click the confirm link, they will be taken to a Thank you page with additional details to fill At this step, I want to finish collecting rest of the details.   I have installed and tested all popular registration plugins and tried all the QA listed here. But no one talks about this method of registration (email alone)  Is this possible with Wordpress or do you think any unpopular plugin can do the job?  Your help is much appreciated.


I DM a group of four PC's and even "easy" battles take at least an hour to resolve. Normal encounters take even longer! I want to speed up combat so my players can do more in a session.  I've been trying a lot to speed up combat, we are already using:   Initiative cards that the players keep up 30 second bonus rule: if someone take his turn within 30 seconds, he receives a token. This token can be used to give a +1 on attack or damage, after rolling. Completely removed healing surges Checked all character sheets, they are roughly equal Roll damage and attack at the same time   I even introduced an experienced player, which helped my party to play more strategic, but speed hasn't improved.  Also the party is Lv 8, nearing Lv 9.  This is not an issue of the DM's turn taking too long. My turns take about 60 seconds tops. The 30 second rule helps a lot, most of the the players turns are within or near 30 seconds.   The major issue appears to be the sheer number of rounds, averaging on 25-30 rounds needed to resolve even a "normal" encounter.  What can I change to resolve combat faster?  I'm looking for both 4e solutions, system agnostic and home brew solutions.


Etiquette for asking loved one to share life story before death

This might be a bit of an odd question, but I figured that at least one or more persons here have been in the situation that I am now.   My question is as follows:     What is the (if any) 'proper etiquette' for telling a   loved one that you wish to record them as they tell their life story,   before they die and all familial information is gone?   I am struggling with how to word it without it coming out so bluntly or being seen as a rude and/or crude question to ask. Obviously, from the standpoint of a genealogist and someone in general that loves and wants to remember their family members, recording someone would seem to be common sense. However, bringing up the subject of death or phrasing your question so that it doesn't come out as, "I know you're going to die soon, so can I record you?", can be quite the task (with respect to each personality type).


When replacing the rear brake pads I noticed that 4 spokes were broken and the wheel wobbles.  I phoned a local bike shop and was told that they recommend replacing the wheel if more than 3 spokes are broken.  I assume that this is a safety precaution but wonder if the recommendation is in line with common practice.  I certainly have no desire to get thrown off the bike in traffic, but it also seems a waste to (probably) discard an entire wheel because it might be damaged and might fail at some point.  This is a 27" road bike, inexpensive, which I ride for transportation in the city (Tokyo).  The rear rim is a bit scored from waiting too long to replace the brake pad, which is another factor to consider.  To clarify slightly, it probably would be cheaper to replace the wheel as suggested below.  My objection is more of an ethical one -- tossing something useful into a hole in the ground seems irresponsible.  Difficult to avoid though, the way things work right now.


Iptable forward interfaces for gateway machine

I have two Ethernet interface being configured to use as system gateway ex:    eth1: 10.10.1.0 eth2: 10.10.2.0   I want to forward all the packets which are coming to the 10.10.2.0 gateway contacting 10.10.1.x via eth1 (10.10.1.0), and the reverse as packets coming to 10.10.1.x, contacting 10.10.2.0 machines via eth2.    How can I write iptables rules for this?


Does the Shapechanger trait work in an Antimagic Field?

Certain monsters have the Shapechanger trait. For instance, here it is on the Werewolf:     Shapechanger. The werewolf can use its action to polymorph into a wolf-humanoid hybrid or into a wolf, or back into its true form, which is humanoid. Its Statistics, other than its AC, are the same in each form. Any Equipment it is wearing or carrying isn't transformed. It reverts to its true form if it dies.   I note that nowhere in this description is the word "magical" found.  Contrast this with a metallic dragon's Change Shape feature, which does feature the word "magical".     Change Shape. The dragon magically polymorphs into a humanoid or beast that has a challenge rating no higher than its own, or back into its true form.   In an Antimagic Field, can a Werewolf use its Shapechanger trait?


How to read from stdin in process substitution?

I would like to , however I'm not sure how do I read from standard input within process substitution?  My attempts:  $ echo foo >(cat /dev/stdin) >(cat /dev/stdin) foo /dev/fd/63 /dev/fd/62  $ echo foo >(cat -) >(cat -) foo /dev/fd/63 /dev/fd/62  $ echo foo >(cat <&3) >(cat <&3) 3<&0 foo /dev/fd/63 /dev/fd/62 -bash: 3: Bad file descriptor -bash: 3: Bad file descriptor   Alternative version of the same problem:  $ cat file | tee &>/dev/null >(cmd1 /dev/stdin) >(cmd2 /dev/stdin)   What's the right way of doing this?


Salesforce MC - How to data extract in UTF8 to FTP

I'm having problems trying to export a data extension from Salesforce Marketing Cloud to FTP.  I created an Automation to extract this file, but I want to extract in UTF-8, my database only import files in this format.  So, how can I convert my data extract to UTF-8, instead of UTF-16?  I've tried to add a new Data Extract Activity, using ExtractType: Custom UTF-16 to UTF-8 Encoding. But that it isn't working, occur an error in this activity. I've fund that some guy did a , but I can not find that option in my Salesforce Marketing Cloud Business Unit.


Display Value of a nodes RGB input in a panel

I have a Mix RGB node and want to display the input in a normal panel in the UI. I can show the color widget by using layout.prop(input,"default_value"), but what I want to do is to just show the Value of the input. This would then show a float input instead of the color widget.


I've been given an old Eeepc 1005HA netbook running Windows XP and want to switch to a Linux OS and remove XP completely.   Is this easy/advisable?   What's the best way?  The netbook has no CD drive I read about installing from USB but then the Ubuntu site mentions using the Windows installer (not sure if this is only applicable if you want to add Ubuntu to XP).  Also confused about setting new drive sizes. Device is described as CPU Intel ATOM N280 / 1.66 GHz, RAM 1024 MB.


I have a pi symbol inside a circle on my phone's notification bar. What does this mean?


Practical way to share 15GB of files with distributed users on cable connections

I am working with a company of 7 employees distributed throughout the U.S., each with basic cable internet connections, who need to share about 15 GB of thousands of documents (mostly Word and PDF files). Solutions we have tried include:   Dropbox (too slow to sync; also, folder structures are not synced across all shares) An NFS share hosted on an Amazon EC2 instance (lag is too great in saving documents, especially large Word documents) BitTorrent Sync (SUPER fast, but has serious bugs that have caused data loss)   Is there a practical way to share the documents, given constraints regarding network speed?


An orthogonal matrix in $\mathbb{R}^{3\times3}$ with real eigenvalues is diagonalizable

I know there are two non trivial (i.e. if we solve these two cases the other cases are trivial) cases:  $\lambda_{1,2,3}=1$  and:  $\lambda_1=1,\lambda_{1,2}=-1$  I have been trying to use generalized eigenvectors and the Jordan Canonical and the fact that the JCF of matrix A can be rewritten as:  $\hat{A}=\hat{D}+\hat{N}$  Then I assume that $\hat{N}$ is not the zero matrix, but I don't know how/where to invoke the fact that A is orthogonal to get a contradiction. It feels like I have some of the pieces but not all of them...Any help would be greatly appreciated. This question is specific orthogonal matrices with the aforementioned eigenvalues. It would be helpful if this question was solved using definitoins for generalized eigenvectors and the JCF.


Does simple syrup require refrigeration?

I'm curious about plain simple syrup and simple syrup with other ingredients. For instance, cardamon simply syrup. Do other ingredients make a difference?


Moving all files of a certain type or extension

I have a large external with many subfolders that I want to move all videos, pictures, and music to another hard-drive, what would be the best way to do this?


"Tell me why I should marry you" or "Tell me why should I marry you?". Which is correct?

I have always followed the former rule, i.e, "Tell me why I should marry you" (without a question mark). But my cousin insists the latter is correct. He seems equally confident that he is correct. So can you please answer which is correct? Or are both correct?  Or the following example would illustrate my question better:        Give me reasons why I should marry you.   Give me reasons why should I marry you?      Which of the above is correct?


Is there a difference between "can't you" and "don't you"? As in:     You just can't behave properly, can't you?   vs.     You just can't behave properly, don't you?   I don't understand their difference (if there is).


NullPointException in Fragment with CheckBox

In my aplication i have a fragment were i have any checkbox. When i chek start a TextToSpech. I have created a similar version without fragment and it work fine. But when i implemented it in a fragment it doesn't works. Her is my code:  public class OneFragment extends Fragment implements TextToSpeech.OnInitListener, CompoundButton.OnCheckedChangeListener { private TextToSpeech tts;  ListView listView; ArrayAdapter<Model> adapter; List<Model> list = new ArrayList<Model>();  public OneFragment() { }  @Override public void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);  }  @Override public View onCreateView(LayoutInflater inflater, ViewGroup container,                          Bundle savedInstanceState) {      View returnView = inflater.inflate(R.layout.fragment_one, container, false);     listView = (ListView) returnView.findViewById(R.id.listView);     adapter = new MyAdapter(getActivity(), getModel());     listView.setAdapter(adapter);     final CheckBox chk = (CheckBox)returnView.findViewById(R.id.checkBox);     chk.setOnCheckedChangeListener(OneFragment.this);      return returnView; }  @Override public void setUserVisibleHint(boolean isVisibleToUser) {     super.setUserVisibleHint(isVisibleToUser);     if (isVisibleToUser) {         tts = new TextToSpeech(getActivity(), this);     } }  private List<Model> getModel() {     list.add(new Model("Linux", "S"));     list.add(new Model("Linux", "S"));     list.add(new Model("Linux", "S"));     list.add(new Model("Linux", "S"));     list.add(new Model("Linux", "S"));      return list; }  @Override public void onInit(int status) {     if (status == TextToSpeech.SUCCESS) {          int result = tts.setLanguage(Locale.ITALIAN);          if (result == TextToSpeech.LANG_MISSING_DATA                 || result == TextToSpeech.LANG_NOT_SUPPORTED) {             Log.e("TTS", "This Language is not supported");         } else {              startSpeak();         }      } else {         Log.e("TTS", "Initilization Failed!");     } }  private void startSpeak() {     tts.speak("Ciao", TextToSpeech.QUEUE_FLUSH, null); }  @Override public void onCheckedChanged(CompoundButton buttonView, boolean isChecked) {     CheckBox chk = (CheckBox)getActivity().findViewById(R.id.checkBox);       for (Model i: list ) {         if (chk.isChecked()) {             this.startSpeak();         }     } } }   This is the partial LogCat result:  java.lang.NullPointerException: Attempt to invoke virtual method 'void android.widget.CheckBox.setOnCheckedChangeListener(android.widget.CompoundButton$OnCheckedChangeListener)' on a null object reference   How should i do?


Understanding of the formal and intuitive definition of a limit

The intuitive definition for $\lim\limits_{x \to a} f(x) = L$ is the value of $f ( x )$ can be made arbitrarily close to $L$ by making $x$ sufficiently close,  but not equal to, $a$ . I can easily understand this ,but for the (ε, δ)-definition of limit:For every real ε > 0, there exists a real δ > 0 such that for all real x, 0 < | x − a | < δ implies | f(x) − L | < ε. Oh, god, I cannot understand it completely.  As it is the formal definition of limit, I think it should be precise but somewhat should include the mean of the above intuitive definition, so as for "$f ( x )$ can be made arbitrarily close to $L$" in the intuitive definition correspond to “For every real ε > 0,| f(x) − L | < ε” in the formal definition, it's fine! but does  “making $x$ sufficiently close,  but not equal to, $a$ .” correspond to “there exists a real δ > 0 such that for all real x, 0 < | x − a | < δ” ? This is the point I cannot understand, because I am not sure if  “there exists a real δ > 0 such that for all real x, 0 < | x − a | < δ”  shows "x close enough, but not equal, to $a$".  The other question is: does the biggest δ also get smaller as ε is getting smaller? Why? (Exclude the case when f(x) is a constant function.)  Why do we need the formal definition of a limit? Does the intuitive definition have some flaw?  P.S. Thank you everyone, but I must declare I only have some basic knowledge of limit, I only started to learn calculus a few days ago.


shopt works in command line, not found when run in a script

I'm writing a script to copy some files around, and trying to use shopt -s dotglob  like .jshint and whatnot.    I can run shopt -s dotglob directly at a bash prompt with no error.  However, running the script throws the error:  script.sh: 81: script.sh: shopt: not found   I'm running this script in bash shell, with the shebang header #!/usr/bin/env bash.  Error line:  shopt -s dotglob cp -r $TEMP/img/* $TARGET/img/ cp -r $TEMP/js/* $TARGET/js/ cp -r $TEMP/less/* $TARGET/less/   Not finding anything helpful on google, any idea what the problem is here?


Looking for a classic sci-fi short story about a boy who discovers pods growing in a field

For years, I've been looking for a short story about a boy who discovers alien pods in a field that are growing replacement people. If I remember right, he sees the pod creature eat his mother and then become her, and no one believes him. The story ends with him going in to see his dad, one of the few real people left until that point, and seeing something (an empty pod maybe) that lets him know his dad has been taken and he's next. I'm thinking that the title was something like Father Figure, but I may be remembering wrong.  The story was part of several collections of classic science fiction stories that we had on our bookcase when I was growing up, so I'm guessing that the story could be from the 70's or any time earlier.


Codeblocks Permision denied after update from 12.10 to 13.04

When I try to compile it says  sh: 1: /media/user/Linux/test/bin/Debug/test: Permission denied   I did not have this problem with Ubuntu 12.10   I have just started to use Ubuntu so....


The largest positive integer which cannot be written in the form $5m + 3n$ where $m$ and $n$ are positive integers is?

I came across this question and I was able to solve this question with the help of the options provided in the question and the answer turned out to be $15$. But it intrigued me to find a general statement for the solutions for these kind of problems. How can we approach a general problem like "The largest positive integer which cannot be written in the form $Am + Bn$ where $m$ and $n$ are positive integers and $A$ and $B$ are positive integers too is?" Is there a general solution statement for this problem. I looked up on the web and stumbled upon this statement from Frobenius:  Suppose that  $gcd(a,b)=1$ . Then the largest integer  $k$  for which $am+bn=k$  has no non-negative integer solution  $(m,n)$  occurs when $k=ab−a−b$ .  The problem is when I apply this statement into my problem where $a=5$ and $b=3$ then it gives me the answer as $7$ which is less than what I got as answer. Can someone please clarify this for me and give an idea to approach these kind of problems? Thanks in advance !!! PS : Just now I noticed that my answer 15 is basically $5*3$. So can we say that for our general problem statement i.e.  "The largest positive integer which cannot be written in the form $Am + Bn$ where $m$ and $n$ are positive integers and $A$ and $B$ are positive integers too is?", the answer will be $A*B$.


How do I vote to migrate questions to other SE sites that aren't listed?

When I vote to close a question because it is off topic, the only other SE I can recommend the question to are the following 5:    In this instance I feel the question should have been posted at wordpress.stackexchange.com, but I have no way to suggest this?


Bluetooth does not detect any devices - Dell Inspiron 15/ 12.04LTS

The bluetooth adapter is visible and not blocked, but does not detect any devices at all while attempting to pair.   rfkill list  0: dell-wifi: Wireless LAN     Soft blocked: no     Hard blocked: no 1: dell-bluetooth: Bluetooth     Soft blocked: no     Hard blocked: no 2: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no 3: brcmwl-0: Wireless LAN     Soft blocked: no     Hard blocked: no 6: hci0: Bluetooth     Soft blocked: no     Hard blocked: no   lsusb :  Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 002 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 003 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 004 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 001 Device 002: ID 8087:0024 Intel Corp. Integrated Rate Matching Hub Bus 002 Device 002: ID 8087:0024 Intel Corp. Integrated Rate Matching Hub Bus 003 Device 002: ID 04ca:0061 Lite-On Technology Corp.  Bus 001 Device 003: ID 0a5c:21d7 Broadcom Corp.  Bus 001 Device 004: ID 0bda:0129 Realtek Semiconductor Corp.  Bus 001 Device 005: ID 0bda:58c2 Realtek Semiconductor Corp.   I searched and found that issue lies with Broadcom BT. Is there no way around it?


I see the character    in many papers, which looks different than the standard math character $z$.  Why is this character used, and what is the command for it?


What is the ontological status of the laws of logic?

Are the laws of logic abstract objects that exist independently of physical things? Are they the same in all possible worlds? Are they man-made constructs, nothing more than ideas in our minds? Or something else?


What are the possible tests for gauging the correlation between two categorical variables?

I have two categorical variables: Emotions {Sad, Happy, Neutral} and Psychological_state {Depression, Normal, None}.  I want to interpret the relationship between these two variables (is there a correlation between them). For instance, is there a dependence between being sad and depressed ? What is the degree of this dependency ?   Can I use Pearson correlations to test the correlation between these two categorical variables? What are the alternative solutions to interpret the relationship between categorical variables? What are the other alternatives to do this, excluding the chi-square test?


Simple word related to "a group of intellectuals" or "a group of smart learners"

What could be a good word for "a group of intellectuals" or "a group of smart learners"? Any suggestions of related terms also invited.


Is there a set of lines in $\mathbb{R}^3$ such that their union is equal to the set of points with not all coordinates rational?

Does there exist a set L of pairwise disjoint lines, each line in an axis direction, in $\mathbb{R}^3$ such that their union is equal equal to $\{ x : x \text{ has at least one irrational coordinate}\}$?


Is it necessary to ask permission before including someone in the acknowledgements of a research paper?

I had the impression that obtaining written permission before including someone in acknowledgements was required. Therefore, I just wrote to someone asking for written permission to include him in the acknowledgements of a paper, and he said he didn't think it was necessary. I don't recall where I got this notion from - perhaps the rules of a specific journal? So, I was wondering if there are any general rules about this or not, or are they perhaps journal specific?


Is there any better way of getting the right length of array containing digits?  I have an array of digits: 0, 0, 1 and I try to get length of it. It obviously breaks and returns 0. I am new to C but I tried to make custom strlen function:  int custom_strlen(char *str) {     for(int i = 1; ;i++) {         if (str[i] == 0) {             return i;         }     }     return -47; }   but it is not that efficient and in some cases returns unexpected values as well. The expected out put would be 3 in this case.  Is there any function to use?


How can I prevent iwconfig power management from being turned on?

I am affected by this bug: .  A workaround which seems to stop the kernel panics for me is to disable wlan0 power management:  sudo iwconfig wlan0 power off   However it seems to automatically turn power management back on when I unplug the power cable and I think at many other times, too.   Is there something that might be causing this? Does anyone know how I can prevent it?


I have looked around the internet for methods of having big redstone delays (Up to 5 or 7 minutes), and multiple of these delays in a row, each delay sending a redstone signal to a command block then activating another long redstone delay (Not a loop).  The problem is that I don't want to use a whole lot of repeaters connected between different command blocks, as this would take too long and take up a lot of space. The amount of time also does not need to be too accurate.  What I have found is that many of the solutions I have tried to find are loops (Like Etho's Hopper Timer), and instead of a constant loop I want a redstone delay, like a bunch of repeaters, but more compact.  Anything easy to set up via redstone is preferred but I'm open to using scoreboards.  Edit: I slightly edited Yeet's suggestion so that the command kills the minecart, sand, and also gives an output.


I would like to use a Wii remote to control my player in my 3D game.  So far I have the arrow keys and mouse to move and look but I want the Wii d-pad to move and accelerometer data to look around.  I have downloaded  and the demo works fine. In my game I have imported the Unity package for the Wii remote but I'm not sure what script goes where, attached to what, how to call particular functions. They are mostly C# scripts.  There is no documentation with the Unity-Wiimote-1.1 and as I'm a newbie, I'm clueless on what to do.  Or is there a simpler method to getting the Wii remote to be the main controller?


why can't i select two objects in edit mode?     I am trying to make a face from two different meshes but can't perform the action


What kind of lens do I need to take a photo of jewelry like this?

I am trying to do some pretty jewelry photography and I am wondering what type of lens I would need to create a shot like this? Also what is the lighting environment required to take this shot?


Mindmap tikzpicture in beamer (reveal step by step)

I want to include a tikzpicture (mindmap) in beamer and I want the children to appear one after the other.  So I use \visible but it don't works -- also not with \pause command. I get errors regarding forgotten semicolons. When I insert semicolons, not all of the mindmap is created.  Is there an easy way to realize that?  \begin{frame} \frametitle{Charakteristika} \begin{tikzpicture}[mindmap, concept color=gray!50, font=\sf, text=white]    \tikzstyle{level 1 concept}+=[font=\sf, sibling angle=90,level distance = 30mm]   \visible<1->{   \node[concept,scale=0.7] {Gedächtnis}     [clockwise from=135]}       \visible<2->{         child[concept color=orange]{ node[concept,scale=0.7]{Musik} } }       \visible<3->{         child[concept color=orange]{ node[concept,scale=0.7]{Kunst} } }       \visible<4->{         child[concept color=orange]{ node[concept,scale=0.7]{Mathematik} } }       \visible<5->{         child[concept color=orange]{ node[concept,scale=0.7]{Seltenere} } };  \end{tikzpicture}  \end{frame}


Can we get energy from the Earth's rotation?

Is there any way to harvest large amounts of energy from the Earth's rotation?


Closed form for this particular Taylor series

I know that in general one can't find closed forms for arbitrary infinite series, but in working on a problem I came across this sum:  $$\sum_{n=0}^\infty \binom{2n}{n}(1/9)^{n}$$  (Note: I originally put $(1/3)^{n}$, have corrected it above.)  The Taylor series  $$\sum_{n=0}^\infty \binom{2n}{n} x^{n}$$  looked vaguely familiar and so I tried to find/derive a closed form for this but have had no luck. So my questions are:   Do you recognize this particular sum? Do you have any suggestions for tracking down questions like this? I checked most of the basic Calc I level functions, and did an initial scan through Abromowitz and Stegun, but didn't find anything even close. Are there any methods that might apply? I have a memory of a paper where the author had a method for a wide variety of sums like these with binomial co-efficients, but I can't track it down.   Note: From the "Related Questions" in the side bar here I'm going to check if hypergeometric series can help me, but I'll go ahead and post this anyways.    Edit: Thanks for the identification. I'd like to know if it's just something you've recognized, or you know how to search Wolfram better than I do. For example, I wouldn't know to call the co-efficient the "Central Binomial".


i have just finished modelling a Newton's Cradle, but I noticed the bars are too thick, I did not use a solidify modifier. I have tried scaling it in the x and y axis but is just makes it look flat. I wanna reduce the thickness, how would I do that?    I know the question seems a bit vague, but it is way too thick and i really don't wanna have to re-model them. Is their a way?


Let $R$ be a commutative ring with a multiplicative identity. If $a\in R, a \not = 0$, prove that $R/(a)$ is not a free $R$-module.   My initial attempt was to say that R/(a) is not torsion free, thus it cannot be free, but then I realized that the theorem "M is a free module if and only if it is torsion free" only works for finitely generated modules over PIDs.  So I'm pretty lost as to how to prove this.  Any help would be appreciated!


I want to know what a "virtual base class" is and what it means.  Let me show an example:  class Foo { public:     void DoSomething() { /* ... */ } };  class Bar : public virtual Foo { public:     void DoSpecific() { /* ... */ } };


How to draw a label box next to the flowchart and put the flowchart under the figure environment so it appears on LoF

Hi i want to add the box description into my flowchart like . (Sorry for bad drawing). first, i don't know how to make that box and shapes inside it and aligned in equal symbol. The box should be about 5x6cm (flexible). And i want the flowchart have caption just below the flowchart. This is my attempt for the flowchart only: \documentclass{book} \usepackage[utf8]{inputenc} \usepackage{tikz} \usetikzlibrary{shapes.geometric, arrows} \usepackage{caption}  \tikzstyle{startstop} = [rectangle, rounded corners, minimum width=3cm, minimum height=1cm, text centered, draw=black, fill=red!30] \tikzstyle{io}=[trapezium, trapezium left angle=70, trapezium right angle=110, minimum width=3cm, minimum height=1cm, text centered, draw=black, fill=blue!30] \tikzstyle{process} = [rectangle, minimum width=3cm, minimum height=1cm, text centered, draw=black, fill=orange!30] \tikzstyle{decision} = [diamond, minimum width=3cm, minimum height=1cm, text centered, draw=black, fill=green!30] \tikzstyle{arrow} = [thick,->,>=stealth] \tikzstyle{line} = [draw, very thick, color=black!50, -latex']  \begin{document}     \begin{tikzpicture}[node distance=2cm]         \node(start)[startstop]{Start};         \node(in1)[io, below of=start]{Input};         \node(pro1)[process, below of=in1]{Process 1};         \node(dec1)[decision, below of=pro1, yshift=-0.5cm]{Decision 1};         \node(pro2a)[process, below of=dec1, yshift=-0.5cm]{Process 2a};         \node(pro2b)[process, right of=dec1, xshift=2cm]{Process 2b};         \node(out1)[io, below of=pro2a]{Output};         \node(stop)[startstop, below of=out1]{Stop};                  \draw[arrow](start)--(in1);         \draw[arrow](in1)--(pro1);         \draw[arrow](pro1)--(dec1);         \draw[arrow](dec1)--node[anchor=east]{yes}(pro2a);         \draw[arrow](dec1)--node[anchor=south]{no}(pro2b);         \path[line, dashed](pro2b) |- (pro1);         \draw[arrow](pro2a)--(out1);         \path[line](out1)--(stop);      \end{tikzpicture}    \end{document}  Please help me. Thanks in advance.


The command history will display the list of commands I used before. Now:    How could I know the most used commands? Also how to count number of times I used each command?   For example:    If I use sudo 30 times in first day and 45 times in second day, then when displying the most used commands then sudo will be shown with number 75


Confirm event for logout not working properly

I had some trouble with logout button, so i use confirm(); with on click event on jQuery. I use if statement for confirm that the user is click Ok or Cancle  Button script :
Logout
    Script that working :  $("#logout-btn").on("click", function() {     var acc = confirm("Are you sure want Logout?");     if (acc == true) {         window.location.href = "logout.php";     }else{      } });   Script that isn't working :  $("#logout-btn").on("click", function() {     var acc = confirm("Are you sure want Logout?");     if (acc == true) {         window.location.href = "../logout.php";     } else {      } });   The different between script just different folder but the second script when i click Cancel it still logout, What is the problem??


Where does Google Play Store put downloaded apps?

I want to know where Google Play stores downloaded .apk files. I've heard that Google Play doesn't send you an .apk file and installation is completely online. Is it true?


Is my analogy on Hawking Radiation correct?

I just want to make sure what I know is correct. Let me explain and if there is anything wrong (any simple detail) with what I said, please, correct me.  When the particle crosses the event horizon, it falls off to the black hole with almost the speed of light. However, the space near the black hole is almost completely vacuumed, its shape will not be altered. When particle sucked into a black hole, the particle divide into the matter and antimatter. Antimatter is sucked into the black hole, causing pair annihilation, emitting gamma ray and slightly losing its mass, and evaporate. Matter, however, is emitted outside, just like I spit the watermelon seeds when I eat watermelon. Particles that are emitted are radiation that only contains heat but no information. Because the information is stored upon the surface of the black hole, we are not able to gather up the information of the particle back. This theory automatically disproved the white hole and wormhole theory, which was shown in the movie, Interstellar.


Proof that in a field $x=0$ is equivalent to $x=-x$

Let $F$ be a field and $x\in F$. If $x=-x$ and $1\neq -1$, then $$0=\frac{x+x}{1+1}=\frac{1+1}{1+1}x=x.$$ This means that the statement in the title is true if and only if $1\neq -1$. But how do we know that $1\neq -1$ for an arbitary field?


I tried hard to find explicit Linear transformation but I couldn't find it. I am doing it from $2$ dimensions. Also by rank nullity theorem I see that dimension of $V$ must be even ($T: V \to V$)  Kindly suggest  Thanks


How to find where a linux package has been installed

I have just issued the sudo apt-get install linux-source command that installs the linux-source package, but I am not quite sure where this package has been downloaded to.   My question is how can I find where the package has been saved/downloaded to? It would be useful if I know the path to where it has been downloaded.


Why didn't Harry and Co. travel to the Ministry in OotP by the floo network?

Seems to me that the only reason they didn't do it in the first place was because they were caught by Umbridge when she failed to fall for Nevile's ploy.   But once she was dragged away by the Centaurs after Harry and Hermione's encounter with Grawp in the forest, they seem to forget their initial plan altogether. Instead they opt to fly on comparatively slow Thestrals and waste hours flying to London, when the only obstacle that stood in their way of using the floo network is now in the middle of the forest having tea with the Centaurs.  They could have saved hours of time, and the whole catastrophe of the Ministry could have been avoided.


When to use Windows Workflow Foundation?

Some things are easier to implement just by hand (code), but some are easier through WF. It looks like WF can be used to create (almost) any kind of algorithm. So (theoretically) I can do all my logic in WF, but it's probably a bad idea to do it for all projects.  In what situations is it a good idea to use WF and when will it make things harder then they have to be? What are pros and cons/cost of WF vs. coding by hand?


Is there any way to make this list sorter shorter?

I want to input 5 names and then sort them manually.   Is there any shorter solution than this??  def swap(x,y):   L[x],L[y]=L[y],L[x]   L = input("Enter names separated by space: ")   L = L.split(" ")     for x in range(len(L)):        for y in range(len(L)-1):           if L[y] > L[y+1]:             swap(y,y+1) print(L)


Cannot copy text from the simplest PDF file?

Consider the following code:  \documentclass{article} \begin{document}    We define multiplication by    $$v_1x = 0,\quad v_2x = v_1,\quad v_1y = -v_1,\quad v_2y = v_1$$ \end{document}   which looks like this        It's as simple as it gets, but when I copy the content of the PDF I get:  We de??ne multiplication by v1x = 0; v2x = v1; v1y = ??v1; v2y = v1 1   So there are 4 errors:   The fi in define disappears  , becomes ; The minus sign is not being copied properly Another 1 appears at the very end of the copied text   How can I prevent this from happening? I use Texmaker with Miktex 2.9 and pdfLatex.


I'm having problem with ArcScene. I'm doing a project on the visual impact of felling areas of forest in locations regularly visited/used by people.   I have viewpoints and have created a TIN model for ArcScene. However when i try to drape my other layers - forests, roads, viewpoints - some become patchy and disappear beneath the surface of the TIN in ArcScene.   I have tried converting these features to 3D, adding layer offsets and extruding features but they just seem to make the imagery worse. I have also set the drawing priority to its lowest for the TIN and all others layers' priority to their highest.


What is the use of a capacitor between Vdd and Vss (or Vcc and Vee)?

I'm trying to make my STM32 communicate VIA Can. Therefore I'm making use of the CAN transceiver MCP 2551. In many circuits I've seen a 100 nF between Ground and Vdd. What is the reason for that? Here an example:


Why do I have to say “want you to do” instead of “want you do”?

I'm confused about 'want you to do (something)' and 'want you do (something)'.  Example:      "I want you to eat fish" instead of "I want you eat fish" or "I want that you eat fish".    Can anyone explain what is the grammar rule for this?


Is there a free trusted virtual machine image with Ubuntu preinstalled?

Since the vmware virtual machine drivers are pretty standard I don't see any technical reason for a preinstalled image not to be portable.  Although the above situation is obvious, I didn't find any preinstalled vmware image for Ubuntu.  Is there a trusted free vmware image or an OVF image with Ubuntu preinstalled?   Note: OVF image works !


I've tried both calculations on Wolfram Alpha and it returns different results, but I can't get a grasp of why it is like that. From my point of view, both calculations should be the same, as $2.5=25/10,$ and $(-2)^{2.5}$ is equal to $(-2)^{25/10},$ relying on a general rule $(a^m)^n=a^{mn}$.  Links to sources:


Is there a neat and tidy way of adding comments, or text boxes, into the display of the Graphical Modeller of QGIS 3.14 for a model that one is building. This is straightforward in ArcGIS ModelBuilder but I can't find a neat way of doing this in the QGIS process model building tool.