Stuck with install of dual-boot on “remove installation media”

I am trying to install a dual-boot system on my windows computer (HP Spectre).  I have turned off secure boot and fast boot, partitioned my hard drive (I gave 100GB to Ubuntu) and created a USB Drive that was formatted to have the Ubuntu boot on it (I don’t have a DVD drive on my computer, so I have to use USB).  I used Rufus 3.1 to accomplish this.  I also changed my boot order to boot first to the USB HDD.  When I boot up with the USB drive inserted, it boots to the GRUB Menu.  I have tried both "Try Ubuntu" and "Install Ubuntu".  Both bring me to an Ubuntu loading screen, and then to one that says “Please remove the installation medium, then press ENTER”.  If I do not do anything, it will just stay there.  If remove the USB drive and press enter, it shuts down the computer.  If I DON’T remove the USB drive and just press enter, the same occurs.  After the shutdown, I have tried to restart.  Restart without the USB drive loads Windows 10.  Restart with the USB drive brings me back to the GRUB startup screen.  I have tried multiple USB ports and USB drives, so that is not the issue.  The computer is a 2018 model laptop with intel i7, 16GB RAM, and a SSD - power or RAM shouldn’t be a problem. I have also tried the “check for problems with the disk” option - it shows no issues. Heat is also not an issue - I tried this in the refrigerator and freezer, and it occurs no matter how hot or cool the computer runs.  At this point, I’m pretty much out of steps.  Has anyone had the same difficulty?  Does anyone know how to fix it?  Thanks.  EDIT: I tried to follow all of the steps in the mentioned article, and it does not solve the problem.  The question fails to explain a working solution to the problem - instillation with the USB media stops at the stage mentioned above, and there’s is no way that I can find (including boot options menu) to get to the boot without the drive installed.  Also, even if I select the “try Ubuntu” option, I get the same issue - I cannot get into a live Ubuntu Session beyond the Ubuntu loading screen  EDIT #2:  I don't know what caused the problem, but I was able to fix through this process: When at the grub bootloader, select the "try ubuntu" option, and press "e" for edit command.  In the edit command screen, add acpi=off to the end of the first command.  That fixed it for me.


Distance is paired with Displacement and it seems to be a bigger idea than just the magnitude of Displacement. Speed is paired with Velocity.  I have always thought that there is not such pairing with Acceleration.  I would teach: Acceleration is a vector, and we can talk about the magnitude of Acceleration, but we cannot talk about a scalar that describes the change in Speed over time.  Is there a scalar counterpart to Acceleration?  P.S. First question on physics.stackexchange.  Please excuse me if the question is inappropriate.  Edit to Question: I think I need to explain the question better.  If I walk to the store and back home, my displacement is zero and my velocity would also be zero (regardless of how long it took me).  Since the store was some distance away, my total distance traveled for this situation would be positive and so my speed would be positive.  I would then conclude that speed is not the magnitude of velocity, but something different (just like distance is a different concept than displacement).  In this way I can say distance & speed are scalar (not magnitudes of vectors).  Now that I define my question a bit better, I think I see the problem.  It seems distance is a summary (i.e. sum of) of the magnitudes of a group of vectors (displacements).  Speed is the summary of the magnitudes of the first derivative (with respect to time) of the group of vectors.  I doubt there is (or is there a need for) a similar summary of the magnitudes of the second derivative of  the  group of displacements.  I welcome your thoughts.


What is the difference between var foo=function() and function foo()

I have a JavaScript class Test that has a private function foo that looks like this:  function Test(){} (function() {     var foo = function(){         // do stuff         console.log('private work');     }      this.publicStuff = function(){         foo();     }  }).apply(Test);   and one that looks like this  function Test(){} (function() {     function foo(){         // do stuff         console.log('private work');     }      this.publicStuff = function(){         foo();     }  }).apply(Test);   they both work OK and do same stuff and can even coexist like this:  function Test(){} (function() {     var foo = function(){         // do stuff         console.log('private work VAR');     }      function foo(){         // do stuff         console.log('private work FUNC');     }      this.publicStuff = function(){         foo();     }  }).apply(Test);   But when they are together, the var foo = function() gets executed and the other one not.  What is the difference between the two ways of defining these private functions, what is the best practice and what are the advantages/disadvantages of each aproach


Create a wifi hotspot like in Windows 10 in Ubuntu 16.04

I need to create a wifi hotspot with my currently connected wifi network in Ubuntu GNOME 16.04, like I do in Windows 10). Is there a way to do that?


Starting from yesterday, the up-/downvote buttons seem to have moved from the left of a post towards above (in the middle) of the bodies of all questions and answers. Here is a screenprint of a sample (containing such buttons for both a question and an answer to it):    This happens on an iOS device (running 9.3.5), using various browsers and this in any SE site. No idea so far how it looks like in the most recent iOS version. Same for the (green) checkbox below those voting buttons (to mark an answer as accepted). Is this intended to be like this (IMO it looks ugly ... and a huge waste of available space), or is it rather some sort of CSS related issue that needs to be fixed? PS: Looking at the same page around the same time on a Win PC (using any of the common browsers) seems to work fine.


I've tried several modifications to see why it's not working, but I can't find the answer.  Here is my code, this is in french but this is just a normal fonction that ask to the user if he's ready to start.  #!/bin/ksh function start  {     echo "Vous etes sur le point de lancer la generation, etes-vous pret(e)? [OUI/NON]"     read touche     case $touche in         [Oo] | [Oo][Uu][Ii] )            echo "Demarage du bash..."         ;;         [Nn] | [Nn][Oo][Nn] )         echo "Annulation du bash..."         exit         ;;     esac } start   This is what I get :     sh start.sh   : unfindable command   »art.sh: line 3: syntax error close to the « symbol   'tart.sh: line 3: `function start


Why does my term show up as undefined in python?

unencryptionKey = (-16)   # Caesar Cypher Encryption def passwordunEncrypt(encryptedMessage, key):      # We will start with an empty string as our encryptedMessage     encryptedMessage = ''   # For each symbol in the unencryptedMessage we will add an encrypted symbol into the encryptedMessage for symbol in 'encryptedMessage':     if symbol.isalpha():         num = ord(symbol)         num += unencryptionKey   When I run the above code it tells me that, in the last line, 'unencryptionKey' is undefined.  In the first line it shows exactly what 'unencryptionKey' is.  Why the error?  In the original code the term in the last line was just 'key' so I changed it as I assume they mean unencryptionKey is to be used and thought tying it to the first line would allow it to run. I tried to screenshot so the line numbers would be included but it didn't work so had to cut and paste.


How to work with a player who cites ADHD as reason for disruptive behavior

I regularly run an Adventurers League table at a local game cafe. For the last few weeks I've been trying to incorporate a college age player into the group who hasn't worked out at other tables.  He's been displaying some disruptive behavior like drawn-out fights over rulings, fudging stats, and getting frustrated when I point out mistakes in his use of features. Rude and sudden outbursts--although enthusiastic ones--have already deterred several new players from returning to the store. He's gotten slightly better, but the same exact mistakes occur session after session.   When I approached him one-on-one before a session to figure out how we can work together better, he became slightly irritated and claimed that he's forgetting things as a result of his ADHD and that there's nothing he can do about it. He used a similar explanation later when I pointed out that this was the fourth time I had to repeat a specific setting description to him while he was on his phone.  I think he feels targeted due to his ADHD, after he has claimed I'm being unfair with rulings and challenges, especially when faced with scenarios that make it difficult for his monk to simply walk up and punch enemies.  I want to work with this player if possible. Since I have no perspective on ADHD I'm blind to how much of this is justified, but I'd be loath to let him push players around at my table. How can I effectively address this player's behavior in a way that won't close him off further?  What measures can I take to make this player feel welcome at my table without allow his distractions to disrupt the existing group, or letting him get away with being overly aggressive? Since this is Adventurers League, I don't really have a way to approach him in private, but I could try talking to him before the session again. But at what point can I safely say it's just not going to work and he's going to keep on fighting the other players/myself?


A job with an important title but no real responsibility

What's the word for a job with an important title but no real responsibility?


What can I add to make my gluten free buns a decent size.  I have tried for years. There has to be something to lift them and make them to the same size as our regular hot cross buns


Choose which pages appear in Google search results snippet?

I was wondering sometimes, the first result in Google's results has a list of pages (in the website) below the title of the search result.  Is this something I can force Google to do, with some sort of HTML tags?  Or does Google just do it automatically, when it feels like it?


for a $3 \times 3$ matrix A ,value of $ A^{50} $ is


Can we prove the law of total probability for continuous distributions?

If we have a probability space $(\Omega,\mathcal{F},P)$ and $\Omega$ is partitioned into pairwise disjoint subsets $A_{i}$, with $i\in\mathbb{N}$, then the  says that $P(B)=\sum_{i=1}^{n}P(B|A_{i})P(A_i{})$. This law can be proved using the following two facts: \begin{align*} P(B|A_{i})&=\frac{P(B\cap A_{i})}{P(A_{i})}\\ P\left(\bigcup_{i\in \mathbb{N}} S_{i}\right)&=\sum_{i\in\mathbb{N}}P(S_{i}) \end{align*} Where the $S_{i}$'s are a pairwise disjoint and a $\textit{countable}$ family of events in $\mathcal{F}$. However, if we want to apply the law of total probability on a continuous random variable $X$ with density $f$, we have (): $$P(A)=\int_{-\infty}^{\infty}P(A|X=x)f(x)dx$$ which is the law of total probabillity but with the summation replaced with an integral, and $P(A_{i})$ replaced with $f(x)dx$. The problem is that we are conditioning on an $\textit{uncountable}$ family. Is there any proof of this statement (if true)?


Order of general- and special linear groups over finite fields.

Let $\mathbb{F}_3$ be the field with three elements. Let $n\geq 1$. How many elements do the following groups have?   $\text{GL}_n(\mathbb{F}_3)$ $\text{SL}_n(\mathbb{F}_3)$   Here GL is the , the group of invertible n×n matrices, and SL is the , the group of n×n matrices with determinant 1.


Produce a GLM intercept that does not include reference levels for categorical variables?

I realize that a similar question to this has been asked, but it was not ultimately resolved. I have tried the suggestions posted to that question , but have had no success. I am using the following code:         allinfa4.exp = glm(survive ~ year + julianvisit + class + sitedist + roaddist + ngwdist, family = binomial(logexp(alldata$expos)), data=alldata) summary(allinfa4.exp)   Call: glm(formula = survive ~ year + julianvisit + class + sitedist +  roaddist + ngwdist, family = binomial(logexp(alldata$expos)),  data = alldata)  Deviance Residuals:  Min       1Q   Median       3Q      Max   -2.6435   0.3477   0.4164   0.4960   0.9488    Coefficients:               Estimate Std. Error z value Pr(>|z|)     (Intercept)  4.458e+00  7.117e-01   6.265 3.74e-10 *** year2013     3.680e-01  1.862e-01   1.976  0.04819 *   year2014     2.136e-02  1.802e-01   0.119  0.90564     julianvisit -5.714e-03  3.890e-03  -1.469  0.14192     classb       2.863e-02  2.194e-01   0.131  0.89615     classc      -2.394e-01  2.277e-01  -1.051  0.29304     classd      -1.868e-01  2.479e-01  -0.754  0.45109     classe      -4.500e-01  2.076e-01  -2.167  0.03021 *   classf      -5.728e-01  2.005e-01  -2.858  0.00427 **  classg      -8.495e-01  3.554e-01  -2.390  0.01684 *   classh      -1.858e-01  2.224e-01  -0.835  0.40351     classi      -3.196e-01  4.417e-01  -0.724  0.46932     sitedist    -2.607e-04  5.043e-04  -0.517  0.60520     roaddist     6.768e-05  4.311e-04   0.157  0.87525     ngwdist     -5.751e-05  9.456e-05  -0.608  0.54306   The main thing to note here is that I have two categorical variables, year and class, and R has combined the first level of each (2012 and class a) into a reference level intercept term. Not only do I need to know the intercept term for these levels individually, but I also need to know the base intercept terms itself (beta0), just as SAS produces.   I have tried changing the contrasts and deviation coding to accomplish this, but although doing so allows me to extract different levels, it changes the way they are calculated and still does not produce beta0. I've also tried adding +0 and -1, but this also does not provide what I need. Is what I'm trying to do simply impossible in R? It may seem like a strange request, but beta0 is necessary to convert the results of logistic exposure (special kind of logistic regression for nest-survival data) to daily survival rates. Any help would be hugely appreciated. Thanks!  Here is an example of SAS output I want to emulate (taken from a similar analysis done by my lab mate) :  Parameter Estimates Parameter   Estimate    Standard Error  DF  t Value Pr > |t|               beta0       7.8404      2.8479          19  2.75    0.0127   NT         -3.8786      1.8831          19  -2.06   0.0534   bgdensity  -0.1127      0.1614          19  -0.70   0.4935   nwh         1.3466      1.4625          19  0.92    0.3687       NRD        -2.6981      1.9496          19  -1.38   0.1824       NAGW       -0.4898      2.2518          19  -0.22   0.8301


Prefix with TikZexternalize does not work for me

The example bellow comes from the  (p610). It does not work my computer. Note that it works when I comment the option [prefix=figures/]. Any idea of what could go wrong here?  \documentclass{article} % main document, called main.tex \usepackage{tikz} \usetikzlibrary{external} \tikzexternalize[prefix=figures/] % activate  \begin{document} \tikzsetnextfilename{trees} \begin{tikzpicture} % will be written to ’figures/trees.pdf’ \node {root} child {node {left}} child {node {right} child {node {child}} child {node {child}} }; \end{tikzpicture} \tikzsetnextfilename{simple} A simple image is \tikz \fill (0,0) circle(5pt);. % will be written to ’figures/simple.pdf’ \begin{tikzpicture} % will be written to ’figures/main-figure0.pdf’ \draw[help lines] (0,0) grid (5,5); \end{tikzpicture} \end{document}


Lightning: aura:iteration - how to refer indexVar variable inside loop to access elements in List?

What is the way to refer index variable inside looping ?  The code below results in error:     Failed to save undefined: expecting a positive integer, found 'indx'   at column 10 of expression: v.labels[indx]: Source       <aura:iteration var="item" items="{!v.items}" indexVar="indx">
             {!v.labels[indx]}             {!item}
     </aura:iteration>


a vacuum airship is a hypothetical airship that is evacuated instead of using a lighter gas. Really, once I first saw this, I thought, "Why did I never think about this before?!" Indeed, whenever I pictured an evacuated container, I thought it would just sit there.  But no. Instead here on Earth, a theoretical vacuum airship could lift 1.28 grams per liter of evacuated space, a 14% boost over helium, owing to the density of air.  Of course, the air is also the destroyer of this powerful capability; it exerts 14 psi, or ~0.1 MPa!! According to Wikipedia's calculations, a hemispherical shell would have to withstand $$450,000 kg^{-1} m^5 s^{-2}$$ which is over 3 times the buckling pressure of diamond.  Give up? Not yet. There is a couple of interesting ideas I thought about:   Why hemispherical? Wouldn't other shapes do well also? For example, a sphere, or a cylinder (maybe a cylinder with radius=height). From what I know (not much..) about spherical items, I suppose it would distribute the pressure evenly. Wouldn't that mean that diamond could easily sustain 100 kPa (withstands up to 600 GPa)? Is there no other way around this obstacle? Could we make use of any exotic forces or structural methods? (One interesting suggestion: Gradually evacuate the helium-filled airship, slowly going up, so that when we reach a total vacuum the airship is basically in space? In that case there wouldn't be any powerful pressure from air...)


I am getting red boxes around hyperlinks on the PDF output. Apparently contrary to  the boxes are actually part of the final PDF, as when I save a copy of the PDF the red boxes remain.  I think the problem is coming from the only error I get on build:  ! Package hyperref Error: Wrong DVI mode driver option 'hypertex'   which I believe has been produced since changing from LaTeX>>DVI to LaTeX>>PDF  Using TeXnic Center and the following packages:  \documentclass[a4paper,twoside,10pt]{report} \usepackage[hypertex]{hyperref} \usepackage[USenglish]{babel} %francais, polish, spanish, ... \usepackage[T1]{fontenc} \usepackage{graphicx} \usepackage[ansinew]{inputenc} \usepackage{lmodern} %Type1-font for non-english texts and characters \usepackage{caption}  \renewcommand{\labelitemii}{$\star$} \begin{document}


How to end paragraph text in an inverted pyramid shape?

In many old books, the final paragraphs of chapters end in an inverted pyramid shape, like this:    I think this is beautiful, so I would like to imitate this for my book. I've found the code for a triangle in this post   \documentclass{article} \usepackage{microtype,shapepar}  \def\triangleupshape{% {0}% {0}b{0}\\% {8.66}t{-5}{10}\\% {17.32}t{-10}{20}\\% {17.32}e{0}% }      \begin{document} \shapepar{\triangleupshape}A ipsum dolor sit amet, consectetuer    adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat. Ut wisi enim ad minim veniam, quis nostrud exerci tation ullamcorper suscipit lobortis nisl ut aliquip ex ea commodo consequat. Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat, vel illum dolore eu feugiat nulla facilisis at vero eros et accumsan et iusto odio dignissim qui blandit praesent luptatum zzril delenit augue duis dolore te feugait nulla facilisi. Lorem ipsum dolor sit amet, consectetuer adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat. \par \end{document}   Which results in this:    But I'd like it to be inverted and the first part of the paragraph need to be full line width. Only the last few lines should end in an inverted pyramid like in the example above.  Is there a way to do this? Thanks in advance for your help.


USB drive is corrupted after rebooting during copy proccess

user decided to reboot his pc during copy from usb stick and it corrupted his precious data. I'm trying to diagnose what's wrong but unfortunately i hit a wall and can't understand the issue with the stick.  I can see this disk in Disk Utility, but seems like all it has is unallocated space.  sudo fsck /dev/sdc fsck from util-linux 2.27.1 e2fsck 1.42.13 (17-May-2015) fsck.ext2: Attempt to read block from filesystem resulted in short read while trying to open /dev/sdc Could this be a zero-length partition?  fdisk -l /dev/sdc fdisk: cannot open /dev/sdc: Input/output error   Any help would be greatly appreciated.    dmesg /syslog:  [ 6073.351716] sd 6:0:0:0: [sdc] tag#0 Sense Key : Not Ready [current] [ 6073.351719] sd 6:0:0:0: [sdc] tag#0 Add. Sense: Medium not present [ 6073.351722] sd 6:0:0:0: [sdc] tag#0 CDB: Read(10) 28 00 00 76 c6 80 00 00 08 00 [ 6073.351724] blk_update_request: I/O error, dev sdc, sector 7784064 [ 6073.351726] Buffer I/O error on dev sdc, logical block 973008, async page read   He tried to copy around 500mb of work files from that stick, it froze and he rebooted "Just in case". As far I know that was the only copy of those files. Is there any way to try to restore data?     It's getting weirder and weirder. I gave up with restoring data and tried to wipe this stick with shred or dd. Outputs:  shred: /dev/sdd: error writing at offset 19218807296: Input/output error shred: /dev/sdd: error writing at offset 19218807808: Input/output error  dd: error writing '/dev/sdc': Input/output error 1+0 records in 0+0 records out 0 bytes copied, 0,00123257 s, 0,0 kB/s   Tried to format on Win workstation, cant even plug it in or access through cli, got over hundred "Wrong folder name errors" in a few seconds.


Let $\phi:A\rightarrow B$ be a ring homomorphism. Let $X＝ \operatorname{Spec}(A)$, $Y= \operatorname{Spec}(B)$. If $q\in Y$, then $\phi^{-1}(q)$ is a prime ideal of $A$. Hence $\phi$ induces a mapping $\phi^* :Y\rightarrow X$. Show that:       If $b$ is an ideal of $B$, then    $$\overline{\phi^*(V(b))}＝V(b^c).$$   Here $b^c$ is the ideal $\phi^{-1}(b)$.    I can prove that the left side is contained in the right side. But I can't prove the right side is contained in the left side.


Can't solve linker error for small C program on CentOS 8.1

I'm getting a linker error when I try to build a small C program on CentOS 8.1.  I'm new to Linux development, and to using make, and I haven't been able to solve the error.  The linker is failing to resolve a function that's defined in a static library.  I built the static library from the sample code for the APUE book.    I'm able to build my program, if I use a makefile that's provided with the APUE sample code.  But I'm trying to get it to build with a simpler makefile that I wrote.  The program is:  #include "apue.h"  int main(void) {     err_exit(8, "hello world");     exit(0); }   The relevant line from the header file is:  void    err_exit(int, const char *, ...) __attribute__((noreturn));   The makefile is:  runme: testprog.o     gcc -ansi -Wall -o runme -L. -lapue testprog.o  testprog.o: testprog.c     gcc -c -ansi -Wall -o testprog.o -I. -DLINUX -D_GNU_SOURCE testprog.c   The error is:  $ make gcc -ansi -Wall -o runme -L. -lapue testprog.o testprog.o: In function main': testprog.c:(.text+0x14): undefined reference toerr_exit' collect2: error: ld returned 1 exit status make: *** [Makefile:2: runme] Error 1  Any suggestions would be appreciated.


Prove $a^k\equiv 1 \pmod k$ has no solution for infinitely many even integers k

Prove that there are infinitely many EVEN positive integers $k$ such that for each of those $k$, the equation $\varphi(n) = k$ has no solution in positive integers $n$. I believe there might be a way to approach this using Euler's Theorem where one proves $a^k\equiv 1 \pmod k$ has no solution for infinitely many even numbers.


Checking a number with calculator package

I have a problem about calculator package, I need check if #1 is a number or not, could I use conditional command? ex:  \def\CHECK#1{  % if #1 a number  \if...?   #1 is a number  \else   #1 is not a number  \fi  }  \CHECK{3}  \CHECK{n}


What are the options to add one or more USB 3.0 port to a laptop? The only way I seen so far are USB 3 expresscard adapters but all of these adapters stick out quite a lot from the laptop and have power/bandwidth limitations.  Update: after some more research I found there are smaller 1 port (PhotoFast GM3000EX ExpressCard) that do not stick out of the laptop at all after plugging in. Looks like these are not available in US yet but I'm sure it's coming soon.


How can I compare logarithm and the number?

There are two numbers $\log_3 4$ and $\sqrt[4]{2}$. How they can be compared without calculator?


How to find coefficients for Logistic Regression

How do you find the coefficients for logistic regression?  Is it a case of just transforming the samples from the dependent variable and preceding to fit it like a linear regression?


Can you add the probabilities of a classifier to better predict an outcome?

Say I am interested in predicting the TOTAL number of people that survive the titanic disaster, NOT each individual who died. Is it possible to run a probabilistic classifier on the data getting a value for each individual between 0 and 1, then summing those values for a best guess?


I have found here some questions about my problem, but I can't use it. I will change a css property of  during click on them via JS, JQuery   <!DOCTYPE HTML>       <meta charset="utf-8">          <link rel="stylesheet" type="text/css" href="../css/styles.css">
 Green

     Red
      and my javascript.js  function uploadcss() {$(".osb").css("border","15px solid blue")}; function downloadcss() {$(".osb").css("border","5px solid red")};  function addcss (csslink) {     var csslink = document.cretaeElement ("link");     csslink.rel = "stylesheet";     csslink.type = "text/css";     csslink.href="../css/test.css"; }   And it's doesn't work :( Why?


I'm proofreading a text that includes the following passage:  Semiology is defined in A Glossary of Literary Terms as ‘the systematic study of signs, as these function in all areas of human existence’. So perhaps this is what all modern literary and artistic study is.  It's the second sentence I'm having trouble with, particularly the phrase, "what all modern literary and artistic study is." I can't decide whether that sentence should end with "is" or "are". If I were editing, I would just rewrite the sentence, but I don't have the remit to do that as a proofreader. A compound subject linked with the word "and" would normally take the plural: "…what all modern literary [study] and artistic study are." But neither "is" nor "are" sound correct to me. I'm assuming that it is a compound subject in that it is referring to two types of study (literary study and artistic study) rather than a single subject (study that is, at the same time, both artistic and literary). Is this a compound subject, as I'm assuming it to be, or a single subject? Or is there a better way to think about this problem?


How to break from multiple for loops at once in python

inc = 0 for i in range(100):   for j in range(5):       print("before",inc)     inc = inc + 1     print("after",inc)     if inc == 1:       break  This is the minimum code. I want to break the all the loops at once and yes I do know a method that I found on this site the method I found inc = 0 done = None for i in range(100):   for j in range(5):       print("before",inc)     inc = inc + 1     print("after",inc)     if inc == 1:       done = True       break   if done:     break  But the above method would be too long and tedious if there is a more than 4 loops or code is a bit more complex. Is there a function/library that can help?


Jquery click event not registering for a button inside handlebarjs template

I have an HTML page when loaded, send a request to an API and populates a div via handlebars.js template using the data returned from the API call. The json data is nested and I am adding a button for each nested object. However, when I try to add a click event to those buttons using their class, nothing happens. The event is not registering. I tested with adding a button on the HTML file instead of the template and it worked as expected. It seems the issue is only for the buttons inside the handlebarsjs template. HTML: <!DOCTYPE html>     <meta charset="UTF-8">   <meta http-equiv="X-UA-Compatible" content="IE=edge">   <meta name="viewport" content="width=device-width, initial-scale=1.0">      <link href="assets/bootstrap/css/bootstrap.min.css" rel="stylesheet">   <link href="assets/bootstrap-icons-1.5.0/bootstrap-icons.css" rel="stylesheet">            <title>Rule Engine</title>

                        JS : const API_URL  = 'http://localhost:5000/getdata'  // Templates const ruleTypeHTML = $('#ruleType-template').html(); const ruleTypeTemplate = Handlebars.compile(ruleTypeHTML);  $(document).ready(function() {    $.get(API_URL , function(data) {     let html = ruleTypeTemplate({data})     $("#ruleTests").append(html);   });    $('.addButton').click(function() {     alert('clicked')     let d = $(this).data('ruleType');           console.log(d);      });  });


Do physicists know what the expansion rate of the Universe was at the beginning of the matter dominated era?


if $𝐺$ is a finite abelian group $𝑜(𝑎)$ divides the exponent of $𝐺$, for each $𝑎\in 𝐺$

Define the exponent of a group as $\sup o(a)$ ,where $a \in G$. Show that if $G$ is a finite abelian group $o(a)$ divides the exponent of $G$, for each $𝑎\in 𝐺$ Here $o(a)$ denotes the order of an element $a$? How can I show this? Can someone please show the right approach to attempt this question. Thanks.


My visa application to the UK got refused under 4.2 (a), (c), (e)

I recently became unemployed and applied for the UK short term standard visitor visa to see my boyfriend who is a British citizen. I provided an invitation letter from his father (because he is the owner of the house) and his ID; my 6 months of bank history with the balance information about my other accounts (yet I failed to prove some of the money that I mentioned in my application). Even though they are only saving accounts, they asked me to show all transaction history and prove the source and provenance of all of my deposits and funds.  Also because I am currently unemployed and unable to prove strong ties to Turkey since I am single with no dependent relatives, and my financial circumstances are not satisfactory, I am also rejected based on lack of incentive to leave the UK.  I am now planning to provide my whole employment history showing all my salaries; full transaction history of all my accounts with an attached letter explaining the times where I exchanged my Turkish liras to Euros to show where the money in my Euro account came to be; a letter from my former employer declaring that I was let go because of economic situations so that they don't think I quit my job with the intent of moving to the UK; and plane tickets to show the exact dates I will be there.  What do you think should be helpful in my situation? I want to be really careful and provide as much information as possible.


I usually convert my logos to a particular colour (not just greyscale) in photoshop by using the following process: Convert to Greyscale/Choose Duotone/Select colour and click okay.     I need to do the same thing in GIMP but can't find duotone/monotone options. I need a method of being able to do this conversion quickly and without having to select each part of the logo and the paint brush.   Does anyone have any suggestions?


How to block administrative user from accessing the internet on windows 7?

How to force the administrative user to type in a password in order to open and use internet explore in windows 7?  Or  Uninstall or disable internet explore?


I live in London, and would like to find a SIM card that has an attractive EU wide data plan for my iPad.  I know I can get individual SIM cards for each country, but that's something I'd like to avoid when going on road trips.  Any suggestions?  Ideally I'd like prepaid, but I'm open to a UK contract that would offer a good plan.


I have a quartz crystal and I am connecting it to a microcontroller's EXTAL and XTAL pins.    Can I connect it anyway? Do the crystals have polarity? In EXTAL and XTAL, which is input and which is output pins?


When do we use the positive vs. negative square root of numbers?

When we take the square root of a number or in a equation, where do we get only the positive root, and where do we get both the positive and negative (both answers)?  For example, when taking the square root of $4$ or solving an equation like $x^2 = 9$.


Default and hover states for bounty award buttons don’t match on Meta Stack Exchange

This is what the default state of the “bounty award” button looks like on Meta Stack Exchange:    Notice how it doesn’t match the general style of the site. The hover state, on the other hand, does:    Because they’re of different sizes, moving the cursor over the button shifts the whole post over; it’s a bit annoying.


Find a general control and then show that this could have been achieved at x2

Determine the general form of $u_0, u_1 ~\text{and} ~ u_2$ if a system of difference equations of the form  $$x_{n+1} = Ax_n  + Bu_n,$$  where:  $$A = \begin{pmatrix}   3 & 2 & 2  \\   -1 & 0 & -1 \\    0 & 0 & 1   \end{pmatrix}$$  and:  $$B = \begin{pmatrix}   0 & 0  \\   0 & 1 \\   1 & 0   \end{pmatrix}$$  is to be controlled for $x_0 = 0 ~ to ~ x_3 = [2, 1, 2]^T$ .  Show this target could have been achieved at  $x_2$   Solution So far I have caculated the controlability matrix to be $$ C =\begin{pmatrix} 0&0&2&2&6&6\\ 0&1&-1&0&-3&-2\\ 1&0&1&0&1&0 \end{pmatrix}. $$ Thus the system is controlable Now putting Cv=x3 i have the 3 equations $$ 2c+2d+6e+6f=2\\ b-c-3e-2f=1\\ c+e+f=2\\ $$ which i have then put into augmented matrix row echleon form which i have found to be $$ a-d-2e-3f=1\\ b+d+f=2\\ c+d+3e+3e=1\\ $$  How do I now solve with so many unknowns? also can you please check my working so far is correct. many thanks


Basis of infinite Vector Space $\mathbb R^{\infty}$

I have a question about one example in Linear Algebra.  Let $\mathbb R^∞$ be the vector space of infinite sequences $(\alpha_1, \alpha_2, \alpha_3, \ldots )$ of real numbers.  Scalar multiplication are defined in the natural way: the sum of $(\alpha_1 , \alpha_2 , \alpha_3 , \ldots )$ and $(\beta_1,\beta_2,\beta_3,\ldots)$ is $(\alpha_1 +\beta_1, \alpha_2 + \beta_2, \alpha_3 + \beta_3,\ldots)$ the product of $(\alpha_1,\alpha_2,\alpha_3,\ldots)$ by a scalar $\lambda$ is the sequence $(\lambda \alpha_1, \lambda\alpha_2, \lambda\alpha_3, \ldots )$.  There exists infinite linear independent set of vectors $(e_1, e_2, e_3, \ldots)$ \begin{align} e_1 &= (1, 0, 0, \ldots)\\ e_2 &= (0, 1, 0, \ldots)\\ & \,\,\,\vdots \end{align}  The problem is that this set (lets call it $X$) is not a basis of this vector space. Because for example $v = (1, 1, 1, \ldots)$ cannot be written as a linear combination of set $X$ (Linear combination must be a finite sum).  My task is to add "some vectors" to the set $X$ to create a basis of that vector space. If I add $v$ its not basis ($\langle X, v\rangle \ne\mathbb R^∞$)  Is there any proof that the process of adding vectors to set $X$ is not finite? Or is it possible to create a basis with adding vectors to $X$?  Thanks for answers


Smartly omit chapter number in equation numbering

In my thesis I use chapters, sections and subsection. I like to have my equations numbered with respect to section, but I want the displayed equations numbers not to include the chapter number. Moreover when referencing the equations I want the chapter number to be excluded unless I reference them from a different chapter.  How can I achieve this? If not otherwise possible it would be ok to use two commands \ref{} and \gref{} where the first one omits the chapter number. I would like to do the same thing also for references to sections and to theorems. At the moment I am using the koma scrbook class.  Example  I. Chapter 1 1. Section 1   a^2 + b^2 = c^2         (1.1) as seen in (1.1)  II. Chapter 2 1. Section 1 an extension of (I.1.1) is   a^3 + b^3 = c^3         (1.1)


Why does a working standalone nested function/script not work inside a larger script?

The following (nested) function/s  function hpf_matrix {    # Positional Parameters   Matrix_Dimension="${1}"   Center_Cell_Value="${2}"    # Define the cell value(s)   function hpf_cell_value {     if (( "${Row}" == "${Col}" )) && (( "${Col}" == `echo "( ${Matrix_Dimension} + 1 ) / 2" | bc` ))       then echo "${Center_Cell_Value} "       else echo "-1 "     fi   }    # Construct the Row for Cols 1 to "Matrix_Dimension"   function hpf_row {     for Col in `seq ${Matrix_Dimension}`       do echo -n "$(hpf_cell_value)"     done   }    # Construct the Matrix   echo "MATRIX    ${Matrix_Dimension}"   for Row in `seq ${Matrix_Dimension}`     do echo "$(hpf_row)"   done   echo "DIVISOR   1"   echo "TYPE      P" }   work/s fine, both as a standalone code and inside a script.  I.e. hpf_matrix 5 18 will return  MATRIX    5 -1 -1 -1 -1 -1  -1 -1 -1 -1 -1  -1 -1 18 -1 -1  -1 -1 -1 -1 -1  -1 -1 -1 -1 -1  DIVISOR   1 TYPE      P   and it will even work (with various values) as requested in:  Kernel_Size=5 Center_Cell_Default=18 ; Center_Level=Default eval Center_Cell="Center_Cell_${Center_Level}"  HPF_MATRIX_ASCII=`hpf_matrix ${Kernel_Size} ${!Center_Cell}` echo "${HPF_MATRIX_ASCII}"   However, integrating without any changes the above pieces of code (the hpf_matrix function and feeding the "${HPF_MATRIX_ASCII}") inside a larger bash script, errors-out with the following message:  ((: 1 2 3 4 5 == 1 2 3 4 5 : syntax error in expression (error token is "2 3 4 5 == 1 2 3 4 5 ")   Minor Update  If I understand correctly, for whatsoever is the reason behind, the line  for Row in seq ${Matrix_Dimension}  as well as the line  for Col in seq ${Matrix_Dimension}  are printed as "1 2 3 4 5" instead of "1" "2" "3" "4" "5".  What is wrong in this case?  I would like to keep a nested structure for the function unless it is clearly wrong.


Why will my remove function find strings but not ints?

We are working on generics which requires us to have an array of AnyType (the driver implements an array of strings then integers). One of the functions is a boolean function called 'remove' which finds 'x' and removes it, then it returns true. It has no issues finding and removing a string but can't seem to find ints. Why is this?  the code is  public boolean remove(AnyType x) {     for(int i = 0; i < length; i++)     {         if(arr[i] == x)         {             for(int j = i; j < length - 1; j++)             {                 arr[j] = arr[j + 1];             }             length--;             return true;         }     }     return false; }


Under what conditions a functor sends products to products?

Let $\mathcal{C}$ be a category and $A,B$ two objects in $\mathcal{C}$. We call $(P,\mu : P\rightarrow A,\nu:P\rightarrow B)$ a product of $A$ and $B$ if for any $P'$, $\mu':P'\rightarrow A$ and $\nu':P'\rightarrow B$ there exists a unique morphism $g:P\rightarrow P'$ such that $g\circ \mu'=\mu$ and $g\circ \nu'=\nu$.   Now assume that $F$ is a functor from the category $\mathcal{C}$ to category $\mathcal{D}$. What are the necessary conditions that whenever $F$ satisfies them, it sends products to products, namely, if $(P,\mu,\nu)=A\times B$ then $(F(P),F(\mu),F(\nu))=F(A)\times F(B)$?  Clearly, there must be some conditions since for any category $\mathcal{C}$ you can define a functor $F$ that takes every object to the set $X=\{0,1\}$ and every morphism to $id_X$ in the category Sets. Then $F(A\times B) = (\{0,1\},id_X,id_X)$ which is clearly not the product of $F(A)=\{0,1\}$ and $F(B)=\{0,1\}$ (in Sets).  However, if $(F,G)$ is an equivalence of categories I think $F$ takes products to products.  I am pretty new to the subject, so simple examples and explanations would be very nice.


I am getting very strange compilation problems after using the \cal command in a very simple setup:  \documentclass[12pt]{article}  \usepackage{amsmath} \usepackage{amsfonts}  \newcommand{\Pp}{\mathbb{P}} \newcommand{\Ee}{\mathbb{E}} \newcommand{\Prob}{\text{P}}  \title{STAT 535 Homework 3} \author{Sheridan Grant} \date{\today}  \begin{document}  \maketitle  \section{Theorem 2.2.8 and Proposition 2.2.9}  Here is normal stuff: $n + b$  Now I'll try to do something with ``cal'': $\cal{R}_n$  What? $\cal{R}_n \sim \frac{n + b}{1}$  \end{document}   The result (compiled with latexmk -pdf) is:   The problem is fixed if I switch to {\cal R}_n or \mathcal{R}_n but I don't understand why; I've been able to use \cal in the \cal{R} manner in the past without problems. I figure it might be nice to have an explanation easily available on here...


Expand content with user generated tutorials

After a brief discussion with @MonicaCellio (In the comment) - It has come to my attention that perhaps I chose the wrong words to describe my original idea (In the edit history). When I wrote "social features" I was actually suggesting an alternative way to for users to share their knowledge using a new type of post and articles and not just by questions and answers.   The basics of my idea was to allow users to write articles on topics relevant to the community on the SE websites just as any answer posted is expected  to be too. Allowing users to write their own content (I.E posts/articles/etc..) will be granted as a privilege for advanced users so that not anyone could write stupid things, users that will write content must be established and well-familiar with the rules of SE.   I know anyone can start a blog, but it's require frequent maintenance and content updates, while writing on SE ensure that it addressed to a large, well-established community, with a similar fields of interest.  Posts writing will follow the same guidelines as asking and answering questions does, but it will provide an alternative for users that are mostly answering specific questions, as a new method to contribute to the community.   By writing, one may also reveal more about their personality, wit, way of thinking, ETC. That's when the "social" takes place - You'll also have "authors" and not just "users" you can remember by their catchy name, but people that you can remember by the field of interest they are writing content about.   They key points will be:    Users will be able write rich content with advanced WYSIWYG HTML editor, content that doesn't require a question to answer, but that is still relevant to the SE website it is writing on. Users will be able to Upvote/Downvote other users posts. Posts will be listed on their author profile, so it will not just show the activity, but additional layer of user generated content. Popular posts with high reputation could be associated to tags making the information of tags richer with user generated content Users will be able to include links in answers not only to other questions, but also to posts. User will be able to comment on post to allow the author to correct and improve it. It will improve the interaction and offline discussions (Which are prohibited when it come to long discussions on questions and answers). I believe that users will be happy to share their own tutorials, tips and tricks - Because they are already doing so when answering questions, but before the can start, they'll have to earn enough reputation to ensure that only high profile users will be able to write high profile content, and not just any rubbish. It will provide another type of method for voting and getting earning reputation Users will be able to include content in their CVs on SO Jobs.  Opportunity to earn some new badges.   So it's a Mega feature request and it require some detailed design work, but I do think that it will invite a new type of activity for users on SO (and the rests of the sites of-course).


How to include figures below the beginning of section?

I am writing a paper and have included a separate section at the end called "Tables and Graphs" but when I insert an image below the \section{ }, it pushes the title of the section below it. My code is: \newpage \renewcommand{\thesection}{} \section{Tables and Graphs}  \begin{figure} \includegraphics[width=\textwidth]{"Provincial Time Series growth".png} \caption{Natural Logarithm of Provincial Real GDP per capita, 1960-2016} \end{figure}  Which produces the following image:  Not sure why it is doing this. When I don't include the image the title just appears at the top of the page. Anyone see a clear issue with my code or is there something more I need to do?


Every vector space admits a Hamel basis by AC. That is there are maximally linear independent sets. But how to prove their cardinalities necessarily agree?  ..I couldn't really find any reference.


I want to know what to use in C# to format my output in my console window I tried to use \t but it did not work  I know there is printf in C to format my output  check this image


I have some code with FluentPDO with UTF-8 encoding like this:  and result:  but when i run this, it is not working, my database using utf8_general_ci collation. I try to edit and search this problem on this page but it still does not working. Please help me


Let $\mathfrak{g}$ be a Lie Algebra over $k$, $\mathfrak{n}$ its radical. Why is $[\mathfrak{n},\mathfrak{g}]$ the smallest of its ideals $\mathfrak{a}$ such that $\mathfrak{g}/\mathfrak{a}$ is reductive?


How do you install Android Studio for Ubuntu 14.04 LTS

I have looked around the web and tried to follow the official instructions () but the file I am meant to run called "Studio.sh" wont run? Thanks.


What is the difference between free groups and free modules/vector/algebras spaces, or in other words what does free mean in algebra?   I have seen two uses of the term free:   something of infinite order that is generate by a linear independent set called a basis. I have seen this applied to (Groups/abelian groups/vector spaces/modules/algebras) an algebraic structure in which there is no defined relation between elements. I have seen this apllied to vector spaces/modules-used in tensor product definition.   Thanks


Google returns that response, not sure why is a complex number.


I am on the verge of building a mini metropolis in Terraria but no one is arriving? What do I need to do? I have a table chair and light source but nothing for the last hour. What do I need to do?  I tried going through the post that has been on here but still got nowhere. It was the wiki and that post that I tried to follow before (and that post that brought me to this site) Seems that only Josh wants to be helpful though


error in count script for number of occurences

I have written a small script to count number of occurrences of logs in a particular file. The following is my code:   #!/bin/sh count=1 while read line do     found=$( grep M $line )     OCCURENCE=$( grep M /log.txt)     if [ "$OCCURENCE" ]; then         echo $count")" $line >> filesave.txt     fi     count=$((count+1)) done < log1.txt   but I am getting this error:  ./count.sh ./count.sh: syntax error at line 10: `found=$' unexpected


A vector space over an infinite field is not a finite union of proper subspaces?

Show that if $V$ is a vector space over an infinite field $\mathbb{F}$, then $V$ cannot be written as set-theoretic union of a finite number of proper subspaces.


What, if anything, makes forces the "cause" and acceleration the "effect"?

We typically say that forces cause acceleration inversely proportionate to mass. Would it be any less correct to say that acceleration causes forces proportionate to mass? Why?  (Note that the underlying question in my mind - essentially, what distinguishes cause from effect - is far more general. But this seems like a good place to start.)


Mirror changes to side of cube across all six sides

I want to create a cube with some general extrusions. This should be the same across all sides of the cube. Is there a way to make this mirrored across all six sides? I know that I could delete the rest of the cube, copy my changes, rotate it 90°, move it down and to the side, and repeat for all the sides, then remove doubles, but I'm wondering if there's a way to make this work in real time.  In the below image, all six sides should copy the changes shown here on the one side:


Let $G$ be a group, $H<G$ a subgroup of $G$ and $K<H$ a subgroup of $H$. Assume that $[G:K]$ is finite. Then: $[G:K]=[G:H][H:K]$.    In the case where $G$ is finite, the proof is pretty simple using Lagrange theorem and a bit algebra. However, I'm not sure what to do in case $G$ is infinite.  Edit: I have seen the solution in the linked post. I still have one question: In the answer, we define a bijection $\phi:(H\backslash G)\times(K \backslash H) \to K \backslash G \ \ $ by $\ \ \phi(Ha_i,Kb_j)=Kb_ja_i$.  Why is this function well defined?


Could any one please suggest me on which boot level or /etc/rc.x folder should I include my shell script so that it runs automatically immediately after login or just before the system prompts for login in LTS 12.04  Thanks


How did Google find my site if I had no incoming links?

I had bought a domain name, hooked it up to my hosting, and started working on it. Mid-way through I decided to check to see if my site was indexed on google. I wasn't expecting it to be, because I didn't have any links to it or put it into any sites that would link to it (ei SEO Tools like Alexa). Sure enough, my website had been indexed. How did Google find out about my site? Does it just crawl any new domain that is purchased?


Books on the GAP (groups, algorithms and programming) system

I am learning GAP by using internet only for computations in finite group theory. Is there any book for GAP? I didn't find any such book.Thanks.


Click event listener on dynamically created button

I am having some real difficulty with using .onclick on a group of dynamically created buttons. I was having the same problem with this yesterday on a real project that I'm working on so decided to trial out on this practice project that I have and the problem still persists so this is definitely a me problem. At first I thought maybe it was to do with how I am creating the buttons. So this was how I was creating it in the beginning, like this: function userData() {     fetch("https://jsonplaceholder.typicode.com/users")     .then(response => response.json())     .then(users => {         let output = '
List of Users
';         output += '
';         users.forEach(function(user) {             output += `                 <button data-user="${user.id} type="button" class="list-group-item list-group-item-action">                     ${user.name}
                     ${user.email}
                     ${user.address.city}
                 </button>             `;         });         output += '
';         document.querySelector('#response').innerHTML = output;         }); }  I thought this probably wasn't the best way to go about it so I decided to use the document.createElement method instead and now it all looks like this: document.addEventListener('DOMContentLoaded', function() { userData(); document.querySelectorAll('button').forEach(button => {     button.onclick = function(){         userSelect(this.dataset.user_id);     } })  });   function userData() {     fetch("https://jsonplaceholder.typicode.com/users")     .then(response => response.json())     .then(users => {         const h6 = document.createElement("h6");         h6.innerText = "List of Users";         const userList = document.createElement("div");         userList.className = "list-group";         users.forEach(function(user) {             const userButton = document.createElement("button");             userButton.className = "list-group-item list-group-item-action";             userButton.setAttribute('data-user', `${user.id}`);             userButton.innerHTML = `             <strong>${user.name}</strong><br>             ${user.email}<br>             ${user.address.city}<br>             `;             userList.appendChild(userButton);         });         const container = document.querySelector('#response');         container.appendChild(h6);         container.insertBefore(userList, h6.nextSibling);     }); }   function userSelect(user_id) {     fetch(`https://jsonplaceholder.typicode.com/users/${user_id}`)     .then(response => response.json())     .then(user => {         console.log(user);     }); }  The problem is when I click on a button, nothing is showing in the console but when I directly use the function: userSelect(6); that user object shows up fine. I am really going wrong somewhere with the .onclick but I really don't know what's wrong. If I can work out how to solve it here, I know I'll be able to resolve the problem with the project I'm working on.


mysql varchar does not compute with java string

my case:  I try to get a value from my MySQL database. This data is defined as a VARCHAR. This is done in java with a prepared statement and resultset.  String add1 =rs.getString("include");   according to  website table 5.1 states "Can always be converted to these Java types".  therefore a VARCHAR should be able to be converted in a java.lang.string. When i check the data type in java it indeed gives java.lang.string. So for so good.  My issue is when i try to compare this obtained "String" value to a in java defined String value they don't seem to be equal.  Let's give a simple example. I get the (VARCHAR) value "1" from the database and store in in String add1  I want to check if this value is indeed "1" and therefore I use the following statement  if(add1=="1") {       /* do something */    }       Only the values are , according to java, not the same. So I was curious about why this is.  I started searching why those two "Strings" are not equal.  First of I checked the length of both strings. Both came out to be 1 in length as expected.  Afterwards I checked the value of both. To see if both values where indeed the same i wanted to check their hexadecimal representance. Both came out with the value 0x31. Still as expected.  But then why isn't my if statement accepted by java if both seem to represent the same string-hex-bin-you name it value.  In short: Why is my VARCHAR "String" obtained from a MySQL databse in java not the same as a String defined in java.


Why is a direct flight twice as expensive as a flight with 1 stop where the stop is the same city as the destination of the direct flight?

As the title shows I found the following:  1 direct return flight HK->Vancouver-> HK, priced at HKD 10600  and  1 return flight HK-> Vancouver -> Seattle -> Vancouver -> HK, priced at 5200 HKD  How is that possible? I understand Air Canada might want to compete with different American airlines that are able to service Seattle but I saw the same weird pricing offered by Korean Airlines and other non Canadian/non American airlines.   My question is this: With the 1-stop flight, can I get off in Vancouver and not partake in the 2nd leg of the journey? Can I collect my suitcases at Vancouver even if the final stop is Seattle? Even more important, on the way back to Hong Kong, can I board the flight in Vancouver instead of in Seattle?   I am just wondering because despite all potential reasons of price discrimination, and other marketing techniques that may attempt to explain this price discrepancy, I find no logic in how those 2 different flights are priced at all. Can someone explain?  Thanks      Here the flight with 1 stop , 1/2 price, and the first leg being the exact same as the direct flight.


How to evaluate this indefinite integral $\int\frac{\cos(x)}{1+\mathrm{e}^x}\mathrm{d}x$

One of my student asked me to help her evaluate this indefinite integral $$\int\dfrac{\cos x}{1+e^x}\mathrm{d}x,$$ and I tried several minutes, but at last I had to given up, for I thought that  it is very possible the primitive of $\dfrac{\cos x }{1+e^x}$ can not be expressed in terms of elementary functions. And then, I resorted to Maple and  Mathematica. But these two computer algebra systems can not give me the answer, which shows that it is very certain that that indefinite integral is irreducible. But since I am not very familiar with differential Galois theory, I do hot know how to tell my student?  Can anyone help me?


Why is there a 6 character requirement when reviewing questions?

Possible Duplicate:          I was reviewing a question on stackoverflow today.  According to the yellow box on the right side of the window I am encouraged to correct minor grammatical or spelling errors.  So I attempted to do this and was unable to save it.  In this case the OP mispelled maybe.  Why is this restriction in place?  Seems kinda silly to me.


How does iOS know if a web site is restricted?

I don't add these web sites to the restricted list. Is the iPhone sending every page I visit to Apple? Random surfing will encounter a random  restricted site. In this case it renders this app broken because the 'allow' link doesn't work. Setting is currently set to limit adult content which allows me to use a white list and blacklist. I never added this site to blacklist. I only blacklist 3 sites.     How does iOS know that a website is restricted? Does it send it every page I visit to Apple?   How does iOS know if a website is restricted? Does it send it every page I visit to Apple?   See this is the BS I'm talking about:    iOS 10.1.1


Why two different ways to create instance of Inner classes?

Now that I was looking into static inner class, I found that the way of object creation of static inner class and non-static inner class is different. But I don't understand why.  For non-static inner class:  Outer.Inner inner = new Outer().new Inner();   For static inner class:  Outer.Inner inner = new Outer.Inner();


I have a loop where I display all posts on the site, the problem is that the_excerpt is not being displayed. What am I doing wrong?    <?php      $all_posts = get_posts(array('numberposts' => -1));     $total_posts = count($all_posts);     $posts_per_column = intval($total_posts / 3);     $count = 0;     $col = 1;     foreach($all_posts as $post):   ?>       <div class='post' id='article<?php echo $count; ?>'>
        <a href='<?php the_permalink() ?>'>              <?php the_post_thumbnail() ?>       <?php          $cat = get_the_category();          $cat_long = $cat[0]->cat_name;         $cat_split = explode(' ', $cat_long);          $cat_short = strtolower($cat_split[0]);       ?>              <span class='tag <?php echo $cat_short ?>'><?php echo $cat_long ?>
      <div class='inner <?php echo $cat_short ?>'>
<a href='<?php the_permalink() ?>'><?php the_title() ?>

       <?php the_excerpt() ?>


Dual power supply from a single AC adaptor

I designed a microphone preamplifier based on a single op-amp. It works perfectly using two 6-volt batteries.  However, I need to power it directly from AC.  I found a 9 V AC rated wall-wart, but it is not center tapped so I need to find another way of making dual-voltage supply. How do I do that?


How do I get the list of exit codes (and/or return codes) and meaning for a command/utility?

Is there a way I can do what stated in the title from the terminal commands, or will I have to look into the codes?


Can't able to connect Android things Respberry pi 3 to Wifi gives Error: No intent supplied

I successfully connected to Raspberry pi3 (android things preview image) via following command   adb connect <ip-address>  but after to connect Wifi  using following command :   adb shell am startservice \     -n com.google.wifisetup/.WifiSetupService \     -a WifiSetupService.Connect \     -e ssid dsid \     -e passphrase am@sin305   it gives following error msg :   Error: No intent supplied   Problem solved already : By following changes  (Don't comment now) - Tip : remove all backslash from above command.  now it's connected to Wifi successfully.


Connect to Wireless Network without existing profile through NetSH

I'm currently coding a network app based on NetSH. Is there a way to connect to a wlan network without having to create a wlan xml profile?  Sorry if the question is unclear or doesn't belong here... Thanks.


Is there a way to tell if a pumpkin is going to be good for cooking?

It's the season for pumpkins and I was wondering if there is a way to tell if a pumpkin was going to taste good enough to cook with. I guess this is a similar situation as with a watermelon - you can't really cut it open to check if it will taste good.


This is meant to be a generic question of the type that we get repeatedly on this site, in different versions:        Why do universal constants have the values they do? Can we predict their values theoretically? Do they change over time? How would the world be different if a particular constant had a different value?


Automatic beamer presentation with one slide generated for each image in a directory?

I would like a simple script to "scrape" every image in a directory into a single beamer presentation as follows:  $ ls   %img1.jpg  %img2.jpg  %img3.jpg   $ *run script*   %OUTPUT SOMETHING LIKE THIS:  \documentclass{beamer}  % for themes, etc. \mode<presentation> { \usetheme{boxes} }  \usepackage{times}  % fonts are up to you \usepackage{graphicx}  \section{Images in this Directory}  \begin{frame} \frametitle{img1.jpg} \begin{center}         \includegraphics[width=4in]{img1.jpg} \end{center} \end{frame}  \begin{frame} \frametitle{img2.jpg} \begin{center}         \includegraphics[width=4in]{img2.jpg} \end{center} \end{frame}   \begin{frame} \frametitle{img3.jpg} \begin{center}         \includegraphics[width=4in]{img3.jpg} \end{center} \end{frame}  \end{document}


Theoretical implications of multidimensional Time

While the idea of extra spatial dimensions has been around for quite a while now, is there a possibility or any theory which proposes extra time dimensions?  If so, what could be theoretical implications of multidimensional time on existing theories like relativity or QM?  Would they work just fine?


I was reading the other questions about how flags now convert to close votes since I just breached 3k rep, and I was wondering -- does this mean I am no longer eligible to obtain the Marshall Badge (500 flags)? I'm at 142 right now and I'm kind of bummed out to hear that I might not be able to get the badge anymore.


Is lookaround always executed after the character expansion in Regex?

I've tried this  Regex:  ^(?:(?![_]{2}).)+$   Text:  abcc..abc  abcdefgh_  abcd_abcd  abc_a_abc  abc__abcd  a__abcde_  abc++abcd  where highlight texts mean match.  The regex above is literally mean "match any line that constructed from any characters except __", I just wonder about evaluation process of this regex, in my understanding the process suppose to work like this  Consider text: abc__abcd  Evaluation process:   check condition ^ (match). check condition .+ (match). check condition $ (match).   So far, all regex still can match to our considered text.   check condition of negative lookahead.   (?![_]{2})a(?![_]{2})b(?![_]{2})c(?![_]{2})_(?![_]{2})_(?![_]{2})a(?![_]{2})b(?![_]{2})c(?![_]{2})d  negative lookahead executing:  (?![_]{2}) ab (match) (?![_]{2}) bc (match) ... (?![_]{2})__ (not match) ...   Is my understanding correct?


How to create a simple map using JavaScript/JQuery

How can you create the JavaScript/JQuery equivalent of this Java code:  Map map = new HashMap(); //Doesn't not have to be a hash map, any key/value map is fine map.put(myKey1, myObj1); map.put(myKey2, myObj2); //Repeat n times  function Object get(k) {     return map.get(k); }


Weird URL in the search console reports with domain name appended to the end

We have been fixing some issues according to the Google Search Console reports. However we have come across an issue that we don't know where to look for fixing. As you can see in the image, google crawls pages with a URL in the end that has never been created. The URL is not our domain but it is one of our client's we used to track their web banner with GA. We removed that banner very long time ago along with the google tracking code. (We use WordPress and track banners with a HTML code added in the widgets.)  If you guys have something in mind about the issue, please let me know. I have checked the sitemap and there's also no such URLs.


Geometry problem prove $\angle{ADB}=3\angle{BAC}$

Acute $\triangle{ABC}$, point $D$ is on side $AC$ so that $AD=BC$, $CF$ bisects $\angle{ACB}$. Point $E$ on side $AB$ so that $DE \parallel CF$ and $AE=CD$. Prove: $\angle{ADB}=3\angle{BAC}$


Index of multiplicative group in field extension

Let $k\subset K$ a field extension. Assume that $K$ is infinite. Then the index of $k^∗$ in $K^∗$, $[K^∗:k^∗]$  (as groups) cannot be finite. How can I prove this?  If $k$ is finite then I know how to solve this since, if $\mid k\mid=q$ then , if we assume that $[K^∗:k^∗]= n$ is not finite, we have that $K$ can be partitioned into $n$ disjoint sets with $q$ elements. So $\mid K\mid =nq$  not finite, therefore contradiction.  I dont know how to prove it for k is infinite as well.


Request: link to see bounty events ("revisions") even if question has not been edited

The times when a bounty is placed and when it is awarded are apparently .  However, for questions like  which have not been edited, the information is not visible from the question page (although you can access it by ). Can we get a link to the "revision history" even when there are no edits, or some other way to see the bounty info without manually typing in the /posts/[id]/revisions URL? It's strange to show the timing of bounty events only when the edit history is non-empty.


Why did C-3PO close down while Luke talked to Ben in A New Hope?

When they were in Old Ben's dwelling, C-3PO made this strange request to Luke:     THREEPIO: Sir, if you'll not be needing me, I'll close down for awhile.   LUKE: Sure, go ahead.   Why did he want to do that?


Let $n$ be a natural number. we need to proove that: $$\forall{1\leq k\leq\tfrac{n}2}, \text{we have } {n \choose k-1} < {n \choose k} $$ I tried to do the following with induction: We set $n$ as a constant and doing induction on $k$: if $ k=1 $: ${n \choose 1} > {n \choose 0}$ and it can be shown by writing the exlpicit ration of the ${i\choose j} sign $ . Assuming that for every $k$ as it was set, the equation above is right, we will try to proove with induction that for $k+1$ we get: $$\forall{1\leq k+1\leq\tfrac{n}{2}}, \text{we have}{n\choose k} < {n \choose k+1}$$ But at this point, I am stuck, because I can't see how can I apply the induction assumption. I also tried to use pascal identity but I can't see how it fits in.


Does relativistic speed increase gravitational attraction?

If something is moving past me at a relativistic speed, does its gravitational force on me increase as its speed increases? That is, not as if its speed is changing, but if multiple of the same (rest) mass go past me in the same path, is the gravitational attraction at the closest point the same for each, or is it higher the faster it's moving?  As some background, I was recently surprised to see that I should discard the idea of "relativistic mass", so I've been trying to work on that. Please forgive me mixing Newtonian physics with relativity, but I'm trying to get a high level understanding before going into the math too much. I understand now that instead of $F=m_{relativistic}a$ I should use $F=\frac{d}{dt}(\gamma m_0v)$, but what about $F=\frac{Gm_1m_2}{r^2}$? Is that still roughly as it is, or do I need to throw a factor of $\gamma$ in there, or something else entirely?  Yes, I know this is talking about acceleration and so it doesn't really fit into special relativity, and lots of other disclaimers, but I'm hoping for a simple answer to get a general understanding.


How to get days between two different dates in react js inside map function?

How to find the difference between the return date and departure date in ReactJs jsx map loop.   JSON response:   {     departureDate: '2020-07-28',      returnDate: '2020-09-16',  }   Component   const DaysDiff = () => {             const days = 1000 * 60 * 60 * 24;        return(          Object.keys(datajson).map((key,index): ReactElement => (                  <h2>{((datajson[key].returnDate) - (datajson[key].departureDate)) / days) } </h2>     )       )      }


I would like to hear the best arguments for and against the  of QM.


I was able to solve $ \ln x = - x $ using Lambert's function.  I was wondering how does one solve $ \ln x = x$   Does the solution even exist for this equation?


Let $L$ and $K$ number fields, if $p$ is ramified in $LK$ then it's ramified at $L$ or $K$?


what is the difference between node and nodejs version being shown in my terminal ubuntu 17

When I type node -v result: v.10.8.0, npm -v result: v 6.2.0. and finally nodejs -v result: v.6.14.2. I read in other forum saying that node and nodejs are same. If it's true, did I installed two different version of node? Is there really a difference between nodejs and node or both are same.


Is it possible to learn a neural network to predict always zero?

I saw a paper where they learn L based on the following cost function: $$D_1L(q(k-1), q(k)) + D_2L(q(k),q(k+1)) = 0$$ Here $D$ is the derivative with respect to ith argument of L. So the target is always zero independently of the input of L but how does the optimization method knows the real values of L for a given input? I mean as long as the cost function is satisfied with a zero value the model is learning but it can be learning wrong values for L. For instance, if the real value of $D_1L(q(k-1), q(k))$ is 10 then the real value of $D_2L(q(k),q(k+1))$ has to be -10. However the neural network may be learning wrong values for L as long as they are symmetric, for example -2 and 2. Am I missing something or the method in that paper simply doesn't make any sense? Is it possible to learn a neural network in regression task with constant target?


Combinations, when placing n objects into k boxes, each box has its own size and the order in them doesn't matter?

I have n objects and k boxes, each box has its own size.  The arrangement of objects in a box doesn't matter. How many combinations are there, respectively the formula?  Say we have 7 objects and 3 boxes with sizes of 2, 3 and 4. The solution is 6, the same result appears (it has to appear) when we place the gaps [(2+3+4)-7=2]  The multinomial coefficient only considers (I think so) the case when a box has to contain a specific number of objects, so the result is wrong:  $$ \frac{7!}{2!\cdot 3!\cdot 4!} = 17.5 \not= \frac{2!}{2!\cdot 3!\cdot 4!} = \frac{1}{144} $$ But what's the correct formula?


Evaluating $\sum_{n=0}^{\infty}{\sin^{3}\left(3^{n}\right) \over 3^{n}}$

How do I find the sum of this series?   $$\sum_{n=0}^{\infty}{\sin^{3}\left(3^{n}\right) \over 3^{n}}$$   Hints in the right direction would be appreciated.


Why does sizeof return a value that is not the real size of the struct

I have the following struct   struct vertice_t{     char city;     char connectedBy;     unsigned short airportCost;     unsigned short primKey;     int queueIndex;     struct adjacency_list_t * adjacencyList; };  struct adjacency_list_t{     struct adjacency_list_node_t *  first;     struct adjacency_list_node_t *  last; };  struct adjacency_list_node_t{     unsigned short weight;     struct vertice_t *  vertice;     struct adjacency_list_node_t * next; };   When I do sizeof(struct vertice_t) I get the value 24. But I can see by myself that this struct only takes 1 + 1 + 2 + 2 + 4 + 8 = 18Bytes  Why does this happen? Is there anyway I could compress the data in the struct above to make it smaller? This is for a project and I need to reduce the whole memory usage by 30%.  Thanks!


Can't always access value of instance variable without @ even with attr_accessor

How come I get the error NoMethodError: undefined method '+' for nil:NilClass but the line with puts test prints out a 1 so we know that the value is initialized?  class TestClass   attr_accessor :test   def initialize()     @test = 1   end    def testFn     puts test     test = test + 1   end end  t = TestClass.new t.testFn   It also works if I change test to @test but I thought I didn't have to if I had attr_accessor :test


Can anyone help me find a story about an alien who comes to earth and lives with a family and then in the end takes that family to his homeplanet?

I remember some of the story, that the alien travels through space and arrives in a particular place on earth through a door. He has telepathic and mind reading powers and he starts living with a family when they find him in the forest. Everything is going smooth until the people start to get scared of this alien boy and they are going to try to kill him. So he escapes earth along with the family who took care of him. I do not remember the name of this book or the author. Can someone help me find this book?


Remove "You may only submit a comment vote every 5 seconds" for high rep users

Often times there are multiple good comments on a question and you want to upvote them all. However, you can only do one every 5 seconds. I presume this is to prevent spam (especially from bots). However, based on how the rest of the site works, restrictions such as these are suppose to go away as the user gains more rep and becomes more trusted. So why not just have a point where the site says 'you are trusted enough to not upvote spam, so upvote as fast as you want`, though still have the limit of 30 per day?  Edit: Yeah, chaning the coment system to x every y seconds is an alternative answer, but Im something different - removal entirely based on rep. I think it would work better.


I dont want to enable auto login for various reasons. Is it possible to login to the desktop, from an ssh session, in order to then VNC into the desktop ? The issue is that I remotely turn on/off my pc remotely and on occassion I would like to gain access to the desktop.


I'm trying to have a sorted map Map<Integer,Set<Integer>> which keeps elements sorted based on the size() of the value set.  In practice this is a map of a node to the other nodes connected to that node. I want to quickly (O(logn)) access the node with the most edges without having to sort every time.  For example the order should be:  3 => {1,2,4,5} 12 => {1,2,3} 14 => {3,2,3} 65 => {3,8} 6 => {2} 2 => {5}   Since TreeMap won't do it since I can't sort based on values, I probably need to roll something custom.  EDIT: The size of the Set may indeed change which may over-complicate things even more  What would be the simplest way to achieve this?


"never did before" vs. "has never done before"

What is the difference between these two phrases:  something he never did before  something he has never done before


How to reduce PREEMPTIVE_OS_AUTHENTICATIONOPS wait type stats in SQL Server, any advice on it would be greatly appreciated. Thanks


Could the One Ring be destroyed in any manner besides Mount Doom?

Was there something more mystical about Mount Doom that meant another volcano wouldn't work and no matter how much energy was put into it, it would not be destroyed?  A comment mentioned that not even Ancalagon the Black, the greatest dragon, could not have done it; but how about a Balrog? What about another Maia or a Vala? Could a sufficiently advanced technology destroy it? Given that middle earth was becoming more industrialized wasn't it only a matter of time until a furnace or other artificial heat source that was hot enough was created?  If some catastrophe destroyed Middle Earth entirely would the ring be unmade, or would Eru have to do it himself?


Why are pixels not the same from Photoshop to Illustrator?

I'm so confused! I'm sure I'm missing something very simple. But when I create a new file in Photoshop that 320x240px at 300ppi then save that out as a JPEG and try to place onto an Illustrator artboard that is also set up at 320x240px at 300ppi the image I'm placing is half the size. Aren't they supposed to be the same size? What am I missing?


I have already checked out , but that didn't answer my query. I already know that from the De-Broglie wavelength equation we can say, $$p = \frac{h}{\lambda}$$ where $p$ is the momentum of the photon. But as a high school student I know that momentum is defined as $$\vec{p} = m\vec{v}$$ but photons aren't like normal particles, right ? Their rest mass is zero and they behave as both wave and particle (aka wave-particle duality). So, how can one define the momentum for massless objects ? PS : I had also checked :  but that didn't fully answer my query.


Constructing N-dimensional vectors out of point distances

I was wondering if anyone had any insight or information on how one might go about determining point coordinates in an n-dimensional space from point pair distances.  For example, say I start with a table of pairwise Euclidean distances between points for 10 points $\{a, \ldots, j\}$.  This would have a distance for each distinct pair of points, a through j, so 45 separate distances.  I want to be able to produce an n-dimensional vector for each point so that the Euclidean distance between each of the points matches the point pair distances from my original table.  Any insight on the subject would be much appreciated.


How can I delete this apparently undeletable/invincible 0 byte desktop icon in Windows 7?

I’m running Windows 7 and I have an icon on my desktop called _USAJ-PRDDSFS1_Candidate_6334_13727_7FF2294F-9C5D-462F-818D-B3903872BAF8.doc   When I try to remove it I get the message:     Could not find this item. Verfy the items location and try again.   This thing has been pestering me since 2012 and will not go away. Can help me out?


Are older copies of current standard-legal reprints playable again?

As far as I know, standard format allows cards released within the last two year before the release of the current edition e.g. for now, Rivals Of Ixalan.  During the Ixalan edition, there was a new Duel Deck edition (Merfolk, Goblins) containing re-prints of much older cards. Are they legal in standard format although they were firstly released more than two years ago from now on?


merge two JavaScript objects with priority

I have two JavaScript objects like  let master = {A:0, B:2}; let slave = {B:1, C:1};   I need:  result == {A:0, B:2, C:1};   Does JS have a simple command to merge in that way?


How do I turn off the little CTRL-SHIFT bubble that pops up on Windows 7 around my cursor?

I have a Wacom Bamboo pen tablet. When I press CTRL, SHIFT, or ALT, a little yellow bubble pops up near my cursor. This interfers with screenshots etc.  Wacom has informed me that this is not a feature of the pen software but of Windows 7. Does anyone know how I can turn this off? Addendum I'm adding these notes here as a quick run down for when I have to configure my Wacom Bamboo pen on a new operating system:  to remove the click animations and little bubbles described above, do as Simon described below: type "gpedit.msc" in the command line window, navigate to User Configuration > Administrative Templates > Windows Components > Tablet PC > Cursor, then click "Turn off pen feedback" and ENABLE it.  to remove the "press and hold circle animation", open "Table PC Settings", click on "Go to Pen and Touch", click on "Press and Hold" and then on the "Settings" button, uncheck "Enable press and hold for right-clicking" NOTE: Revisiting this in 2020, what worked is what Crobemeister and molee suggest below: Windows Icon > Wacom Preferences > Tablet Mode >  Correspondance... (French), then unclick "Use Windows Ink" (French: "Utiliser entrée manuscrite Windows")  to change buttons, open "Pen Tablet Properties", change front button to "double click", close window (there is no OK button here)  to prevent that yellow handwriting window from appearing on the screen, I forgot how I turned that off, will record it next time, just click around in the settings either in "Table PC Settings" or "Pen Tablet Properties", there is a checkbox for it somewhere, good luck.


C# simple multithreading - why is it not producing the correct results?

can someone tell me why the below is not producing the correct results? It is giving me 1233 when I expected 0123.       public static readonly object locker = new object();     public static List<int> queue = new List<int>();      public static void calculate(int input)     {         Thread.Sleep(1000);         lock (locker)         {             queue.Add(input);         }     }      [TestMethod]     public void TestT()     {         int[] _intList = new int[] { 0, 1, 2, 3 };         List<Thread> _threadList = new List<Thread>();         foreach (int num in _intList)         {             Thread t = new Thread(() => calculate(num));             t.Start();             _threadList.Add(t);         }          foreach (Thread t in _threadList) { t.Join(); }          foreach (var t in queue)         {             Console.WriteLine(t);         }     }   When I change it to use a copy of the _intList variable instead, I get the correct results of 0123. Can someone tell me why this is happening? Is it being cached somewhere?          foreach (int num in _intList)         {             int testNum = num;             Thread t = new Thread(() => calculate(testNum));             t.Start();             _threadList.Add(t);         }


Help understanding SQL Server Developer License when users test via webserver

I'm trying to understand how many licenses I may need if we decide to pursue a SQL Server Developer license for our Testing environment.  We would have 5 actual developer and DBA's physically accessing the database to perform work.  The part where I get confused is our users will be testing our applications from a web server. This webserver will communicate with a 'logic' server that will perform all the database interaction.  At our highest level of testing we probably have 20 users on the system, but depending on the time of year they may be different users.  Example: During fiscal year end we may have 20 people from account on the system, but during benefit enrollment time of year we may have 20 HR/Payroll users testing on the system.  In reading different sets of documentation and speaking to our license reseller I still do not have a clear idea of how many licenses I need.    I think I can purchase 5 for the actual developers/DBA's and one license for each SQL accounts the services uses?  This is the how we are structured currently.  The servers have SQL Server accounts for authentication.


Lower bound for monochromatic triangles in $K_n$

Say $K_n$ is a complete graph of $n$ nodes, and every edge is either blue or red. I'm trying to find $T_n$, which is the lower bound for the number of monochromatic triangles in $K_n$ (monochromatic meaning triangles whose 3 edges are of the same color).  I'm trying this approaches:   A. Let $v_i$ a vertex in $K_n$. This vertex belongs to $\binom{n-1}{2} $ different triangles. Let $r$ be the number of red edges that $v_i$ belongs $b$ the number of blue edges. Of course,  $$r + b = n-1$$ So, the number of non-monochromatic (dual/stereo-chromatic?) triangles is $r \cdot b$, and so our bound would be (for vertex $V_i$)   $$T_n \le \binom{n-1}{2} - r \cdot b$$  Question is - how do I know when $r \cdot b$ is the maximal possible number? Also, this would give me the upper bound, how do I find the lower bound?  Thanks in advance!


My image won't render. Every time i go to render, all I got is a grey screen

I have tried many methods and none of them worked! I tried blender render and cycles render, checked that everything was able to render, and i even tried re-doing the project all over! Anyone have anyway i can fix this? Ill add the blend file.    (File was to big for other options, so mediafire I guess)


Where is centre of gravity on a Dyson Sphere?

Suppose there is a  earth thick, on the inner surface would the gravity be pointing outwards of centre of sphere with same strength as Earth's gravity?


I got a DSLR camera a while ago, and I took a photography course, but I really haven't learned much about how to take great photographs. I know about shutter speed, aperture, manual mode, ISO, and other vocabulary, but I don't know where to start for applying it. Any tips or lessons for someone who's not a complete beginner, but definitely not advanced?


Can a normal subgroup of a finite nonabelian group be nonabelian?

We know that if a group is Abelian, then all its subgroups are normal. Also, if a group is nonabelian, it can contain a subgroup which is Abelian. Eg: The Dihedral group of order 2n, $D_{2n}$ is nonabelian for $n\geq 3$ but has $C_n$ sitting inside it. Now, my question is: "If a finite group is nonabelian, can it have a normal subgroup which is nonabelian?" In other words, can a normal subgroup of a nonabelian finite group be nonabelian? Thanks.


So from my understanding of final you can't change the value of variable after. In the case of a private final foo HashSet<>() = new HashSet<>() I can use foo as a HashSet and edit the values in it but I can't reassign foo right?


Can't type the password while logging in the Non-Graphical interface (Ctrl+Alt+F3)

I have managed to log before, but now its different. I can type the Login normally and press enter. It asks for the password. But what I type is not displayed on the screen. I have to press enter, what moves it one line down, to start typing the password. Because of that, the password is seem as "incorrect". If I dont press enter it just wont display my password on the screen.   PS: Even trying to type it on "invisible" wont let me in.   PS2: I can log in the Graphical interface without a single digit problem.  What might be causing the problem?


Baking multiple materials into one texture

If there are multiple objects with different materials that have been combined into one object, UV unwrapped together and texture baked, the result is glitchy at best. Here is my process:   I start out with everything as a single material with a single UV map and multiple materials. There are three separate pieces in the combined mesh:      I create a new material, a new 4096x4096 image, and a new UV map (through smart projection) that doesn't overlap. I select the image, the new material, the new UV map. Every piece of magic I can think of since I don't know exactly how the bake knows what to bake where:      I click bake, with the sample size set to 256. Nothing is baked to the image I created and selected:      Some stuff baked, but not all of it, and what little was baked was baked to two new images it created:     I don't know what's going on here.


I deleted GarageBand by dragging the app to the trash, but in the system information it says it is still taking up over 20gb, where are these files located?


is cheese safe to eat when the refrigerator was 57 degrees

soft and hard cheeses were left overnight in the refrigerator with the door was a bit open and the temperature was at 57degrees in the morning . Is the cheese safe to eat?


Show that   $$\lim_{n \to \infty} \sum_{k=0}^{2n} \frac{k}{k^2+n^2} = \frac{1}{2}\, \log 5$$  How would you prove this? I understand limits, but summations not so much.  Would I need to take the derivative of the summation first, then evaluate the limit of that?


How do I delete var/log files in Ubuntu 16.04 (Xenial Xerus)?

I want to delete var/log files due to low disk space, but I cannot find out how.


How do I unlock the secret room in Dungeon Defenders

I beat all of the levels in Dungeon Defenders on mixed difficulties and the room upstairs isn't open, what do I need to do to open it?


Error when trying install Ruby with RVM on Ubuntu 17.10

I installed RVM in my Ubuntu 17.10 but when I try to install Ruby I have this error:  $ rvm install 2.5.0 Searching for binary rubies, this might take some time. No binary rubies available for: ubuntu/17.10/x86_64/ruby-2.5.0. Continuing with compilation. Please read 'rvm help mount' to get more    information on binary rubies. Checking requirements for ubuntu. Installing requirements for ubuntu. Updating systemjacques password required for 'apt-get --quiet --yes update': .-| ... Installing required packages: libreadline6-dev.... Error running 'requirements_debian_libs_install libreadline6-dev', please read /home/jacques/.rvm/log/1514981551_ruby-2.5.0/package_install_libreadline6-dev.log Requirements installation failed with status: 100.   If I try to install libreadline6-dev with apt-get I receive this error:  The following packages have mismatched dependencies:   libreadline6-dev: Depends: libreadline6 (= 6.2-9ubuntu1) but 6.3-8ubuntu8 is to be installed


How to use window menu accelerators/mnemonics in Ubuntu 18.04 LTS?

On Ubuntu 16.04 LTS I have used simple keyboard shortcut to set property Always on Top (Nautilus window as example):   Alt+Space,    t After next Alt+Space or right mouse click I see that window was set to Always on Top.     In standard Ubuntu 18.04 LTS with GNOME Shell I can press Alt+Space:    but it does not react to t.  Seems to be a real .    How to enable such menu accelerators/mnemonics in standard Ubuntu 18.04 LTS?


Prove that if $\sum |a_n|$ converges, then $\sum a_n^2$  also converges.  Attempt:  $\sum |a_n|$ converges $\implies \sum |a_n|<M$.  If $\sum |a_n|$ converges, then $\sum a_n $  also converges.  Could anyone please tell me on how to proceed ahead with regard to this problem.  Thank you very much for your help


Entry to Germany with Swiss national visa, staying for a week

As far as I know, it is possible to freely travel inside the Schengen zone with visa D of some EU country, using 90/180 rule (up to 90 days in 180 days). However, I have the following question: I have a study Swiss National visa, and would like to shortly visit my relative in Germany before start of my studies. However, I am worried about two things (in which this case differ from ones, which I found to be already discussed here):   Although Switzerland is included in Schengen, it is not part of EU, so I am not completely sure if the same rules applied to Swiss National visa. Usually people enter other EU countries after they entered country which issued visa, and have registered there. So would it be a problem to enter Schengen via Germany, stay there for a week, and then from there go to Switzerland? Instructions from swiss embassy say "It allows you to travel to Switzerland; transiting other Schengen States is possible", from which it is clear that I can enter through Germany, but not clear, whether I can stay there for a week. I am worried, that at German border I can be asked to show my tickets to Switzerland, and the fact that the flight would be in a week from my entrance to Germany, could be a problem.   I would appreciate advise, if anybody had some similar issue before.


Why is this accepted answer not listed at the top?

Answer in question:   I have the answers sorted by votes, but strangely the answer marked as accepted is listed last. The top answer is the one with most votes:    I've never seen that happen before. Is it because the answer was posted by the asker, or is it a bug?


I am reading about free will and it seems to me that for everyone free will is associated with consciousness and this is why the Libet experiment has been so important in this debate.  I do not understand why we could have free will only if it is our consciousness that acts freely and not just our brain (listen for example  and ).


What happens when you update a column which should not be updated? Are rows updated completely?

Let's start with the bottom-line question. Say I have an UPDATE statement as following:  UPDATE my_table SET    my_column = <some new value>,        my_other_column = my_other_column   Is there a performance penalty for the unnecessary my_other_column = my_other_column assignment?    Now, to the real scenario. In my case, I have a function update(a, b) as following:  create function update(integer, integer) returns void as $$     UPDATE my_table     SET    a = case when $1 is not null then $1 else a end,            b = case when $2 is not null then $2 else b end $$ language sql volatile;   I am wondering what happens when I call select update(150, null). This resolves to:  UPDATE my_table SET    a = 150,        b = b   Is there a performance hit for that redundant b = b assignment? Are we now re-writing the b column, instead of only the a column if we were to remove that assignment from the UPDATE statement? Or are rows always written as a whole anyway, regardless of the actual updated columns? Or maybe, is the planner or executor smart enough to filter such redundant assignments out?


How can draw this picture in latex Tikz?

This is my flow chart. I need this picture to draw in Tikz


I'm using Blender 2.92, and Cycles Render, and it rendered how it should, however after adding a fluid simulation, whenever I try to render an image, by pressing F12, it just produces a black screen, as seen below, however I can see my model rendered normaly as seen in the bottom picture, I have already tried changing the post-processing composition and sequencer options, I have also made sure to disable composition nodes and made sure that my nodes output what they should, and the camera is looking the way it should, I'm quite new so this is probably an easy fix that I missed; here are some things that may be important:  I'm only able to use my CPU for rendering currently. My operating system is linux Arch.    Here is my blend file and everything it uses:


How to create a table with numbered equations?

I am trying to recreate a table with equations (numbered) in them but for some reason I cannot get it to work. I tried to used custom equation numbers where I added equation numbers manually, I tried with align (which seems to be the most promising) and some other methods that didn't work. I've made an example in Word how I want it to look like:    And this is currently how I recreated it in LateX    However, the problem is that the equations are not aligned and that the whole table is wider than the textwidth even though I set the columns that together they are equal to the textwidth p{0.15\textwidth}|p{0.85\textwidth}. The reason I use a parbox is that it allows me to use numbered equations in a table which is a solution I also found on this forum.  This is the code I used for the table.  \documentclass{report} \usepackage{a4wide} \usepackage{amsmath} \usepackage{booktabs} \usepackage{lipsum}  \begin{document}  \chapter{Chapter 1}  \lipsum[5]  \begin{table}[htb]     \caption{Test table}     \begin{tabular}{p{0.15\textwidth}|p{0.85\textwidth}}         \toprule         Molar gas flow & \parbox{0.85\textwidth}{\begin{align}         \frac{\mathrm{d} \mathrm{F}_{\mathrm{k}}}{\mathrm{d} \mathrm{V}_{\mathrm{R}}} &=\mathrm{S}_{\mathrm{k}, \mathrm{r}} \pm \mathrm{S}_{\mathrm{k}, \mathrm{be}} \end{align}} \\         Molar solid flow & \parbox{0.85\textwidth}{\begin{align}         \frac{\mathrm{d} \mathrm{F}_{\mathrm{m}}}{\mathrm{d} \mathrm{V}_{\mathrm{R}}} &=\mathrm{S}_{\mathrm{m}, \mathrm{r}} \pm \mathrm{S}_{\mathrm{m}, \mathrm{we}} \end{align}} \\         Energy balance & \parbox{0.85\textwidth}{\begin{align}         \frac{\mathrm{d} \mathrm{U}_{\mathrm{R}}}{\mathrm{d} \mathrm{V}_{\mathrm{R}}} &=\frac{\mathrm{d}}{\mathrm{d} \mathrm{V}_{\mathrm{R}}}\left[\mathrm{T}_{\mathrm{R}} \sum \mathrm{C}_{\mathrm{p}, \mathrm{k}} \mathrm{F}_{\mathrm{k}}+\sum \mathrm{C}_{\mathrm{p}, \mathrm{m}} \mathrm{F}_{\mathrm{m}}\right]=\mathrm{S}_{\mathrm{h}, \mathrm{R}}+\mathrm{S}_{\mathrm{h}, \mathrm{ext}} \end{align}} \\         Pressure balance & \parbox{0.85\textwidth}{\begin{align}         \frac{\mathrm{d} \mathrm{p}_{\mathrm{R}}}{\mathrm{d} \mathrm{V}_{\mathrm{R}}} &=\frac{\nabla \mathrm{p}_{\mathrm{R}}}{\mathrm{A}_{\mathrm{R}}} \end{align}} \\         \bottomrule     \end{tabular} \end{table}  \end{document}   I don't mind too much that the unit column is missing as long as my equation are numbered as I want to refer to them in my text.  Basically my questions comes down to: How can I recreate the first table in LaTeX with equation numbers?


How many actual developers work on the Linux kernel?

For a study I am doing I was asked how many actual developers commit on a typical kernel version.  I know there is Linus Torvalds as the main developer, followed by many second main developers. Several of which work in companies. But here comes my doubts:   Does a commit to the kernel from a company mean that many devs from that company worked to make that commit possible or was it just one man (The one that did the commit). Are there 3rd party groups that help companies or main devs? What could be the estimate of the total number of people involved in a particular version of the Kernel. Not only the total number of companies but the actual amount of people that contributed one way or another to the kernel.


Creating point at midpoint of polyline with ArcPy?

I have a polyline shapefile (that contains multiple lines) and am trying to create a point at the midpoint of each line using Python. I am currently using the ET Geowizards tool 'PolylineToPoints' which does exactly what I want it to... but I am trying to avoid using ET Geowizards (as it is causing other issues).  Is there a way to do this in Python using Arc tools and functions?


UK visa start date and Flight Depature Time

So I’ve got a UK Visa with a start date of the 30th of April and I’ve booked a Flight which departs 23:55 on the 29th of April. That’s 5 minutes before my visa becomes active.  Will this pose a problem for me? I have to absolutely be in Manchester by 1st of May for an important meeting.  The flight is Turkish airlines Abuja to Manchester, so there’s a layover in Istanbul.


Showing that the event: $X$ is continuous on $[0,t_0)$ belongs to the given filtration.

Let $( \Omega, F, P)$ be a probability space.  Let $X$ be a stochastic process defined on such probability space whose sample paths are RCLL (right continuous on $[0, \infty)$ with finite left hand limits on $(0, \infty)$. Let $A$ be the event that $X$ is continuous on $[0,t_0)$.   I am tasked in showing that $A \in F^X_{t_0}$, where $F^X_{t_0}:= \sigma(X_s ; 0 \le s \le t) = \{ \{ X_s \in B \}\subset \Omega : B \in \mathcal{B}(\Bbb{R}),  0 \le s \le t  \}$   Some may recognize this exercise as one of the first from Brownian Motion and Stochastic Calculus by Karatzas and Shreve, I am in fact trying to self study this book through august.  My problem here is that I can't figure out exactly what $A$ represents, I know that for a fixed $w \in \Omega$ I have that  $X_s(w)$ is RCLL but I can't figure out how to start.


What files should i put in a logo pack to give to clients? Should I put small, medium and large version of my logo as well as the vector file.