Is $\{X: \#X = \#S\}$, for some set $S$ a set? (without axiom of regularity)

In ZF(C), is $C_S =\{X: \#X = \#S\}$, for some set $S\neq \emptyset$ a set? No, because then we would have an element of $C_S$ that contains $\{C_S\}$ and we get an infinite chain $\{C_S\} \in C_S \in \{C_S\} \in$ ..., which contradicts axiom of regularity. But if we exclude the axiom of regularity, can such a set exist?


Titles should be side-by-side in side-by-side markdown view

If you look at  in side-by-side view, the titles are, as you would expect, side-by-side:    If, however, you look at it in side-by-side markdown view, the titles cease to be side-by-side:    I think it would make more sense if titles were side-by-side in both side-by-side view and in side-by-side markdown view.


Links do not appear in the profile info of Stack Exchange profile

After updating the profile info on Stack Exchange from another SE site, I discovered that the links are not clickable there:    Just for a comparison, here is the same snippet from the About Me section on my Stack Overflow profile:    Is this a bug or a feature?


I was working on a PGRE practice problem:      A brick of mass $m$ falls onto a masses spring with spring constant $k$ from a height $h$ above it. What is the maximum distance the spring will be compressed from its equilibrium length?   I use conservation of energy and get that  $x = \frac{mg}{k}(1+\sqrt{1+\frac{2kh}{mg}})$ with the book confirms is correct. However, in the limiting case that h goes to zero, this reduces to $x=\frac{2mg}{k}$ (which the book also notes is correct). If h is zero though, the problem is just find the equilibrium of a spring of spring contact k supporting a brick of mass m, in which case doesn't Newton's second law just give $mg - kx = 0$ implying $x = \frac{mg}{k}$?   I also tried to solve this by saying that when the brick is initially on the spring (in the case that h=0) then the system has gravitational potential energy of zero. Once the spring reaches its equilibrium, the energy will be $0.5kx^2 - mgx=0$ which also gives me $x=\frac{2mg}{k}$  I seem to recall something in my first year physics course about the average force of the spring, but I can't remember anything definitive. Can anyone explain where this factor of two comes from?


Undo apt-get command that removed a large number of packages

I installed libatk 1.0.-0:i386 on my 64-bit system by mistake. It removed almost all from my system starting with indicators ending with Eclipse and other programs. So then I removed libatk and called apt-get autoremove. Now I have a black screen instead of GUI and it's only possible to work from terminal. In apt log there are a huge number of packages, very huge. I even couldn't read them all. Is there any way to automatically install them?


How to set the Identify Feature tool in QGIS 2.4?

The Identify Results window does not appear when using the identify feature tool  in QGIS 2.4. I guess there's a check box somewhere I need to check/uncheck, but the settings of the tool changed compared to the previous version (see attached printscreen).


I know they are important in abstract algebra, but why do people study them? Why are they so important to study? Do they make certain things easier to understand?


Finding Sylow 2-subgroups of the dihedral group $D_n$

I am trying to describe the Sylow $2$-subgroups of an arbitrary dihedral group $D_n$ of order $2n$.   In the case that $n$ is odd, $2$ is the highest power dividing $2n$, so that all Sylow $2$-subgroups have order $2$, and it is fairly easy to describe them.  However, if $n$ isn't odd, we may factor a power of $2$ out and write $|D_n|=2^{k}m$ for some odd integer $m$.   There is  that there exist precisely $m$ Sylow $2$-subgroups, but it does not provide an explicit description of such subgroups in the case $n$ is odd.   Additionally, someone has asked a similar question in the past, and they claim to give a description of the Sylow $2$-subroups in the case $n$ is odd, but I can not find a source or an explanation. The question is .     Can anyone provide a description of how one may determine precisely the Sylow $2$-subgroups for the case $n$ is odd?    Thank you.


Why does adding positive and negative double values in different order produces different result?

I have seen this behavior when I try adding double values where one of the value is a negative double, the order in which I add these values apparently does matter. Here's my test      double val1 = -0.06, val2 = 0.04, val3 = 0.02;     double resOrder1 = val1 + val2 + val3;     double resOrder2 = val2 + val3 + val1;     Console.WriteLine(resOrder1); //3.46944695195361E-18     Console.WriteLine(resOrder2); //0   Am I missing some key principle here? Moreover, how do I make sure I get true for if(resOrder1 == 0){} regardless the addition order. And no I don't want to change the data type to decimal.


NullPointerException outside of volley method

When I am trying to access catagory array after this code it gives me nullpointerexception. I am returning this array to other class. So it also produce nullpointerexception.    JsonObjectRequest req = new JsonObjectRequest(url, new JSONObject(),             new Response.Listener<JSONObject>() {                 @Override                 public void onResponse(JSONObject response) {                     // handle response                     try {                         JSONArray jarray=(JSONArray)response.get(item);                         catagory=new String[jarray.length()][2];                         //catagory_name=new String[jarray.length()];                         for(int i=0;i<jarray.length();i++){                             JSONObject jobj = (JSONObject) jarray                                     .get(i);                             catagory[i][1]=jobj.getString(sectionurl);                             catagory[i][0]=jobj.getString(name);                         }                     }                     catch (JSONException je){                      }                  }             }, new Response.ErrorListener() {         @Override         public void onErrorResponse(VolleyError error) {             // handle error         }     })   String str=catagory[0][0];//AT THIS LINE AN EXCEPTION IS THROWN


how to expand function with additional strings

I am currently trying to solve some beginners exercises but I am stuck at the point where I am supposed to expand an existing function and also add the string that allows me to ignore upper and lower cases. I do really do not know where in the function I should be adding this last information. I am also supposed to find all the lines where the words appear ('Heaven', 'all', 'you'). Here is what I have now: def all_line_numbers(text, word):     """     Returns the line numbers (beginning with 1) where the word appears in     :param text: Text in which the word is searched for     :param word: A word to search for     :return: List of line numbers     """      lines = text.splitlines()     i = 0     for line in lines:         i = i + 1         if word in line:             return i      return []  and it ends with: # print() print("exercise") words = ['Heaven', 'all', 'you'] for word in words:     num = all_line_numbers(it_rains, word)     if num:         print(f"The word {word} is in the following lines {num}.")     else:         print(f"The word {word} was not found!")  Thank you very much in advance!


How to show a user login form on a completely separate page?

I am developing a application where I want to restrict everything from anonymous users. If anyone tries to access any page from url directly they will be redirected to login page. How to do this?  Also I want show the login page in a completely separate page where there should be no menu or any other links, just the login form (like for example: google login page). What is the best way to do this.


Where is it preferred to place the answer to duplicate questions?

Using the following assumption:   If two questions are both equal to the same question, then they are equal to each other.  Therefore, the answer to one of them is also the answer to another.   And the following question are considered duplicate:       However, I think that to answer two duplicate questions with duplicate answers would just be seen as spam, so I currently leave only one.   But I'm not sure for Where it is preferred to place the answer to duplicate questions?.


How long do I have to be on a page for it to count as a "view"?

I have noticed that when I post a new question, it has a 1 view straight away.  It has this even if I post and then close the tab within 0.05 seconds. Is this long enough for the page to count a view?


How to display field_tags of a node in html.html.twig?

I want to display fields "field_summary" and "field_tags" of a node in html.html.twig (without using a module for that). I was already able to get "field_summary" value in html.html.twig with this code:  function universaldenker_preprocess_html(&$variables) {   $node = \Drupal::routeMatch()->getParameter('node');   $variables['node_summary'] = $node->get('field_summary')->value;   $variables['node_tags'] = $node->get('field_tags')->getString(); }   Then I just used {{ node_summary }} in html.html.twig. It works perfectly. But I couln't display values of "field_tags". If I use {{ node_tags|join(', ') }} then I get the field_tags ID's.   How can I get the values and not ID's?


If photons do not have mass, why does light get attracted such that it cannot escape a black hole?

Does gravitational force of black hole attract the light? Or is it something else?


How do I efficiently determine if a polygon is convex, non-convex or complex?

From the man page for :        If shape is Complex, the path may self-intersect.  Note that contiguous coincident points in the path are not treated as self-intersection.   If shape is Convex, for every pair of points inside the polygon, the line segment connecting them does not intersect the path. If known by the client, specifying Convex can improve performance. If you specify Convex for a path that is not convex, the graphics results are undefined.   If shape is Nonconvex, the path does not self-intersect, but the shape is not wholly convex. If known by the client, specifying Nonconvex instead of Complex may improve performance.  If you specify Nonconvex for a self-intersecting path, the graphics results are undefined.      I am having performance problems with fill XFillPolygon and, as the man page suggests, the first step I want to take is to specify the correct shape of the polygon. I am currently using Complex to be on the safe side.  Is there an efficient algorithm to determine if a polygon (defined by a series of coordinates) is convex, non-convex or complex?


Number of solutions of $x^2=1$ in $\mathbb{Z}/n\mathbb{Z}$

Next is what I have worked out to the moment.   $1$ and $-1$ are roots for all $n$.  $x \in \mathbb{Z}/n\mathbb{Z},\ $ $x^2\equiv1 \Leftrightarrow (x-1)(x+1)\equiv0 \Leftrightarrow \exists k \in \mathbb{Z}/n\mathbb{Z}: k(k+2)\equiv0 $. But how can it be applied to find other roots?


I have tried and tried to open the candy box but it won't work I have all four stones whats my problem?


Asking questions not of personal interest

There are sometimes questions that come to mind, to ask on the site. They could be very general, or relate to common examples. However, I personally may not be interested in knowing the answer, or I myself may know that the answer is beyond my scope of understanding. Nevertheless, they would benefit others on the site.  Is it okay to ask such questions, and then ignore any answers that do come?


Function failed when called from other project due to assembly file c#

I have a c# solution with 2 projects. one of them is a server (The server was build using signalR) which activates a Hub. The second is a windows form project which suppose to output a basic window, in the constructor of this window I call the following function (from the first project)  this function suppose to activate the server.  However when I run this line dis = WebApp.Start<Startup>("http://localhost:10476"); I get the following exception  "Could not load file or assembly 'Microsoft.Owin, Version=4.0.1.0, Culture=neutral, PublicKeyToken=31bf3856ad364e35' or one of its dependencies. The located assembly's manifest definition does not match the assembly reference. (Exception from HRESULT: 0x80131040)"  So do you know what is the problem? should I install signalR also for the second project?(it sounds inefficient)


I have just started learning Lie Groups and Algebra. Considering a flat 2-d plane if we want to translate a point from $(x,y)$ to $(x+a,y+b)$ then can we write it as :  $$   \left( \begin{array}{ccc} x+a  \\ y+b  \end{array} \right) =   \left( \begin{array}{ccc} x  \\ y  \end{array} \right) +    \left( \begin{array}{ccc} a  \\ b  \end{array} \right)$$  Now the set of all translations  $ T =   \left( \begin{array}{ccc} a  \\ b  \end{array} \right) $ form a two paramater lie group (I presume) with addition of column as the composition rule.  If that is so, how do I go about finding the generators of this transformation.  PS:  In my course I have been taught that the generators are found by calculating the taylor expansion of the group element about the Identity of the group. For instance, $SO(2)$ group  $$ M =   \left( \begin{array}{cc} cos \:\phi & -sin \:\phi \\ sin \:\phi &  cos \:\phi \end{array} \right) $$ I obtain the generator by taking  $$ \frac{\partial M}{\partial \phi}\Bigg|_{\phi=0} =   \left( \begin{array}{cc} 0  & -1 \\ 1 &  0 \end{array} \right) $$  Now if I exponentiate this, I can obtain back the group element. My question how do I do this for Translation group.


I connect to my server via Putty SSH client.  With the key ↑ I see previous entered commands, one by one. I just wondering is there a some command, which show all previous entered commands out of a simple list. Something like the command ls show the list directory contents.     I mark the list of all commands, but cant click with the second mouse button or Ctrl + C to copy all commands. Do you have idea how i can copy all commands list?


$\lim_{n\to\infty}\frac{2^n\cdot n!}{n^n}$   I think we can do it by squeeze rule but I could not find a sequence bigger than this one converging to 0 without using Stirling approximation of n!


git-daemon-sysvinit error. Unable to purge

So.. I recently tried to install git-all but it gave me a git-daemon-run error. I read that it is suggested to install git-daemon-sysvinit instead. However, now I am unable to install or purge anything. I get the following output when I try   sudo apt-get install git-all git-daemon-sysvinit  Reading package lists... Done Building dependency tree        Reading state information... Done git-all is already the newest version (1:2.7.4-0ubuntu1). git-daemon-sysvinit is already the newest version (1:2.7.4-0ubuntu1). The following package was automatically installed and is no longer required:   fgetty Use 'sudo apt autoremove' to remove it. 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 1 not fully installed or removed. After this operation, 0 B of additional disk space will be used. Do you want to continue? [Y/n] y Setting up git-daemon-sysvinit (1:2.7.4-0ubuntu1) ... Failed to start git-daemon.service: Unit git-daemon.service not found. invoke-rc.d: initscript git-daemon, action "start" failed. dpkg: error processing package git-daemon-sysvinit (--configure):  subprocess installed post-installation script returned error exit status 5 Errors were encountered while processing:  git-daemon-sysvinit E: Sub-process /usr/bin/dpkg returned an error code (1)   I also get the same error if I try to uninstall or reinstall  git-daemon-sysvinit. So now I am basically stuck... I am running 16.04 LTS


How does a value not part of the domain satisfy the function?

Consider $$y= \frac{(x^2-9)}{x-3}$$ For y to be meaningful x must not equal 3 , So, 3 is not included within the domain of the function y (Call it f(x) if you will)  It follows that,  $$yx-3y = x^2 -9 $$ Plug in 3 to x out of curiosity, I find, $$ 0=0 $$ A perfectly valid relation! How is this possible?  This problem is even more predominant in partial fraction decomposition. Have a look  at this example I found on the web,  x cannot equal -1 or 2. How is it giving us the right answers then? What is the math behind this? When I do these kind of problems it feels like something's is happening mathematically, hidden from my view  All help is appreciated


Since the update to 1.5 to 1.6, I haven't had any sound. I've tried the fallowing:  Deleted .minecraft folder Redownloaded the new launcher Replaced lwjgl with the version used in 1.5 (doesn't work because new launcher auto-updates it back to the latest) Changed resource packs. F3+S Checked sound files and options  None of which fixed it. :( From what I gather, this isn't the same issue some folks on Windows have had, because none of their fixes work for me. So I assume this is a Linux issue with java.  This is on Ubuntu 13.04 64bit, and I'm using the latest openjdk.


How to give dots or point or period before the number of equation

Hi I want to ask how to give period before the number of equation.  For Example  A = B + C            ...(1)


Why does \includegraphics ignore the space in a filename?

I use the following code:  \documentclass{article} \usepackage{tikz} \begin{document} \begin{center} \includegraphics{GR0568 q28.png} \end{center} \end{document}   and get this output:    Why does it publish "q28.png"? I'm sure I could fix this if I didn't have a space in the filename, but is there another workaround?


NullPointerException occurs when going through methods

I'm trying to figure out some basics in Java. The code I've typed below compiles just fine, but not running. Everytime the code runs, it says NullPointerException error occurs.  class testOnStrings {     public static void main (String args []){         String input, output;          // isWordPalindrome         input = "forever eating cheese";         boolean boolOutput = isWordPalindrome(input);         System.out.println("\n" + input + (boolOutput ? " is " : " is not ") + "a word palindrome");          input = "fall leaves when leaves fall";         boolOutput = isWordPalindrome(input);         System.out.println("\n" + input + (boolOutput ? " is " : " is not ") + "a word palindrome");          input = null;         boolOutput = isWordPalindrome(input);         System.out.println("\n" + input + (boolOutput ? " is " : " is not ") + "a word palindrome");     }      static String reverseWords(String input) {         // My code         String words[] = input.split(" ");         String reverseWord = "";         for (int pointer = words.length - 1; pointer >= 0; pointer--)             reverseWord += words [pointer] + " ";         return reverseWord;     }      static boolean isWordPalindrome(String input) {         // My code         String reverseWordInput = reverseWords(input);         boolean isPalindrome = input.equals(reverseWordInput);         return isPalindrome;     } }   There is an error when running the code.  Exception in thread "main"  java.lang.NullPointerException     at idle.reverseWords(idle.java:21)     at idle.isWordPalindrome(idle.java:30)     at idle.main(idle.java:15)   Please help because the compilation is successful but code is not running


Word for number or word that reads the same when inverted or mirrored

The number I am thinking of is 80808. This is a palindrome. However, it is more than a palindrome, because it can be flipped or mirrored and will still read the same way.  Is there a word for this?


Is there any way a griefer could overcome my 5-million-block quarantine?

I'm running a vanilla Minecraft (PC) server that some of my friends and I play on together. We've been looking to get more people to join us, but have been fairly unsuccessful so far. Listing the server publicly would almost certainly change that, but brings the risk of griefing.  So my question is: if I simply set the spawn point far enough away from where we have so far built everything (say 5,000,000 blocks away), it would take very long to reach 0,0 even by horse in the nether. I'm thinking that would be sufficient protection for our existing village, if I'm not overlooking anything. Is there a way to bypass or overcome this distance that I am not aware of?


How to retain/transfer ranking when updating/redesigning website?

What steps do I have to take in order to make sure that I keep my search engine rankings after I redesign or update my site?


Unable to open ubuntu in virtual box 6.1 after changing system permissions

I had virtual box previously installed and it worked fine until I created a new user and gave it permissions using: sudo chmod -R 777 / After that when I closed and reopened my virtual box I could not open Ubuntu. I uninstalled and reinstalled virtual box.But this is what I am getting when I try to open Ubuntu.     How do I fix this issue?


Finding a pair of functions with properties

I need to find a pair of functions $f$, $g$ such that    $f$ is not differentiable at  $x = 0$ $g$ is not differentiable at $f(0)$ $g \circ f$ is differentiable at $x = 0$   I've tried a lot of functions but just can't seem to find ones that work. Any help would be appreciated, thank you.


Cocoa powder stays stuck at the bottom of the cup

I am trying to make a warm drink using cocoa without much additions. Basically I boil water and the slowly add it to a cup with cocoa powder while I stir. I also add some cold milk. When I stir with a spoon, I see that it becomes sticky and liquid and looks like butter melted. The problem is that when I fill the cup with boiling water and some cold mild and start drinking it, in the end most of the cocoa powder have stayed stuck at the bottom of the cup. How can I make it so that it is completely dissolved but only using water and a bit of milk? Please note, that I don't have a microwave


If $f^2$ is an analytic function then so is $f$

I want to show the following:  If $f(z) $ is a continuous  function on a connected open subset of the complex plane and $f(z)^2$ is an analytic function, then $f(z)$ is analytic.  Clearly if $f(z) \neq 0$ then $$\frac{f(z+h)-f(z)}{h}=\frac{f(z+h)^2-f(z)^2}{h}.\frac{1}{f(z+h)+f(z)}$$  which shows $f^\prime(z) $ exists if $f(z)\neq0$.  What do I do when $f(z) =0$?


I understand all of the bitwise operations (in Java specifically) except bitwise left shift.  I've combed the "stacks" and read many "explanations" on different pages, but I am still left unsatisfied.  Either this is an extremely complicated concept or it is not well understood and obscure.  But, I know it must be relevant to some extent because I have seen Java algorithms (today) that indeed use the left shift operator "<<".  So if someone could break this down in plain English that would be great!


When attempting to install Wine, Terminal answers about the wrong path:  E: Unable to locate package winehq-stable   BUT  it was installed:   anatoly@anatoly-desktop:~$ sudo apt install --install-recommends winehq-stable Reading package lists... Done   Please how to tell Terminal to go to its place?  anatoly@anatoly-desktop:~$ wget -nc https://dl.winehq.org/wine-builds/winehq.key --2019-02-28 11:00:11--  https://dl.winehq.org/wine-builds/winehq.key Resolving dl.winehq.org (dl.winehq.org)... 151.101.14.217 Connecting to dl.winehq.org (dl.winehq.org)|151.101.14.217|:443... connected. HTTP request sent, awaiting response... 200 OK Length: 3220 (3.1K) [application/pgp-keys] Saving to: ‘winehq.key’  winehq.key                 100%[========================================>]   3.14K  --.-KB/s    in 0s        2019-02-28 11:00:12 (13.4 MB/s) - ‘winehq.key’ saved [3220/3220]  anatoly@anatoly-desktop:~$ sudo apt-key add winehq.key [sudo] password for anatoly:  OK anatoly@anatoly-desktop:~$ sudo apt update Hit:1 http://il.archive.ubuntu.com/ubuntu bionic InRelease Hit:2 http://il.archive.ubuntu.com/ubuntu bionic-updates InRelease Hit:3 http://il.archive.ubuntu.com/ubuntu bionic-backports InRelease Hit:4 http://security.ubuntu.com/ubuntu bionic-security InRelease Reading package lists... Done                      Building dependency tree        Reading state information... Done 270 packages can be upgraded. Run 'apt list --upgradable' to see them. anatoly@anatoly-desktop:~$ sudo apt install --install-recommends winehq-stable Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package winehq-stable anatoly@anatoly-desktop:~$


An example of a bounded pseudo Cauchy sequence that diverges?

Harmonic series diverges and pseudo Cauchy however it's not bounded. So how can I find such a sequence?  A sequence $(s_n)$ is pseudo-Cauchy if, for all $\xi>0$, there exists an $N$ such that if $n ≥ N$, then $|s_{n+1}−s_n| < ξ$.


Canot access my desktop folder with bash script

I've wrote a script to go to a Windows folder on my desktop. Here it is:  #!/bin/bash cd /mnt/c/users/username/desktop/testes/.../.../mydir   then chmod +x scriptname.  but when I call it (./scriptnameENTER), it does nothing and remains in my home directory.  I've tried sudo ./myscriptname also...


How to set up and use a virtual python environment in Ubuntu?

Python virtual environments are used to create isolated python environments to avoid dependency and version conflicts, and also indirectly take care of permission issues. But what is the easiest way to set it up, and use it, in Ubuntu?


Poisson distribution and properties of probability

I need the step-by-step solution for this question.  If X and Y are aleatory independent variables with a Poisson distribution whose parameters are $\lambda_1$ and $\lambda_2$, respectively. Show that the aleatory variable $W=X+Y$ has a Poisson distribution too.


How to write a test class for a Constructor?

In my Apex controller, I have a Constructor method which initializes two variables by querying custom objects using id from URL:  ApexPages.currentPage().getParameters().get('Id');   Am I able to write a test method to the Controller's constructor?


Let $f,h,g\in L^{2}(\mathbb R^2).$ Prove the inequality   $$\int_{\mathbb R^3}\vert f(x,y)g(y,z)h(z,x)\vert d(x,y,z)\leq\|f\|_2\|g\|_2\|h\|_2.$$   Using Fubini's Theorem and the Cauchy-Schwarz Inequality I obtained the following string of inequalities $$\int_{\mathbb R^3}\vert f(x,y)g(y,z)h(z,x)\vert\,d(x,y,z)\leq\|f\|_2\int_{\mathbb R}\left[\int_{\mathbb R}\int_{\mathbb R}\vert g(y,z)h(z,x)\vert^2\,dx\,dy\right]^{1/2}dz,$$ $$\int_{\mathbb R^3}\vert f(x,y)g(y,z)h(z,x)\vert\,d(x,y,z)\leq\|g\|_2\int_{\mathbb R}\left[\int_{\mathbb R}\int_{\mathbb R}\vert f(x,y)h(z,x)\vert^2\,dy\,dz\right]^{1/2}dx,$$ $$\int_{\mathbb R^3}\vert f(x,y)g(y,z)h(z,x)\vert\,d(x,y,z)\leq\|h\|_2\int_{\mathbb R}\left[\int_{\mathbb R}\int_{\mathbb R}\vert f(x,y)g(y,z)\vert^2\,dx\,dz\right]^{1/2}dy,$$ which I think, upon multiplication of all three, lead to nothing.  After that I tried using again Fubini's Theorem and this time Minkowski's Integral Inequality, but that leads to a similar string of inequalities, once again leading nowhere.    Can anyone please recommend me something to try to get started on this problem?  Thank you for your time and I apologize for my failure to solve the problem or come up with a more clever attempt.


"Failed to fetch liborbit2_2.14.19-0.2_amd64.deb" when installing Java

When I try to install openjdk-7-jdk, I get the following message:  Failed to fetch http://in.archive.ubuntu.com/ubuntu/pool/main/o/orbit2/liborbit2_2.14.19-0.2_amd64.deb   Size mismatch E: Unable to fetch some archives, maybe run apt-get update or try with --fix-missing?   How to fix it?


I'm looking to see if there is a way of taking a generic async function, such as AJAX, or web worker on message, and forcing it to behave synchronously.  First off - I really do need this behaviour, I am aware of all the arguments regarding async callbacks vs returns - but in this case, I truly need to wait for a callback.   If there is no generic solution available I'd settle for one that works purely on the Worker.prototype.onmessage as that is the primary use case here.   I'm fairly sure the answer will be "thats not possible" but I wanted to check before surrendering.  I've already looked into promises and generators, I'd prefer not to use a third party library (I'm aware of fiber/futures for Node).  A potential use case:  function main(){     worker = new Worker("someWorker.js")     var result = worker.onmessage(function(event){         return event.data;     })     //wait for worker.onmessage     return result; }


Moment UTC time how to convert to seconds

I would like to convert a date from my filter to UTC time and then to seconds keeping the UTC time / not the local time. Examples: new Date()  // Wed Aug 19 2020 15:28:09 GMT+0200 (Central European Summer Time) moment.utc(new Date()).format()  // correctly outputs 2020-08-19T13:28:09Z - so -2h moment.utc(new Date()).format('X')  // unix timestamp 1597843870 - 19/08/2020, 15:31:10 Summer Time returns time plus 2h - not what I want moment.utc(new Date()).unix()  // again as above unix timestamp 1597843870 - 19/08/2020, 15:31:10 Summer Time returns time plus 2h - not what I want  So to summarize I need to convert the UTC formatted time to a number of seconds so it is (whenever converted with convertor the same number of seconds). Meaning this: moment.utc(new Date()).format() after conversion to seconds needs to be 1597843689 Is there any reasonable way how this could be done with a moment?


string match - find all occurrences of the same word in the string being evaluated

Looking to find a way, via string match, to find multiple occurrences of the same word using the streamreader class and contains method (or some other approach).  Below only returns a match on the first occurrence, however if I'm evaluating a string that has "the" 3 times in the string, how can I capture all 3 of those for a count result?  while ((line = file.ReadLine()) != null)     {       if (line.Contains(text))       {           counter++;       } }


I am trying to prove, that for any real $x$ and any real $t \neq 0$ that $$\bigg{|}\frac{e^{itx}-1}{t}\bigg{|} \leq |x| $$ Graphically it seems to be true but I cant quite get it formally.


I have to answer if the following code compiles and which are the results:  char *s1 = "A String"; char *s2 = "Other String"; *s1 = *s2;   I didnt really find what happens in the background when you do declarations like that. Is s1 pointing to memory looking like this?:   |A| |S|t|r|i|n|g|\0|   In my understanding *s1 = *s2 is the same like s1[0] = s2[0], right? So why do I get a memory error? Shouldnt it be?:  |O| |S|t|r|i|n|g|\0|


Regex find word and allow any characters after it in a string

Ive got this string  designer-brand-paradise-design-t-9999-123990-tshirt-print-18-preorder-november-delivery  I need to extract any instance of preorder-* from it as I have a bit of a situation with alot of data lingering around.  Im new to regular expressions, so Im hoping this is an easy one. any help greatly appreciated


How to know if there is any iron ore on the map?

From reading the wiki, it seems that iron ores can be found in layers consisting of chalk. I've now mined out almost two complete layers of chalk, and found nothing but gems. Is it possible that my map doesn't have any iron ore, or am I misunderstanding how to find the ore?  The first couple of layers consist of chalk, so that's where I'm digging. Unfortunately the strip mining makes the fortress quite ugly, as that's where I've got my workshops. The lower levels have mainly phyllite and schist.


Parametric equations for the plane through origin parallel to two vectors

Given two vectors $u,v\in\mathbb{R}^3$, find the parametric equations for the plane through the origin parallel to $u$ and $v$.  I'm having a difficult time understanding this question. How can a plane through the origin in $\mathbb{R}^3$ be parallel to two vectors, both of which start from the origin? Surely they all intersect at the origin and thus not parallel?  More concretely, $u=(1,2,3)$ and $v=(-2,1,1)$. The cartesian equation of the plane is $x+7y-5z=0$, which is essentially the solution. But I want to know why.


This question is basically a spin off from my friend's question - "What are we basically seeing? Is it the atom or the nucleus?" (He had referred to the huge amount of empty space inside the atoms). I replied that it must be the electronic transitions between different orbitals. It gets energy from outside, it then goes in some orbit inside, but it is unstable there, so it releases energy and comes back to its original orbit. If the corresponding wavelength matches a particular colour, we detect it. (Typical explanation based on Bohr's model).  Now another question arises that what we must be touching (suppose if we touch the keyboard), because most of the space inside the atom is empty. The size of the nucleus is almost 100,000 times less than the atom. So are we touching the atoms or the nucleus? Or the lattice arrangement of atoms? What about liquids then?  Another thing I know is that frictional & other contact forces have electromagnetic origins but I don't know exactly how. Can someone please explain?


How can I put all expressions within a pair of dollar signs into a desired color?

In my Tex document, I want to colour all the expressions within two dollar signs (such as $e^{i\pi}$, $\log x$ etc), within a pair of dollar signs (such as $$e^{i\pi}+1=0$$), within the \begin{eqnarray}...\end{eqnarray} in a desired color (say, yellow) without doing it each time. Is there any command to achieve this?


Good day to everyone,  I would like to ask this question. I was wondering what is considered to be the hardest area of mathematics, so I searched in forums and outside of answers like Langlands programe and Cohomology there was this answew called Irational number theory, where it was stated that we basically have no idea of how to even solve the basic questions. Which leads me to my question.   Do we have number systems of higher cardinality then Reals? I don´t mean number systems like Complex numbers, Quartions, ... as all of them have the same cardinality as Reals, I mean number systems like the power set of Reals and power set of that power set etc. And do we do some math(outside of set theoretic math), meaning have big open problems like the millenium prize problems in those number systems? Or is it more or less corect to say that almost all of our current math research is done in Computable numbers and mathematics in those "higher infinities" is too hard for our finite brains?   Thank you for your answer.


How/why does this generating function approach work?

Suppose I wanted to find the number of solutions of $$e_1 + e_2 + e_3 = 17$$ where $e_1, e_2,$ and $e_3$ are nonnegative integers with $2 \leq e_1 \leq 5, 3 \leq e_2 \leq 6, 4 \leq e_3 \leq 7$.  The solution [apparently] lies in the fact that the number of solutions with the indicated constraints is the coefficient of $x^{17}$ in the expansion of $$\bigg(\sum_{k=2}^5 x^k \bigg)\bigg(\sum_{k=3}^6 x^k \bigg) \bigg(\sum_{k=4}^7 x^k\bigg) $$Why is this the case? Why, on a fundamental level, do elementary generating function-based counting methods (such as this one) work?


Why did Cloud City have the huge chutes leading into open air?

Towards the end of "The Empire Strikes Back", Luke escapes from Darth Vader by jumping down a chute... which opens up into open air, and leaves him dangling on a mast...  Why does Cloud City have these death traps in the first place?


Why do we use a gray encoded signal by 2 stage flip-flop in asynchronous FIFO to avoid race-condition issue?

In the FIFO design, to compare the rptr and wptr, we are feeding one signal into another clock domain. The rptr which is coming from the slow clock domain to faster one can be synchronized with sync Flip-flop logic explained in the beginning. However, the wptr which is coming from fast clock domain to slower clock domain and it cannot be synchronized. For example, If Write clock faster 10 times than Read Clock, then sync_w2r doesn't sample the wptr which is based on wclk.  AS you can see the above waveform, din[10:0] on the write(fast) clock is sampled by read clk clock(slow). and the din is a write pointer which is encoded by Gray. and dout[10:0] is a signal synchronized signal by read clock(slow) Actually Gray Encoded pointer signal(dout[10:0]) looks not having a continuously sampled by read clock. you can see the dout[10:0]. It causes a race condition problem. Even Gray encoded signal is synchronized by 2 stage flip-flops. but gray encoded signal does not work to avoid race condition issue at the each of edge sample clock. 1(sampled)-3-2-6(sampled)..go on.. it's actually 2 bits signals were changed from 2'b001 to 2'b110. how can we explain the Gray encoded signal can be used to avoid a race-condition problem? How is the problem solved?


With the following code, I get TWO errors on the line \begin{abstract}, one saying "Misplaced alignment tab character &" which doesn't make sense because I'm not citing anything, so no & is misplaced in my citations and Package hyperref Warning: Token not allowed in a PDF string (PDFDocencoding): remove \unskip on input line 61 - which is the \begin{abstract} line I understand perhaps \texorpdfstring would be a solution here, but I'm unclear how to input that exactly into this type of "bookmark"      \documentclass[runningheads]{llncs} \fontfamily{ptm}\selectfont \usepackage{hyperref} \hypersetup{     linktocpage,     colorlinks=true,     linkcolor=blue,     citecolor= red,     filecolor=red,           urlcolor=cyan} \usepackage{graphicx} \graphicspath{{figures/}} \usepackage{array} \usepackage{longtable}  \usepackage{makecell} \usepackage{cite} \usepackage[utf8x]{inputenc}  \usepackage[english]{babel} \renewcommand\theadalign{bc} \renewcommand\theadfont{\bfseries} \renewcommand\theadgape{\Gape[4pt]} \renewcommand\cellgape{\Gape[4pt]} \usepackage{geometry} \geometry{letterpaper, portrait, margin=1in}  \begin{document}  \title{The Ethics of Software: A Systematic Mapping Study of Ethical Concerns  in Software Engineering \thanks{Supported by my school.}}  \titlerunning{The Ethics of Software: A Mapping Study \& Focus Group}  \author{My name\inst{1}\orcidID{2643038}}  \authorrunning{my name}  \institute{my school \email{my email}} \maketitle \begin{abstract} \end{abstract}   \end{document}


Add JavaScript in footer if shortcode used in page

I want to add javascript to page footer if the shortcode is used into the page content.  add_shortcode('show-popup', 'show_aip_popup');  function show_aip_popup($args){     // HTML Comes here for popup }


Why don't we define $\frac00$ (or other undefined expressions) the same way we define $\sqrt{-1}$? My guess, and my Calculus professor's opinion, is that by doing so we really do not achieve anything. In other words, it's useless to do so. However, how do we know defining undefined expressions is useless? Take for example $\frac00$.


Is there a difference between laptop and desktop RAM?

Looking to upgrade my Acer laptop, and from what I've researched, I can swap out a 1x2GB module with a max of 1x8 GB module of DDR3 running at 16000mhz. I've found a listing on Amazon for the exact some module but the product states it is a Desktop RAM  Is it okay to use Desktop RAM in laptop RAM?  If not, what should I be looking for in terms of RAM for a laptop?


Does a Burkina Faso citizen need a transit visa for Brussels?

Does a Burkina Faso citizen need a transit visa for Brussels when traveling to the USA?  She has a USA visa.


Show that $\mathbb{R} \backslash \mathbb{Z}$ is open.

Definition. A subset of $\mathbb{R}$ is called open if it is a union of open intervals.  Example.  $\mathbb{R} \backslash \mathbb{Z}$ is open.  Proof (is from my lecture notes).$\mathbb{R} \backslash \mathbb{Z}=\cup\left\{ \left( n,n+1\right) :n\in \mathbb{Z}\right\}$.  My question is: why $n$ in $\mathbb{Z}$? I think, $n$ cannot be in $\mathbb{Z}$ because  we say $\mathbb{R} \backslash \mathbb{Z}$.


How much did Hobbits of Middle Earth during the Third Age know about Vala, Maia, and the events of the First of Age?

This question is prompted by a previous question (  ). My initial instinct was that Bilbo and Frodo had no idea what a "Maia" or "Vala" was. They probably knew more than the average Hobbit about these things, but I would guess they know less about their own universe than average readers of Tolkien legendarium questions on this site.  This question (  ) establishes that Faramir's men know of the Valar. One cries "May the Valar turn him aside!" when faced with an oncoming oliphant. Being Men of Gondor, which has a long history, they probably knew more than other Men or Hobbits. Clearly, many of the Elven characters (Galadriel, Elrond, Glorfindel, Círdan, etc) are also well aware of the Valar and Maiar and some of them were present for the events of the First Age.  Is there any evidence from the books or Tolkien's writings that the Hobbits had a good understanding of their own creation story? Do the Hobbit characters of Lord of Rings or the Hobbit discuss Vala, Maia, or events of the First Age, beyond simply recognizing that there are old, mysterious powers in the world that mostly outside of their experience and knowledge?


How can I block app and game invitations once and for all in Facebook?

I want to block app and game invitations once and for all in Facebook. How can I do it so they cannot disturb me anymore?


Is it possible to create static class with [] Operator?  On non static classes the syntax is pretty simple:     public V this[K key]         {             get             {                //get stuff...             }             set             {                //set stuff....             }         }   However, I can't find a way to this on static objects.


How to migrate the sonatype-nexus repository from one instance to another?

We have two nexus instances running on two different Linux servers. We are planning to have only single instance for all apps and hence wanted to move the repositories from a smaller nexus to another one.  In , they said we can just download the repositories from storage path one instance to another but on same machine.  Can someone give some accurate steps here?


I am attempting to make a board for the  24-channel led driver to drive an 8x8 rgb led array. I have made what I think is a good eagle library for the sop-38 package, but I am not sure what to do about the pad on the underside of the ic. The datasheet has thermal characteristics with and without the pad soldered, but I suspect I will want the heat dissipation provided by the pad. This is my most ambitious soldering project yet, and I have a few questions I would like to straighten out before I have the first round of boards made.  Should I hook the heatsink to my ground polygon on the bottom side, or leave it disconnected? I'm not sure if it will cause problems with grounding if it heats up too much.   Is my only option to reflow this, or is there a way to do it by hand? I have never done any reflow soldering, and I am much more comfortable hand soldering. I am definitely not comfortable having a stencil made to do this kind of thing. Is there any kind of thermal compound or something that can make a thermal connection comparable to a solder joint, or is solder best?   The datasheet has very specific dimensions for pad size, via patterns, and stencil opening. Should my solder mask pretty much follow the stencil opening outline on the datasheet?


UK visitor visa issues because of previous transgression

Between 1999 - 2005, I lived in Nigeria but travelled in and out of the UK numerous times. In 2006 (I was 21 years old), I overstayed my visa by a month and left voluntarily (was not deported or forced to do so).  In 2006, when I arrived in Nigeria, a Nigerian immigration official backdated my arrival date in Nigeria to appear as if I did not overstay (fraud). When I went to renew my visitor visa at the UK Embassy in Nigeria, I was called for an interview. The official who interviewed me called the airline to confirm if I had arrived back in Nigeria on the date stamped on my passport and they said I didn't and the visa was refused.  In 2016, 10 years later, I applied for a UK visitors visa to visit my brother who is a British citizen. On the section where it asked if i have ever been refused a UK visa, I was quite vague about the 2006 event. It was refused due to previous travel history (they didn't elaborate), because I used a private bank statement while self employed, and for lack of ties to home country.  Now, in 2018, I want to re-apply in order to visit my brother and his family. My circumstances have changed significantly. My business is now formal with company bank statements for 2 years, I am married with children, and I bought a property outright and have title deed in my name (value £100,000). I also run a thriving business with a bank balance of more than £250,000 at any time and have travelled to a Schengen country and came returned to my country.   What are my chances of getting a visa again? Will an apology letter for the incident in 2006 help? Is there a way to motivate a new application?


I installed XAMPP in my Ubuntu laptop and I used to work with it without a problem. Just starting the server with: sudo /opt/lampp/lampp start Then, I tried to install a software that needed an apache server and probably something screwed it. Now, each time I run the command, I have this output: Starting XAMPP for Linux 5.6.3-0... XAMPP: Starting Apache...fail. XAMPP:  Another web server is already running. XAMPP: Starting MySQL...ok. XAMPP: Starting ProFTPD...ok.  What I have to do, is to run the sudo /etc/init.d/apache2 stop and then start the lampp again. This means that the apache2 is running all the time. Is there any way to solve it without destroy the lampp installation too?


I have an app built with C#. This app uses Entity Framework to query tables. In my databsae, I have two tables:  Department ---------- Id Name RemovedOn  Managers --------- Id Name DepartmentId   When a user accesses the page, I have their ID. I need to get all of the departments associated with that manager. Currently, I have the following:  var managerDepartments = MyDb.Departments   .Where(d => d.RemovedOn == null)   .OrderBy(d => d.Name)   .ToList();   This gives me all departments. However, it doesn't give me the list of departments specific to the manager. I know I can get the manager using something like this:  var manager = MyDb.Managers   .Where(m => m.Id == this.CurrentUserId)   .FirstOrDefault();   However, this doesn't bridge the two. I know I need to do a join. However, I don't know what that syntax looks like. Can someone please show me how to get all of the departments for a manager?  Thank you


As a Freelance Production Artist, are clients entitled to native files? My now ex-client gave me images to edit for their website and marketing g and are now requesting all the PSD's so they can have for further editing.


Why is the electric current instantaneous while the drift velocity of electrons is slow?

The speed of an electron is very slow  while going through a conductor(like 1mm per second),but the current passes instantaneous.why?


Let $$n= 2^a p_1^{e_1}...p_r^{e_r}q_1^{f_1}...q_s^{f_s} $$ be the prime factorization of $ n \in \mathbb{N} $, where $ p_1,\ldots,p_r $ are the primes leaving a residue of $1\bmod{4}$, $q_1,...,q_s$ are the ones leaving a residue of $3$, and $f_1,...,f_s $ are even numbers.  How can I show that   $$ \# \{(a,b) \in \mathbb{Z} ^2 | a^2 + b^2=n \} = 4(e_1+1)...(e_r +1 ) ?$$  Any help is appreciated. __ _Edit  I try to get an example for this to understand it more..the answere in the linked duplikate is not very clear to me. lets take $ 65$  $65= 5* 13 $  $65=(1* 3+2*2)^2+(2*3-1*2)^2  $  I can't find a representation for the $4(e_1 +1)..(e_r+1) $ what is $e$ in this case?


Will Linux start killing my processes without asking me if memory gets short?

I was running a shell script with commands to run several memory-intensive programs (2-5 GB) back-to-back.  When I went back to check on the progress of my script I was surprised to discover that some of my processes were Killed, as my terminal reported to me. Several programs had already successively completed before the programs that were later Killed started, but all the programs afterwards failed in a segmentation fault (which may or may not have been due to a bug in my code, keep reading).  I looked at the usage history of the particular cluster I was using and saw that someone started running several memory-intensive processes at the same time and in doing so exhausted the real memory (and possibly even the swap space) available to the cluster.  As best as I can figure, these memory-intensive processes started running about the same time I started having problems with my programs.  Is it possible that Linux killed my programs once it started running out of memory?  And is it possible that the segmentation faults I got later on were due to the lack of memory available to run my programs (instead of a bug in my code)?


How do you best read a textbook such as Hatcher's Algebraic Topology ? Do you start with chapter 0 and make your way through the book ? Can math books such as these be read in a linear fashion in a period of , say , months ? I'm self-studying Algebraic Topology.


Null pointer exception when connecting to database

so I'm trying to connect to my database from java, I'm working in Eclipse, I watched a tutorial online and everything seemed to be working perfectly !!.. but when I wanted to connect another database on appache server.. the program starts running.. but nothing happens for a few minutes.. then I get the Null Pointer Exception message.. and at the line : st = con.createStatement(); this is the code:  package database_console;      import java.sql.*      public class DBConnect { private  Connection con; private  Statement st; private ResultSet rs;  public DBConnect(){      try {         Class.forName("com.mysql.jdbc.Driver");               try {                 con = DriverManager.getConnection("jdbc:mysql://localhost:80/mysql", "root", "admin");                 st = con.createStatement();             } catch (SQLException e) {                 // TODO Auto-generated catch block                 e.printStackTrace();             }     } catch (ClassNotFoundException e) {         // TODO Auto-generated catch block         e.printStackTrace();     } }  // to retrieve the results and print them out public void getData(){      String query = "select DB from db";     try {         rs = st.executeQuery(query);         System.out.print("Records from Database");          while (rs.next()){             String DB = rs.getString("DB");             //String name = rs.getString("name");             //String password = rs.getString("password");             //int id = rs.getInt("id");             //System.out.print("ID: "+id+" Name: "+name+" password: "+password+"");             System.out.print("DB: " + DB );         }         st.close();     } catch (SQLException e) {         // TODO Auto-generated catch block         e.printStackTrace();     } }   I later call the getData() function from another class where the main() is:  package database_console;  import java.io.IOException;  public class Main {  public static void main(String[] args){     DBConnect connect = new DBConnect();     connect.getData(); }   can u help me figure out what's wrong with my code? thanks.


Unreal conditional inversion with "Should"

Unreal conditional sentences with Past Perfect, Were and Should may suffer inversion to show more formality. "Past Perfect" and "Were" exist in the original regular Unreal Conditional but how does "Should" work? Where does it come from? From another S.Past verb different from "were"?  Is it correct, for ex? "If he knew it, he would tell me".        INVERSION.....Should he know it, he would tell me.


I'm helping my friend install Ubuntu on his new laptop and we're having trouble getting it to see the wireless adapter. I tried a few fixes I found on here but nothing has worked yet. His laptop is an HP 15-db0008ca and the wireless card is a  Realtek RTL8821CE.   Thanks in advance.  03:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8821CE 802.11ac PCIe Wireless Network Adapter [10ec:c821]     Subsystem: Hewlett-Packard Company RTL8821CE 802.11ac PCIe Wireless Network Adapter [103c:831a] 2: hci0: Bluetooth     Soft blocked: no     Hard blocked: no


Prove that for each prime $p$ there exists a nonabelian group of order $p^3$

Can anyone helo me out with this question: "Prove that for each prime there exists a nonabelian group of order $p^3$".  This is my attempt:  I know how to show that $|Z(G)|= p$. So, since $C(x)$ contains $Z(G)$ for every $x$ not in $G$ then $|C(x)|> |Z(G)|$ i.e. $|C(x)|> p$. But $C(x)$ is always a subgroup of $G$ so it’s order must divide the order of $G$ and so $|C(x)= p^2$. (If $|C(x)|= p^3$ then $|G:C(x)|= |G|/|C(x)| = p^3/p^3 = 1$, so the number of elements in every conjugacy class would be 1, which would imply that every element is in the center of $G$, which in turn would mean that $G$ is abelian, which is not what we're after.) If $|C(x)|= p^2$ then $|G:C(x)|= |G|/|C(x)| = p^3/p^2= p$. Here’s where I don’t know how to go forward. I know that if there would be $p^2 – 1$ conjugacy classes then  $|G |= |Z(G)|+ (p^2-1) \cdot|G:C(x)|= p + (p^2-1)p = p + p^3 – p = p^3$. But how do I know that there actually exists a group with exactly $p^2 – 1$ conjugacy classes?  Greatful for input on my reasoning and also other ways of proving this, including how to construct such a group.


If $f\in K[x]$ has degree $n$ over $f$, and $F$ is the splitting field of $f$ over $K$ then, show that $[F:K]\mid n!$   I can show that $[F:K] \leq n!$ using the fact that  $[F(a,b):K]\leq [F(a)(b):F(a)][F(a):F]$


My laptop keyboard is not working from last week. I found that it is ok in Boot mode. Therefore, I have planned to replace my windows with ubantu 18.04. I have UEFI boot. In the past, I tried to convert my machine in dual boot setup with ubantu 14. However, it did not work. I got the o.s options the first time. I select windows, from the 2nd time it stopped given me o.s options selection and directly boot to windows. Therefore, I am little bit afraid about ubantu installation. Will it boot correctly with UEFI?


Why are things like RESET/MCLR active low on most ICs?

Convention?  Easier to implement?  Another reason?  Is there a reason things like MCLR or RESET on microcontrollers are active-low, that is, you have to pull them down to reset the IC, and pull them up to "run" the IC.   I'm just curious because this causes me some problems. If it were active high, I could avoid the capacitor on MCLR required in some instances and deal with just a pull-down resistor. It seems only to add to complexity.


Existence of certain hyper surface with no lines in $\mathbb{P}^3_k$ for an infinite field

Let $k$ Be an infinite field.  Show that for any $n>3$ there exists a degree $n$ hypersurface $f(x_0, x_1, x_2, x_3)$, so deg$f = n$, that contains no lines.  I’ve been trying to figure this out / have been looking for a proof of this statement for a week now but no luck. Does anyone have a proof for this?


Non trivial examples of $f\circ g = g \circ f$ but $f^{-1} \neq g$ and $f\neq\mathrm{id}\neq g$.

Are there real-valued functions $f$ and $g$ which are neither each other's inverses, the identity, nor linear, yet exhibit the behaviour $$f\circ g = g \circ f?$$  Examples such as $f(x) = 2x$ and $g(x)=3x$ are "trivial" in this sense.   Moreover, given a function $f$, can one go about obtaining an example of a function $g$ which commutes with $f$?   I suppose this would be similar to fixed point iteration? E.g. if $f\colon\mathbb R\smallsetminus\{1\}\to\mathbb R$ is defined by $f(x) = 2x/(1-x)$, I would need a function $g$ such that  $$g(x) = f^{-1}\circ g\circ f =\frac{g(\frac{2x}{1-x})}{2+g(\frac{2x}{1-x})},$$ so maybe choosing an appropriate "starting function" $g_0$ and finding a fixed point of $g_{n+1} \mapsto f^{-1}\circ g_n\circ f$ would be a possible strategy, but I can't seem to find a suitable $g_0$.


Adage or epigram for something not working until someone else looks at it?

It's a pretty common occurrence. My code doesn't work. Why? I have no idea. So I call over a coworker to look at it, but the instant he looks at the code it is magically working.  Another situation -- my mother in law's DVD player is not working so she calls and asks for me to fix it. She promises that if I fix it she'll cook me a delicious roast for dinner. I drive four hours to her home and turn on the TV and the DVD is playing.  Does anyone know if there is a well known adage or epigram that goes along with these occurrences of something not working until a third party looks at whatever is broken?  EDIT - I'm going to go out on a limb and say that all of the answers to the previous question don't actually answer this. All of the terms are either personal terms that are used in a small group of people e.g. proximity fix, or are inaccurate e.g. intermittent fault.  Intermittent Fault would explain if it happens occasionally without any explanation. In my situation the problem never arises again after someone else looks at it.  Repair Phobia would imply that the individual is afraid of actually fixing it, which I'm not afraid of when I'm fixing my own code.  See also this question that doesn't give an already existing or well known epigraph or adage. :


Is there a way to edit/tweak the regional settings?

Is there a way to tweak the regional settings and , while preserving greek locale, I can change the decimal separator to en_US? as this is necessary for google earth to work ?   I don't see any button to change the number format in the Language Support dialog.


Number of homomorphisms from $(\mathbb Q^+ , \,\cdot\,)$ to $(\mathbb Z_n , +)$

How many homomorphism are there from $(\mathbb Q^+ , \,\cdot\,)$ to $(\mathbb Z_n , +)$?   Could anyone give a hint how to proceed? I couldn't even start


Is it possible to retrieve the index into a text area that the cursor is at using the keydown event?


How to see if SkyDrive is still syncing in windows 8.1?

Windows 8 displayed overlay icons on my SkyDrive files, so I could see which files are current and which are in sync.  After I upgraded to Windows 8.1 the files still sync, but I can't see if the files are current or not. The only way is to load a file, check for myself if the latest changes are there (if I remember them) and refresh until the file is synced. Which is a pain! The sync overlay does only show for files which modified locally and are waiting to upload, it does not show up for files which had been changed on the server (other computer) and are waiting to download!!  So how do I get the file sync Status on Windows 8.1?


Which one is correct to say: "It's me" or "It's I"?

I was taught at school that the following expression is not grammatically correct:  Who is there? It's me.  The correct one is:  Who is there? It's I.  Can you let me know which one is accurate?


I have some Javascript that works perfectly before a postback happens in ASP.Net, however when a postback event occurs from a button click the script no longer runs.   this is the code I am using  function displayCheckboxInSubject() {     var CountSelectedCB = [];     console.log("in displayCheckBoxInSubject with loader");     $(".subjectCB").on("change loader", function () {     //$(".subjectCB").change(function () {         selectedCB = [];         notSelectedCB = [];         CountSelectedCB.length = 0;         $(".subjectCB").each(function () {             //alert("in here two")             if ($(this).find("input").is(":checked")) {                 //alert("in here three")                 CountSelectedCB.push($(this).find("input").val());             }         });          $("#txtSubject").val(CountSelectedCB.join(", "));     }).trigger("loader");  }  $(document).ready(displayCheckboxInSubject);   I would be grateful if someone could point me in the right direction of how to resolve this.   thanks  Simon


I understand the geometric meaning of cross product but not getting with what dot product of two vectors actually implies geometrically.


Is there a combinatorial interpretation of the triangular numbers?

The triangular numbers count the number of items in a triangle with $n$ items on a side, like this:    This can be calculated exactly by the formula $T_n = \sum_{k=1}^n k = \frac{n(n+1)}{2} = {n+1 \choose 2} = {n+1 \choose n-1}$.  Is there any combinatorial interpretation to that formula, as in some way to interpret arranging objects in a triangle with $n$ on a side as the number of ways to choose 2 or $n-1$ objects out of a collection of $n+1$ objects?


Novel about near future where humans are transmitted to a mirrored room on another planet

Near future with hyperinflation, humans get captured and transmitted to a mirrored room on alien planet. They are studied.  when the men complain about a lack of women, one of the women is duplicated twice making a trio, process was like downloading an image.  The three women remain very close and avoid men.  Eventually, it's discovered that the keepers have enemies and there is a greater war in play.  Humans escape.  I think it is a series of novels.  One thing early in story before abduction, Inflation is exceptionally high and due to this the inflation adjustment is announced daily and rent is due daily, and pay is earned daily as well. And there is a general rush to buy anything before it gets more expensive.


Help Us improve the site - broken link - old blog post

Broken Link on the Review page on Stack Overflow  Steps to reproduce:   go to Stack Overflow click the review link on the top find the yellow banner on the right      click the link 'you' (pointing to ) receive a message that the link is no longer found and that you can report a broken link on the feedback site (meta)


How to extract a floating number from a string

I have a number of strings similar to Current Level: 13.4 db. and I would like to extract just the floating point number. I say floating and not decimal as it's sometimes whole. Can RegEx do this or is there a better way?


Could network-wide suspensions last longer than 10 years?

The dupe candidate deals about suspensions in general, the essential part of this question is the increase of the network-wide suspension length from 10 years to 30. The answer to the question has nothing about this, except that network-wide suspensions are longer than 1 year.  Digging the SEDE, I've found something .  Well... 2046 won't be tomorrow, I am not sure I will live at the time.  As far I know:   Mods can give at most 1 year, and only for their site, CMs can give at most 10 years, network-wide, In the database, 9999-12-31 is last possible date, but it would require direct SQL to set up.   But Hutchinson got around 30 years. It falls into (3).  How is it possible? What could have he committed?  Maybe the system has changed, and even a >10year network-wide suspension is already possible?    Update (29-7-2018): our current record holder is . His "temporary" suspension will expire roughly as  becomes habitable again.


Where do you ask questions about home networking?

It seems that Server Fault explicitly disallows questions about networking outside the workplace. Is there a reason for that? Where should those questions go - ie  Where do you ask questions about networking/setting up routers/APs/Firewalls/etc for one's home.


How to know if someone is uzing Vuze or other torrent programes?

So here's the deal, I gave a couple of my friends the password to my WIFI, but since then the internet has been going too slow for long periods of time.  I suspect that one of them is using a torrent application to download movies or something, I want to know who that person is by knowing which pc is downloading through torrent.  I have the admin privileges on my network adapter, and would also like to know if there is away to see who is torrenting though my network using only my laptop by any means. so please help me.


Take a look at the screenshot below:  I'd like to vertically center the elements in the yellow box, and align them so that the images are all in one vertical line. The image below shows what I'd like to achieve:  Here's the code:   * {   box-sizing: border-box; }  .column {   float: left;   width: 50%;   padding: 5px;   color: #242323; }  .centered {}  .container {   display: flex;   align-items: center;   justify-content: center; }

Telephone: +94 (0)11 5 828468

Fax: +94 (0)11 2 931086

E-Mail: group@nawaloka.lk

Address: Some Address

    Appreciate the feedback!


Prove that set $\{f \in \mathbb{N^N} \: | \:f \: $is strictly increasing $\}$ has the same cardinality as $\mathbb R$

Prove, that set $\{f \in \mathbb{N^N} \: | \:f \: $is strictly increasing $\}$ has  the same cardinality as $\mathbb R$.  My attempts:  The beginning of this task was quite easy, but then I got stuck on constructing an injection between a set of function (let's call it $X$) and $\mathbb R$. I started with proving that $|\mathbb R| \geq |X|$:   $|\mathbb R| \geq |X|$ because if $\forall _f , f\in \mathbb{N^N}$, and $|\mathbb{N^N}|=|\mathbb R$|, then $X \subset\mathbb R$.   Then I tried to prove that $|\mathbb R| \leq |X|$, but I don't know how to do it. I tried to define a function $g(x)=x^3$, but the result is a number, not a function. Or maybe it is a correct solution?  If not, can you explain to me how can I construct an injective function from  $\{f \in \mathbb{N^N} \: | \:f \: $is strictly increasing $\}$ to $\mathbb R$? Is it even possible?


Does the shape of the Universe refer to the curvature of spacetime in 5-dimensional space?

When we say that the universe is flat, this means that the sum of angles of any triangle will always be 180°. I believe that "flat" refers to the bending of spacetime in a 5-dimensional space (or a forth space dimension). This would however contradict the fact of the su of angles, as for warped space, the sum is smaller than 180°. Or does the geometry to the universe as a whole and "small" fluctuations like galaxies (which bend space) are ignored? So: Is it correct to describe the shape of the universe in relation to a 5-dimensional surrounding? Like you can see in this picture: (Image Credit ) In this picture, one space dimension is omitted (so the spheres actually should be circles), so our 3-dimensional Universe/Brane "floats" in a higher-dimensional hyperspace or bulk. In This image, space is locally warped by mass (or energy, but this is not shown here), but space as a whole is flat. Is it correct to imagine the flat shape of the universe like this (theoretically with one space dimension more)?  Update This question was closed as a duplicate of the following: , , . While they are somewhat related to my question, they still ask for a different question, namely the following: Question 1: Is your 3-dimensional universe part of the surface of a 4-dimensional sphere [like in the ant-sphere analogy] that we cannot perceive or access? Question 2: The correctness of the bend-sheet-analogy for GTR Question 3: Could the universe be bend over a forth dimension to form a 4-dimensional shphere? The essence of my question was: When we refer to the shape of the universe (being flat for example), do we mean the same curvature as in GTR?


.NET EventHandler Delegate - Why still an "EventArgs" parameter if it "will handle an event that has no event data."?

Probably my head is a kind of scrambled now, but I'm having some difficulty understanding the description about the already-defined EventHandler delegate of .NET. The  says it "Represents the method that will handle an event that has no event data." Then if every time we use it we'll definitely not pass data, why the argument "EventArgs" is still there? Its existence makes every time we have to pass an EventArgs.Empty to it which is quite tedious. Is there any particular reason for it, or is it just for compatibility and code flexibility? I'm new to .NET so sorry if this question seems naive. Thanks in advance.


Metropolis Hastings algorithm and Markov chains

Why does Metropolis Hastings algorithm need/make a sequence of interdependent samples, i.e., a Markov chain in order to generate a posterior distribution?


How can I prevent Google mistakenly offering to translate a page?

Several of my site's pages are appearing in search results with [Translate this page] next to it. When I click that it takes me to Google Translate and translates my page "from Catalan to English".  The pages are in English but have a couple of foreign words (actually Japanese romanisations, not Catalan) that appear to be tripping Google up.  A few weeks ago I set the html tag to <html lang="en"> which from research appears to be the best method to specify the language of a document. Google has cached the pages with this attribute but it is still offering to translate.  More research led me to a "notranslate" attribute which prevents translation entirely: <html lang="en" class="notranslate">. The problem now is users cannot translate from English to their desired language!  Are there any other solutions that force Google to parse my site as English only?


Exists a dedicated non-O(n²) Algorithm for avoiding to have overlapping elements?

I am generating positions in a random fashion.  In the game world, instantiated elements have a radius, and shouldn't overlap.  The problem is that they will overlap because I use a usual random number generator combined with other fanciness. I can't use other random number generation algorithms where I can guarantee that the elements will never overlap.  A way to solve this is to use a spatial data structure and search for the nearest neighbors in that tree. When I insert an element into that tree, I update it accordingly.  This solution would do the work and it would be fast but my question is:  Is there a dedicated algorithm without that Tree implementation complexity which is faster than O(n²)?


Cauchy-Schwarz inequality in Shankhar's Quantum Mechanics

I'm trying to understand proof of this inequality. But I have some problems.   So, Shankar starts a proof with definition a new vector $|z \rangle$:  $$ |z \rangle = |v\rangle - \frac{\langle w|v \rangle}{|w|^2} |w \rangle.$$  And here, I would like to know, why we suppose vector in this form? I know that it's projection of one vector on the second one.   My second question is, that we multiply this equation by $\langle z|$.  $$ \langle z|z\rangle = \left\langle v - \frac{\langle w|v \rangle}{|w|^2} w \right|\left.v-\frac{\langle w|v \rangle}{|w|^2} |w \right\rangle\\ = \langle v|v \rangle - \frac{\langle w|v \rangle \langle v|w \rangle}{|w|^2} - \frac{\langle w|v \rangle ^*\langle w|v \rangle}{|w|^2} + \frac{\langle w|v \rangle ^*\langle w|v \rangle \langle w|w \rangle}{|w|^4} $$  What I don't understand is a complex conjugate in the last two expression. Why then, we don't conjugate the first and the second one?  EDIT:  So - we're multiplying ket-z times bra-z. So, if the ket-z is: $$ |z \rangle = |v\rangle - \frac{\langle w|v \rangle}{|w|^2} |w \rangle.$$ and bra-z is: $$ \langle z |= \langle v|- \frac{\langle w|v \rangle}{|w|^2} \langle w|.$$  And what concernes me is this term above: $$ \langle w|v \rangle, $$ because if $ | z \rangle = [(\langle z |^*)^T]. $ So shouldn't bra-z be $$ \langle z |= \langle v|- \frac{\langle v|w \rangle}{|w|^2} \langle w|.$$


Why is it important to be able to multiply matrices?

I'm not asking how matrix multiplication is done. I know how to multiply matrices and can look at two matrices and say whether or not they can be multiplied. I just want to know what matrix multiplication reveals to us.


I am trying to understand the sum of equal Gamma distributions  Let $X_1,...,X_n$ be iid where all $X_i$ each follow a Gamma distribution with $shape=\lambda,scale=\beta$  Is the following then true?  $Y=\sum_{i=1}^n X_i$ follows a Gamma distribution with $shape=n\cdot \lambda,scale=\beta$


Prove that $2x^3+3x^2+x$ is always divisible by 6 if x is an integer.

Prove that $2x^3+3x^2+x$ is always divisible by $6$ if $x$ is an integer.  I started by factoring the expression:  $x(2x^2+3x+1)=x(2x+1)(x+1)$  However I wasn’t sure how to progress from here to prove that it is always divisible by 6. Any ideas?


How can I return to the start of a line in a console?

How can I return to the start of a line and overwrite what has already been output on the console? The following does not appear to work:  System.out.print(mystuff+'\r');


I am editing a safety manual at work and am having a hard time figuring out comma placement.  Many sentences are complicated and technical, which I'm not used to editing.  Below are general examples of where I get hung-up.    Would I place a comma after visitors, or leave as-is?  Asbestos awareness training for employees, subcontractors, and visitors may be necessary depending on the concentrations of NOA present.  Is the comma after device(s) appropriate?  The switch, valve, or other energy-isolating device(s), will then be initiated to ensure that the equipment is isolated from its energy source(s).


Is it possible to merge threads in Thunderbird?  I recently got into a discussion where one person was consistently not using "Reply", but starting new threads. I'd like to merge all such emails into one thread.  I know that .  Thanks!


Instruction being skipped, Is there a bug I'm not seeing here?

here is the code:     @Override public void onBindViewHolder(@NonNull final WorkerViewHolder holder, int position) {     final Worker currentWorker = mWorkerList.get(position);     holder.textView_worker_name.setText(currentWorker.getName());//sets each worker in the Recycler     holder.btnWorking.setVisibility(View.INVISIBLE);      Log.d("myappCurrent",currentWorker.getName() + wWorkerList.get(0).getWorkerName());       for(AtWorkWorker worker: wWorkerList){          if(currentWorker.getName() == worker.getWorkerName()){              holder.btnWorking.setText("Working on "+ worker.gettask());             holder.btnWorking.setVisibility(View.VISIBLE);             Log.d("myapp", worker.gettask());          }     } //iterates over wworkerlist(obj array) and matches position var with the corresponding position in AtWorkWorkers list  }  the log.d just before the for loop prints out this: 2020-09-13 15:35:17.307 22092-22092/com.example.sheetmetalroofersaudit D/myappCurrent: TrevorTrevor 2020-09-13 15:35:17.322 22092-22092/com.example.sheetmetalroofersaudit D/myappCurrent: CandaceTrevor 2020-09-13 15:35:17.336 22092-22092/com.example.sheetmetalroofersaudit D/myappCurrent: Kevin soareTrevor 2020-09-13 15:35:17.348 22092-22092/com.example.sheetmetalroofersaudit D/myappCurrent: akins smithTrevor  but the if statement never triggers when Trevor and Trevor line up. The wWorkerlist comes from sharedpreferences so could there be a delay in getting the values and the if statement is run through before its triggered?


PCB opaque coating for anti reverse engineering?

Im trying to find a coating for my PCB in order to protect it from reverse engineering. I want it opaque, non-conductive and with a low thermal resistance.  Basically I do not want that someone replicates my circuit easily. I´ve beens searching a lot on coatings but did't find anything that suits to all my requirement. Anyone with an idea?


Computer doesn't use more than 4 of my 8GB of RAM...? (64-bit computer)

Recently, to future-proof my computer, I've added on top of my original 4GB of memory. I brought the total memory to 8GB, and I've got no noticeable change in speed-- even when it should. I went to look into Task Manager and saw that my computer would NOT go over 4GB of memory being used, even with both Chrome and Firefox open with 20 tabs each.  After researching, everything that everyone had suggested to do was to check on how much memory was usable. Oddly enough, it says that I have 8GB of memory, and 7.74GB is usable.   It is a notebook PC with Windows 7 Home Premium 64-bit with AMD Phenom II.   My main question is: with my 64-bit computer, why is my computer not using more than 4GB of memory, even when more than 7 is usable?  EDIT: if it helps, Resource Monitor describes all the other RAM as "Standby"


A uniformly continuous function maps bounded set to bounded sets

I am trying to prove the following:  If $A\subset\mathbb R$ is bounded and $\,f:A\to \mathbb R\,$ is uniformly continuous, then $f[A]$ is bounded.  Could you check my proof?  Let $A \subseteq [-K,K]\subseteq \mathbb R$. Let $\varepsilon = 1$. If $f$ is uniformly continuous there is $\delta$ wuth $|x-y| <\delta$ imply that $|f(x)-f(y)|<1$ for all $x,y\in A$. Let $a \in A$. Then because $A$ is bounded there is a finite number of balls $B(a_n,\delta)$ that cover $A$. Let the number be $N$. Then $f(a)-N \le f(x) \le f(a) + N$ for all $x\in A$.


A helpful proof in contracting the Christoffel symbol?

Out of all of my time learning General relativity, this is the one identity that I cannot get around.   $$ \Gamma_{\alpha \beta}^{\alpha} = \partial_{\beta}\ln\sqrt{-g} \tag{1}$$   where $g$ is the determinant of the metric tensor $g_{\alpha \beta}$.   With the Christoffel symbol, we start by contracting  $$ \begin{align}  \Gamma_{\alpha \beta}^{\alpha} &= \frac{1}{2} g^{\alpha\gamma} (\partial_{\alpha} g_{\beta\gamma}  + \partial_{\beta} g_{\alpha\gamma}  - \partial_{\gamma} g_{\alpha\beta} ) \\ &= \frac{1}{2} g^{\alpha\alpha} ( \partial_{\beta} g_{\alpha\alpha}) \\ &= \frac{1}{2g_{\alpha\alpha}} ( \partial_{\beta} g_{\alpha\alpha})  \end{align}\tag{2}$$   where I took $\gamma \rightarrow \alpha$ and $g^{\alpha\alpha} = 1/g_{\alpha\alpha}$.  The next steps to take now, I have no clue. MTW gives a hint by saying to use the results from some exercise, which are,  $$\det A = \det||A^{\lambda}_{\ \ \rho}|| = \tilde{\epsilon}^{\alpha\beta\gamma\delta}A^{0}_{\ \ \alpha}A^{1}_{\ \ \beta}A^{2}_{\ \ \gamma}A^{3}_{\ \ \delta} $$  $$(A^{-1})^{\mu}_{\ \ \alpha}(\det A) = \frac{1}{3!}\delta_{\alpha\beta\gamma\delta}^{\mu\nu\rho\sigma} A^{\beta}_{\ \ \nu} A^{\gamma}_{\ \ \rho}A^{\delta}_{\ \ \sigma} $$  $$ \mathbf{d}\ln|\det A| = \mathrm{trace}(A^{-1}\mathbf{d}A) ,\tag{3}$$ where $\mathbf{d}A$ is the matrix $||\mathbf{d}A^{\alpha}_{\ \ \mu}||$ whose entries are one-forms.  I fail to reason why the metric turns into the determinant from what I have done and then becomes the result at the top.


Problem in solving a question related to finite difference.

Show that the $k$-th finite differences of the sequence $1^k ,2^k,3^k ,...$ are each $k!$.  I have tried but I fail when I try it proving using mathematical induction.Please help me.  Thank you in advance.


What is the value of $i^{i^{i^\ldots}}$?   My effort is the following: If $z, \alpha \in \mathbb{C}$ with $z \neq 0$ then we can write $z^{\alpha}=e^{\alpha \log z} = e^{\alpha [ \log |z|+i \text{ Arg z} + 2 \pi i m]}$ where $ m=0, \pm 1, \pm 2, \ldots$  and Arg z is the principle argument of the complex number $z$. But in above expression we don't have the finite no of exponents, so I am not sure how should I use this formula to the solve above problem. Thanks and Regards!


Default value is null always,Schema.DescribeFieldResult

I am trying to describe a field and get the default value but the following always outputs null.  Schema.DescribeFieldResult dfr = Account.SLASerialNumber__c.getDescribe(); system.debug('res '+dfr.getdefaultvalue()); // null   What I am missing ?


When do we use ' before a value in Lisp?

I am following a tutorial on youtube online and I noticed that the teacher    used ' before a value. like this:  (defvar *randomStuff* 'stuff)   all help will be appreciated


Is torque as fundamental a concept as force?

I used to think that torque and force were equally “fundamental”. In other words, my understanding was that we usually use Cartesian coordinates in many common problems because it is a convenient system, so as a result instantaneous forces which act in straight lines seem “easier” mathematically but torques require some extra “baggage”. This baggage includes typically teaching that torque is defined in terms of force.  But if say we happened to choose polar coordinates for the problem the situation would appear the other way around. So it would be arbitrary if we chose to define forces in terms of torques instead.  But later on I learned that angular momentum is conserved independently of regular linear momentum (IIRC). Given the definitions of force & torque as derivatives of momentum, this makes it seem much less certain that one should define either torque in terms of force or vice versa — it gives the impression they are more distinct than it first seemed.  That said, as far as I know a lot of physics is about defining & describing “fundamental forces” — not “fundamental torques”.   So is choosing to use either force or torque as the basis of laws & problems arbitrary? Or is there an actual fundamental rationale to when one or the other should be used?


How to save a GIF with transparency without it creating white blobs around glow? Open for other solutions!

So, basically, I have a website where I want to put animated christmas lights, nothing to complex.  Note: Don't mind the watermarks, they are just in case...  I made the static image in png first:  Static image:   All ok with that, it display correctly in the website  Then, I tried animating it to gif, in photoshop, and the image was ruined:  Settings:   Final result:   So, basically, I just want to know what are all the possible ways of making this animation show in my website, good quality, without white blobs or any blobs at all, and with transparency.  I will really accept any options, gif, video, flash, anything. I would just like to have this on a website.  Note: This is above a slideshow, so, making it match the background is not an option, at all.  Thanks for reading.


Today I did a clean ubuntu installation by removing window 8 from my laptop. I thought that after installing ubuntu I will have no problem in acessing D drive, where i have all my important data.But now I am unable to mount D drive. it gives following error.  ror mounting /dev/sda5 at /media/nitesh/data: Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000,dmask=0077,fmask=0177" "/dev/sda5" "/media/nitesh/data"' exited with non-zero exit status 14: The disk contains an unclean file system (0, 0). Metadata kept in Windows cache, refused to mount. Failed to mount '/dev/sda5': Operation not permitted The NTFS partition is in an unsafe state. Please resume and shutdown Windows fully (no hibernation or fast restarting), or mount the volume read-only with the 'ro' mount option.   Now I dont have window 8 also to resume and shutdown Windows fully.now Is there any solution for it?


Right justify roman page numbers in list of tables

I have a scrartcl document with arabic and roman page numbers. The list of tables looks like this:    Arabic page numbers are right justified (relative to each other), whereas roman numbers are centered.   I would like to have all page numbers right justified, like this (the red line is just for illustration):    Although I suppose that the solution is probably related to the listof document options, I cannot find an appropriate setting. However, the problem also occurs with article instead of scrartcl, so it does not seem to be specific to KOMA script.  MWE:  \documentclass{scrartcl} \begin{document} \listoftables \clearpage  \begin{table} \caption{First main table.} \end{table} \clearpage  \setcounter{page}{95} \begin{table} \caption{Second main table.} \end{table} \clearpage  \pagenumbering{roman}  \setcounter{page}{1} \begin{table} \caption{First appendix table.} \end{table} \clearpage  \setcounter{page}{28} \begin{table} \caption{Second appendix table.} \end{table} \end{document}


All zeros of $\sum \frac {z^k}{k!}$ in open ball around origin

Prove that, for each $R > 0$, there exists $N(R) \in \mathbb N$, such that, for all $n \geq N(R)$, the function $$f_n(z) = \sum_{k=0}^{k=n} \frac {z^k}{k!}$$ has exactly $n$ zeros in $|z| < R$.    This question is asked after Rouche's theorem, so I assume I have to apply the theorem to prove this.    Rouche's theorem : If $f$ and $h$ are each functions that are analytic inside and on a simple closed contour $C$ and if the strict inequality $|h(z)|<|f(z)|$ holds at each point on $C$, then $f$ and $f+h$ must have the same total number of zeros inside C.    I would like to get some hint on how to prove this.


SQL Server Management Studio 18 won't open (only splash screen pops up)

I just installed SSMS 18 GA on a computer with only VS2019 installed, and when I try to open SSMS the splash screen will come up, but then the process exits.    Running ssms with the -log parameter reveals an error message:     CreateInstance failed for package [Task Scheduler Package]Source:   'mscorlib' Description: Could not load file or assembly   'Microsoft.VisualStudio.Shell.Interop.8.0, Version=15.0.0.0,   Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a' or one of its   dependencies. The located assembly's manifest definition does not   match the assembly reference. (Exception from HRESULT: 0x80131040)   System.IO.FileLoadException: Could not load file or assembly   'Microsoft.VisualStudio.Shell.Interop.8.0, Version=15.0.0.0,   Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a' or one of its   dependencies. The located assembly's manifest definition does not   match the assembly reference. (Exception from HRESULT: 0x80131040)   File name: 'Microsoft.VisualStudio.Shell.Interop.8.0,   Version=15.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a'   ---> System.IO.FileLoadException: Could not load file or assembly 'Microsoft.VisualStudio.Shell.Interop.8.0, Version=8.0.0.0,   Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a' or one of its   dependencies. The located assembly's manifest definition does not   match the assembly reference. (Exception from HRESULT: 0x80131040)   File name: 'Microsoft.VisualStudio.Shell.Interop.8.0, Version=8.0.0.0,   Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a'      WRN: Assembly binding logging is turned OFF. To enable assembly bind   failure logging, set the registry value   [HKLM\Software\Microsoft\Fusion!EnableLog] (DWORD) to 1. Note: There   is some performance penalty associated with assembly bind failure   logging. To turn this feature off, remove the registry value   [HKLM\Software\Microsoft\Fusion!EnableLog].      at System.Reflection.RuntimeAssembly.GetType(RuntimeAssembly   assembly, String name, Boolean throwOnError, Boolean ignoreCase,   ObjectHandleOnStack type)    at   System.Reflection.RuntimeAssembly.GetType(String name, Boolean   throwOnError, Boolean ignoreCase)    at   System.Activator.CreateInstance(String assemblyString, String   typeName, Boolean ignoreCase, BindingFlags bindingAttr, Binder binder,   Object[] args, CultureInfo culture, Object[] activationAttributes,   Evidence securityInfo, StackCrawlMark& stackMark)    at   System.Activator.CreateInstance(String assemblyName, String typeName)    at System.AppDomain.CreateInstance(String assemblyName, String   typeName)      System.IO.FileLoadException: Could not load file or assembly   'Microsoft.VisualStudio.Shell.Interop.8.0, Version=8.0.0.0,   Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a' or one of its   dependencies. The located assembly's manifest definition does not   match the assembly reference. (Exception from HRESULT: 0x80131040)   File name: 'Microsoft.VisualStudio.Shell.Interop.8.0, Version=8.0.0.0,   Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a'      WRN: Assembly binding logging is turned OFF. To enable assembly bind   failure logging, set the registry value   [HKLM\Software\Microsoft\Fusion!EnableLog] (DWORD) to 1. Note: There   is some performance penalty associated with assembly bind failure   logging. To turn this feature off, remove the registry value   [HKLM\Software\Microsoft\Fusion!EnableLog].   I tried running "Repair" on SSMS, and tried a repair of C:\ProgramData\Package Cache\{AAA9F15B-AF45-4562-9991-93A848D3A902}v15.0.28307.421\redist\vs2017_isoshell_for_ssms.msi, but the problem persists.


I've recently had some issues with my Dell Vostro laptop and Dell sent me out some OS discs to reinstall Windows 7 Ultimate SP1. I expected to get 64-bit discs in the mail, but instead received 32-bit.   So I called up Dell and asked what type of processor I have. The person on Dell's side said 32-bit. So I looked up my processor: Intel Core i3 CPU M370 @ 2.4GHz, and the documentation I found online says it's a 64-bit instruction set.   So I'm guessing it actually is 64-bit. Should I request new discs?


How come a flight is cheaper with an extra stop?

I found a flight from a smaller airport (A) to an intercontinental place (C) for a price of EUR 440. This flight has 1 stop at a city also not far from my home (B). The stop however is 26 hours.  So I searched for the flight going from point B to point C directly without the stop of 26 hours and the price is EUR 750. The price difference for adding 1 stop for the same flight is EUR 310 more.  I asked the airliner how this is possible but didn't get a clear answer. Thanks in advance.  Scenario:  A->B (26h)->C = EUR 440  B->C          = EUR 750


Installing 13.04 on an EFI partition - Share with Windows 8?

Information I've found here suggests that for my system, I need to install 13.04 into an EFI-type partition, since it needs to boot as UEFI.  I also understand it is advisable to have only ONE EFI partition on the disk; I've read here that it is OK for Ubuntu and Windows to share the same partition (please confirm).  When I try to install into the existing EFI drive, I get the message "No root file system is defined.  Please correct from partitioning menu."  Do I change the EFI boot partition to another type?  Doesn't that defeat the purpose?  If I change it to Ext4 Journaling File System, I am given the opportunity to define the '/' Mount point.  I haven't proceeded beyond this point for fear I am going to destroy Windows 8 by altering this partition.    BTW, I created three partitions in Windows before installing, per the helpful response to my previous question.  But if I try to install into the partition I created for Ubuntu, I get the "No root file system..." error again.  I have read this question/answer several times over:       Much of that answer talks about dealing with Secure Boot - I have already figured out how to disable Secure Boot, so according to that answer "there is no problem" there.  If I understand correctly, I want to stay in UEFI with Secure Boot disabled.  There is already have an EFI partition, and when I try to install Ubuntu into that EFI partition I get the error message "No root file system is defined.  Please correct from partitioning menu."  This is my question - and I may be missing something, but I don't see how the question/answer I duplicated helps me with that problem.


An Irreducible polynomial in $\mathbb{Q}[x]$

I want to prove that $x^4+x^3+x^2+x+1$ is irreducible in $\mathbb{Q}[x]$. I noticed that this polynomial can be rewritten as $x(x+1)(x^2+1)+1$. As seen, it has no proper divisor because of the constant term $1$. However, I need a rigorous proof. Can anybody help me?  Thanks in advance.


Differences between 5V DC 350ma vs. 450ma

I have two A.C adapter chargers giving an output of 5V DC 350mA and the other one with 5V DC 450mA. Is it possible that I could use a 5V DC 350mA to recharge a phone  which came out with 5V DC 450mA charger and vice-versa?  I have searched the google and found that using a lower amperage supply charger for the phone that came out with or requiring higher amperage charger could be damaged by it.   How much does this matter with 350mA and 450mA or what is the difference between them?


Nginx force port 8080 to use SSL and rewrite or redirect http to https

Hi I am forcing nginx to use SSL for port 8080, here is my conf:  server {         listen        8080 ssl;         server_name   example.com;         access_log   /var/log/nginx/access.log  main;          include /etc/nginx/ssl.conf;          location / {             proxy_pass         http://192.168.1.20;         }      }   the https://example.com:8080 works fine but when use http://example.com:8080 the nginx has the error message shown:  The plain HTTP request was sent to HTTPS port   now my question is how to get http://example.com:8080 auto redirect or rewrite to https://example.com:8080 by editing my nginx conf file?


"I {may / might} have missed that information."

I have confusion in below 2 statements.     A) I may have missed that information.   B) I might have missed that information.   I wanted to say I possibly missed that information "in past" to someone. So at that time may OR might which one should I use?


Sequence such that $\lim\limits_{n\to \infty} \frac{x_1^2+x_2^2+...+x_n^2}{n}=0$

Let $(x_n) _{n\ge 1}$ be a sequence of real numbers such that $\lim\limits_{n\to \infty} \frac{x_1^2+x_2^2+...+x_n^2}{n}=0$. Prove that $\lim\limits_{n\to \infty} \frac{x_1+x_2+...+x_n}{n}=0$. I used the definition of the limit to conclude that $\exists N\in \mathbb{N} $ such that $|\frac{x_1^2+x_2^2+...+x_n^2}{n}|<\frac{1}{n^2}$, $\forall n\ge N$. Hence, we get that $|x_1^2+x_2^2+...+x_n^2|<\frac{1}{n}$. Now here comes the part where I am not really sure. I think that this implies that $\sum_{n=1}^{\infty}x_n^2=0$, and as a result $x_n\to 0$,which solves the problem because if we use the Stolz-Cesaro lemma we get that $\lim\limits_{n\to \infty} \frac{x_1+x_2+...+x_n}{n}=\lim\limits_{n\to \infty} x_n=0$.


Why was Quirell unable to take the stone out of mirror?

“Ah, now, I’m glad you asked me that. It was one of my more brilliant ideas, and between you and me, that’s saying something. You see, only one who wanted to find the Stone — find it, but not use it — would be able to get it, otherwise they’d just see themselves making gold or drinking Elixir of Life. My brain surprises even me sometimes... -Harry Potter and the Sorcerer's Stone.” -Chapter 17-The Man With Two Faces.  Dumbledore quotes this to say a person who wishes to use the elixir of life can't bring the stone out of mirror.  He also says that the person would just see himself making gold or drinking the Elixir of Life. But Quirell  doesn't understand how to get the stone out of mirror, it implies that he sees nothing than just a reflection of himself in the mirror.  “What does this mirror do? How does it work? Help me, Master!” -Harry Potter and the Sorcerer's Stone.” -Chapter 17-The Man With Two Faces.  Now the main part is, Quirell did not intend to use the stone for himself. He wanted to present it to his master, which is for a valid reason, he can take the stone out of mirror as per the reason said by Dumbledore. Why was he unable to see the stone in Mirror?


how to open "Ubuntu Software" on Ubuntu 20.04.2 LTS

first off: I am aware of  I want to open the "Ubuntu Software" I do have it installed, because I can see and open it from my menu-bar  I want to open it with the Terminal, because when I try to install "Dropbox" from Ubuntu Software, it just closes automatically. And now I want to see, if it works when I start it from the terminal. I've tried all of these: :~$ software-center software-center: command not found  :~$ gnome-software Command 'gnome-software' not found, but can be installed with: sudo apt install gnome-software  :~$ ubuntu-software ubuntu-software: command not found  what else could I try? I am using Ubuntu 20.04.2 LTS on 64-bit, with GNOME Version 3.36.8


I have an exercise that involves this set: $2^\mathbb{N}$, but I don't know what set it is. I know that the elements of the set are functions whose domain is $\mathbb{N}$, but no idea which type of functions they are.  Thanks in advance.


How can I get the "Diamonds to you!" achievement in single player?

How do you get the "Diamonds to you!" achievement if you're in single player?


What are Tom Banks's arguments against a QFT of quantum gravity?

Pages 1-9  What are his arguments here against a QFT of QG, can someone provide a simpler explanation of these?  And to what specific theories of QG do these arguments apply to?


I have the following code:  public DataTable GetAllActiveUsers() {             DataTable dataTable = new DataTable();              try             {                 connection.Open();                  SqlCommand getAllActiveUsersCommand = new SqlCommand(getAllUsers, connection);                  SqlDataAdapter dataAdapter = new SqlDataAdapter(getAllActiveUsersCommand);                 dataAdapter.Fill(dataTable);                  return dataTable;             }             catch(Exception e)             {                 Console.WriteLine(e);                  return null;             }             finally             {                 connection.Close();             }         }   Which basically get's the active users I have on my database. But can someone explain to me whether the Finally Block will be executed if it successfully runs the try block and returns the DataTable??  Thanks


Let $G$ be a group and (the center of $G$) $Z(G)=\{e\}$. Prove that $Z(\mathrm{Aut}(G))=Z(\mathrm{Inn}(G))=\{I_G\}$ Since  $\mathrm{Inn}(G)\leq \mathrm{Aut}(G)$, it seems that we only need to prove $Z(\mathrm{Inn}(G))=\{I_G\}$, but I do not know how to continue. Appreciate your help!


In what language do the wizards and witches from non-English-speaking countries cast their spells in?

As long as spells of Harry Potter world goe, most famous ones are in . But the magical community is not only specifically situated in English-speaking countries, since there are schools in other countries as well, like in Russia, France, and Japan.  My question is are there any spells which don't have their origins in Latin or Greek? Do other non-English countries also use same spells, or do they have their own language counterparts?