MSVC++ Linker error which I do not quite understand

Right I am getting weird linker errors which I've never seen before and which I can't really decipher.  Code for the  and  can be found there. One remark: I've moved all function bodies to the source file instead of the header file. Naming has stayed the same.  Error   1   error LNK2019: unresolved external symbol "public: __thiscall RelationUser<class Family,class Citizen>::RelationUser<class Family,class Citizen>(class Family *)" (??0?$RelationUser@VFamily@@VCitizen@@@@QAE@PAVFamily@@@Z) referenced in function "public: __thiscall Citizen::Citizen(class Family &,class Name)" (??0Citizen@@QAE@AAVFamily@@VName@@@Z) *path*\Citizen.obj  CodeAITesting Error   2   error LNK2019: unresolved external symbol "public: __thiscall RelationUser<class Family,class Citizen>::~RelationUser<class Family,class Citizen>(void)" (??1?$RelationUser@VFamily@@VCitizen@@@@QAE@XZ) referenced in function __unwindfunclet$??0Citizen@@QAE@AAVFamily@@VName@@@Z$1  *path*\Citizen.obj  CodeAITesting Error   3   error LNK2019: unresolved external symbol "public: __thiscall RelationOwner<class Family,class Citizen>::~RelationOwner<class Family,class Citizen>(void)" (??1?$RelationOwner@VFamily@@VCitizen@@@@QAE@XZ) referenced in function __unwindfunclet$??0Family@@QAE@VName@@@Z$1   *path*\Family.obj   CodeAITesting   The first one is about a constructor and the second two are about the destructor. That I understand.  I've also implemented my own version of the User and Owner as the following:  // header of Family.h (Owner in the linked PDF file) #include "Name.h" #include "RelationOwner.h"  class Citizen; class Family; // I didn't really know if this one was necessary.  class Family      : public RelationOwner<Family, Citizen> { public:     Family(Name name);  private:     Name name; };  // Source of Family.cpp #include "Name.h"  Family::Family(Name name)     : name(name) { }  //Source of Citizen.h (User in the linked PDF) #include "Name.h" #include "RelationUser.h"  class Citizen; class Family;  class Citizen      : public RelationUser<Family, Citizen> { public:     Citizen(Family &family, Name name);  private:     Name name; };  // Source of Citizen.cpp #include "Family.h" #include "Name.h" #include "RelationUser.h"  Citizen::Citizen(Family &family, Name name)     : RelationUser<Family, Citizen>(&family),     name(name) { }   As far as I know I am not doing anything fancypancy, yet it is complaining big time and I don't know why.


I've tried both these posts with no success :      My goal is to create a 'product card'. It will have a background image and a product image that should fit to 100% of it's width and 60% of it's height (from top).  Something that looks like that -    That's my HTML(JSX) :

   That's my CSS :   .card-background{ position: relative; top: 0; left: 0;  }  .product-image { position: absolute; top: 0; left: 0;  }   And the weird result -


Indian National transiting through Helsinki

I am travelling to Krakow, Poland and have a stopover at Helsinki from 3.55pm one day to 9.55 am the next day. Do I need a transit visa and if so, how do I get it?


I am connecting to mySQL database using a shell script. After connecting to the mySQL database, I execute a query. The query gives me 300,000 URLs as the result.  For each of the 300,000 URLs I need to check if the URLs actually exist and need to update the table that the URL is checked for its existence.   I have planned on using the curl command. I am giving the command as below.   curl -s --head http://myurl/ | head -n 1 | grep "HTTP/1.[01] [23].."   If I just give the command in my shell, I am getting the response (like 301, 200 etc). However, I need it in a variable so that I can use it for some manipulation purposes. For example, like below.   $var = curl -s --head http://myurl/ | head -n 1 | grep "HTTP/1.[01] [23].." echo $var; if ($var == "some value") {      do something; } else {     do some other thing; }


"There are no comments" vs. "There is no comment"

Which is correct?     There are no comments.  There is no comment.   Which would you use for a web application, i.e. what to display when a blog post or an article has no comment attached?    Actually, I am trying to fix an application that says: "There is no comments"! Would that ever be right?  More generally speaking, it feels wrong to have a plural after the negative no/none or with the preposition without (see my previous question ).  Those words imply zero, i.e. less than one, while plural is two or more. Yet, I know that phrases like "There are no comments" or "He is without friends" are common. It seems illogical to me.   Are the majority of people making a grammar mistake when using such expressions, or else can you explain why this is correct?


Windows 10 ridiculously slow after 20H2 update

After 20H2 update, I can't seem to get my apps fuction properly. Every app I try to launce (I.E Steam) takes a 4 minutes or five to load. I have a room of 32 gb ram and my windows is installed on 1tb m.2 of ssd. What can I do in order to fix this?


jQuery Keyup event is not firing for dynamically generated elements

In my code there is a div  with id="mix" generated dynamically with the jQuery load() method:  $('#mix').load('handlers/muscript.php');   muscript.php contains a few input element, which will be loaded into this div having id "mix" .  the event keyup is not firing when the user enters their text.  The code for creating the new input elements is:  $('#add').click(function() {     $('<input id="'+k+'" type="text" name="trans' + k + '"  />')       .appendTo('#mix');   The code for capturing the user's values is:  $('input').keyup(function() {     handler = $(this).val();     name = $(this).attr('name');   This second code block work for the single element, but it is not fired for dynamically generated elements.


If G is a finite group in which every proper subgroup is abelian, show that G is solvable.

If $G$ is a finite group in which every proper subgroup is abelian, show that $G$ is solvable.     I'm working on this proof and already proved that a subgroup in which every proper subgroup is abelian will not be simple and therefore contains a normal subgroup.    Because this group doesn't have to be of maximal order I can't use the answer here   So I was thinking it should be possible to proof that the commutator subgroup is a proper subgroup and create the required derived series. $1\trianglelefteq$ $\mid G,G\mid$ $\trianglelefteq G$ which would prove solvability.    I found another proof here  which covers concepts which were not yet part of the book I'm working through. Specifically I'm not familiar with  transitive substitution groups or primitive groups.   The question is from Exercise 56 in Chapter 4.5 in the book Abstract Algebra of Dummit and Foote.


Change all @username references in comments when a user changes their name?

The fact that a user can change their name at will can lead to some confusion in the comments.  For instance, suppose a user named "foo" changes his name to "bar", all those comments signed by "foo" are now signed by "bar", but responses to "bar"'s comments still start with "@foo".  Could those "@foo" references in comments be changed to "@bar"?    A brief discussion on this has set me straight.  I didn't think it through.  Request withdrawn.


Finding the smallest square inside a parabola.

I just thought of a problem earlier today, but wanted to know if there was an easier way of acquiring the answer.  Say I have a standard parabola $y=x^2$ with 3 points on it $P,Q,R$ and another point $S$ such that $PQRS$ is a square.  Now I can clearly see that if I have the origin $(1,1), (-1,1)$ and $(0,2)$, then I form a square with area 2. However, this may not necessarily be the smallest square.  My idea for finding the square with the smallest area is to parameterise the parabola with 3 points $(t,t^2)$ where $t=p,q,r$, then to find the area of that triangle (perhaps using the determinant) and then minimise that quantity with the constraint that the interval $PQ=PR$ and that $PQ \perp PR$.  However, this seems too tedious. Is there a better way perhaps?


What are the properties of an N-bit microcontroller?

I've heard of 8 bit microcontrollers and 16-bit microcontrollers.  I've even heard about  microcontrollers and  microcontrollers.  What are the general attributes of these groups?  How do I choose which type to use for a project?


Shortcut arrows on desktop are different sizes

How can I make the shortcut arrows on my desktop icons consistent? Some are 75% of the image, and others are 20% of the image.  There doesn't seem to be anywhere that this can be edited, or even toggled on/off.


How to compute $\sum\limits_{n=1}^{\infty}\frac{1}{x^n-1}$?

The sum came up when I was trying to evaluate $\frac{1}{1}+\frac{1}{11}+\frac{1}{11}\cdots$  I rewrote the sum as, $S = 9 \ \displaystyle{\sum_{i=1}^n} \frac{1}{10^i-1}$  Wolfram gives an answer in terms of the digamma function.


How do I get the path my script is running in?

I am writing a Quake 1 .BSP import script with python and I want to extract the textures from the .BSP so that the mesh can be textured. However, the textures are paletized (instead of a color, only an index into a palette is stored for each pixel) and the palette is not contained in the .BSP.   I'd like to include the palette in a file with my script, and load it from the script at run time. However, I don't know how to get the path to the palette file, so I can't load it. Is there a way to get the path my script is running in? I've tried using just the file name of the palette, but it didn't work.  p.s. I know I could store the palette in a python file, but I'd rather use the original .PAL format so that users can swap it for another palette if desired.


How to circumvent using an out parameter in an anonymous method block?

The following method does not compile. Visual Studio warns "An out parameter may not be used within an anonymous method". The WithReaderLock(Proc action) method takes a delegate void Proc().  public Boolean TryGetValue(TKey key, out TValue value) {     Boolean got = false;     WithReaderLock(delegate     {         got = dictionary.TryGetValue(key, out value);     });     return got; }   What's the best way to get this behavior? (Please refrain from providing advice on threadsafe dictionaries, this question is intended to solve the out parameter problem in general).


How to prove that $\lim_{(x,y)\to (0,0)} \frac{xy^5}{x^4+y^6}=0$

How can I apply the squeeze theorem to show $$\lim_{(x,y)\to (0,0)} \frac{xy^5}{x^4+y^6}=0$$


Recently – I believe due to Texlive update – the background of the title text on my beamer presentation started to be of solid color compared to being fully transparent before.  MWE:  \documentclass[12pt,t]{beamer} \usepackage{graphicx} \usetheme{default} \title{Test}  \begin{document} \usebackgroundtemplate{\includegraphics[width=\paperwidth]{test.jpg}} \frame[b]{\titlepage} \end{document}     How can I get rid of the white blocks so only the background image and text is visible?


My other operating system has vanished even after running boot-repair

After installing Lubuntu, I have never found a dual boot option, so I ran boot-repair.  I've got 2 updates and one is good and the other is extremely bad:  The Good One: I can see the dual boot options now.  The Bad One: I can't see my other operating system, it's just Ubuntu.  Output of parted --list    Here is the output of the commands:  sudo os-prober sudo update-grub


change the background color for  while loading the page in ASP.NET

I have <map> which contains an image of different districts. I need to change the background color for different hotspots while loading the page. Background color information is stored in a SQL Server table. While loading the page, I retrieved the color and stored it in list. Using JavaScript, I need to change the background color of a particular <area> element.  <%@ Page Language="C#" AutoEventWireup="true" CodeBehind="WebForm1.aspx.cs" Inherits="Indicator_Color_Map.WebForm1" %>  <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">  <html xmlns="http://www.w3.org/1999/xhtml"> <head runat="server">     <title></title>     <%--<style>     area     {         background-color:Red;     }     </style>--%>     <script type="text/javascript">         function setColor() {             document.getElementById("area1").style.background-color = "green";         }     </script> </head> <body onload="setColor()">     <form id="form1" runat="server" >     <div>     <img src="jammu.jpg" alt="Planets" usemap="#planetmap" style="height: 434px; width: 369px">     <map  id="map1" name="planetmap">      <area shape="rect" coords="0,0,82,126" href="" alt="Sun" id="area1"  >   <area shape="circle" coords="90,58,3" href="" alt="Mercury" id="2">   <area shape="circle" coords="124,58,8" href="" alt="Venus" id="3"> </map>     </div>     </form> </body> </html>   I tried with ImageMap control, but I can't apply the style for different coordinates.   Would any other third party control be helpful?


I am looking to add a image with a alpha channel to a BSDF shader but i'm struggling to find a way without having to create a whole image texture instead. Is it possible to use a node based material with a cut out image ontop? (first question on stack exchange please let me know if my formatting is wrong)


How box topology is finer than product topology?

I just studied Munkres, but there is only one line that box topology is finer no any explaination. I think i just need to show tha basis elements of box topology are contained in the basis element of product topology but i don't know how??


electrons in elecrtostatic force(please read specification given below)

when comb is rubbed with hair, and brought near small pieces of papers, small paper pieces gets a towards comb. Here the comb gets negatively charged and when brought near piece of paper where do electrons go because after sometime attraction of paper pieces towards comb stops and comb doesnt have negative charge then. Why does it happen so ? What is the reason for it ?  If a glass rod is rubbed with silk, rodna and silk gets positive or negative charge respectively, an when they are seperated after charge gets nuetral. Why does it happens? What is the reason behind this ?


Are these "for + nouns" adjectival prepositional phrases or adverbial prepositional ones?

Consider:  Some "for + nouns" are adjectival prepositional phrases; others are adverbial prepositional ones, but I am not sure which is which in these following examples:        The pension plans involve very little risk for employers.    A bank creates a reserve for loan losses.    How do investors decide on the expected returns they require for individual investments?   Regulators aim to ensure that ﬁnancial institutions keep enough capital for the   total risks they are taking.   Policyholders can often redeem (surrender) whole life policies early or use the   policies as collateral for loans.   Many exchanges on which stocks, options, and futures trade use market makers.   Typically an exchange will specify a maximum level for the size of a market maker’s bid-offer spread.   The CME has introduced contracts for 10 different weather stations.   The lesson from these losses is that it is important to define unambiguous risk limits for traders.   For similarly rated bonds and structured products, the probability distribution of losses are markedly different.         All the examples are taken from Risk Management and Financial Institutions, 3rd Ed. written by John Hull.    I have no difficulty in understanding these sentences, but it’s not easy to tell whether these "for + nouns" are adjectival prepositional phrases or adverbial prepositional ones.   I would guess this problem could cause ambiguity in some cases.


Strange Behavior of Empty String in JAVA

I am working on a Existing code and i found a Strange Behavior while checking a String is null or Empty. The existing code :   System.out.println("Length: " + value.length()); if (value != null && value != "") {    //code }   Output:  Length: 0   But the if statement becomes true and its executing the code.  When i replaced the if statement with this one:  if (value != null && value.length() > 0) {    //code }   It works perfectly. Any idea why the previous one failed and Why value != "" returns true?


Why can't a Carnot engine heat sink be at absolute zero?

We know that for a Carnot engine the efficiency is given by $1-(T_2/T_1)$, but why can't a real engine have $T_2=0\,{\rm K}$?  I know that the efficiency cannot be $1$, but why can't we make the heat sink temperature zero Kelvin?


What is partial least squares (PLS) regression and how is it different from OLS?

Assume we have a simple linear regression model expressed as $$y= X \beta + \epsilon,$$ where $y$ is a vector of size $n \times 1$, $X$ is a matrix of size $ n \times p$, $\beta$ is the regression coefficients vector of size $p\times 1$, and $\epsilon$ is a noise vector of size $n\times1$.  We all know that the Ordinary Least Squares (OLS) estimator of $\beta$ cannot be used when $p\gg n$. That is why there are a lot of alternative methods were proposed. One of these methods is the Partial Least Squares (PLS) estimator. I read some resources which explain the PLS, but unfortunately I didn't understand well the concept and the main difference between OLS and PLS.  So can someone kindly explain me in detail how PLS works?  Furthermore, can someone write me the Matlab code of how to estimate the $\beta$ vector using PLS?


Will MacBook still show as Offline in find my iPhone after it's been restored?

I have received so many different answers and I'm hoping to get one from someone who knows about this specific issue.   My MacBook Pro was stolen last week, but it is still showing on my devices on find my iPhone as "offline." If the thief wiped the laptop, would it still show as offline or would it be completely removed? I read something about it being possibly stored in the NVRAM so it could still show up like it is but I want to be certain.  Thank you so much for your answers


Does relativistic mass affect space time in the same way as rest mass?    To my understanding, (as I am not an actual physicist, but simply a citizen scientist) relativistic mass is really the measure of an object's energy.  It is not the same as rest mass, which is the definition of mass that a layperson would be familiar with (how much matter an object is composed of).  However, does a change in relativistic mass amount to the same magnitude of gravitational variation as an equivalent change in rest mass?


These are the screen shots of the issue I am having.  Google please fix this issue.


In ZF, how would the structure of the cardinal numbers change by adopting this definition of cardinality?

In ZFC, a good way of ordering sets by cardinality is by leveraging the notion of an injection. We define: $$X \lesssim Y \leftrightarrow \mbox{ there exists an injection } X \rightarrow Y.$$  Alternatively, we can leverage the notion of a partial surjection, by which I mean a partial function that hits every point of its codomain at least once.  $$Y \succsim X \leftrightarrow \mbox{ there exists a partial surjection } Y \rightarrow X.$$  Now in ZFC, these approaches are equivalent, in the sense that $$X \lesssim Y \iff Y \succsim X.$$  But if we just consider ZF (that is, we drop choice) then the equivalence breaks down. However, we've still got the forward implication, because the converse of an injection is always a partial surjection.  A specific question. Define that two sets are weakly equipotent iff $X \succsim Y$ and $Y \succsim X$. Question: does weak equipotence imply genuine equipotence? I'm guessing "no."  A general question: In broad terms, how would the structure of the cardinal numbers in ZF be altered by adopting $\succsim$ rather than $\lesssim$ as the fundamental order relation, and taking equality of cardinal numbers to correspond to weak equipotence of sets? I'm guessing this would hide a lot of the (usually very complicated) structure of the cardinal numbers in ZF.  Remark. The order symbols can be written \lesssim and \succsim.


Does there exist a Stack Exchange site on which I can ask for help regarding whether I can use an audio clip? Basically, an SE for copyright law. This can be really confusing sometimes, and I don't want to accidentally steal from anyone.


$\mathbb{R}^n$ not homeomorphic to open subset of $\mathbb{R}^m$

I am a little confused on this topic, I have managed to prove that if $n < m$ then this is true, but the proof does not seem to work if $m < n$. Indeed, if $n < m$ and $f :\mathbb{R}^n \to U$ is a homeomorphism  with $U$ being an open subset of $\mathbb{R}^m$, then $\mathbb{R}^n$ will also be homeomorphic to the subset of $\mathbb{R}^m$ consisting of tuples where the last $m-n$ entries are zero, this set $A$ is closed, and so we have an homeomorphism $F: U \to A$, but since $U$ is open so must $A$ be by the invariance of domain theorem, but $A$ can't be both close and open since the only such sets in $\mathbb{R}^m$ is the empty set and $\mathbb{R}^m$ itself, contradiction.  But what if $m < n$? This proof does not seem to work then?


How does a reflected photon keep its entanglement

I'm curious how a photon from an entangled pair, travelling through say a delayed choice quantum eraser experiment, can bounce around between mirrors but remain entangled with its partner photon, when any kind of "observation" of that photon destroys its entanglement.  Surely there is some form of interaction happening at the site of reflection that causes the photon to change its direction. What is special about this type of interaction that does not cause decoherence in the photon's wave function?


Ubuntu won't load on chromebook Acer r11

I wanted to install Ubuntu on my Acer chromebook r11, so I turned it into developer mode, switched to terminal window (ctrl+alt+F2) and downloaded Ubuntu files via wget (tnyga). Everything worked ok, but then it boots every time to Crome OS again. I tried   sudo cgpt add -i 6 -P 5 -S 1 /dev/mmcblk0  but it didn't help.


Question:Prove that $x^{p^n} -x +1$ is irreducible over $\mathbb{F_p}$ only when n=1 or n=p=2  I know it is a duplicate question. However, someone gave some nice hints on this problem and I want to follow the hints he gave.  Hint (1): Note that if $\alpha$ is a root, then so is $\alpha+a$ for any $a \in \mathbb{F_{p^n}}$  Hint (2): Show that this implies that $F_p(\alpha)$ contains $\mathbb{F_{p^n}}$  Hint (3): Show that $[\mathbb{F_{p}(\alpha)}:\mathbb{F_{p^n}}]=p$  Hint(1) and Hint(2) are done:   Hint(1) is easy to prove, just use two properties: $(\alpha+\beta)^p=\alpha^p+\beta^p$ and $\forall a \in \mathbb{F_{p^n}}$, $a$ is a root of $x^{p^n}-x+1$.  Hint(2): Since $F_p(\alpha)$ is a Galois Extension, we have $F_p(\alpha)$ contain all the roots of $x^{p^n} -x +1$, thus contain $\mathbb{F_{p^n}}$.  However, I stuck on Hint(3), and actually Hint(3) is very important, once we get $[\mathbb{F_{p}(\alpha)}:\mathbb{F_{p^n}}]=p$, we will get $[\mathbb{F_{p}(\alpha)}:\mathbb{F_{p}}]=n \cdot p$ ,and we know $[\mathbb{F_{p}(\alpha)}:\mathbb{F_{p}}]=p^n$, thus we can finish the proof.  Can anyone give me any idea about how to prove hint(3)?


Prove $$0\leqq x^{2}+ y^{2}- 2\,x^{2}y^{2}+ 2\,xy\sqrt{1- x^{2}}\sqrt{1- y^{2}}\leqq 1 \tag{1}$$ with  $$\left | x \right |,\,\left | y \right |\leqq 1 \tag{2}$$ My normal work $$\begin{cases} \left | x \right |\leqq 1 \Rightarrow -\,1\leqq x\leqq 1 \Rightarrow x\equiv \cos\alpha\,(\,0\leqq \alpha\leqq \pi\,) \\ \left | y \right |\leqq 1 \Rightarrow -\,1\leqq y\leqq 1 \Rightarrow y\equiv \cos\beta\,(\,0\leqq \beta\leqq \pi\,) \\ P\equiv x^{2}+ y^{2}- 2\,x^{2}y^{2}+ 2\,xy\sqrt{1- x^{2}}\sqrt{1- y^{2}} \end{cases}$$ $$\Rightarrow P= \cos^{\,2}\alpha+ \cos^{\,2}\beta- 2\,\cos^{\,2}\alpha\cos^{\,2}\beta+ 2\,\cos\alpha\cos\beta\sqrt{1- \cos^{\,2}\alpha}\sqrt{1- \cos^{\,2}\beta}$$ Otherwise $$\begin{cases} \sqrt{1- \cos^{\,2}\alpha}= \left | \sin\alpha \right |= \sin\alpha\,(\,\because\,0\leqq \alpha\leqq \pi\,) \\ \sqrt{1- \cos^{\,2}\beta}= \left | \sin\beta \right |= \sin\beta\,(\,\because\,0\leqq \alpha\leqq \pi\,) \end{cases}\begin{cases} \cos^{\,2}\alpha= 1- \sin^{\,2}\alpha \\ \cos^{\,2}\beta= 1- \sin^{\,2}\beta \end{cases}$$ $$P= \cos^{\,2}\alpha+ \cos^{\,2}\beta- 2\,\cos^{\,2}\alpha\cos^{\,2}\beta+ 2\,\cos\alpha\cos\beta\sin\alpha\sin\beta$$ The equality condition is $$\alpha+ \beta= \frac{\pi}{2},\,3\,\frac{\pi}{2}$$ I tried to solve the trigonometric equation of $$\begin{cases} \cos^{\,2}\alpha+ \cos^{\,2}\beta- 2\,\cos^{\,2}\alpha\cos^{\,2}\beta+ 2\,\cos\alpha\cos\beta\sin\alpha\sin\beta= 1 \\ \cos^{\,2}\alpha+ \cos^{\,2}\beta- 2\,\cos^{\,2}\alpha\cos^{\,2}\beta+ 2\,\cos\alpha\cos\beta\sin\alpha\sin\beta= 0 \end{cases}$$ but without success. I need to the help! Thanks!  Little idea  How about using vector? $$\begin{cases} \vec{a}= (\,a_{\,1},\,a_{\,2}\,) \\ \vec{b}= (\,b_{\,1},\,b_{\,2}\,) \end{cases}$$ $$\Rightarrow \left [ \,0\leqq (\,\vec{a}\,.\,\vec{b}\,)^{\,2}\leqq \left | \vec{a} \right |^{\,2}\left | \vec{b} \right |^{\,2}= 1\Leftrightarrow 0\leqq (\,a_{\,1}b_{\,1}+ a_{\,2}b_{\,2}\,)^{\,2}\leqq (\,a_{\,1}^{\,2}+ a_{\,2}^{\,2}\,)(\,b_{\,1}^{\,2}+ b_{\,2}^{\,2}\,)= 1\right ]$$ I can't continue!


ffmpeg generate and use different palette for every frame

Following  I managed to create high quality gifs in reasonable memory size.  Using piping, what I'm currently doing is this  # Generate palette ffmpeg -y -i - -vf fps=15,scale=600:-1:flags=lanczos,palettegen some_dir/palette.png  # Generate gif using palette ffmpeg -y -i - -i some_dir/palette.png -filter_complex fps=15,scale=600:-1:flags=lanczos[x];[x][1:v]paletteuse output.gif    This is working great, but I read in the tutorial above that it is possible to generate a different palette for EVERY frame, how can I do that ? (Generate and use different palette for every frame)


Can I make a pen-and-ink change on the UK visa application form?

I didn't submit my form but did make a mistake; I wrote my date of birth wrong. Will they accept having a crossed-out date of birth and, written above in black ink, the correct date? I live in Saudi Arabia


Concept of "none" in the English language

None of them are/is   I don't know if this is the place to ask, but:   In German you would say "none of them is" and it totally sounds wrong to me to say "none of them are". As German and English are both Germanic languages, I can't explain how they have a different concept of none, especially because in French and Italian it's singular as well.  Does anyone know how/why this turned out this way?  Edit: Before this gets put on hold ;-) I have read a lot of threads about none, my question is: how did it become this way? I haven't seen any other threads on that.


Remove Read-only (Only applies to files and folders) attribute.

I have a folder showing read only attributes. I am logged in as administrator. Tried unchecking the mark. Explorer shows "updating attributes", but when I check attributes again it has the read only check mark again. Ran cmd as an administrator and executedattrib -r /s /d to no avail. changing the owner to myself didn't help either. This is my folder with documents, and I don't have any of them open.  What can be locking files in read only state? How can I change that?


Proving that the subspace topology only works for subsets of topological spaces

As we already know, the subspace topology is a convenient way to construct topologies from supersets of a set that have a known topology already. Subspace Topology: Suppose you have a set $X$ and a topology on $X$ called $\mathcal{T}_X$. Suppose $Y \subseteq X.$ Then we can find a topology for $Y$, called $\mathcal{T}_Y$, as given by: $\mathcal{T}_Y=\{O \cap Y  \mid O \in \mathcal{T}_X\}$. I'm going to prove that the induced topology only works for $Y \subseteq X$. Namely, I'm going to prove that the subspace topology fails for $Y \not \subseteq X.$ Proof Suppose $X$ is a set and $\mathcal{T}_X$ is a topology on $X$. By way of contradiction, let $Y$ be a set such that $Y \not \subseteq X$ Since $Y \not \subseteq X,$ there is at least one $z \in Y$ such that $z \not \in X.$ Let's attempt to construct a topology $\mathcal{T}_Y = \{Y \cap O \mid O \in \mathcal{T}_X\}$ Then for any $O \in \mathcal{T}_X, O \bigcap X \neq Y$. This is because $z \in Y$ but $z$ will never be in $O$ since $O \subseteq X$ and $z \not \in X.$ Then $Y \not \in \mathcal{T}_Y$ This means that $\mathcal{T}_Y$ is not a topology of $Y$ as it violates the definition of topology Therefore, the subspace topology only works for $Y \subseteq X$ $ \hspace{1cm} \square$


The functionality of my program is not working properly. It is not doing what I need it to do. I don't have any errors in the code but the app isn't doing what I want it to do.  **UPDATE: Okay thank you very much for the help. the button displays a value for TextView ce. However, the app does not seem to run my ifstatement to get a new value of CE1 which would be = 4*credit_1. The app is taking the initialized value of CE1 which is = 0, and converting that to a string CE1s. Hence dispalying 0.0 in TextView ce. Why is the app not taking my ifstatement if(grade_1.equals("A")) into consideration?  Here is the MainActivity.java:  public class MainActivity extends ActionBarActivity {  @Override protected void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     setContentView(R.layout.activity_main);     final EditText course1 = (EditText)findViewById(R.id.Course1);     EditText credit1 = (EditText)findViewById(R.id.editText7);     final EditText grade1 = (EditText)findViewById(R.id.editText13);     final Button b = (Button)findViewById(R.id.button1);     final TextView ce = (TextView)findViewById(R.id.textView5);     String grade_1 = grade1.getText().toString();     String text = credit1.getText().toString();     if (!TextUtils.isEmpty(text)) {         // call parseDouble in here         double credit_1 = Double.parseDouble(text);          double CE1=0;         if (grade_1 =="A")             CE1 = 4*credit_1;         final String CE1s = Double.toString(CE1);          b.setOnClickListener(new OnClickListener(){             public void onClick(View v){             ce.setText(CE1s);             }            });     }      }   @Override public boolean onCreateOptionsMenu(Menu menu) {      // Inflate the menu; this adds items to the action bar if it is present.     getMenuInflater().inflate(R.menu.main, menu);     return true; }  @Override public boolean onOptionsItemSelected(MenuItem item) {     // Handle action bar item clicks here. The action bar will     // automatically handle clicks on the Home/Up button, so long     // as you specify a parent activity in AndroidManifest.xml.     int id = item.getItemId();     if (id == R.id.action_settings) {         return true;     }     return super.onOptionsItemSelected(item); }  /**  * A placeholder fragment containing a simple view.  */ public static class PlaceholderFragment extends Fragment {      public PlaceholderFragment() {     }       } }   Here is the AndroidManifest.xml  <?xml version="1.0" encoding="utf-8"?> <manifest xmlns:android="http://schemas.android.com/apk/res/android"     package="com.example.rutgersgpacalculator"     android:versionCode="1"     android:versionName="1.0" >      <uses-sdk         android:minSdkVersion="8"         android:targetSdkVersion="19" />      <application         android:allowBackup="true"         android:icon="@drawable/ic_launcher"         android:label="@string/app_name"         android:theme="@style/AppTheme" >         <activity             android:name="com.example.rutgersgpacalculator.MainActivity"             android:label="@string/app_name" >             <intent-filter>                 <action android:name="android.intent.action.MAIN" />                  <category android:name="android.intent.category.LAUNCHER" />             </intent-filter>         </activity>     </application>  </manifest>


Can you move backwards 4 spaces right outside of the safety zone?

In Sorry, can I move a pawn that is right outside my start, then pick a move backward 4 spaces card to right outside my safety zone?


MS Excel: Unique random number generator within a range

I searched for a similar question but couldn't find one..  I want to generate 10 groups out of numbers ranging from 1-60 (including both), with each and every group containing random and non-repeating numbers. How can I do this in excel?


Basic mathmatical concepts( multiplication)

Here is a conundrum I pondered upon while solving an equation -  2x2 , generally means we are adding 2 two times , that is , 2+2  Then ,  (-2)x(-2) , should go like this (-2)+(-2)=-4 ,  But , that's not true , the answer is +4 .  Can anybody figure out and help me with it..


im running gnome ubuntu 14.10/windows 7 ultimate on a hp pavilion g6 1d98dx and it appears that my wireless button is somehow bound to something to do with the softblock (not the hardblock as it should be) i ran rfkill list all and it gives me   0: phy0: Wireless LAN Soft blocked: no Hard blocked: yes   but if i press my wireless button (f12) nothing happens to the indicator light but when i run rfkill list all again it says  0: phy0: Wireless LAN Soft blocked: yes Hard blocked: yes   any ideas are welcome ive tried installing diffrent distros such as mint, ubuntu, kubuntu, deepin, and fedora but they all have the same problem


How to calculate total number of data cells in raster?

I am using ArcGIS 9.3 and python 2.5. My code is shown at the bottom of this post.  I have a raster containing fire intensity information at 200m cell resolution. I run the script and the first count cell part returns the size of the fire. This works fine.  I then clip the raster using a polygon representing a forested catchment. The new raster represents the area of the catchment that is burnt. When I try to use the same code to count the number of cells of the new raster, it always gives me an answer of zero, even if there is definitely a raster created by the clip tool.  I have tried every combination of every tool I can think of.  my code...      fire = str(ignitionID) + "_" + str(weatherID) + "_Intensity.asc"     print "fire: " + fire      # ---------------------------------------------------------------------------     # this section calculates the size of the fire for model calibration purposes     # ---------------------------------------------------------------------------      # Process: Build Raster Attribute Table...     the_fire = input_fires + fire     shutil.copy(the_fire, "C:\\FIRESTORM\\Workspace") # copy the fire to workspace     the_fire = "C:\\FIRESTORM\\Workspace\\" + fire      try:       gp.BuildRasterAttributeTable_management(the_fire, "NONE")       resultf = gp.GetCount_management(the_fire)  # count num of rows in raster       countf = int(resultf.GetOutput(0))       fire_area = countf * 4  # each cell has an area of 4 ha       print "the fire area = " + str(fire_area) + " ha"      except:  # the attribute table cannot be created coz the fire is too large        fire_area = 300000 # default value for large fires 300000 ha       print "the fire area EXCEEDS 262,140 ha"      # -----------------------------------------------------------------------------     # this section calculates the area of the catchments that are burnt by the fire     # -----------------------------------------------------------------------------      # Local variables...     catch_extent = input_catch + "WS_Catchment_region.shp"  # catchment boundary     fire_raster = "C:\\FIRESTORM\\Workspace\\fire_raster"     fire_ascii = the_fire     Output_raster = "C:\\FIRESTORM\\Workspace\\Extract_ASCI1"     Output_ASCII = "C:\\FIRESTORM\\Workspace\\rastert_extract1.asc"     catch_burn_area = 0  # reset catchment burn area      # Process: ASCII to Raster...     gp.ASCIIToRaster_conversion(fire_ascii, fire_raster, "INTEGER")      # Process: Define Projection... based on projection of catch_extent     desc = gp.Describe(catch_extent)     spatialRef = desc.SpatialReference     gp.DefineProjection_management(fire_raster, spatialRef)      # Process: Extract by Mask...     gp.ExtractByMask_sa(fire_raster, catch_extent, Output_raster)      # Convert raster to ascii     gp.RasterToASCII_conversion(Output_raster, Output_ASCII)      # Process: Build Raster Attribute Table...     gp.BuildRasterAttributeTable_management(Output_ASCII, "OVERWRITE")      # count number of rows in raster     resulti = gp.GetCount_management(Output_ASCII)     counti = int(resulti.GetOutput(0))     catch_burn_area = counti * 4  # each cell has an area of 4 ha      print "catchment area burnt = " + str(catch_burn_area) + " ha"


Is it advisable to rollover multiple 401k accounts?

I left my fulltime job mid 2017. I am not earning since then (no pay roll being generated). Since many years I have changed many jobs. Each job had a 401k plan which I maxed out every year. So I have 5 different 401k plans spread with different 401k providers (fidelity, wellsfargo etc). I have not been taking care of these 401k and therefore, I am not seeing growth to my hard earned money. I may or may not have a payroll/salary with 401k   Based on this, below is what I am trying to understand:   Should I rollover 401k from all these providers and consolidate it in to 2 or 3 top providers? What is a good approach in doing something like this? Can 401k be rolled over to IRA only in my situation?   Thank you for your time


Why does the fact that $\int_0^1\int_0^1 \frac{x^2-y^2}{(x^2+y^2)^2} \,dy \,dx = \frac{\pi}{4}$ and $ \int_0^1\int_0^1 \frac{x^2-y^2}{(x^2+y^2)^2} \,dx \,dy = -\frac{\pi}{4}$ doesn't contradict Fubini's Theorem? Does the tangent function have something to do with that matter?


I want to execute custom jquery code which shows login dialog to user if he clicks a button and he is not logged in. How could I do that?


I was aiming to make a square wave generator which gives 16 kHz -7V,+7V square wave signal. I have used  however i could not reach a clear square wave. I have shown the LTSpice simulation result and circuit below. If you have any idea, i will be happy. Thank you.


When forcing intercept of 0 in linear regression is acceptable/advisable

I have a regression model to estimate the completion time of a process, based on various factors. I have 200 trials of these processes, where the 9 factors being measured vary widely. When I perform a linear regression of the 9 factors (and all 2 and 3 factor interactions), with no explicit intercept, I get an adjusted R${^2}$ of 0.915, if I force the intercept to 0 I get an adjusted R${^2}$ of 0.953.   My intention of forcing the intercept to 0 was to ensure that trials that completed in very short amounts of time (< 1 second) did not result in predictions of < 0. Setting the intercept to 0 did not help with this.  So my question is threefold.  1) When is it acceptable/advisable to force an intercept? 2) Does the improved R${^2}$ actually mean the model is a better fit (the plot of fitted vs measured did look better)? 3) Is there a way of ensuring the fitted values are all > 0?


If I understand correctly file permissions have an associated 3 digit number which specify read/write/execute permission.  The umask value is a default 'mask' which is subtracted from the default value. So for a umask value of 0022 the default value for something that would be 777 would become 755?  Is this correct and if so, what is the first 0 in the umask value?


NullPointerException when instantiating an inner class

I know Java foreach loops are only meant to read values and not assign them, but I was wondering if they can call mutator methods on object. To find out I designed an experiment. Unfortunately the experiment crashes and I'm curious as to why.  public class test {  public static void main(String[] args) {     foo[] f = new foo[4];     /*this would be a foreach loop, once I got the program working normally*/     for(int i = 0; i < f.length; i++) {         System.out.println(f[i].get());         f[i].add();         System.out.println(f[i].get());     } } private class foo {     foo() {         int x = 5;     }      void add() {         x++;     }      int get() {         return x;     }      private int x; }   }  Gives Exception in thread "main" java.lang.NullPointerException when I expected the output to be 5 6. Is it because the constructor to foo isn't being called? If so, how can it be called? Must foo be made a static class?


Finding roots for complex numbers polynomial

For finding the solutions for $z^3−5=−12i$, I calculated $\theta$ as $-67.3^\circ$. I can then write $z=r^{(1/3)}e^{i\theta/3}$ where I can substitute $e^{(i\theta/3)}$ as $\operatorname{cis}(2\pi k/3+θ/3)$ where I took $k$ as $0,\,1,\,2$. Is this right?


Help with Limit: $\lim_{n \to \infty} \frac{(2 n)! (n)^n}{n! (2 n)^{2 n}}$

Honestly, I am just plain stuck, I have been hitting my head against it for $2$ days straight. I know the solution should be $2^{-2}$ but...  Help would be appreciated. If anyone has a Wolfram Alpha PRO account I am sure that thing churns out the solution as it is something quite basic I just don't see it and its driving me crazy.  Edit: Stacks seemed to correct my formating from this sloppy one "Limit[(2 n)! n^n (E^n/(n! (2 n)^(2 n))), n -> Infinity]" $\displaystyle\lim_{n \to \infty} \frac{(2 n)! e^n (n)^n}{n! (2 n)^{2 n}}$  to this one $\displaystyle\lim_{n \to \infty} \frac{(2 n)! (n)^n}{n! (2 n)^{2 n}}$ somewhere dropping the $e^n$ term. I should have learned to propperly use latex in stackexchange first.


Stack Exchange doesn't allow me to answer protected questions because I gave away earned rep in bounties

I noticed that I can't answer protected questions. I don't want to actually, but it says:        It was , but I also didn't have an ability to answer other protected questions.  I earned 270 reputation points + 100 reputation point bonus. Then I  350 reputation points as a bounty. Then I earned 59 reputation points. Today I started another bounty (50 reputation points), etc – I offered 4 bounties with total 500 rep.  Despite the fact I started from the association bonus, I must have an ability to answer protected questions, as I earned reputation points here. But offered them as bounties.    I now have enough reputation points, but I would like it to be fixed, because I like offering bounties very much.  I would like system to check for my bounties when it checks if I can answer protected question.


How to count a word covering both triple and double word cells?

In my game I managed to produce a word womanizers which covers both "double word" and "triple word" squares. Should I myltiply final count by 2, 3 or 6?


Is there a library (or something similar) available for optics including e.g. convex and concave lenses? I fount  but it seems that this is not available as an official library …


Is this study stating red algae reduces cold virus by 92% believable?

I was using this spray meant to hasten recovery from the common cold. , sponsored by the pharmaceutical company that produces the spray, stated it reduced virus by 92%, and so shortens the duration of the common cold.  Meanwhile a doctor told me that these kinds of things don't work.  Does someone have some perspective on this? Is this a believable study? Was it well designed, and has it been duplicated?   If so, why wouldn't the pharmaceutical produced a certified and expensive drug instead of a no-prescription drug?


Is it possible to restore windows 10 from empty hard drive if plenty of system restore points saved?

Apparently my hard drive was wiped so I lost everything. I don't know if this is possible, but would the system restore points I had saved be in some other partition that I would be able to boot into? I am trying to get as much data back as possible. So if this is possible how would I restore my hard drive using the system restore points?


I have a big database that I need to extract all primary keys and foreign keys from each table.  I have pgAdmin III.   Is there a way to do this automatically and not go over each table manually?


I am not looking for explanations of why "I seen it" is wrong (though with sight there's an unfair grammatical burden that doesn't impact the other senses, whose past tense and past participle are the same - hear, heard, heard... feel, felt, felt... et cetera).   I want to know from the snoots here: in which circumstances might you actually say "I seen it."?  By way of explanation: my work sometimes takes me to places, and to people, where and to whom "I have seen it" would stand out as strange. So do I conform (let me hear you descriptivists!) or do I stand out (shout it out prescriptivists)?     Okay, I'm adding to my question here because there's been some negative feedback (some even calling the question "dumb"). I think it's a valid sociolinguistic question, not just one about what is said in certain dialects or which dialects use a certain expression. It's related to the issue of prestige (regular and covert), code switching, and perhaps a kind of circumstantial inversion of class aspiration.   That is, are there circumstances when you (fellow ELU members) might want to use restricted, rather than elaborated, code. Many - as evidenced by the most popular answer - flatly say "never." Others appear game to explore the idea, and there are some interesting answers that do indeed address my question.  I've chosen what I myself perceive as a fairly crass example (at least in my own speech community), one that seems to divide the educated from the uneducated. I realize this is not necessarily the case in all English-speaking regions, but it is in mine. I've chosen this because I found myself contemplating whether I myself would ever find it somehow useful to use it. To be honest, I don't think I could use it without feeling it was terribly affected.   I know it's incorrect grammatically. That doesn't mean it has no currency.   And I will not be offended if anyone considers the question crass by association (with the utterance at issue) or unenlightening and therefore chooses to simply ignore it and move on to another question.


"Would you like to automatically move this discussion to chat?" should have Yes/No

I saw this in the comments on my latest question:     Please avoid extended discussions in comments. Would you like to automatically move this discussion to chat?   Clicking the second sentence starts a new chat automatically, and this I didn't want to do.  We need a YES/NO option.


I'm new in linux, Today I've logged in to my server and found that my 2TB drive is 95% full, which sounds incredible, and all services are down, the only access I have right now is SSH, I did try to find where are this files using df -H  it show me in: /dev/vda1 , but going trough all folders will take ages.  how can I find easily where are the files and what causes the issue?


I am working on an animation where my character is a donut that spins to move like a wheel. I want to make it that the animation makes the donut spin perfectly and it loops perfectly. However when I attempt to make the animation, it always rotates 360 degrees but then at the end of the animation is comes to a slow halt. I don't want this. I want it to be forever traveling at the same speed so the loop is seamless. I am fairly new to this so help would be appreciated thanks.


Why does the TCP handling mechanism in the OS wait for an ACK from client before sending

Im observing the below behavor in a TCP connection between a server application and a client which run on two different red hat machines.  Example 1   Client acks everything until now (ACK with WND = 1424) Server sends 296 bytes to TCP layer and it is sent to the client(PUSH/ACK) Server sends 296 bytes to TCP layer and it is sent to the client(PUSH/ACK) Server sends 296 bytes to TCP layer and it is sent to the client(PUSH/ACK) Server sends/tries to send 239 bytes to TCP layer but: either one of the following two happens   the OS waits ~30ms until ACK from client is received before sending these bytes (this x bytes send will be referred as delayed message below) the tcp send call returns EWOULDBLOUCK or EAGAIN (I think this is not possible because 239+239+239+239 < 1424. Please correct me if I'm wrong    Example 2   Client acks everything until now (ACK with WND=1424) Server sends 239 bytes to TCP layer and it is sent to the client  Server sends/tries to send 239 bytes to TCP layer and one of the two things in the above happens   The problem I want to understand is why the server application or the OS waits until the ACK when window size for the client is big enough? Is this something I can tune in the OS level. Can I force server to send all bytes until the window of the client is filled?  As per my understanding there are two possible reasons   Server application does not pass the 'delayed message' to TCP level becuase the send system call returned EWOULDBLOUCK or EAGAIN.  Application does pass the message to TCP layer, but the operating system does not send it until an ACK from the client is received.   In all the delayed message scenarios, there is an ACK from the client before the SEND of the delayed message. Also the working logic of the application suggests that it does pass the message to the TCP layer.  Can you please suggest where I should focus on the troubleshooting of this.    Is it some OS level setting I can set in either the client or server side Is this somehow a fault in the application server? Am I wrong in assuming OS doesn't return EWOULDBLOCK until messages fill up the window


What (beside tags) makes a question appear on the front page?

Sometimes I get questions on my Stack Overflow front page, and I don't understand why. I mainly use the site in the , tags, with some light  activity added recently.   Today, I've got plenty of Android/Java questions on the front page, but also some that I just don't understand. For instance, , and . One is tagged with , the other with . I've never used these tags, so what makes them appear?  I know about the , but mine doesn't show anything related. I even browsed my profile's tag listing, but it turns out I've never asked or answered a single question for any of the three.  So my question is, why are they there? I don't browse -related tags, and I don't use  at all, so no action there either. It can't be based on being a "popular" question, because they both have zero votes and low views (at this time).   The questions aren't even topically related to my main tags as far as I can tell. Is there some sort of question scanning algorithm that lumps things together even with differing tags?


Is there a way to kill a specific thread with Python? I have a thread running a function that is a loop and it is interfering with other parts of the program. I need to kill it when a certain function is started, is there a way to do this?


I am a beginner programmer. I wrote the following code to copy the one string into other, using pointers. But I am not getting the output. The compiler says segmentation fault. I have gone over and over the program, but to no avail. I am not able to locate the fault, and how to fix it. It would be hard to believe but I have been stuck for almost 2 hours now. Any help is greatly appreciated.  #include<stdio.h>  char *copy(char*, char*);  int main() {     char *str1 = "avanti";     char *str2 = "ujj";      printf("%s\n", str1);      char *result = copy(str1, str2);      printf("%s", result); }  char *copy(char *str1, char *str2){     int i=0;     while (*(str2+i) != '\0') {         *(str1+i) = *(str2+i);         i++;     }      *(str1+i) = '\0';     return str1; }


ShellExecuteEx code 31 error any time I try to launch an EXE, how to find problematic driver?

I don't know if this is the right forum for this question, so please direct me elsewhere if needed. I am having a new issue launching .exe files. I keep receiving the following error: ShellExecuteEx failed; code 31. A device attached to the system is not functioning.  Specifically, I have recently tried to launch the following EXE and get that error: uninstall_flash_player.exe  R-3.6.3-win.exe  Rtools35.exe These are all downloaded from legit sources (Flash remover from Adobe website; R packages from R-CRAN). I've restarted my computer a million times and I don't have any external hard drives plugged in. When I right-click and Run as Administrator, it still says gives the error box, "A device attached to the system is not functioning." Based on , it looks like it is a driver issue, but I am not sure how to find out what driver is the culprit. Windows 10, ASUS TUF, laptop is about 2 yrs old, issue just started a couple weeks ago (noticed it when I tried to uninstall Flash and just ignored it... now it's an issue I can't ignore) Update I restarted in safe mode, dropped the User Account Control (UAC) settings down to the lowest level, and this resolves the issues. I can run the EXE files and I can run Command Prompt as Administrator in non-safe mode. I am not sure why this fixes things, as my account already is sent to Administrator. In the past, there would just be a pop-up window that said, "hey, you're about to make admin changes, is that ok?" So, I don't know what has changed. I then changed the UAC settings back to the default. Following @BenN's question in the comments, I ran reg query HKLM\SOFTWARE\Microsoft\Windows\CurrentVersion\Policies\Explorer in a non-elevated command prompt window, and this is the result, but I don't know what it means.


Translate spanish characters to english for field values

I have a requirement to translate few predetermined spanish characters to english in field values of different custom objects. I have tried to create a generic code. can someone please let me know where it fails to give desired output?  Apex class snippet:  public static String translate(String str) {   M= new Map<String,String>{'á'=>'a', 'é'=>'e' ,'í'=>'i', 'ó'=>'o', 'ú'=>'u', 'ü'=>'u', 'ñ'=>'n'};    for (String key: M.keyset())//iterate over keyset   {     str.replace(key,M.get(key));//Get CORR Value   }    return str;//english }


Is traffic coming from URL shorteners treated as direct?

Traffic coming form shortened URLs like bit.ly, do they show up in Google Analytics as direct or do they keep their real referrer?  Ex.: if someone types in a bit.ly link it counts as direct, but if someone clicks a bit.ly link from Twitter, it counts as referral traffic from Twitter?


Combinatorics, choosing 3 elements from 100, such that largest bigger than the product

In how many ways can we pick three different numbers out of the group                                                   1,2,3,...,100   such that the largest number is larger than the product of the two smaller ones? (The order in which we pick the numbers does not matter.) Please answer without any computer programming or algorithms. Pure math only


How would I differentiate $\sin{x}^{\cos{x}}?$

How can I differentiate $\displaystyle \sin{x}^{\cos{x}}$? I know the power rule will not work in this case, but logarithmic differentiation would. I'm not sure how to start the problem though and I'm not too comfortable with logarithmic differentiation.


Transfer file via SSH from server back to client

I am logged to remote server via ssh (linux) or via putty(windows). I want to copy file back to my origin machine from remote bash prompt (because of convenience). I know I can launch FileZilla or WinSCP at my machine and copy files, but I would like to know how to do that from remote bash prompt.  I know I can copy files via pscp using another ssh link:  pscp server.file localuser@local:/local_path   But this is impossible to use if client does not run a openssh server.  I see that my server has some variables like SSH_CLIENT, SSH_CONNECTION etc. Is it possible to use this information to craft a command like this?  copy_from_server server.file local.file   Where server.file is file located on the server (local to bash prompt where copy_from_server runs) and local.file is destination on client machine where file should be copied.  I would like a solution that works for windows and linux but I am also open to solutions that work on linux only or on windows only.  EDIT: Similar questions:


How to add an ssh key from other computer to my Ubuntu server

how can I add an SSH-key generated from a computer of a friend to my server?  Currently I don't have access to his computer he just sent me his SSH key.


I'm really confused about the pronunciation of the letter "a". Why is there a difference when it is used in a sentence and when "a" is single? When it is single, we read it like dwelling on it, like /eɪ/. On the contrary, in a sentence, it sounds interruptedly. What's the reason?


I have an array with these values.   $MyArray = array('2','4','4','4','2','2','0','0','0','0','4');   I want do an "array group by" (like in MySql) to only have one occurence of values. I expect something like this  $AnotherArray = array('2','4','0');


how to prove the following inequality by using real analysis

how to prove this inequality by real anlysis  $\frac{|x+y|}{1+|x+y|} \leq \frac{|x|}{1+|x|} + \frac{|y|}{1+|y|}$  I finally came with the following inequality. but I dont know what to do after that  $\frac{|x+y|}{1+|x+y|} \leq \frac{|x|}{1+|x+y|} + \frac{|y|}{1+|x+y|}$


I'd like to make a diagram representing a sum of arrows.  I'm not really familiar with tikz, so I was wondering if this was something doable. The first idea I had is something like this:  \documentclass{article} \usepackage[utf8]{inputenc} \begin{document} \begin{tikzpicture}[] \draw[->,thick] (0,0) -- (0:1cm) node[inner sep=0pt, outer sep=0pt] (a) {}; \draw[->,thick] (a.50) -- (50:1cm) node[inner sep=0pt, outer sep=0pt] (c) {}; \draw[->,thick] (c.90) -- (90:1cm) node[inner sep=0pt, outer sep=0pt] (d) {}; \draw[->,thick] (d.130) -- (130:1cm) node[inner sep=0pt, outer sep=0pt] (e) {}; \draw[->,thick] (e.160) -- (160:1cm) node[inner sep=0pt, outer sep=0pt] (f) {}; \end{tikzpicture} \end{document}   I have two problems :  First, the arrows are not coming out with the (same) right length.  Second, I will eventually have to draw a large number of arrows with arbitrary angles. I was wondering if there was a way to write a loop that would automatically draw the arrows given a set of angles.


Should a comma ALWAYS come before any type of quote?

I am finishing up an essay, and my teacher has marked on my essay that there should be a comma before every set of quotation marks.   I had commas where I deemed suitable, but in some instances I find that the use of a comma would make the sentence sound really weird.   For example, sentences in the form of     All morning, Adam "avoided saying anything to Bob that required a form of address", referring to him only as "him", or "the kid".    To me, it sounds weird to have it become     All morning, Adam, "avoided saying anything to Bob that required a form of address", referring to him only as, "him", or, "the kid".    Can someone please explain to me whether I should use commas in places demonstrated above, and the general rule for this?  Thanks!  Edit: I specifically am looking for the answer of whether there should be commas before quotes that are integrated into the sentence, where the quote directly flows from the introductory text.


Simplest way to send one-line mail out via command line using gmail?

Using Raspbian and Ubunntu 16.04 LTS so need a generic Linux solution.  Requirement is simple:  I need a way to send one-line email messages from the command line.  I have set up a gmail account just for this particular Rpi3, with the address of rpi3abc@gmail.com - with no 2FA  So now I need to be able to send one-line mail messages from anywhere (including cron) without user intervention.    I also would like it to be able to send text files; basically, anything from stdin.


For how many pairs of positive integers n and m is the statement $mn - 8m + 6n =0$ true?

Each interior angle of a regular polygon with $n$ sides is $\frac{3}{4}$   of each interior angle of a second regular polygon with $m$ sides.      How many pairs of positive integers $n$ and $m$ are there for which this   statement is true?   $\frac{(n-2)*180}{n}$ is the value of one interior angle for a polygon with $n$ sides.  Therefore $\frac{(n-2)*180}{n} =\frac{3(m-2)*180}{4m}$ and $mn - 8m + 6n =0$  For how many pairs of positive integers $n$ and $m$ is the statement $mn - 8m + 6n =0$ true?


How to define numbering for figures and tables?

I am writing a document with several figures with subsections numbers in the 2.1, 2.2, etc. format. I would like to number the figures in each subsection with a 3 digit format, for example: Figure 2.1.1, Figure 2.1.2, Figure 2.2.1, etc. How do I go about doing this? I am very new to latex.


A new art form has captured the world's attention: the reconstruction of past personalities based on their works and historical records. When the Richard Strauss, composer of such works as Also Sprach Zarathustra [the theme music at the beginning of "2001: A Space Odyssey"!] is resurrected, he undergoes a difficult period of adjustment. Who is he, after all, and what use should he make of this new life? Eventually he gets down to work, and feverishly composes a new symphony that he is sure will be his best. The world is fascinated and it's a full house at the premiere. But as Strauss conducts his symphony, he is struck by its banality. He realizes that he has composed nothing truly new, but has combined themes and ideas from his older works. The applause, however, is deafening. As Strauss turns to face the audience, he realizes that the applause is not for him, but for the artist who reconstructed him.  I am not at all sure of the date of this short story, which I read in English in an anthology. It could date from the 70s or as late as the 00s.


How does Drupal know when to run an update script?

How does Drupal 8 know what module needs updating and to what version he needs to update?  I have build a module and I'm trying to update it (adding a table). I implemented a update hook numbered 8001, which is the first update, but when I go to update.php Drupal does not see any update for my module.  I expect there must be a place in my module where I can define the current version of my module and another place in the database where Drupal stores the latest installed update of my module. (I need this for debugging the update script later on.)


So my Lenovo G50 is running as standard with 4 GB RAM. I have got the idea to make an upgrade and when I have Ubuntu on the Lenovo G50 I was thinking this was the right place.  How many RAM does Ubuntu supports?  I have found this:


How to find limit $\lim_{n\to \infty}\left[(n+1)\int_{0}^{1}x^n\ln(x+1)dx\right]$

How to find this limit;  $$\lim_{n\to \infty}\left[(n+1)\int_{0}^{1}x^n\ln(x+1)dx\right]$$  What techniques can I use here? Thanks for reading and help.  This question was asked in  2008.


Are all prime numbers greater than 2 odd?   I wasn't allowed to assume this was true.   AFSOC that there exists an even prime $n$. Then by definition of even, $n = 2q$, where $q$ is a positive integer. But if $n$ is even, it is divisible by $2$, hence that contradicts $n$'s prime-ness. QED.   What? Is there some wacky prime that can't be assumed odd?


How could "this character" come back to life without becoming a Vampire at the end of Stardust Crusaders?

At the end of JoJo season 3:  episode 48:   Dio Brando killed Joseph Joestar using 'The World'. Later on, Dio drained his blood entirely and left Joseph Joestar as a husk.  However, Jotaro was able to revive   Joseph by transferring blood from Dio's dead body into his Grand Dad. ()  What I'm trying to understand though is why   Joseph did not turn into an undead vampire.  Because I remember the episode before that, Dio had previously used his blood   to turn  into a vampire (the one with the "self-eating" Stand).


bash is stripping leading whitespace from variables

I'm new to bash (ksh only up until now). I'm struggling with whitespace being striped from variables.  I've read a number posts on bash's treatment of leading whitespace but I'm not sure how to correct it in my example.  echo "No space"         > x.tmp echo "     Some space" >> x.tmp cat x.tmp cat x.tmp | while read line do    echo "$line" >> y.tmp done cat y.tmp   Output:  No space      Some space No space Some space   What do I need to do to preserve the whitespace?  Thanks.


If a group is the union of two subgroups, is one subgroup the group itself?

"Let $G$ be a group, and suppose $G=H \cup K$, where $H$ and $K$ are subgroups.  Show that either $H=G$ or $K=G$."  Let $h \in H$ and $k \in K$.  Then $hk \in H$ or $hk \in K$ (since every element of $G$ is in either $H$ or $K$).  If $hk=h'$ for some $h' \in H$, then $k=h^{-1}h'$, so $k \in H$.  If $hk=k'$ for some $k' \in K$, then $h=k'k^{-1}$ so that $h \in K$.  If for all $h \in H$ we have $h \in K$, or if for all $k \in K$ we have $k \in H$, then $H \subseteq K$ or $K \subseteq H$.  Then since $G=H \cup K$, we must have either $H=G$ or $K=G$.  I'm not sure if the first paragraph of my 'proof' implies the second.  I've shown that for arbitrary $h \in H$, $h \in H$ and possibly $h \in K$, and similar for $k \in K$.  I don't know how to wrap it up (or perhaps this route won't lead anywhere at all).  If this way won't work, I'd just like a hint on a new direction to take.  Thanks.


Advice on applying for Economics graduate programs with a low GRE

I took the GRE in August and scored a 301 and took it recently again and scored a 308. My field of work is primarily in Behavioural Economics so I plan on applying to specialized and general Economics grad school programs. I have a strong profile with internships in various organizations within my field and outside it as well as several publications and a good CGPA.   My questions are:    What are my chances of getting into good/top grad school programs in the U.S/UK?  Should I consider applying to places outside of the US that don't require the score at all?    Thanks in advance!


I can't find .minecraft and I want to use a resource pack. Help?


difficulties in proving Rouche's theorem

This problem came from Schaum's complex variable p.156     Suppose $f(x)$ and $(g)$ are analytic inside and on a simple closed curve $C$ and suppose $|g(z)|\lt |f(z)|$ on $C$. Then $f(z)+g(z)$ and $f(z)$ have the same number of zeros inside $C$.   Here is the proof:     Let $F(z)=\frac{g(z)}{f(z)}$, or briefly $g=fF$. then, if $N_1$ and $N_2$ are the number of zeros inside $C$ of $f+g$ and $f$, respectively, we have by Argument Theorem, using the fact that these function have no poles inside C, $$N_1=\frac1{2\pi i}∮\frac{f'+g'}{f+g}dz$$ $$N_2=\frac{1}{2\pi i}∮\frac{f'}fdz$$   then$$N_1-N_2=\frac 1{2\pi i}∮\frac{f'+f'F+fF'}{f+fF}dz-\frac 1{2\pi i}∮\frac{f'}{f}dz$$$$=\frac 1{2\pi i}∮\frac{f'(1+F)+fF'}{f(1+F)}dz-\frac 1{2\pi i}∮\frac{f'}{f}dz$$$$=\frac 1{2\pi i}∮\left\{\frac{f'}{f}+\frac{F'}{1+F}\right\}dz-\frac 1{2\pi i}∮\frac{f'}{f}dz=∮\frac{F'}{1+F}dz$$$$=\frac 1{2\pi i}∮F'(1-F+F^2-F^3+...)dz=0$$      using the given fact that $|F|\lt 1$ on $C$ so that the series is uniformly convergent on $C$ and term by term integration yields the value zero. Thus, $N_1=N_2$ as required.   I don't understand the last step that why it yields to zero.  I also don't understand the wiki version.


Mathematical Induction Question About A Basis Step

Use mathematical induction to show that:  $1^3 + 3^3 + 5^3 + ... + (2n + 1)^3 = (n+1)^2(2n^2+4n+1)$ whenever $n$ is a positive integer.  I am able to solve this problem, but the thing that confuses me on this is the Basis Step.  P(1): $(2(1) + 1)^3$ $\neq$ $4(7)$, does this mean that this problem can not be proved using mathematical induction, or am I missing something? Thanks.


Prove that if the equation $x^{2} \equiv a\pmod{pq}$ has any solutions, then it has four solutions.

Suppose $n = pq$ with $p$ and $q$ distinct odd primes.   Suppose that $\gcd(a,pq)=1$. Prove that if the equation $x^{2} \equiv a\pmod n$ has any solutions, then it has four solutions.   Proof: Suppose $n = pq$ with $p$ and $q$ distinct odd primes and that gcd($a,pq$) = 1. Let us have the equation $x^{2} \equiv a\pmod n$. Then, $x^{2} \equiv a$ (mod $pq$), $p \not = q$. By definition, we can separate the equation into two equations such that $y^{2} \equiv a \equiv b$ (mod $p$) and $z^{2} \equiv a \equiv c$ (mod $q$). Let $g_{p}$ be a primitive root modulo $p$ and $g_{q}$ be a primitive root modulo $q$. Then, $b$ is equal to some power of $g_{p}$ and $c$ is equal to some power of $g_{q}$. With the fact that $b$ has a square root modulo $p$ (i.e. $r^{2} \equiv b$(mod $\ p)$) and $c$ has a square root modulo $q$ (i.e. $t^{2} \equiv c$(mod $\ q)$), there is an even power of $g_{p}$ and of $g_{q}$ such that $b = g_{p}^{2k_{1}}$(mod $\ p)$ and $c = g_{q}^{2k_{2}}$(mod $\ q)$ for some $k_{1}, k_{2} \in Z$. By computing, we have the following:  $r^{2} \equiv b$(mod $\ p)$       $\equiv b^{(p + 1) / 2}($mod $\ p)$       $\equiv (g_{p}^{2k_{1}})^{(p + 1) / 2}($mod $\ p)$       $\equiv (g_{p}^{p + 1})^{k_{1}}($mod $\ p)$       $\equiv g_{p}^{2k_{1} + (p - 1)k_{1}}($mod $\ p)$       $\equiv b \cdot g_{p}^{(p - 1)k_{1}}($mod $\ p)$       $\equiv b$ and $t^{2} \equiv c$(mod $\ q)$        $\equiv c^{(q + 1) / 2}($mod $\ q)$        $\equiv (g_{q}^{2k_{2}})^{(q + 1) / 2}($mod $\ q)$        $\equiv (g_{q}^{q + 1})^{k_{2}}($mod $\ q)$        $\equiv g_{q}^{2k_{2} + (q - 1)k_{2}}($mod $\ q)$        $\equiv c \cdot g_{q}^{(q - 1)k_{2}}($mod $\ q)$        $\equiv c$  Hence, $r$ is a square root of a modulo $p$ and $t$ is a square root of a modulo $q$, which means there are two solutions for each $p$ and $q$. Since $p \not = q \in \mathbb{Z}_{n}$, we have isomorphism such that $\mathbb{Z}_{n} \simeq \mathbb{Z}_{p} \cdot \mathbb{Z}_{q}$. Therefore, if the equation $x^{2} \equiv a$ (mod $n$) has any solutions, it must have four solutions. $\blacklozenge$  What do you think about the proof I wrote?


Buck Rogers episode with a "OMG humans ate MEAT!" scene

What I'm looking for is which episode of this show has a scene I remember.  Buck and a friend crash their fighters in a desert planet. They survive unhurt, look around and the friend says there's no civilization around and if they can't call help fast they'll starve. Buck points at a small animal and says "no we won't". The friend is horrified that people used to eat animals in the 20th century but ends up eating the meat along with Buck out of necessity. This scene establishes that 25th century society is vegetarian.   I asked this same question in TVTropes' YKTS sction, but didn't get a definite answer.


Getting Null pointer exception while running the below script using Selenium WebDriver

public class TestBase {     public static WebDriver driver = null;     public static Properties prop = null;     public TestBase() {         try {             prop = new Properties();             FileInputStream ip = new FileInputStream("C:\\seleniumFolder\\SampleMavenProject\\src\\main\\java\\com\\crm\\qa\\config\\config.properties");             prop.load(ip);         } catch (FileNotFoundException e) {             e.printStackTrace();         } catch (IOException e) {             e.printStackTrace();         }     }     public static void initialization() {         String browsername = prop.getProperty("browser");         if (browsername.equals("chrome")) {             System.setProperty("webdriver.chrome.driver", "C:\\seleniumFolder\\chromedriver.exe ");             driver = new ChromeDriver();         }         driver.manage().window().maximize();         driver.manage().deleteAllCookies();         driver.manage().timeouts().pageLoadTimeout(TestUtil.PAGE_LOAD_TIMEOUT, TimeUnit.SECONDS);         driver.manage().timeouts().implicitlyWait(TestUtil.IMPLICIT_WAIT, TimeUnit.SECONDS);         driver.get(prop.getProperty("url"));     } }


Must execute "sudo su" and then do apt-get update/upgrade/install, prefacing with sudo doesn't work

In order to get the apt-get update/upgrade/install commands to work, I have added proxy information to my /etc/environment file. For example:  http_proxy="http://proxy-chain.acmewidgets.com:8080/"    https_proxy="https://proxy-chain.acmewidgets.com:8080/"     ftp_proxy="ftp://proxy-chain.acmewidgets.com:8080/"     socks_proxy="socks://proxy-chain.acmewidgets.com:8080/"   Then, and this is important for my setup (not sure why - that is my question), I have to enter super user mode in order to get apt-get  to work. Like I said, I'm not sure why, but simply prefacing the aforementioned apt-get commands with sudo does not work for me. For example, when I do sudo apt-get update, the terminal window hangs like so:  somedude@ACME-WIDGETS-03:~$ sudo apt-get update  0% [Connecting to us.archive.ubuntu.com (91.189.91.13)] [Connecting to security   What works is entering sudo su at the command line and then running the apt-get commands WITHOUT prefacing with sudo. I have to do this even if I am working in a super user terminal (opened by executing sudo gnome-terminal). Until I issue that sudo su command at the prompt, the proxy settings in /etc/environment are not seen. I checked this by doing echo $http_proxy before and after the su; before: nothing came back, after: what was set in /etc/environment came back.  Not a big deal, because I am able to get my updates and do my installations; but the idea with Ubuntu is to use sudo so that you don't do damage  accidentally while in super user mode.  So what is going on do you think?  Thanks.


What is the meaning when we say something is at the higher potential and the other is at lower and wht is the direction of flow of charge?

Electric potential is defined as the work done in bringing per unit positive charge from infinity to a point in the electric field of some other charge.  let me explain what i actually want to ask. consider a battery   as the two electrodes are connected electrons start to flow from the right part towards the left.since electrons are moving the right part is at higher potential and the left at lower.but what actually does we mean by potential at right part and at the left one.


How to connect with a specific IP in agar.io?

I wanted to play agar.io with my friend. He gave me his server IP and I tried to connect with it through the Web Console:  connect("ws://" + prompt("Server IP", "XXX.XXX.XXX.XXX:XXXX")); void 0;   But after prompting this script, console says  "Connecting to ws://37.187.163.240:1502" socket open TypeError: b is undefined   What's wrong with this script? Are there any ways to play together?


Is there a Linear Transformation $T : R^5 \rightarrow R^4 $ that its $KerT$ is $KerT = \{( x,y,z,t,w) \in R^5 | x = 2y ,and, z = 2t = 3w\}$  Well, I tried to prove that by first saying : $KerT = \{2y,y,2t,t,w\}$ and $x=2,y=1,z=6,t=3,w=2$ Thus  $KerT = Sp\{2,1,6,3,2\} $Thus $dimKerT = 1 $  Well, to show that it just a linear transformation from $R^5$ to $R^4$ with that given $KerT$ I need to first find a base in $R^5$, so I did:   $B = \{(2,1,6,3,2),(0,1,0,0,0),(0,0,1,0,0),(0,0,0,1,0),(0,0,0,0,1)\}$ So B is a base in R^5 now.  Well, now it's still not enough so I tried to define $ImT$ and use $ImT = \{T(v1),...,T(v_n)\}$ to prove it's linear transformation. So I took ImT like that  $T(2,1,6,3,2) = (0,0,0,0,0)$ It's obviously true because $Ker(2,1,6,3,2)= (0,0,0,0,0)$ And then, defining: $T(0,1,0,0,0) = (1,1,1,1,1)$  $T(0,0,1,0,0) = (2,4,5,6,7)$  $T(0,0,0,1,0) = (3,5,6,7,8)$  $T(0,0,0,0,1) = (4,6,7,8,9)$  Does it prove that $T : R^5 \rightarrow R^4 $ is a Linear Transformation when $KerT = \{( x,y,z,t,w) \in R^5 | x = 2y ,and, z = 2t = 3w\}$?  If not, is it even possible to prove it?


java.net.URLEncoder will encode a single whitespace with +.  scala> val encodedSpace = URLEncoder.encode(" ", "UTF-8") encodedSpace: String = +   However, per this W-3 , shouldn't it be encoded with %20?


I've trying to solve this problem. I just need someone to set me on the right path to solving it.  Given that $$(1+x)^n = nC0 + nC1x+ nC2x^2 + nC3x^3 + \cdots + nCnx^n$$  for all $n$ belong to $\mathbb{Z}^+$.    Now I should prove that $$nC1 + 2nC2 + 3nC3 + ... + n\cdot nCn = n \cdot 2^{n-1}$$ How do I prove this?


I'm trying to make a simple summation of an array of 10 numeric elements. I get a totally incorrect result, which only occurs with an array of certain values, otherwise works well.    var sum = 0; var values = [14, -1.4, -1.4, -1.4, -1.4, -1.4, -1.4, -1.4, -1.4, -1.4, -1.4]; for (var i = 0; i < values.length; i++) {   var v = values[i];   sum += v; } console.log(sum);     The expected result is 0, but I get oddly -2.22! At other times, I have achieved results with so many decimal places, which I had to round up. But in this case, with these numbers, that kind of bug is absurd.


Display files permissions in number format i.e "0755"?

Is there a way to get files/directories permissions in number format "0777" instead of "-rw--r--r" format?


On page 96 of the Monster Manual (Young Green Dragon), it's stated that:     On initiative count 20 (losing initiative ties), the dragon takes a lair action...   Does this mean the 20th round of combat (unlikely, as that would be a much easier way of saying it), does it only happen if the dragon rolls exactly 20, or does it happen every round as initiative passes down through 20?   It seems a crazily powerful thing to happen every round, or am I just being too nervous about killing my Starter Set players?


Can we require a deletion reason to be entered any time an OP deletes their post, question or answer?  I think this would help moderators (including 10k users) get answers when asked to explain a "why".


mysqli or PDO - what are the pros and cons?

In our place we're split between using mysqli and PDO for stuff like prepared statements and transaction support. Some projects use one, some the other. There is little realistic likelihood of us ever moving to another RDBMS.  I prefer PDO for the single reason that it allows named parameters for prepared statements, and as far as I am aware mysqli does not.  Are there any other pros and cons to choosing one over the other as a standard as we consolidate our projects to use just one approach?


Keeping text snippet central within a box

I am making a dynamic slide show.   I am trying to get some text that I assign dynamically to align itself centrally and vertically within a box.  So far, I have:  HTML
             Hello. This text needs to be:

         - left-aligned but
        - centered in the grey box
         - even if it changes
        - the center of the white box
           should equal center of grey one.
        CSS  .slide {   position:relative;   background-color: #ddd;   width: 300px;   height: 300px }  .content {   position: absolute;   top: 30%;   left: 15%;   background-color: #fff; }   OUTPUT    This doesn't work because if the text changes, it will no longer be central. Anyone have any ideas how to fix this?


Run a command for a specific amout of time

Is there a way to run a command for a specific amount of time and then kill it?  Example 1 :  I would like to play a song in cvlc for 1 minute and then stop. (song is longer than 1 min).  Example 2 :   I would like to run the command cmatrix for 30 seconds and then stop it.


He followed me into/to my home- meaning difference

He followed me into my home.   He followed me to my home.      What's the difference in their meaning?


I want to ask some funny things (humor questions) but I don't know where. Is there an appropriate Q&A site in Stack Exchange?   Maybe not only humor, but we all known memes. Why don't have a site about new science called "Memology"?


I am going to Find Finitely generated module with a submodule that's not finitely generated.please help me!


Changing control of an attacking or blocking creature mid-combat

I've happened upon a new scenario I didn't realise was possible: I attack or block with , and after blockers are declared, I use  or  to give the Jackal Pup to another player. I'd like to make sure I understand this interaction properly.  As far as I understand it:   Jackal Pup and the creature it's blocking or being blocked by still exchange damage as usual. It doesn't leave combat. Jackal Pup will deal a bunch of damage to whoever I gave it to. I can even hand Jackal Pup to the player blocking it or attacking me, and that will still hold true. (They'll then control two creatures who exchange combat damage with each other!) If a creature was declared attacking me (or my planeswalker), it is still doing so even after I block it with Jackal Pup and hand someone else control of it. If that creature has trample, the damage will go to me.   Do I understand this correctly? (These are some fun hijinks, if they work like they seem to.)


Would it be bad design (and unsafe) to put password guidelines next to a login box?

Different websites have different password requirements   Some are content with a combination of just lower case words  Some require a combination of lower case and upper case words Some require numbers in your password Some require special charecters   Now I have a number of different passwords modified to suit the website requirements but I often get mixed up about whether the password was      word@%(some numbers) or just word(some numbers)    and I end up often resetting my password or not even logging in.  Now my question is would be wrong or bad design to display the password guidelines next to the login screen ? I understand it might actually make it unsafe to an extent since it also gives guidelines to someone with malicious intent about how a password might be structured but is this a case where security trumps usability or what is the equitable balance between the two.  Edit: Please note that I am talking about the scenario of password guidelines being displayed when a person is trying to log in (having established an account) and not when he is trying to sign up ( I strongly believe password guidelines are very important then)


How to describe all normal subgroups of the dihedral group Dn?

The dihedral group consists of rotations and symmetries. But the symmetry group is a group only if n is even, thus the group of rotations is a normal subgroup of the dihedral group.   So how to describe this normal subgroup(rotations) and are there any other normal subgroups of the dihedral group?


How do I determine the maximum RAM installable in a Dell Inspiron 15R SE?

I'm looking for a new laptop and the  seems a pretty good fit for my requirements. However, I can't find the maximum RAM capacity anywhere in the spec. It seems Dell don't ship them with any more than 8GB, but how can I tell what I can extend that to after sale? I'm looking at the model with an Intel i7 3612QM which  ("dependent on memory type"). But I don't know enough to be sure if that's the only limiting factor.


How to avoid adding the asterisk to the last author in elsarticle.cls?

My article has two authors. The first one is the only corresponding author. Hence my LaTeX code for the authors is:  \documentclass[preprint,12pt]{elsarticle} \journal{elsarticle} \begin{document} \begin{frontmatter} \title{Title} \author{AuthorOne\corref{TheOnlyCorrespondingAuthor}} \ead{authorone@gmail.com} \author{AuthorTwo} \ead{authortwo@gmail.com} \cortext[TheOnlyCorrespondingAuthor]{Corresponding author} \end{frontmatter} \end{document}   The output is as follows:    However, as the above clips show, LaTeX automatically adds the asterisk to the last author. Why?  Can anyone solve the problem?  You'd better not to change the based setting in the original elsarticle.cls LaTeX template.


Users with default picture and grayed out name

There are some users who have a certain preset icon, and you can't access their profiles. For example the user that asked this question:   .  Why does this happen? Are they deleted?


Duplicating non primitive mesh with Python

I've created a mesh I want to duplicate using python with specifications for the new duplicate's coordinates. How do I do that?


1) I need to say the promotion will be invalid on December 6th and while we have not reached that date, the promotion will be valid. What should I say:     A) The promotion is valid up to December 5th.    B) The promotion is valid until December 5th.    C) The promotion is valid by December 5th.    I think only 'C' is correct here.   2) I need to say the promotion is valid from date ‘X’ to date ‘Y’. After the date ‘Y’ the promotion will be invalid. How shall I say it:     A) They have great promotion from January fifth, until January 8th up to 50% off.    B) They have great promotion from January fifth, up to January 8th up to 50% off.    For me both work here and have exactly identical meanings. Am I right?


Prove that ${n\choose 0}+{n+1\choose 1}+\dots +{n+k\choose k}={n+k+1\choose k}$

I’m looking for a hint to prove that both expressions are equivalent.


INBOX and ACHIEVEMENT button images not showing for my SO account. I tried it in chrome and firefox. They didn't show up on either of them. But they show on safari.    You can see in the above image that its empty. But actually there are buttons, better say invisible buttons.See below pic.     So, when i click on that empty space, the popup shows up. I don't understand why its not working with chrome.It happened today and never had such issue before. I like working on chrome or firefox. It's not a big deal with or with out those buttons.But i just want to know how to revert them.   Thanks,


pigeonhole principle: at least 1 match/hr for 75 hrs, at most 125 matches, then exactly 24 matches in some interval

This is for self-study. This question is from Rosen's "Discrete Mathematics And Its Applications", 6th edition.  An arm wrestler is the champion for a period of 75 hours. (Here, by an hour, we mean a period starting from an exact hour, such as 1 P.M., until the next hour.) The arm wrestler had at least one match an hour, but no more than 125 total matches.  1 - Show that there is a period of consecutive hours during which the arm wrestler had exactly 24 matches.  2 - Is the statement in the previous exercise true if 24 is replaced by  a) 2? b) 23? c) 25? d) 30?  My solution to part 1 is the following, based on Rosen's solution to a similar problem given as example in the text:  1 - If I consider $a_i$ to be the number of competitions until the $i^{th}$ hour, then, $1\leq a_1<a_2<\cdots<a_{75}\leq 125$, because there are no more than 75 hours and the total number of competitions is no more than 125. Now I will add 24 to all the terms of the above inequality: $25\leq a_1+24<a_2+24<\cdots<a_{75}+24\leq 149$.  There are 150 numbers $a_1,\cdots,a_{75},a_1+24,\cdots,a_{75}+24$. By the inequalities above, these numbers range from 1 to 149. Then, by the pigeonhole principle, at least two of them are equal (in a list of 150 integers ranging from 1 to 149, at least two are equal).  Because all the numbers $a_1,\cdots,a_{75}$ are distinct, and all numbers $a_1+24,\cdots,a_{75}+24$ are also distinct, it follows that $a_i = a_j + 24$ for some $i > j$. Therefore, from the $(j+1)^{th}$ hour to the $i^{th}$ hour, there were exactly 24 competitions.  Now, I will show the attempt at a solution for part 2:  2 - a) The same reasoning as above can be used:  $1\leq a_1<a_2<\cdots<a_{75}\leq 125$. Adding 2 to all terms:  $3\leq a_1 + 2<a_2 + 2<\cdots<a_{75} + 2\leq 127$  So, there are 150 numbers that range from 1 to 127. Therefore, by the pigeonhole principle, at least $\left \lceil \frac{150}{127} \right \rceil$ = 2 numbers must be equal. So, there is an $a_i = a_j + 2$. This guarantees that there is a period of consecutive hours during which there were exactly 2 competitions.  b) The same reasoning as above can be used:  $1\leq a_1<a_2<\cdots<a_{75}\leq 125$. Adding 23 to all terms:  $24\leq a_1 + 23<a_2 + 23<\cdots<a_{75} + 23\leq 148$  So, there are 150 numbers that range from 1 to 148. Therefore, by the pigeonhole principle, at least $\left \lceil \frac{150}{148} \right \rceil$ = 2 numbers must be equal. So, there is an $a_i = a_j + 23$. This guarantees that there is a period of consecutive hours during which there were exactly 23 competitions.  c) $1\leq a_1<a_2<\cdots<a_{75}\leq 125$. Adding 25 to all terms:  $26\leq a_1 + 25<a_2 + 25<\cdots<a_{75} + 25\leq 150$  In this case, there are 150 numbers that range from 1 to 150. So, there are not necessarily two equal numbers. Therefore, we can't conclude anything directly.  But it is possible to show that the statement is not true for 25, because an explicit counter-example (suggested below in the comments) can be found. Suppose the number of matches until each one of the 75 hours is, respectively: $\{1,2,\cdots,25,51,\cdots,75,101,\cdots,125\}$. Here, there are no pairs of numbers whose difference is 25.  d) $1\leq a_1<a_2<\cdots<a_{75}\leq 125$. Adding 30 to all terms:  $31\leq a_1 + 30<a_2 + 30<\cdots<a_{75} + 30\leq 155$  In this case, there are 150 numbers that range from 1 to 155. So, we can't apply the pigeonhole principle here, similarly to the above situation. It is not easy to find a counter-example in this case; I think that, for 30, the statement is always true (that is, there is always a period of consecutive hours during which there were exactly 30 matches). But I'm not sure how to prove it.  Edit: I think I found a way to prove it, based on the suggestion given by Lopsy; I've included it as an answer to this question.  Thank you in advance.


definite integral of the product of a power- and a Weibull-function

I am an engineering student who's basic math skills are struggling to solve the definite integral of the product of a power function with a Weibull function: $$\int_{v_1}^{v_2} A*v^{k+2}* e^{-(v/c)^k} dv$$ The function describes the power output of a wind turbine between wind speeds $v_1$ and $v_2$, both >0. $A$, $k$ and $c$ are constants, all >0. I did look at  but cannot make sense of the $\Gamma$ function with two arguments. Thanks a lot for any help, ideally with a step-by-step guide :-)


Is existential instantiation related to "Let x be ..."

I have a question about existential instantiation. So, I am familiar with statements like "Let $x$ be an integer" or "Let $x$ $\in$ $\mathbb{Z}$". These statements define $x$ to represent a particular, but arbitrarily chosen integer. My question is, are we doing a similar thing when we do existential instantion? For example, lets start with the existential statement $P$ = "There exists an integer $x$ such that $x^2 = 4$". When we do existential instantiation on $P$, are we saying "Let $a$ be an element of the set of integers that make $P$ true?"


Show that the set of sequences of value in $\mathbb{N}$ is equipotent with the set of sequences of value in {0,1}

I'm really stuck on this problem. I couldn't find an injection or bijection from $\mathbb{N}^\mathbb{N}$ to $2^\mathbb{N}$ in order to apple Schroder-Bernstein. Can anyone help me out with this? Thanks.


Filipino Citizen transiting through Istanbul

Hello I have a friend who is traveling form Manila to the Dominican Republic making a change of planes in Istanbul and Madrid. Does he need to get a visa to transit through Istanbul?


$$\vdash (( p → q) →  p) →  p$$ how would I go about solving this with no premises. to get the implication i know i need $$(p → q) →  p$$ as my first assumption but im stuck to where to go from there


I have an XML file, and i want to get the text from one tag, but if that text contain another tag to ignore it. For example :  <?xml version="1.0"?> <entries>   <entry accente="B" diacritice="B">     <sense class="0" value="B">       <definition>         <RegDef>Hello  <i>world.</i> Today is Saturday.</RegDef>       </definition>     </sense>   </entry>  </entries>   the output should be : "Hello world. Today is Saturday.  What is the best method to do this?


LED light bulb flickering in socket, incandescent works fine

I have a couple of outdoor light sockets with built in motion detectors. These seem to work as you'd expect with regular incandescent bulbs- you can set a timer for how long you want them to be on when motion is detected and they light up fine.  When replacing them with LED bulbs however they blink rapidly instead of staying on. I'm not talking about a 50hz buzz or whatever, they completely power off and on rapidly, almost like they are trying to strobe. The blinking is erratic, it will go for 10 seconds then go dark completely, then blink again for varying amounts of time. I see this same behavior with LED bulbs in both of the sockets, which are the same brand and model of motion detector outdoor light sockets.   The bulbs are Verbatim A19 6-Pack Warm White 3000K LED Bulb, Replaces 60W, Non-Dimmable 99072 if that matters.   I want to replace everything in the house with LED, but not sure how to make these two sockets work correctly. Suggestions?


Full-wave bridge rectifier with capacitor filter and ripple voltage

According to various sources, the ripple voltage of a full-wave bridge rectifier is   $$ V_r = \frac{V_s}{2}fCR $$  where \$V_s\$ is the peak of the input voltage source, \$f\$ is the frequency, \$C\$ is the capacitor and \$R\$ the resistor.  I have simulated this circuit on PSPICE, circuitlab, and built it in real life:   \$R\$ is \$4.7K\$ and \$C\$ is \$10 uF\$. Voltage source is sine wave with \$0 V\$ offset, \$5V\$ amplitude and \$40 Hz\$ frequency.  All 3 experiments give me a ripple voltage of approximately \$0.65V\$, but the formula gives me \$1.330 V\$ (twice as much).  What am I missing?


I'm trying to get a ball to go through in between the cup gear things shown in the screenshot below.   It seems that the collision box does not consider the cups. Yes, the ball fits and they are rotating in the right direction.  If there is already an answer to this, please link it.       If you have any questions about what is going on/ what the project is, feel free to ask.


What should be use virtual or new in c#? What will be criteria to select among them?

I am new to C# coding. I implemented following code and facing a warning.  class Base {     public static Base Getinstance() {         return new Base();     } }  class Derived : Base {    // getting warning Derived.getInstance()' hides inherited member    //'Base.getInstance()'. Use the new keyword if hiding was intended    public static Derived Getinstance() {         return new Derived();    } }   In order to remove the warning I have 2 options   use virtual in base class write new in derived class any other (please suggests if have anything else)   Which will be the right way to solve this warning?


Baking cloth simulation use only 20% of cpu ressources, how to get 100%?

Baking a cloth use only 20% of CPU, inactive process of cpu is 78%, is there a way to use those extra 78% ? Blender 2.75 Windows 10


Can I arrive before my German National Visa D is valid (e.g 2 weeks)?

I am an Australian, and we can travel in the Schengen Area for 3 months in 6 month period using the Schengen Visa Waiver program.  Can I arrive in the Germany on the Schengen Visa Waiver program two weeks before my National D Visa is valid?


Let's say I have a script that will be executed on various machines with root privileges, but I want to execute certain commands within that script without root.   Is that possible?


Evaluating $\lim_{n \to \infty}\frac{1}{n}(n!)^{\frac{1}{n}}$

I'm trying to find and prove the value of$$\lim_{n \to \infty}\frac{1}{n}(n!)^{\frac{1}{n}}$$  I was thinking that since $$\frac{1}{n}(n!)^{\frac{1}{n}} = \frac{1}{n} \left[ (1)^{\frac{1}{n}}(2)^{\frac{1}{n}}...(n)^{\frac{1}{n}}  \right]$$  and we know that  $$\lim_{n\to \infty}n^{\frac{1}{n}} = 1$$ and  $$k^{\frac{1}{n}} \leq  \ n^{\frac{1}{n}} \ \ \ \ \forall k \leq n$$  So $(n!)^{\frac{1}{n}} \leq 1 \ \forall n \ $* Then it is bounded. We also know that $\lim \frac{1}{n} =0$, therefore  $$\lim_{n \to \infty}\frac{1}{n}(n!)^{\frac{1}{n}} = 0 **$$   I'm pretty sure this line of reasoning is ok. Now proving it is another thing. Any suggestions?  *I realize now that this statement is not true, but that did not get me any closer to solving the problem. I do believe that it is bounded though.  **LOL, I don't believe this to be true anymore either, a wild guess tells me that the solution may be $\frac{1}{e}$