The fastest way to communicate the English language would be just having the camera point at letters. He explains that it would be too difficult to tell what the camera was pointing at. Since the limiting factor is the amount of discrete directions that the camera can point, why would you use hex over base 10 values to translate into letters? Instead of 16 directions, you would only have to discriminate between 10. You are already having to translate from the numeric representation to the letter representation anyway. I assume you would need either a delimiter or an agreed upon "word space" (each value will be padded with zeros if it uses less than the max word size).

In the movie Martian, why does Mark use Hexadecimal to communicate with NASA? Couldn't numerals from 0 to 9 sufficed for indicating the number corresponding to the alphabet?


In Harry Potter and the Half-Blood Prince, Professor Dumbledore was killed by Snape. But later he talked with Harry.  Did Dumbledore really die? Or not?

Most of this discussion involves events at the end of Harry Potter and the Deathly Hallows so if you haven't read that book and don't want spoilers, then stop reading right now.  Yes, now.  It's not clear whether limbo is something everyone moves through in Harry Potter when they die, but when Harry is killed, he not only ends up there, but Dumbledore is there, waiting for him.  Did Dumbledore wait for him all that time, in limbo, until Harry showed up?  Did he have any way of watching what Harry was doing in that time?  Or did he have a way to enter limbo when Harry did to meet him there?  And once Harry was gone, was Dumbledore able to move on, or would he be stuck there?


So I need to create a method which would take ints and return an array of length 3 with those three ints as they have been input.  This is what I have created, but it returns this [I@7852e922  public class IntsToArray {   public static int[] fill(int a, int b, int c){       int[] array = new int[3];       array[0] = a;       array[1] = b;       array[2] = c;       return (array);   }     public static void main(String[] args){         int a = Integer.parseInt(args[0]);         int b = Integer.parseInt(args[1]);         int c = Integer.parseInt(args[2]);         int[] array = fill(a, b, c);         System.out.println(array);     } }   What am I doing wrong?

In Java, arrays don't override toString(), so if you try to print one directly, you get the className + '@' + the hex of the  of the array, as defined by Object.toString():  int[] intArray = new int[] {1, 2, 3, 4, 5}; System.out.println(intArray);     // prints something like '[I@3343c8b3'   But usually, we'd actually want something more like [1, 2, 3, 4, 5]. What's the simplest way of doing that? Here are some example inputs and outputs:  // Array of primitives: int[] intArray = new int[] {1, 2, 3, 4, 5}; //output: [1, 2, 3, 4, 5]  // Array of object references: String[] strArray = new String[] {"John", "Mary", "Bob"}; //output: [John, Mary, Bob]


I need to find $$S = {2n\choose 1}^2 -2 {2n\choose 2}^2 + ... - 2n{2n\choose 2n}^2= \sum_{k=1}^{2n} k {2n\choose k}^2 (-1)^{k+1}$$, given $$\sum_{k=1}^{2n} k {2n\choose k} x^{k-1} = 2n(1+ x)^{2n -1}$$   Using $$-(1-x)^{2n} + 1 = \sum_{k=1}^{2n} {2n \choose k} (-1)^{k+1} x^k$$,  $$(1- (1-x)^{2n}) (2n (1+x)^{2n-1}) = \sum_{k=1}^{4n}x^k\sum_{r=0}^k {2n\choose r} (-1)^{r+1} (k - r) {2n \choose k-r}$$  LHS = $2n ( (1+x)^{2n - 1} -  (1-x)(1-x^2)^{2n-1}) = 2n((1+x)^{2n - 1} -  (1-x^2)^{2n-1} + x(1-x^2)^{2n -1})$  So coefficient of $x^{2n}$ on the LHS is $-2n{2n - 1\choose n} (-1)^n = -n{2n \choose n} (-1)^n$  Coefficient of $x^{2n}$ on the RHS,  $$2n \sum_{r=0}^{2n} {2n\choose r}^2 (-1)^{r+1} - S = - 2n{2n \choose n}(-1)^n - S$$  Equating the coefficient of both sides gives $$S = -n{2n \choose n} (-1)^n$$.  I would like to know different methods for doing this and similar problems as the method I used is cumbersome and prone to miscalculation.

How to deal with combinatoric interpretation (or just solving it in algebraic way) when we have $(-1)^i$ factor in our sum?  Example task:  Simplify the sum: $$ \sum_{i=0}^{k}(-1)^i i \binom{n}{i} \binom{n}{k-i} \text{ for } 0\le k \le n $$  For task without $(-1)^i$  $$ \sum_{i=0}^{k} i \binom{n}{i} \binom{n}{k-i} = n \binom{2 n-1}{k-1} $$ I can write that interpretation:    I have $n$ rabbits and $k$ slots Each rabbit can be in both slot of first type and second type slots of first type + second type = $k$ Lets double rabbits I choose one rabbit as an king and it will be also a rabbit to slot of first type so I need to choose $2n-1$ rabbit for $k-1$ slots  But I don't know how to deal with $(-1)^i$


I'm trying to have a bash script create a variable and have the variable persist in the terminal until the terminal closes (not permanently). I thought export was what I needed but it didn't work.  #!/bin/bash  export VARIABLE='this is a test'   Then run the script:  $ ./test.sh   Then in the same terminal:  $ echo "$VARIABLE"   But it produces a blank response.

I have multiple Amazon EC2 accounts and want to quickly be able to switch variables, such as $EC2_HOME, using a script.  I have have a shell script set up like this:  #!/bin/sh export EC2_HOME=/home/me/.ec2 echo $EC2_HOME   When I run the script I know that EC2_HOME is set, but I thought that using export would make the variable stick around after the script completed. It does not, as running echo $EC_HOME does not show anything.  I know this must be very rudimentary Linux scripting knowledge, but I don't know it. I tried looking for related questions without luck - so my apologies if this is a duplicate.


Say I want to visit somewhere like Osaka for 2 weeks, and am flexible on dates the whole year. My priority is the cheapest and most direct flight. I don't care about dates.  It obviously takes too much time to type and trial-and-error pairs of dates. How can I find out efficiently for free?   doesn't answer my question. You  to use .  ranges just for  one month, not the whole year.    shows the airlines with direct flights between OSA and the US. I checked Delta and JAL's route maps, and they have nothing direct between SFO and OSA.  (screenshot under) proves it does, but it doesn't advertise  what dates. These KAYAK searches  and  show direct flights.

I believe that the standard routes of carriers between two semi-major US cities always maintain the same route number (e.g. UA3271), and day of the week. I'm looking at planning travel for an interview, so dates are [currently] quite flexible (as in at least one month's range). Since that's the case, there are other constraints that go into my choice of flights. One would be the option to fly out of my home city, land in the interview location, conduct the interview, and fly out in the same day. I figure: if I can view the schedule for flights (i.e. routes) between the two cities, I can make an educated request for days of travel. Yes, I could likely work with the interview scheduler (and I will), but I'd like to be proactive in suggesting some dates to achieve my goal, as well as learn this skill for myself in the future. Thus:  Where can I view the daily routes and times for flights between two cities, on whatever rotating basis (e.g. day of the week) they may be on?


I was wondering if there was a method, or if its even feasible, to allow the original poster to increase a bounty?  In essence this equates to a larger enticement to get qualified answers. If the bounty is not enough to involve the experts capable of providing a high quality answer what would be?  Getting high quality answers, one would think, are more important than high quality questions, which in all honesty, most often lack depth and understanding (as a generalization) otherwise they most likely would not be posted.  I think we all hope that the concept of forum/community support sites has not run its course through our social landscape, but to continue the development of future contributors, greater involvement of the higher skilled should be a focus.  A status/points system such as SO, has been working, and hopefully will continue to do so. I can't even speak to the benefits I have reaped, which is why I ask the question. What more can entice high quality answers if the OP can not increase bounty awards?  UPDATE: This question in general has the same premise as the referenced duplicate, but the position as explained here in, is targeted at both improving answer quality and involving more highly skilled professionals. As such, this question expands the scope to the suggestion for the betterment of the issues mentioned.

I think it would be nice to be able to increase an active bounty. A user might initially offer 100 but if it doesn't get any new answers, then the user should have the option to increase it.


I'm using QGIS and trying to display point data from a CSV file.  I've added a vector layer with a shapefile of Canada.  Both the project CRS and the shapefile CRS are set to NAD83 / Statistics Canada Lambert.    The CSV file CRS is also set to NAD83 / Statistics Canada Lambert.  The points should appear somewhere in the province of Manitoba.  However, the points show up outside of the map.  As shown by the attribute table, the lat / long appears normal, but the points show up at the wrong location.  What I am doing wrong here?  I've tried to ensure that both CRS projections are the same.  I've also tried switching the x and y in the CSV import, but the points still continue to show up at the same location.  Here is the CSV file data:  -98.43936109999999,49.3958333,TCR1 -98.38749999999999,49.3505556,TCR2 -98.38666669999999,49.3630556,TCR3 -98.3791667,49.3277778,TCR4 -98.3697222,49.39777779999999,TCR5 -98.3605556,49.3361111,TCR6 -98.3363889,49.3902778,TCR7 -98.33138889999998,49.3844444,TCR8

I have two files with identical projections/CRS. Using both OTF on & off I cannot get them to overlap: one shapefile contains coastal polygons of Massachusetts, and the other shapefile contains coastal lines for MA.   +proj=laea +lat_0=45 +lon_0=-100 +x_0=0 +y_0=0 +a=6370997 +b=6370997 +units=m +no_defs   +proj=laea +lat_0=45 +lon_0=-100 +x_0=0 +y_0=0 +a=6370997 +b=6370997 +units=m +no_defs    however the extents are   xMin,yMin 2321544.64,258328.06 : xMax,yMax 2333464.74,277553.12   vs.   xMin,yMin -176.685,17.9108 : xMax,yMax -65.2246,71.3413   I've followed the steps in  , tried with OTF turned on & off: the layers still do not overlap.  EDIT:  I've saved the MA coast line SHP ( Layer > save as ) using each of the Layer CRS, Project CRS and Selected CRS options: the extent remains the same. As far as I can tell, the chosen projection (EPSG:2163) is a PCS, not a GCS.


I'm using Lyx and I have problem with equations. I would like to add label to equation, but somehow I can't add label if formula is in table or float. Ok, I can take them outside and then I can label them. But(!), then I can't move the equations to left. Tried everything.  The best would be, if I can keep equations in table, so I can adjust them easily. The result should be same as the last three equations with label.  /poor English

Is there a way possible to imitate the align environment for math mode commands, without having all writing being placed toward the center on the output page?  MWE:  \documentclass{article} \usepackage{mathtools}  \begin{document} \begin{align*} \cos\theta_1 \cos\theta_2-\sin\theta_1\sin\theta_2 &= \cos(\theta_1 +\theta_2) \\ \sin\theta_1 \cos\theta_2 + \cos\theta_1 \sin\theta_2 &= \sin(\theta_1+\theta_2) \end{align*}  \end{document}


I am Egyptian but living in Taiwan. I am travelling to USA for two weeks only and returning back to Taiwan. I am using two passports: Passport 1 has less than six months left to expiry but contains the valid USA visa, Passport 2 is a new one.  Does it pose any problem for me?

I have a valid B1/B2 US visa expiring about a year from now. The passport it's in expired a few years ago, and I recently got a new one.   The passport number does not match, but the national ID number, mentioned in both, does (it used to be the same as your national ID, but not anymore)  Can I travel to the US carrying both passports? Or is it asking for trouble? (I read a few years ago that it was possible, but that might have changed)  Should I just get a new visa to avoid potential complications?


I have just made a cheesecake, (not my first), but will admit that for me it is a bit of a guessing game to know when it is perfectly done.    I know that the sign is when the middle still jiggles, but how big of a middle?  Dime size, nickel size,  quarter size, or salad plate size?  Fortunately, luck was on my side and it turned out perfect, but not without worrying about its doneness!  Other than the "jiggle", is there any concrete way of knowing when it is done?  Is it possible to use a thermometer for the middle and what would the temperature be?  Luckily, even if a cheesecake is under or over done, it's still delicious, but when serving it to company, it an added bonus if it turns out perfect!  Any tips?

I'm baking a cake that shall be categorized as "light cheesecake". The recipe says when the top of the cake is firm, the cake is done. So I baked for an hour, opened the oven and found the top of the cake baked right, but when I cut up the cake the inside was too wet. So I had to bake for another 20min to get the inner texture right, but the top is dry already(and stiff after cooling). What have I done wrong?  My recipe: 33g flour, 75g yoghurt, 140g cream cheese, 50g whipping cream, 50g sugar, 2 eggs for an 6-inch pan. Baked in water bath, oven at 160 Celsius.


I have an object called 'Protocols' with 5 record types that will produce 5 types of documents. For each type, I need to track the number of documents that have previously been published, e.g. Protocol Lease #00001, Protocol Incident #00001, Protocol Return #0001, etc.  If each type was in a separate object, this could have been done through autonumber on record name. Not the case here.  It seems like custom metadata and custom settings cannot be updated with a trigger or process.  I am wondering if there is a way to create global variables that can be updated programatically?  Any ideas?

On the Task object, I have to create a field "Barcode Number"( Bar_Code_Number__c), which starting from a specific value 68992001 and for every created task on any object increment to one, when the Task subject is " PTT Dispatch Task" only. For other task subject , it should be blank. Also, the users can also edit this field if they want. But the next task creation will follow the regular increment number ( and not from the one what the user has changed). Can you plz suggest how to achieve it. Thanks  I tried a workflow rule but did not succeeded.  As per the WF I created, the criteria as Task subject as " PTT Dispatch Task" , and formula as below, and first time i inputted the number above first number here. But i think this is not the correct way.


I'm trying to make a seat belt. I've pulled a loop off the seat and converted that geometry to a curve, and then extruded/beveled the geometry in the curve properties. It works, but it's making the belt vertical instead of laying horizontal how I want it.   I've searched around, some suggested using Switch Direction to change the way the normals(?) face on the curve, but that does nothing. I can't figure this out. How can I get the geometry on the curve to be in the horizontal direction?

I'm trying to make a Game of Thrones-style map scene. The roads are defined by curve objects. I'm trying to extrude the roads in the x/y plane, but it seems to only go in Z:    Is it possible to control the extrusion plane for curves?


Recently I’ve suddenly got a second  badge. This badge can be awarded multiple times, but currently if the user already have one the badge is not shown in the list of available:        My request is to add badges which can be awarded multiple times and can be tracked to the list of available badges with an ability to track them.

Just got the  on StackOverflow and, since it can be awarded multiple times, wanted to start tracking progress to the next one, but, the badge is not shown in Available badges to track anymore:    Is it possible to track already awarded badges that can be awarded multiple times?


I'm trying to install the elsarticle class manually on MiKTeX 2.9 (Windows) from the .ins file. However, when I type latex .\elsarticle.ins, I get the following:  This is pdfTeX, Version 3.14159265-2.6-1.40.17 (MiKTeX 2.9) entering extended mode ! I can't write on file `elsarticle.log'. Please type another transcript file name:   When I type any other file name, I keep getting the same error.

I need to install a LaTeX package on my MikTeX system.  Specifically, I am trying to make biblatex work, but I always get the error message:    ! LaTeX Error: File `biblatex.sty' not found.   I have changed the options to have the "Quick Build" command that includes biblatex too.   Code/commands are correct because it's working under Overleaf.


I am trying to read a file and write to another file it is not working I invoke the method from the main  public boolean copy(String inputPlayList, String outputPlayList, int numberOfMunites)  {      String start1 = "#EXTINF:";      String afterNum = ";";      try     {    declaring those variable that I would use to pass the method          File fInput, fOutput;          String s;             String a;   assigning those variable to the method          fInput = new File(inputPlayList);         fOutput = new File(outputPlayList);          // Now I am using bufferedRead and BufferedWriter to read and write in a file          BufferedReader br = new BufferedReader(new FileReader(new File(inputPlayList)));         BufferedWriter out = new BufferedWriter(new BufferedWriter(new FileWriter(outputPlayList)));          // creating a while saying while the line is not finish contunue to read           while((s = br.readLine())!= null)          {            if(s.contains(start1))  {                String numberInString = s.substring(start1.length(), s.indexOf(afterNum));                numberOfMunites+= Integer.getInteger(numberInString);             }            // when it is finsh close the file.           out.write(s);            }          out.close();          System.out.println("donne");      }catch (  IOException e)     {         System.err.println("the is an erro that need to be fixed"+e);     }     return false; }   }

It has always bothered me that the only way to copy a file in Java involves opening streams, declaring a buffer, reading in one file, looping through it, and writing it out to the other steam.  The web is littered with similar, yet still slightly different implementations of this type of solution.  Is there a better way that stays within the bounds of the Java language (meaning does not involve exec-ing OS specific commands)?  Perhaps in some reliable open source utility package, that would at least obscure this underlying implementation and provide a one line solution?


How to write a secure username & password verification in PHP ?  I use MD5 for password ($pass) and string for username ($name) and write this code in PHP for user account verification.  $post_vars = $_POST; if (isset($post_vars['name']))       {         $name = $post_vars['name'];         $pass = md5($post_vars['pass']);         $dbConn = db_open();         $sql = "select `password` from `user_table` where `user_name` = '$name' limit 1;";         echo $sql;         $sth = $dbConn->prepare($sql);         $sth->execute();         $row = $sth->fetch();         if ($row !== false)         {           $verify = $row['password'];           if ($pass == $verify)           {             $_SESSION['isLoggedIn'] = true;             header('Location: ' . _DEBUG_URL_);           }           else $iframeURL = _LIB_URL_ . 'accessdenied.htm';         }         else echo 'No results found!';     }   Is this query hackable by method of SQL Injection, and how it can be hacked ? I use PDO for MySQL.   "select `password` from `user_table` where `user_name` = '$name' limit 1;"

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


class draw {     draw(circle i)     {         // draw a circle;     }      draw(circle i, circle j)     {         draw(i);         draw(j);     } }   Can I call another overloaded constructor of the same class in C++ even if using template?

As a  developer I'm used to running through constructors:    class Test {     public Test() {         DoSomething();     }      public Test(int count) : this() {         DoSomethingWithCount(count);     }      public Test(int count, string name) : this(count) {         DoSomethingWithName(name);     } }   Is there a way to do this in C++?  I tried calling the Class name and using the 'this' keyword, but both fail.


Font displaying as empty square in Ubuntu.

I don't know what I did wrong in my Ubuntu 18.04 OS. For some reason some of my apps look like this:    This also happens to other gnome apps like pdf-reviewer and Logs. Window title, menu bar etc. are all blank, display only squares.  *Problem solved: I downloaded Google Fonts, saved them in a new folder, they can be applied system-wide, but after I did some font settings using Google Fonts it didn't work. I changed the font of Interface with Tweaks-Tool, that was what causing the problem.


While I'm searching for bash examples, I find the let command but I never understand it.  I saw the man bash, also I couldn't understand  what let expression does.  Some let usage that I saw:   let z=z+3 let "z += 3"   What is the usage of let?  Any explained example will be appreciated.

expr does not seem to like parenthesis (used in mathematics to explicit operator priority):  expr 3 * (2 + 1) bash: syntax error near unexpected token `('   How to express operator priority in bash?


A black hole evaporates by Hawking radiation. The computation of the evaporation time uses some approximations.  Question: Is the evaporation time valid for a microscopic black hole?    In particular, is it possible that at a given miscroscopic scale, the evaporation stops? For example at a microscopic scale so that the mass of the black hole is the neutron mass.

Does it just vanish into space leaving nothing behind or does it expel some material?    Also, talking more about black holes, as far as I understand the term "temperature", it is defined by the amount of kinetic energy of the particles of a body and from what I have read, there are no particles inside a black hole, I know that you can find the temperature of a black hole by analyzing its Hawking radiation but I cant really understand how the term "temperature" can be applied to a black hole. Does it mean that whatever is that it is inside a black hole has kinetic energy? Have physicist already experienced the death of any regular black hole (by regular I mean space-sized black holes not micro ones created in labs)? Also, where is the Hawking radiation form? Because if it is released by the black hole I bet it must have formed outside the event horizon, but how exactly?


Let $A$ be a $3$X$3$ matrix whose eigenvalues are $1$, $2$, $3$. Find $\det(B)$ where $B = A^2 + A^T$.  I know that $\det(A) = 6$, but I cannot proceed after $|A^2 + A^T|$. Any hints as to how to approach the problem?

We have to find $\det(A^{2}+A^{T})$. It is given that eigenvalues of $A$ are $1,2,3$.  My attempt: Since the question implicitly states that the answer would be same for all $A$ with eigenvalues $1,2,3$ we find that the answer is $(1+1)*(2+4)*(3+9)$ by taking $A$ as a diagonal matrix :P  I am unable to prove it for general $A$. Any help will be appreciated.


Minor UI glitch: The button to award a bounty is active on a deleted answer. Clicking on it results in the "THIS CANNOT BE UNDONE!" alert.         After confirming, I get the following error though:        So not a fatal bug, but still better not show the +50 next to deleted posts.

Clearly this is an edge case and I probably shouldn't have even tried awarding the bounty to a deleted answer, but why is the bounty award button even available?  It's not a bug since someone added in the notification seen in the final image.  But that sure seems like a roundabout way to let the user know that they can't award a bounty to a deleted answer.  The second step is particularly strange since the system really ought to know that the warning is pointless: no bounty can be awarded.  My suggestion is to rip-off the  and let bounties be awarded without the warning.  Then remove the single click button from deleted answers.


Let $p_n$ represent the $n$th prime number.  Is the following formula necessarily true?  $$p_n^2 > p_{n+1}$$  Experimentally, it seems true but I don't know enough number theory to prove it.  My problem is that I don't know enough number theory to relate primes to each other.  I know enough math to use the  to prove it for sufficiently large $n$ but I can't prove it in general.  My question is whether this relationship is true in general and, if so, what is a proof for this result?  Thank you...

Consider the following statement:     For any integer $n>1$ there is a prime number strictly between $n$ and $n^2$.   This problem was given as an (extra) qualification problem for certain workshops (which I unfortunately couldn't attend). There was a requirement to not use Bertrand's postulate (with which the problem is nearly trivial), and I was told that there does exist a moderately short proof of this statement not using Bertrand. This is my question:     How can one prove the above statement without Bertrand postulate or any strong theorems?   Although I can only accept one answer, I would love to see any argument you can come up with.  I would also want to exclude arguments using a proof of Bertrand's postulate, unless it can be significantly simplified to prove weaker statement.  Thank you in advance.


Proving that $[0,1)$ and $(0,1)$ have the same cardinality (without assuming any previous knowledge) can be done easily using Cantor-Bernstein theorem.  However I'm wondering if someone can build an explicit bijection between these sets.  It's easy to build a bijection between $(0,1)$ and $\mathbb R$, so a bijection from $[0,1)$ to $\mathbb R$ will also fit the bill.

How to define a bijection between $(0,1)$ and $(0,1]$?   Or any other open and closed intervals?   If the intervals are both open like $(-1,2)\text{ and }(-5,4)$ I do a cheap trick (don't know if that's how you're supposed to do it): I make a function $f : (-1, 2)\rightarrow (-5, 4)$ of the form $f(x)=mx+b$ by \begin{align*} -5 = f(-1) &= m(-1)+b \\ 4 = f(2) &= m(2) + b \end{align*} Solving for $m$ and $b$ I find $m=3\text{ and }b=-2$ so then $f(x)=3x-2.$  Then I show that $f$ is a bijection by showing that it is injective and surjective.


I want to install the 64 bits version of Firefox -  on Ubuntu 12.04 system. Since the browser is not available in the software center and I was not able to find any examples of installing it I want to know has anyone do this?  Please,provide more installation details since I am Linux user for few weeks only.

The  web browser is a 64-bit-only open source project based on Firefox.  I would like to see how is the performance compared to Firefox, apparently its better.  Being new to Linux, it's a challenge when it comes to packages that are not .deb. On the official site, Waterfox  as a .tar.bz2 file. How can I install Waterfox on Lubuntu 17.04 and also add an entry for it in my menu, under Internet, alongside Firefox?


How many Watts DC are equivalent to 1,000 Watts AC?  For instance, my load in AC is 1,000 Watts 220V. Then, how much DC watts would an equivalent load dissipate in 12V or 24V DC system?

If my house load is 1000 Watts AC/220V, then 1000 Watts DC/12V solar panels is not enough. What wattage solar panel would be required for AC 1000 watts?


My suggestion is to change     Please avoid extended discussions in comments. Would you like to automatically move this discussion to chat?   to     Please avoid extended discussions in comments. Would you like to continue this discussion in chat?   When I have used this option for the first time, I was sure that comments will be removed from the post after moving them to the chat. And it appears that  the .

When two users message each other in the comments one too many times, Stack Exchange presents a message as follows:     Would you like to automatically move this discussion to chat?   I clicked on it thinking it would move the discussion to chat. Well, it kind of did that. It copied the discussion to chat, and left the original comments behind.  There's an easy fix for this: use the correct verb.  suggested...     Would you like to continue this discussion in chat?   ... and my original suggestion was...     Would you like to automatically copy this discussion to chat?   What do you think?


/execute @e[type=Snowball] ~ ~ ~ /kill @a[score_Hider_min=1,r=3]   The above is the command I'm using. This is running on a loop and I'm  trying to use it to kill people that have that score. Is there a way to do this just based on what team they are on?

I am trying to make a snowball that triggers a command when it hits a player in 1.15, but I don't know how to do that. When I do execute at @e[type=snowball] run gamemode spectator @a[distance=..2] it only runs the command if it goes right next to them.


A stackoverflow is when stack hits the heap and then stops. There are security issues associated with stackoverflow while a inifinite loop just keeps on running.  Someone asked in this in an interview and I answered stackoverflow. Is it correct?

What is a StackOverflowError, what causes it, and how should I deal with them?


I'm running Ubuntu 18.04.  I first downloaded (and installed) a Debian image of Skype from skype.com. But because that installation wasn't working, I downloaded an alternative version through the "Ubuntu Software" app, which ended up working just fine.   Now I want to remove the first, non-working version, but it seems to be caught in a weird state. The removal command seems to run to successful completion:  > sudo dpkg --remove skype:i386 (Reading database ... 170025 files and directories currently installed.) Removing skype:i386 (4.3.0.37-1) ... Processing triggers for gnome-menus (3.13.3-11ubuntu1.1) ... Processing triggers for desktop-file-utils (0.23-1ubuntu3.18.04.1) ... Processing triggers for mime-support (3.60ubuntu1) ... Processing triggers for hicolor-icon-theme (0.17-2) ...   ...but:   the app still shows up in the list of installed applications when I click "Show Applications" the listing in "Show Applications" appears without an icon selecting the listing from "Show Applications" doesn't launch anything (nor present any sort of error prompt)   How can I remove this zombie entry? Where is the registry that drives "Show Applications"?  UPDATE 1  Per @GabrielaGarcia's suggestion, the results of running sudo dpkg -P <filename> are below. For some reason the I couldn't use auto-complete to fill in the filename. When I type "s" and then tab for the autocomplete, it actually just writes out "skype" (as opposed to the filename), but there is no Skype installed on my system at the moment.  homerman@~/Downloads> ls -l total 1050536 drwxr-xr-x  2 homerman homerman       4096 Nov 11 19:56 ./ drwxr-xr-x 23 homerman homerman       4096 Nov 11 21:04 ../ -rw-rw-r--  1 homerman homerman   20112698 Nov 11 16:11 skype-ubuntu-precise_4.3.0.37-1_i386.deb  homerman@~/Downloads> sudo dpkg -P skype-ubuntu-precise_4.3.0.37-1_i386.deb dpkg: error: you must specify packages by their own names, not by quoting the names of the files they come in  Type dpkg --help for help about installing and deinstalling packages [*]; Use 'apt' or 'aptitude' for user-friendly package management; Type dpkg -Dhelp for a list of dpkg debug flag values; Type dpkg --force-help for a list of forcing options; Type dpkg-deb --help for help about manipulating *.deb files;  Options marked [*] produce a lot of output - pipe it through 'less' or 'more' !   UPDATE 2  I've determined the package name for this archive is skype:i386. Below are the results of trying to run the dpkg commands to remove and purge - the system doesn't recognize this as an installed application.  homerman@~/Downloads$ sudo dpkg -r skype:i386 dpkg: warning: ignoring request to remove skype:i386 which isn't installed  homerman@~/Downloads$ sudo dpkg --purge skype:i386 dpkg: warning: ignoring request to remove skype:i386 which isn't installed

I am using Ubuntu 16.04, with Gnome 3.18. Using extensions I have gotten rid of the dash panel and only use the Applications Menu in the upper left-hand corner of the screen. (I don't have Unity.) What I can't figure out is how do you add a new program, move software around to different categories, and create new categories?  Also, any keyboard shortcut to access the Applications Menu?


My staff already use AutoCAD, SketchUp and Illustrator.  I am looking for software to convert simple pencil sketches into drawings. These drawings will later be given to staff for full CAD conversions. Therefore I am looking for a simpler program.  We do custom stone work and use geometric and simple curved designs for floor and wall patterns. Color is not necessary,  only outlines.

I'm trying to convert several of my pencil drawings into vector graphics with Adobe Illustrator. My drawing's are about this complex:    I'm looking for the best way to convert these. I've found some tutorials that use the pen tool . I also have a wacom tablet at hand, which could turn out useful. Any guide or links to tutorials on effectively doing this would be greatly appreciate it.


I have looked at the various help pages but I couldn't find a clear guideline for the following issue: often enough someone will ask in the same post (i.e. in the same SE-question) a whole bunch of questions (in the plain English sense of the word), which while may be about the same topic are nevertheless sufficiently distinct that each may require several paragraphs of text to answer adequately.   I can see an upside for leaving related questions grouped together from the asker's perspective: "there's a thread (on SE) answering all my questions about topic T!" On the other hand, from the perspective of organizing questions by having a clear heading/title for each (actual) question and so forth, i.e. from the perspective of SE being a fairly structured database of Q&As instead of being a more like a collection of forum threads "I'm confused about topic T", the omnibus question-list approach seems clearly sub-optimal.  The omnibus approach also makes the issue of accepting answers (and perhaps reviewing such actions) difficult: if two different users give replies to different parts/sub-sets of the question-list, which one is the most adequate one? Even upvoting all partial answers seems iffy because it actually penalizes the user(s) who provides(s) the most complete answer to the question-list: since a user can only give at most one upvote to another user's answer, if user X provides answers to A & B in the same SE-answer, he can only get at most one upvote from user Y, whereas if these were two different SE-answers, he could get two upvotes from user Y.  So, given the above problems, which I think are real enough, is there anything in the SE system addressing list-of-questions question splitting?

I've recently run into many questions where to author asks several related questions in one post, many of them asked before.   I'm wondering what out policy is on such questions:   Should I vote-close them as being not constructive? Should I vote-close them as duplicates? Should I leave them be? Or even suggest an answer?    - Each of the questions: Waiting for an AJAX request with selenium, and headless browsing in selenium have been asked here before, but he asked both in one.  I've done my best to search for similar questions here in meta but I was unable to find any, reading appreciated.


The viceroy butterfly generates a toxin compound which make it distasteful to predators.  Biologists agree that the viceroy must have developed this trait as a passive defence mechanism to prevent being eaten.  Let’s look at it from an information point of view.  For this to work, information about the bad taste of the viceroy must be known to the predators.  This can happen by a predator eating one viceroy, discovering the bad taste, learning and never doing it again.  Unfortunately, the unpalatable butterfly had to die in the process.  The second, and most important, information path is the genetic one.  One way, evolution work is by the survival of the fittests. In this case the important trait of “tasting bad” dies with the butterfly and is less likely to have been transmitted to a new generation, unless (and this might be part of the answer) we consider the local population of butterfly as the evolving organism.  The question: If a successful gene is only proven successful when removed from the gene pool, how does the species evolve a trait involving this gene?

The chapter by Douglas Futuyma in 'Evolution' (Losos et al 2013, Princeton) states that natural selection can occur at the species level. Futuyma states that if natural selection occurs at the species level it does not occur at the individual level:      Neither gene selection nor species selection has molded the advantageous characteristics of individual organisms; rather, they have affected properties at the gene level or at the species level.    But how does natural selection occuring at the species level not affect individuals? Surely any selective advantage of a particular species must occur among particular individuals of that species. For example, if Species A is selected because it is browner than Species B, this will be because individuals of Species A are browner than individuals of Species B.


$A$ is a non-singular matrix ($n \times n$) and each eigenvalue of $A$ is equal to $\pm 1$. Why is $A$ similar to $A^{-1}$? (by Jordan form)

Let $A \in {M_n}$ is nonsingular and each eigenvalue of $A$ is either $+1$ or $-1$.Why $A$ is similar to ${A^{ - 1}}$?


am having problems understanding the difference between validity and satisfiability. Given the following:  (i) For all F, F is satisfiable or ~F is satisfiable.  (ii) For all F, F is valid or ~F is valid.  How do I prove which is true and which is false?  Statement (i) is true, as for all F, F will either be satisfiable, or ~F will be satisfiable (truth table). However, how do I go about solving for statement (ii)?  Any help is highly appreciated!

I'm working on a task which i'm a bit stuck at. I need to decide whether the statements are true or fale. F stands for the statement logical formulas, and also if the claim is true I need to give a proof or explain why it is so. If the statement is false I need to give a contra-example  Here are the statements:     For all F, then F is satisfiable or ¬F is satisfiable   and     For all F, then F is valid or ¬F is valid.   Is there any easy way I can solve these kinds of statements by seeing if a statement satisfies or is valid or is neither both of them?  Would appreciate some help, thanks alot!


So I have two different buttons:  <input type='button' class='EditData btn btn-warning' value='Edit' name="{{id}}">  <input type='button' class='AddNew btn btn-success' value='Add Allocation' id="{{id}}">  This is my JQuery  $(function () {     $('.AddNew').click(function(){         console.log(this.name);     });     $('.EditData').click(function() {          var y = document.getElementById("location_"+this.name);          y.innerHTML = '<input type="button" class="AddNew btn btn-success" value="Add Allocation" id="'+this.name+'">'     }); });   AddNew just prints something to the console. EditData replaces the EditData button with an AddNew Button.   AddNew works successfully.  EditData successfully replaces itself with an AddNew button, however this button doesn't not work as intended and doesn't print anything on console when clicked.

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


Here is a proposition, if you have current password, then you can log in into network. This proposition is false only for one condition, when you have current password, but cannot log into network. But for the true cases, when you do not have current password, you can log into network, proposition is true. But, how can it be? without current password, how can you log into network, this should be false. Can someone explain what I am missing here. If yes, then please also suggest some good place to learn about the conditional statements more deeply.

I am not able to understand implication well. I can see If in $P \implies Q$, if Pis true and Q is false then implication is false. But i cannot understand other cases where it is taken as true. Is this just a convention ? or some underlying reasoning behind it  Thanks


When is it possible to add different powers of a dimensioned (i.e. non-dimensionless) quantity, e.g. consider power series for dimensioned quantities. For example, when can you exponentiate a dimensioned quantity? I have heard that this is done in symplectic geometry (e.g. $e^\omega$) but I don't know any more beyond this.

While looking for the answer on the internet I came across an answer giving this explanation  "Another way of seeing clearly why an exponential's argument should be dimensionless is to Taylor expand: $\exp(x)=1+x+x^2/2+\cdots$ Every term has a different dimension if x is dimensionful, and hence cannot be summed."  But this is not a proof in the sense we do in mathematics! So can anyone provide with a mathematically sound proof?


ok... let's try this again! Newby here and i have a problem that is really really really annoying. Blender becomes sluggish with time! And i can't find a cause for it. laptop has 8 gig 4 cores 4 Gh While i run blender only 1 core is active around 1 Gh and rarely more. Less than 4 gig of memory is occupied. When i open the software it runs properly... i click on any object, vertex, etc... and it lights up immediately. But after about half an hour latter it can take more than a second for the item to light up. And after a full hour it is beyond 5 second. Someone suggested it could be the undo step??? if it was... when i close the file and open a new one, the system is suppose to drops the old undo list and create a new one... hence the system should then return to normal speed... it doesn't! Plus the lag time should not keep growing. it does! Therefore the problem must be something else. I tried reinstalling the software a while back but it didn't solve the problem. i didn't have that problem with... 3ds Max maya or Rhino (and i used a lot more undo step then, as i was beginning to teach myself 3d). Having to close and reload the software every 30 minutes is truly annoying! Does anyone have any usable ideal?

This is something I have never witnessed with any software before. When I open Blender it works properly; I click on an object, vertex, etc., and it lights up immediately. But after about half an hour of work it can take up to a full second before it lights up, and commands start to yield awkward results. After an hour it can take up to 5 seconds before a clicked item lights up, and commands are yielding weirder results. My processor is not being taxed in any way, nor is my memory. I close the software and reopen it and everything works fine again. But after half an hour it slows down again. Is this programmed in the free version to annoy people who can't pay for the pro version? Because I can't find any logical reason why the software slows down through time during usage. Could anyone explain this?


I had a problem related to Drive partitioning i asked it on superuser here is the link   i was not getting quick response so, i decided to ask the same question on stackoverflow, and eventually i was downvoted and question held as off-topic.  My concern is, if there are knowledgeable persons on stackoverflow who are not on superuser, then they should help me. i think there should be some way to allow these activities without downvoting the user.

I think that now that we have multiple communities, there are questions that will be of interest to multiple communities.    For example consider the question  asked on  .  I think that this question would be better answered on the   (that is where the experts are).  But since questions is of interest to both communities I think that it is useful to cross post it, where answers are also shared between the different sites.  I think that the best way to handle cases like this is by allowing cross posting.  I think users with 500+ reputation should be allowed to cross post questions.  This would allow users from both sites to answer them.  I think that this could also be a good way of marketing different sites to different users.    Similar questions have been asked about the SO, SU and SF triad but I think that this has become a larger issue (and will become a bigger issue as more area51 sites evolve).


I want to download Ubuntu on Windows 7 and dual boot the two but before I do there is the question, can i dual boot Windows 7 and Ubuntu? And if I do, does it work and is it safe for the OS?  What is the procedure to follow after downloading Ubuntu to dual boot with Windows 7?

I currently have Windows 7 on my computer and I want to install Ubuntu alongside Windows safely.  Could someone please provide clear instructions?


I want to convey that I didn't speak English in the last two years and I'm not speaking English now.     I haven't spoken English for two years.      I haven't been speaking English for two years.   In this case, which is proper?

What's the difference between      I have been playing tennis for five years.   and   I have played tennis for five years.   Are they grammatically correct? If yes, how are they different in meaning/nuance?


there is a script I evolved with it, it has line of command like below :  mytemp=`echo ${sourcedir}|awk -F/ '{printf "/%s/tmp",$2}'`/`basename $0`-$1.$$   at the last of the command we see $$ that produces a number. when I use echo $$ in bash I also see a number like bellow:   #echo $$  23019   what exactly is this number, and what is $$?

I've found some special parameter with Bash starting with $ sign. Example: When I was wandering for exit status I knew about $?, process ID  $$ etc. So, I am sharing  this post to know which are special bash (shell) parameters and their usage.


For the recent week I've been diving myself into tetration out of pure curiosity, and after watching videos about how to find the derivative of $^2x$ and $^3x$, I decided that I wanted to look into what a derivative rule for it would be. When I searched online I couldn't find anything that was satisfying to me, so I put some work in and through a couple iterations of solutions, I think I have a closed form derivative rule I am personally satisfied with. What I found was: $$\frac{d}{dx}(^nx)=\frac{^nx}{x} \sum_{a=0}^{\lceil n \rceil -1} \ln(x)^a \prod_{b=0}^a \frac{\ln(^{n-b}x)}{\ln(x)}.$$ Firstly, I've been wanting to get on this website for a while, so I thought I would bring it here. Secondly, I wanted to know if this looks accurate to anyone here, as through my testing with it, it seems to be. And lastly, I'm just a Calc BC student, exploring into these further realms of mathematics myself because it interests me, so I don't know, given that this is accurate, if there is a more concise or elegant way to put this derivative rule together, so is there a way I could? A note about this is that I have it working for $n$ being any nonnegative real number, and for that to work, I am going by the recursive definition for tetration of: $$^nx:=\begin{cases} 1  & \text{if } n = 0\cr x^{\big(^{(n-1)}x\big)} & \text{if } n > 0, \end{cases}$$ which extends it so that $n$ can be any nonnegative real number, such that $^{2.47}x$ would be considered $x^{x^{x^{0.47}}}$. Update: As I know that the recursive definition for tetration is not exactly the definition for tetration across the reals, and that that is still a researched topic, I wanted to share my derivative rule which I made before this one that works for $n$ as any nonnegative integer. Here is what I have on that: $$\frac{d}{dx}(^nx)=\frac{^nx}{x}\sum_{a=0}^{n-1}\ln(x)^a\prod_{b=0}^a{^{n-b-1}x}.$$ For this, I ask the same questions as I asked above. Thank you for your time reading this.

I am trying to find a general derivative for the function: $f(x)=x^{x^{x^{...^{x}}}}$however to do that I must find $f^{\prime }$ and $f^{\prime \prime}$...etc. I am now trying to write down a general expression for $f^{\prime \prime}$ and I have stumble opon the series in the picture below, I wonder, do anyone have an idea of what sort of expantion it migth be ? I have tried breaking it down into three different sums, but I wasn't very successful!  EDIT  So since this post has gotten some attention and the title has been change I will tell you what I am on about, although I already have a post just for the question in the title from before. I am as I said earlier trying to find a general derivative for the function $f(x)=x^{x^{x^{...^{x}}}}$ where $n$ is an arbitrary number, natural number and greater or equal to 2. I have already made success when I tried to find the first derivative, and I have also found some interesting pattern emerge when the derivatives as well as n incresses. But my question here was if anyone knew what this expation might be or look similar to be, since I have yet to be lernt series etc. I did not know that the question needed such background since it's straight a forward question.


I've been struggling with this since I've installed Ubuntu: How do I copy a directory location?   For example:   /home/user/downloads/game/game.sh    Do I have to type every single letter on terminal? The problem is that there are some paths which are too long to see the entire directory. So this isn't possible...   Anyway, again, I'm sorry, but someone, please help me out with this.

I'd like to know if there is a way to run  program/shell script without typing full path:  /opt/idea/bin/idea.sh


Are Lubuntu, Kubuntu, and Ubuntu the same except for the desktop environment and a few programs?

What different Ubuntu derivatives are there? And what is special with them?


I need to install ubuntu alongside with my current version of Windows in my new computer (I prefer UBUNTU but I still need windows to run some programs in my work place).  The point is that, in windows 8 I can not access BIOS as I did the first time that I installed ubuntu in my older computer.  Can somebody please provide me a detailed information about how to install Ubuntu without corrupting Windows 8  Thanks people.  Luis

I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?


I am trying to vertically align my  in my header to be in the middle. I looked up the solutions to this question being asked and none of them work. Does vertical-align: not work for trying to vertically align an inline-element within a div such as a header?  I tried creating a box model using 100% width and 100% height, or also the exact px of my div element that my h1 is in.  It just does not respond and stays on the top.  I know this question has been asked many times, however, I just cannot get it to work. Thank you for your time!

 This Is My Lab Zoe!

    .main-header {     width: 100%;     height: 150px;     background:#3d594b;     margin: 0;     padding: 0;     box-sizing: border-box; }  #header-title-box {     display: inline-block;     vertical-align: middle;     border: none;     width: 100%;     height: 150px;     margin: 0; }  h1.header-font {     height: 150px;     vertical-align: middle;     font-size: 40px;     color: white;     margin: 0;     text-align: center; }

I have a div with two images and an h1. All of them need to be vertically aligned within the div, next to each other. One of the images needs to be absolute positioned within the div. What is the CSS needed for this to work on all common browsers?

testing...


In this pandemic there are a lot of people who are speaking their mind without restraint. So, I was thinking about what phrase would describe that. I felt it had to do with like “open spout" or "faucet” but something of that ilk.   “There are those who are more measured and restrained, and then there are those _____ who only speak their mind.”  I believe the term conveys a negative connotation and is something in the neighborhood of an object that emits something, and is a popularly used idiom.

Is there a word for someone who would say exactly what they are thinking. Sort of if there is this boy named Bob, and whenever he has something on his mind he just says it out loud.


what i mean to say is that, in a liquid (ideal) pressure gets transmitted undiminished, what it means is that a molecule applies equal amount of force to all the molecules in its vicinity how? how do non ideal liquids not satisfy this condition.

Pressure can be explained at microscopic level for a gas with kinetic theory of gases. From that the pressure $p$ is linked to the velocity of molecules (and it is caused by the high amount of collisions in the gas).  $$p=\frac{m N_a}{V} \frac{\bar{v}^2}{3}$$  Where $m$ is the mass of a molecule, $N_a$ Avogadro's number, $V$ volume, $\bar{v}^2$ the quadratic average velocity of molecules.   Nevertheless I did not find a similar microscopic interpretation in the case of liquids. In that case molecules are not as free as in a gas, so it looks like pressure is not linked to the higher or lower velocity of molecules. So what is responsible for liquid pressure, at a microscopic level?  Is there a quite simple microscopic description for pressure in liquids, as there is in the kinetic theory of gases?


I'm unclear on how attacks and grappling work with monsters as opposed to players. Let me elaborate my question.    With PCs, it seems clear to me. Let's say a PC has two creatures grappled and thus has no free hands. If the player attacks on its turn, it can make an unarmed strike against one of the grappled creatures (although it's not clear if it can use the hand that's grappling to make that attack: squeeze, crush, etc.).    Now in the case of a monster, it seems unclear because they have specific actions/attacks that can grapple. Can those same attacks be made even if they are holding the grapple? I'll use a couple of examples to clarify.  A  has two options for attack: Bite and Constrict (which grapples on a hit). If a snake hits character A with Constrict (A is grappled) on turn 1, and turn 2 rolls around, can it attack a still-grappled character A with Constrict, or must it use Bite?  A  has multiattack with Bite and Tail, but can't use them on the same target. If a T-Rex hits character A with Bite (A is grappled) on turn 1, can it then Bite a still-grappled A on turn 2, since it can't attack A with its tail?  I'm asking because because a lot of gameplay or monster strategy blogs seem to indicate in their examples that the answer to this is "no".

I'm unclear on how attacks and grappling work with monsters as opposed to players. Let me elaborate my question.  With PCs, it seems clear to me. Let's say a PC has two creatures grappled and thus has no free hands. If the player attacks on its turn, it can make an unarmed strike against one of the grappled creatures (although it's not clear if it can use the hand that's grappling to make that attack: squeeze, crush, etc.).  Now in the case of a monster, it seems unclear because they have specific actions/attacks that can grapple. Can those same attacks be made even if they are holding the grapple? I'll use a couple of examples to clarify.  A Constrictor Snake has two options for attack: Bite and Constrict (which grapples on a hit). If a snake hits character A with Constrict (A is grappled) on turn 1, and turn 2 rolls around, can it attack a still-grappled character A with Constrict, or must it use Bite?  A T-Rex has multiattack with Bite and Tail, but can't use them on the same target. If a T-Rex hits character A with Bite (A is grappled) on turn 1, can it then Bite a still-grappled A on turn 2, since it can't attack A with its tail?  I'm asking because because a lot of gameplay or monster strategy blogs seem to indicate in their examples that the answer to this is "no".


Can I connect a second TB Display to my MacBook Air?  I currently have just one TB and would like to add a second

How do I find out the number, type, resolution & refresh rate of additional monitors I can attach to my MacBook or MacBook Pro?  This is an attempt at a canonical QA, as per the Meta QA -   to try prevent the myriad "same but different" questions we get on every possible combination of computers, cable & monitors There are perfectly good resources out there that Ask Different should not have to duplicate the efforts of.


Got Ubuntu 16.04, bought a MSI GTX 1060 Gaming X, connected it to PCI, lights on, but actually I dont know how to install and use it.   Last time I installed the Cuda package, I ended up in a login loop and had to reinstall Ubuntu.  The CD that came with the GPU seems to contain only Win-Drivers. Has anyone the same or pretty similar GPU and can tell me how to install or where is a tutorial for this?  Thank you.

I just ordered the Nvidia GTX card. I have a dilemma, though. Should I keep using the driver which is available in "additional drivers" in Ubuntu, or should I install the driver from the Nvidia site?  So which driver is the best for me?


I found , but it doesn't make sense to me. To sum up the question and the answer (in case of link rot):  Q: Does the damage dealt by 's delayed trigger cause  to trigger? A: No. The damage is dealt by a delayed trigger, which is not an instant or sorcery.*  The delayed trigger clearly says that Searing Blood deals 3 damage. Searing Blood is an instant. Therefore, I think Satyr Firedancer should trigger. Can someone explain why Satyr Firedancer would or would not trigger? This question was prompted by a .  * The judge reversed the ruling, but was kind enough to leave notes about it. Keep in mind that the paraphrased quote above reflects the original ruling.

Anthony casts , targeting Nathan's .  Nathan casts and resolves , choosing to 1) prevent all damage that would be dealt by Searing Blood this turn and 2) put a +1/+1 counter on Elvish Mystic.  Searing Blood resolves, deals no damage, and goes to the graveyard.  Anthony casts and resolves  to kill Elvish Mystic.  Searing Blood triggers from the graveyard, because Elvish Mystic died. Does the prevention effect created by Dromoka's command still apply to it after it changes zones? In other words, will Searing Blood deal 3 damage to Nathan?


I would like to use my new wacon Intuos pen and touch tablet with my Chromebook.   I installed Ubuntu Unity 12.04 on my samsung chromebook. I works well. I have seen a that there is some kind of wacom driver or something already installed with this version of ubuntu (Wacom Graphics Tablet). Saddly, when I plug the device... nothing. It powers on but that is all.

My Wacom tablet (CTH-480) is not detected by the Wacom Tablet option under settings. The Tablet shows up when I run lsusb but does not show up under settings. Again Thanks.


I have a rigged and animated mesh that I want to apply the pose of - for each frame. The desired result is an array-like row of slightly different meshes:    The left-most snake is the original rigged mesh. It deforms with each keyframe. The three others are duplicates whose Armature modifiers were applied while the frame was on the one that was to correspond with their pose. I then deleted their armatures and redistributed them along the X axis.  For just three duplicates this is not too tedious. But I have 90 frames of animation, so I think this is going to require scripting in order to be practical.   I found , but I'm not sure what to do next. I don't know much about Python scripting.  Any help appreciated.  Edit: Never mind! While we're on the topic of duplicates... it turns out this is a duplicate question.  I'm going to close this.

Is it possible to store each animation frame as a new object? I searched quite a long time now on google and was wondering that I cannot find any information about this.  I just have a simple model with a simple pose animation and I'm looking for a way to get each frame stored as a new object, that I end up with maybe 100 objects "frame001", "frame002", "frame003", ...  I need this for a game engine that does not support bone animations, but I can fake such an animation by exporting this object (as a collada) and then setting only one of the "frame-objects" visible in this engine.    I tried to write a quick and dirty python script myself after some basic reading, but unfortunately the most important action (the conversion to a mesh) does not work:  import bpy  count=0  for x in range(bpy.data.scenes["Scene"].frame_start,bpy.data.scenes["Scene"].frame_end):     bpy.ops.object.duplicate_move()  bpy.ops.object.select_all(action='DESELECT')  obs = bpy.data.objects bpy.data.scenes["Scene"].frame_current=0         for ob in obs:     bpy.ops.object.select_all(action='DESELECT')     if ob.type == 'MESH' and ob.name.startswith("model"):         if count>0:             ob.select=True             bpy.ops.object.convert(target='MESH')             bpy.data.scenes["Scene"].frame_current+=1         count=count+1


We define p-norm in this way: $\|x\|_p = \{\sum ^N_j=_1|x_j|^p\}^ {1\over p}$ We know that It change to $\|x\|_p = \max|x_j| $    when $ p \to \infty $  How can I prove this ?

If we are in a sequence space, then the $ l^{p} $-norm of the sequence $ \mathbf{x} = (x_{i})_{i \in \mathbb{N}} $ is $ \displaystyle \left( \sum_{i=1}^{\infty} |x_{i}|^{p} \right)^{1/p} $.  The $ l^{\infty} $-norm of $ \mathbf{x} $ is $ \displaystyle \sup_{i \in \mathbb{N}} |x_{i}| $.  Prove that the limit of the $ l^{p} $-norms is the $ l^{\infty} $-norm.  I saw an answer for $ L^{p} $-spaces, but I need one for $ l^{p} $-spaces. Besides, I didn’t really understand the $ L^{p} $-answer either.  Thanks for your help!


I am using below command to install ftp but its showing error message: sudo apt-get install vsftpd  Error Building dependency tree Reading state information... Done E: Unable to locate package vsftpd

When I try to install any package through the command line, I get an error.   $ sudo apt-get install <package> Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package <package>   Can anyone help me on this?


I am using Ubuntu 14.04 and I could not install MS Office 2010 or any office version using wine. A message pop up says "Office encountered an error during setup" but other *.exe files run perfectly. How do I solve this problem?

I want to know how to install Microsoft Office (specifically, Microsoft Office 2010) in Ubuntu?   I am a die hard fan of MS Office and I want to know if there is a way I can use it in Ubuntu.


Are the terms favour and favor interchangeable ? Or is there a slight difference perhaps? This is nitpicking but just curious.     there are other words like this : defence and defense . Why do we have different American and British versions? How did they come to existence? What purpose do they serve?

What is the difference between color and colour?


I've encountered several usages of $:=$, for example      $$\alpha_i := \begin{cases} x_i & i \leq n \\ A & n< i \leq 2^k  \end{cases}$$   and       Since $f$ is not constant, there exist some $a,b \in A$, $a \neq b$   such that $f(a) \neq f(b)$. Take $g$ to be $g(x):=b$ for every $x \in  A$. Now $(f \circ g) (a)=f(b)$. Hence we have $(f \circ g) (a)=f(b)  \neq f(a)$, so $f \circ g \neq f$.   However, I don't understand the difference between $=$ and $:=$. Is there any? I checked  source, but it didn't help.

I am sorry if this is quite elementary question. But I always think, that why we use $:=$ at some places, instead of $=$. Is there any fundamental difference between these two? Before reading Terry Tao's blog (4 months ago), I had never seen a symbol like this (:=).


My rim size is 622-20 and my current tire is 622-30 Can I fit a 622-35 or a 622-40 tire on my rim?   My forks are wide.

We often get questions on bicycles.stackexchange about fitting wider or narrower tires to bicycles. We have a large number of these with answers suiting the specific bike or style of bicycle in question, but I have been unable to find one that provides a generic answer covering off all things that need to be considered. For most bicycles, the answer is the same regardless of the specific style and sizes of tires in question.   This is intended as a canonical question that we can point closed questions to.


Already i asked this question but still i'm not getting the very clear answer. In my server holds more than 20 live databases in that my logfile(.ldf) is use to grow more than 5 GB per day.  Using the below script i'm shrinking my logfile size on day-to-day basis.But after reading the articles i'll come to know my travel is in wrong way.Know i need to start the Logfile shrinking in a good way.   USE ABC; GO -- Truncate the log by changing the database recovery model to SIMPLE. ALTER DATABASE ABC SET RECOVERY SIMPLE; GO -- Shrink the truncated log file to 1 MB. DBCC SHRINKFILE (ABC_log, 1); GO -- Reset the database recovery model. ALTER DATABASE ABC SET RECOVERY FULL; GO   My Database Recovery Model is 'FULL' because if i'm keeping my database recovery model in simple might be data loss can happen for that only i'm keeping my database in the Full recovery model.  Doing the above Querying is a bad idea. Here i need expertise suggestion to keep my database logfile in a best way.As well as i need to avoid the log file growing for each and every day.

This one seems to be a common question in most forums and all over the web, it is asked here in many formats that typically sound like this:  In SQL Server -  What are some reasons the transaction log grows so large? Why is my log file so big? What are some ways to prevent this problem from occurring? What do I do when I get myself on track with the underlying cause and want to put my transaction log file to a healthy size?


I am stuck on part (b) of the question. Please see image above. How would I work out the shortest distance with reducing the amount of cheese the ant has to crawl through?

An ant is caught on one corner of a cuboid with sides $l, b,$ and $h$. It wants to reach the diagonally opposite corner, However, the ant can perform a walk only along the faces of the cuboid. What is the least amount of distance that the ant needs to walk to reach the other corner?  Example : Let $l=b=h=4$ then answer is $8.944271$. How to find it for given $l , b $ and $h$ ?


I have a windows machine with which I want to explore ubuntu. I downloaded and put it on a disk OK. I fixed my boot order and booted into ubuntu. Right there on the screen it asked me if I wanted to install ubuntu. I was feeling optimistic and said yes. Then I got to the part where it wants to know where to put it, but it informed me that there was no other OS on my HD! It wanted to wipe the drive. I got out of there quick and booted back into Windows, just to make sure. Why is it not seeing 9 GBs of Windows and associated programs?  Additionally, is this going to make a partition on my HD? I hope so!

Whenever I startup from the LinuxLive USB, and try to install Ubuntu 12.04, it only gives me two options instead of the usual 3 or 4. My options are "Replace Windows 7 with Ubuntu" and "Something Else". Whenever I go into "Something else", it looks extremely confusing. How do I install it side-by-side while using the "Something else" section? These are my partitions.   /dev/sda /dev/sda1 ntfs (104Mb, System Required Partition) /dev/sda2 ntfs (1000097Mb, Windows 7 Partition)   Or should I try reinstalling my installer on a CD rather than USB and maybe then it will have the "Install alongside" function?


In Nintendo Nightmare, one has the ability to use cheat codes which are lines of code within Game Maker's system (the software has a function specifically for this and the game uses it).  This led to me looking at a few of the assets, one of which caught my attention very deeply. There appears to be a hidden boss with the object name "obj_bigchampi". It appears to be like any of the other big chu-chu monsters in the dungeons of the second part, except it has a mushroom textured band around the middle section of the body. It also randomly spawns boulders on top of the player (which are nothing more than the kind that block paths, thereby immobilizing the player and utterly ruining the camera's angle).  I'm trying to figure out how to kill it (beyond just cheating its life to 0).  I've tried all of link's weapons and a few of the weapons lying around hyrule field. Does anyone have any idea how to kill this thing? It seems like it is invincible, and the rock attack makes it seem even stranger.  Also here is an image of the boss. I think there has to be a way to remove its armor. I just cannot seem to determine how.    Bonus points for whomever can identify what sort of abomination that thing is supposed to be!

I've been playing Nintendo Nightmare for a while and I am stuck in the post-ending stuff. I've found the first two easter eggs (the one when you kill the first supposedly 'unkillable' boss, and the one behind the entrance to the Eggman boss). Does anybody know where this might be at. I know this is a sort of niche question, but I figure somebody here might know.


Background: ...Migrations were never meant to simply shuttle off-topic question to the next “closest fit” (source: )  At target site, display who voted for migration in order to make it easier for  (alternatively: for , or for ) to  them. The feature I think about could look like as marked green at below sketch      Side note. Before asking here, I also tested an option to use the list of close-voters shown at original site, using one of the off-topic migrations recently .   Unfortunately it didn't do the trick - original site has shown me just plain list of close-voters, including those who attempted to prevent erroneous migration.  update For the sake of completeness need to mention that later on I also tested flagging the problematic question (inspired by )    Moderator action on the flag was as follows: "I recognized the problem (another bad migration), but took no action because..." (if needed, refer here for full reply: )

A significant amount of migrations are rejected by the target site, the most problematic being migrations from SO to Programmers.SE. Rejected in this case means the question is closed also on the target site, either for being off-topic or generally not being a good question (NarQ, not constructive, ...).   A failed migration like that is very confusing to the user asking the question in the first place, and also unnecessary work for the moderators of both sites, as they have to coordinate to clear the migration history and delete the migrated question.  I think it would be useful to provide direct feedback on failed migrations. Obviously, a perfect SE citizen would be observant enough to notice when his migrations are rejected often, but I would guess that most users don't closely monitor the state of questions they voted to migrate.   Instead, a rejected migration should either cause a notification in their global inbox, or at least an entry similar to declined flags in their profile.  It could be something like this     You recently voted to migrate [Question X] to [site Y], where it was closed as [close reason]. Please familiarize yourself with [FAQ of target site] to see what kind of questions are on-topic there. Don't migrate low-quality questions, close them  directly using the appropriate close reason.   Educating users is the first step, it might be necessary to go further if users consistently migrate bad questions. After a certain number of failed migration to a specific site, the user could also be blocked from migrating there.


In SQL statement in MySql it is easy to create a row of values on fly by using somethig like  SELECT 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;  this will generate a single row containing numbers from 1 to 10 but is it possible to have a single column that contains these values.

I need to do a join with a table/result-set/whatever that has the integers n to m inclusive. Is there a trivial way to get that without just building the table?  (BTW what would that type of construct be called, a "Meta query"?)  m-n is bounded to something reasonable ( < 1000's)


I need to write numbers to the console with their signs. I mean if the number that I want to write is negative, there is no problem because the number will have the minus before it, but if it is positive, it will not appear like "+some_value", it will appear like "some_walue". I want the sign to be allways visible, and I'm wondering if it is a function which do this easyer. Sorry for my english...

Is there any way I can specify a standard or custom numeric format string to always output the sign, be it +ve or -ve (although what it should do for zero, I'm not sure!)


I am having some difficulties with footer css. I want it to stay in the bottom of the page. I don't want it to be visible until i scroll to the bottom of the page.  .footer{     position: fixed;     display: block;     width: 100%;     height: 80px;     bottom: 0;     float: none; }

I have a simple 2-column layout with a footer that clears both the right and left div in my markup.  My problem is that I can't get the footer to stay at the bottom of the page in all browsers.  It works if the content pushes the footer down, but that's not always the case.


I recently upgraded by Windows 7 Home Premium machine to Windows 10 Home. The upgrade went fine and the machine's been running alright, except for one thing: I hibernate it every night when I'm done using it, and Win 7 stayed "off" until I turned it back on again whereas Win 10 seemingly randomly turns back on.  I've disabled Wake-on-LAN as well as wake on keyboard/mouse movement. Windows Update is configured to have me schedule the updates instead of installing them automatically. There doesn't seem to be anything relevant in the Event Viewer, although to be honest I'm not 100% sure what I'd be looking for there.  So what gives? How can I diagnose these random wake-ups and stop them?    I did read through  and checked out my scheduled tasks and maintenance settings. There are four scheduled tasks and none are configured to wake up the system. The automatic maintenance is supposedly configured to run at midnight, but that doesn't seem to be the case. I came home today to find my machine running and the maintenance run date is reported as 4pm:        I also have the following in the Event Viewer:  The system has returned from a low power state.  Sleep Time: 2015-09-23T03:47:52.760473200Z Wake Time: 2015-09-23T19:36:37.370293600Z  Wake Source: Unknown   This 4 p.m. wake-up seems to be consistent with previous wake-ups. WindowsUpdate ran about 3 minutes after the machine reportedly "woke up", so I'm not sure if that's what woke it up or if it just started running since the machine wasn't in use. I did also see , which matches the behaviour I'm seeing, but unfortunately the "turn off automatic updates" solution doesn't apply since that's already off.  Is this a dead end? What else can I look at?

I have recently upgraded two PCs to Windows 10. Both computers do use "hibernate" extensively. Both are set up in a way so that keyboard, mouse and ethernet commands are not waking the PC.  Unfortunately, both PCs have startet to wake up in the night and stay awake for hours on end. This is totally annoying and costs a lot in terms of energy, so I'm investigating why this happens.  Powerconfig often fails to show any reason, but most often updates seem to be the culprit. Is there any way to force the PCs to stay shut down in the night? Unplugging is not really an option, since one of them is a laptop.


Without adding dependency of WMIC and getting MAC.  I know we can read MachineGuid in registry key:   HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Cryptography   and it won't change unless user formats the PC. But the issue is it can be easily bypassed if the hard drive is cloned.  I came across    Does the info returned by   GetSystemInfo ()   remain same after OS installation, and avoid cloning issue.

I need to write a function that generates an id that is unique for a given machine running a Windows OS.  Currently, I'm using WMI to query various hardware parameters and concatenate them together and hash them to derive the unique id. My question is, what are the suggested parameters I should use?  Currently, I'm using a combination of bios\cpu\disk data to generate the unique id. And am using the first result if multiple results are there for each metric.  However, I ran into an issue where a machine that dual boots into 2 different Windows OS generates different site codes on each OS, which should ideally not happen.  For reference, these are the metrics I'm currently using:  Win32_Processor:UniqueID,ProcessorID,Name,Manufacturer,MaxClockSpeed Win32_BIOS:Manufacturer Win32_BIOS:SMBIOSBIOSVersion,IdentificationCode,SerialNumber,ReleaseDate,Version Win32_DiskDrive:Model, Manufacturer, Signature, TotalHeads Win32_BaseBoard:Model, Manufacturer, Name, SerialNumber Win32_VideoController:DriverVersion, Name


The problem I am facing arises whenever I am trying to obtain a cell. The funny part is that this function works fine till it reaches this part of the code.          for (i = 1; i < 555; i++)          {                        try             {                 cell = sheet2.getRow(i).getCell(columnNo);                           }             catch (NullPointerException e)             {                                cell = sheet2.getRow(i).createCell(columnNo);             }             value = "NOT(ISERROR(MATCH(C" + (i + 1) + ",$N$2:$N$710,0)))";             cell.setCellFormula(value);         }   Because of try catch i get the error for createCell, but i believe that the problem lies at the line where i use getCell. I get the following error : Exception in thread "main" java.lang.NullPointerException  Just before this part, i have a for loop(pasted below) which works just fine.          for (i = 1; i <= incorrect.size(); i++) {             cell = sheet2.getRow(i).getCell(columnNo);             if (cell == null)                 cell = sheet2.getRow(i).createCell(columnNo);             value = incorrect.get(i - 1);             cell.setCellValue(value);         }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


A few months ago as I fast traveled to Whiterun to deposit some items to my home, some mages, who were apparently cultists tried to attack me.  Needless to say, I put them down, and looted their bodies appropriately. Unfortunately, this has the result of their bodies still lying on the street. Every time I revisit Whiterun, their bodies lay stark naked on the pavement, while Ali'kir warriors say the same thing every time: "What's this?" and "What a damn shame."  I'd really like to get rid of this body.  Do bodies have some natural decay period?   If possible without the use of commands.  The bodies have been lying on the streets of Whiterun for nearly two months (of in-game time).

In Whiterun there are two dead bodies that never seem to despawn. They are the cultists from the start of the Dragonborn DLC. I know I could just move them out of sight, but I have some weird feeling knowing that they are still there. Is there anyway to force the corpses to despawn permanently? I'm on PC, so I do have access to the console.


The help centre for MSO states (on this page: ):     "The first queues you gain access to are Late Answers and First Posts. These and all other review queues are accessible from the "review" link that appears at the top of every page next to your user name."   At the top of this and most pages next to my user name I see only rep, badge count, "chat", "main", "about", "help", and a search bar, so to me that quote just looks wrong (and not very helpful).  I originally wrote up a question asking about how to get access to those review queues, and why I could not find the link, since I spent so long looking for them, but I was able to get to a page with list of 4 other review queues (through a link in the help centre), and I imagined there is only one review queue list page, so something strange must be going on.  Finally, before posting that question I came across a question () with critical information I did not see anywhere else in my hunt for the link and for the review cues I supposedly now had access to:     Here on Meta, for example, we 'only' have 4 of the queues, low   quality, suggested edits, reopen and close.   If this is true, it makes sense that I would not see a review link (as I do not have enough rep for any of the review queues that do exist), but can we please change the Meta help centre so that it stops referring to   queues that do not exist a privilege that does not exist a link that does not exist   ?  A lot of confusion could be avoided if the related privilege were removed from the list (and its help page were removed as well).    Update:  I see some of the reasons given for the current unfortunate set-up on another question ():   MSO has a "master privilege list" for all sites, so it can't be changed. MSO users with at least 500 rep do technically have access to the first posts and late answers queue...it's just that it does not exist.   "1." is apparently not true, as WendiKidd points out in the comments there.  Privilege lists are changed in new SE sites to allow for lower rep thresholds.  "2." is just very unintuitive (and cost me and potentially others much time sussing out the answer to how it all works).  If we still don't want to or can't fix things as I suggest above, though, I suggest we:   Start showing the "review" link on MSO starting at 500 rep regardless (as long as the help centre is saying it is there). On the review queue page, show placeholder messages for review queues that do not exist mentioning that they do not exist (so people do not think they are on a separate page somewhere).

When I visit Stack Overflow, I see the review option in the bar at the top of the screen.    However when on MSO, I don't see it. I assumed this was because I didn't have enough reputation to access the queue. I was curious what the requirement was on meta, so I moseyed on over to the privileges page. To my surprise, I saw that the privilege is listed as only requiring 500 rep and informs me I already have it:    Confused, I manually typed in meta.stackoverflow.com/review to see what would happen. The page did in fact load, but as you can see meta has no "First Posts" or "Late Answers" queue.    Seeing on that page that a minimum of 2k reputation is required to access any queues on MSO, I report the following bug:  1) On the privileges list on MSO, the 500 rep privilege of "Access first posts and late answers review queues" should not appear.  I also have the following feature request:  2) On the privileges list on MSO, it would be useful if instead there was a 2k privilege that informed you that you have access to the "Suggested Edits" and "Low Quality Posts" queues.


My favorite food is apples. Or my favorite food are apples.

If I understand it correctly, nouns for fruits (and certain types of foodstuffs, such as pizza) are used as mass nouns if thought of as "food substance", rather than "portions". So is it correct that I say "I like apple" instead of "I like apples"? Is such reasoning as "I like apple as food, especially in cut pieces", just like "I like soup, pork, etc." (instead of "I like apples as items served as food, especially as whole fruits") valid, or at the very least, applicable in any ways?  I know there's , but the given answer is not satisfying to me. It flat out denies such a phrase as "I like apple" as grammatically incorrect. But is it though? If it is, when exactly do we use the mass nouns instead of the count nouns? Does the same principle go with "chicken" (the meat) and "chickens" the animal?  Edit: "Dog" is NOT a mass noun and the other question is completely irrelevant. This is absurd. My question concerns the use of mass nouns and count nouns for foods.


I'm trying to use this command:  /summon Item ~ ~2 ~ {Item:{id:388,Count:1,tag:{}}}   But the command block returns with "Unable to summon object". What am I doing wrong? I'm using Minecraft version 1.12.

I'm making an adventure map, and at some points I need there to be items on the ground. But when I use the /summon command, it always ends up as a stone block.  Here's what I've used:   /summon Item ~ ~ ~ {Item:{id:276,Count:1,tag:{display:{Name:"Mirage"},Unbreakable:1},Damage:0}}   This did not work, so I tried a simpler command:  /summon Item ~ ~ ~ {Item:{id:276,Count:1,tag:{},Damage:0}}   Which also summoned a stone block. Please note that I am in the Minecraft 1.9 snapshot 16w05b


$\frac{\mathbb{F}_3[x]}{(x^2+x+2)} \cong \frac{\mathbb{F}_3[x]}{(x^2 + 1)} $ I know $\frac{\mathbb{F}_3[x]}{(x^2+x+2)} $ and $ \frac{\mathbb{F}_3[x]}{(x^2 + 1)} $ is isomorphic because they are both 2-degree extension of $ \mathbb{F}_3 $ . But I cannot contract explicit isomorphism between them.  Could you show me isomorphism map between $\frac{\mathbb{F}_3[x]}{(x^2+x+2)}$  and $ \frac{\mathbb{F}_3[x]}{(x^2 + 1)} $?  Thank you for your help.

Prove $\mathbb{Z}_3[x]/(x^2+1)$ and $\mathbb{Z}_3[x]/(x^2+x-1)$ are isomorphic by finding an explicit isomorphism. My question is how I can define the map. Here are what I tried:  $\mathbb{Z}_3[x]/(x^2+1)=\{ a+b\alpha \,|\, \alpha^2 + 1 = 0, \quad a,b\in\mathbb{Z} \}$  $\mathbb{Z}_3[x]/(x^2+x-1)=\{ a+b\beta \,|\, \beta^2 + \beta - 1 = 0, \quad a,b\in\mathbb{Z} \}$  Then I am looking for an isomorphism of the form $f(a+b\alpha) = a+bf(\alpha)$ for all $a,b\in\mathbb{Z}$ where $f(\alpha^2)+1=0$. Here I'm stuck.  My professor said $f(a+b\alpha) = a+b(1-\beta)$ so that the restriction of $f$ to $\mathbb{Z}_3$ is the identity morphism. I don't understand why we have $f(\alpha) = 1-\beta$.  He also gave another problem: $\mathbb{Z}_5[x]/(x^2+2)$ and $\mathbb{Z}_5[x]/(x^2-x+1)$, where $f(a+b\alpha) = a+b(2+\beta)$.  Could someone please explain to me why $f(\alpha) = 1-\beta\,$ in the first problem and $f(\alpha)=2+\beta\,$ in the second problem?  Thank you very much.


How can I prove that the following series does not converge uniformly for $|y|<1$? could anyone give me a hint please?  $$\sum_{n=1}^{\infty} \frac{y^n}{2n-1},$$

It is required to prove that the series $\sum_{n=1}^\infty\frac{z^n}{n}$ does not converge uniformly on the open unit disc centered at $0$, i.e. $\mathbb{D}$. Clearly by virtue of the ratio test the series converges pointwise on  $\mathbb{D}$. However I find it difficult to see why the convergence is not uniform. Could someone please give me a hint?


Let $f:X\rightarrow Y$ be a morphism of algebraic schemes (over an algebraically closed field with char 0). If $f$ is proper and the fibres are connected, then $X$ is connected whenever $Y$ is (see ). Is the same result true if we replace "connected" by irreducible? The proof cannot be adapted to the irreducible case, I think. Note that I do not assume that all the fibres have the same dimension.

Let $f:X \to Y$ be a morphism of varieties and let $Z \subset X$ be a closed subset. Assume that $f^{-1}(p) \cap Z$ is irreducible and of the same dimension for all $p \in Y.$ Show that $Z$ is irreducible.  Here is what I tried:  Assume the contrary and let $Z=Z_1 \cup Z_2$ where $Z_i$s are closed in $Z.$ By assumption, $f^{-1}(p) \cap Z=(f^{-1}(p) \cap Z_1) \cup (f^{-1}(p) \cap Z_2)$ is irreducible, so let $U=\{p \in Y|\; f^{-1}(p) \cap Z=f^{-1}(p) \cap Z_1 \}$ and $V=\{p \in Y|\; f^{-1}(p) \cap Z=f^{-1}(p) \cap Z_2 \}.$ My strategy is to prove that $U,V$ are closed in $Y$ and get the contradiction ( $Y$ is a variety, so irreducible). For instance, consider $U \subset Y.$ Then $Y$ has a finite open affine cover by $Y_i$s, so is enough to show that $U \cap Y_i$ is closed in $Y_i$ for all $i.$ I also know that there is an open subset in $W \subset Y$ s.t. all fibers $f^{-1}(x)$ have the same dimension for all $x \in W,$ but I got stuck and don’t know how to proceed and use the fact that $f^{-1}(p) \cap Z$ have the same dimension for all $p \in Y.$


I just read about the coupon collector's problem where you're trying to find out how many coupons you need to collect on average before you get one complete set. This turns out to be $nH(n)$. I was wondering, how would you go about generalizing this problem to figure out how many coupons you would need on average to get N complete sets?

Recently I tried to solve a problem that based on coupons collector problem. Let it be sth like this:  If a package has one of 50 random baseball cards, how many packages do you need to buy to get a complete set? (or sth like this, doesnt matter)  If I need every card one time, so it makes one set that is easy, explaination is on wikipedia and I already understood it. But what if we consider to collect every card k times? (To collect k sets of cards)  How can I tried to solve this problem? I found sth about Chernoff's bound (http://www.math.ucla.edu/~pak/courses/pg/l10.pdf) but I dont get it actually if it is a solution of this problem. I need to estimate E(X) and Var(X) for k sets of cards.  Could anyone give me a hint how to solve this problem? Thanks for all answers:)  Greetings,


I am working on  datatable and trying to linking table data of each data:  <td style="overflow: hidden;" data-link="<%= receivemail_show_path("id" => trash_mail.id) %>">     <%= trash_mail.date.strftime("%e %b")%> </td>   jQuery(function($) {     $("td[data-link]").click(function() {             window.location = $(this).data('link');           // window.document.location = $(this).data("href");       }); });    My problem is that this link works only for the first page on the datatable Can anyone kindly tell me why it should behave like this?

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


Just installed Nautilus on the Ubuntu MATE 19.10. Navigated to /usr/share/applications to launch some application by clicking on its icon. When I click on the icon of the desktop-file for application this file is opened in text editor. Moreover the icons are not shown:    How one can open application by clicking on its desktop-file in modern Nautilus? I remember it was working as expected in Ubuntu 18.04 LTS.

After installing the latest Ubuntu I find that the icons in the applications folder (viz. /usr/share/applications), when opened in the Files application (Nautilus), come up as a blank page with a gear in the middle. If I try to open them I get a read only text box.


Sometimes I see exactly the same question come up twice, and an example of this is shown below:        The questions shown might look different, but tapping on them brings me to exactly the same page, and on reporting one of the questions as a duplicate, I get this message:        Is this a glitch, or am I missing something? Please let me know.

The Stack Overflow search shows questions twice. See  for example.  Results include "A: Add Search Engine into MVC Music Store" and "Q: Add Search Engine into MVC Music Store".  Why is search displaying the question twice, and what does "Q" and "A" mean?  Edit:   @Stephen answer :  The search is returning both a question (Q) and an answer (A) to the question, as both posts match your search criteria.  and my another question  If the question have multiple (like 100) answer ,then the answer link(A: Question Link) shown 100 times?  Is it correct functionality ? But i saw only one answer link , not a other answer link .. why ?


I have created the views which renders table. I want to make table responsive without any contrib module. Is it possible?

I have a views table block within a panel.   The table is overflowing the panel and I am trying to understand how to constrain it. I have tried setting it's CSS to various widths but they are always ignored. I can change individual column widths, colours etc but not the width.   Do views tables ignore these settings and just display to the width of their content? What is the best way to set their width?  Any tips for using views tables in responsive themes(within panels)?  I'm using Drupal 7.23 ,  7.37 ,  7.33 , -4  Update: In my CSS for this table I have previously tried setting table {   width: 100%; (and with !important). I know it is being applied to the table as when I have very colums it increase the width of the whole table to 100% of it's panel.  The problem occurs when there are a lot of columns and the content text of the column is wide. Then the table overflows past 100%. I can make it thinner by changing font size but I am trying to understand how the views table width is set.  In terms of Views table plugins / modules I am looking at  ,  and (sandbox) . None of these are mature modules so I am quite nervous about using them.


I've been seeing a lot of questions about this, but none of them got me a nice solution to this problem. It's the typical no scroll intro page. The header can have x pixels but the footer is gonna be responsive (will be taller in tablets and mobiles). I can't really get my wrapper to be 100% height of the space between header and footer without pulling my footer outside and then centering vertically the content in the wrapper.  Any solution?  Thanks in advance

I have a simple 2-column layout with a footer that clears both the right and left div in my markup.  My problem is that I can't get the footer to stay at the bottom of the page in all browsers.  It works if the content pushes the footer down, but that's not always the case.


I got as far as: T clone(T source) {     if(source != null && source.GetType() == typeof(List<>))     {         Type listType = source.GetType();         Type listElemType = listType.GetGenericArguments()[0].GetType();         var listClone = (T)Activator.CreateInstance(listType.MakeGenericType(listElemType));         ...         return listClone;     }     ... }  Now, how to fill the clone? As I said, I just need a shallow copy. Thanks.

I have a generic list of objects in C#, and wish to clone the list. The items within the list are cloneable, but there doesn't seem to be an option to do list.Clone().  Is there an easy way around this?


In my class I have unmanaged objects in managed collection (pendingFramesBuffer). I need to implemented IDisposable interface. My question: Where I need to clear pendingFramesBuffer collection? In the if (disposing) {...} condition or not. public class Example : IDisposable {     // unmanaged pointer in managed collection     private BlockingCollection<IntPtr> pendingFramesBuffer = new BlockingCollection<IntPtr>();      /// SOME CODE TO FILL pendingFramesBuffer COLLECTION      public void Dispose()     {         this.Dispose(true);         GC.SuppressFinalize(this);     }      private bool disposed = false;      protected virtual void Dispose(bool disposing)     {         if (!this.disposed)         {             if (disposing)             {                      }              // CLEAR pendingFramesBuffer COLLECTION             while (pendingFramesBuffer != null && pendingFramesBuffer.Count > 1)             {                 var tookFrameBuffer = pendingFramesBuffer.Take();                 Marshal.FreeHGlobal(tookFrameBuffer);             }              this.disposed = true;         }     }      ~Example()     {         Dispose(false);     } }

I know from reading  that the "primary" use of the IDisposable interface is to clean up unmanaged resources.  To me, "unmanaged" means things like database connections, sockets, window handles, etc.  But, I've seen code where the Dispose() method is implemented to free managed resources, which seems redundant to me, since the garbage collector should take care of that for you.  For example:  public class MyCollection : IDisposable {     private List<String> _theList = new List<String>();     private Dictionary<String, Point> _theDict = new Dictionary<String, Point>();      // Die, clear it up! (free unmanaged resources)     public void Dispose()     {         _theList.clear();         _theDict.clear();         _theList = null;         _theDict = null;     }   My question is, does this make the garbage collector free memory used by MyCollection any faster than it normally would?  edit:  So far people have posted some good examples of using IDisposable to clean up unmanaged resources such as database connections and bitmaps.  But suppose that _theList in the above code contained a million strings, and you wanted to free that memory now, rather than waiting for the garbage collector.  Would the above code accomplish that?