What exact dimensions does a physical cone AoE template need to have?

I am trying to get a precise set of measurements for cone-shaped areas of effect so that I can craft a physical template to use as an overlay when playing with miniatures. I want to get it right the first time.  The problem is that the rules for the shape of a cone AoE aren't very precise, and when you start looking at them closely, there are a bunch of inconsistencies. These are “good enough” when playing without a grid, or when , but they are causing me difficulties with crafting an accurate physical template.  There are three incompatible interpretations of the maximum length of a cone (PHB, p. 204; emphasis mine):     A cone's area of effect specifies its maximum length.   … which each lead to slightly different template constructions (using a 30' length as the working example):   You can use the maximum length as the centreline of an isosceles triangle.  This would give a template that has a centreline 30' long, but edges beyond the “maximum” length that are ~33.5' long. The end of the area of effect would be a flat plane. This shape would encourage players to aim off-centre to use the “bonus” length offered by the edges. You can use the maximum length as the edges of an isosceles triangle.  This would give a template with no portion farther than the maximum away, but with a centreline length that is only ~27.8'. The end of the area of effect would be a flat plane. This shape would motivate players to do off-centre aiming in order to get full use of the maximum-length edges of the template.  You can use the maximum length as a radius of a conical section of a sphere (a ).  This would result in a template with a rounded end, with all points on that arc exactly the maximum length away from the point of origin.   Which of these interpretations of the definition of a cone's area of effect is the correct one to base my template design and construction on?


How can I catch multiple Exceptions in my code? Like I have the following code for Delete operation, I want to catch Exception for REFERENCE constraint and for SqlConnection Exception.  public void DeleteProduct(Product p) {     try     {         using (IDbCommand cmd = dbConnection.CreateCommand())         {             cmd.CommandType = CommandType.StoredProcedure;             cmd.CommandText = SpDeleteProduct;             dbConnection.Open();             cmd.ExecuteNonQuery();         }     }     catch (Exception ex)     {         System.ServiceModel.Web.WebOperationContext.Current.OutgoingResponse.StatusCode = System.Net.HttpStatusCode.OK;         throw new FaultException(new FaultReason(new FaultReasonText(ex.Message)));     }   }    Then in my client code I want to check the type of Exception thrown so I can show a personalized message to the user:  void DeleteProductCompleted(object sender, AsyncCompletedEventArgs e) {     if (e.Error != null)     {         FaultException fault = e.Error as FaultException;         //Something like         // if e.Error == SqlConnection Exception         GetExceptionMessage("Error occured in connecting to DB");         // if e.Error == Refeence constraint Exception         GetExceptionMessage("foreign key violation");     } }   Is it possible?


I wonder about an equation given as a solution to the following task:     Calculate the multiplicative inverse $$5^{−1} \pmod {13}$$   The solution ends in this equation: $$     5^{11} \equiv 5^{10} \cdot 5 \equiv −1\cdot 5 \equiv 8 \pmod {13} $$ and the check:     $$     5 \cdot 8 \equiv 40 \equiv 1 \pmod{13} $$      1) What is the inverse here now?      2) Why is $5^{10} \equiv -1 \pmod {13}$?   As far as I understood Fermat the rule is given as: $$     x^{(p−1)} \equiv 1 \pmod p $$ which won't come into account here, since in this case  $p = 13$ and not ideal for calculating $5^{11}$.  If I would use $x^{p−1}$ it would be $5^{12}$ in this case, so I'd still need to divide by $5^1$ to get to the result of $5^{11}$.  I am so confused although it should be really easy.


Proof by induction for ${m+n \choose n+r} = \sum\limits_{k=0}^{m}{m \choose k}{n \choose r+k}$

I've gotten as far as splitting it into two sets and I got: $${m+n+1 \choose m+r} = \sum\limits_{k=0}^{m}{m \choose k}\left({n+1 \choose r+k}\right) = \sum\limits_{k=0}^{m}{m \choose k}\left({n \choose r+k}+{n\choose r+k-1}\right)= {m+n\choose m+r}+\sum\limits_{k=0}^{m}{m\choose k}{n\choose r+k-1} $$ but I'm stuck about how to solve the final term. I also tried doing induction on m but got stuck in a similar place.   (I do not think that Vandermonde's identity does helps with this problem, as I am looking to solve for ${m+n \choose m+r}$ rather than ${m+n \choose r}$.)


How to enable hostname resolving in Debian?

I have installed Debian on a dedicated server. The company that leases this server gave me 3 addresses:   DMZ IP Mask Gateway   The server cannot resolve hostnames. So when I use ping with IP- it works. When I use ping with hostname- it doesn't.  I think I should put something in  /etc/resolv.conf   But I don't know what. Should it be the gateway?


By default, the  font joins "st" into a single ligature.  \documentclass{article} \usepackage{humanist} \begin{document} \hminfamily Compare: straight versus s{}traight \end{document}   I've tried to use the microtype package to remove this, but it doesn't seem to work with this particular one.  Any ideas how to change this throughout a document rather than doing it one instance at a time?


How do I remove Yammer in SharePoint 2013 inside search ?

I would like to know I can remove yammer appearing in SP search.


Why is $\mathbb{R}/\mathbb{Z}$ a Hausdorff space, if we assume that $\mathbb{R}$ has the canonical topology, and $\mathbb{Z}$ the induced subspacetopology?  More generally, which requirements for a topologal space $S$ ans it's subspace $U$ allow to conclude that $S/U$ is hausdorff?


Windows 2008 R2 Standard server - how to disable RC4

I have just used www.ssllabs.com and ran a few tests - my server is capped to a B grade because my server accepts RC4     This server accepts the RC4 cipher, which is weak. Grade capped to B.   I've researched and found that to disable RC4 I need to add 3 keys, and set their enabled dword to 0  and   I have done this for RC4 40/128, RC 56/128 and RC4 64/128  I then restarted my server. When the server was up again, I verified the Registry Changes were done, and they are - all 3 exist and all 3 have their enabled value set to 0.  I return to ssllabs, clear the cache, re-run the test and it returns the same result (capped to B due to RC4 being enabled).   At this stage, I'm not sure what this means - if SSLLabs showing incorrect results (I'm going to assume not), have I disabled RC 4.  How can I tell if I have successfully disabled RC4  Edit  I also saw the KB about this  so trying now... I've done the same registry changes but, when I try to download the 64 bit version for W2008 R2 Standard, it fails to install with error message     The update is not applicable to your computer


Wordpress + PHP+ apache +mysql, mysql crash every 1/ month

On a server i have multiple rails apache + postgres apps and a mysql + php. The only PHP app is a wordpress. Except for wordpress everything runs fine.   Every 40-50 days, mysql stop to work. Here is the messages that are logged before a crash :  160408 19:20:31 [Warning] Using unique option prefix myisam-recover instead of myisam-recover-options is deprecated and will be removed in a future release. Please use the full name instead. 160408 19:20:31 [Note] Plugin 'FEDERATED' is disabled. 160408 19:20:31 InnoDB: The InnoDB memory heap is disabled 160408 19:20:31 InnoDB: Mutexes and rw_locks use GCC atomic builtins 160408 19:20:31 InnoDB: Compressed tables use zlib 1.2.3.4 160408 19:20:31 InnoDB: Initializing buffer pool, size = 128.0M InnoDB: mmap(137363456 bytes) failed; errno 12 160408 19:20:31 InnoDB: Completed initialization of buffer pool 160408 19:20:31 InnoDB: Fatal error: cannot allocate memory for the buffer pool 160408 19:20:31 [ERROR] Plugin 'InnoDB' init function returned error. 160408 19:20:31 [ERROR] Plugin 'InnoDB' registration as a STORAGE ENGINE failed. 160408 19:20:31 [ERROR] Unknown/unsupported storage engine: InnoDB 160408 19:20:31 [ERROR] Aborting  160408 19:20:31 [Note] /usr/sbin/mysqld: Shutdown complete   The error logs are empty except on the day of the crash, and this message is repeated 4 times starting at 19:20:25.  To restore wordpress, I just restart mysql and it works. I already increased the ram of the server in the past, it only increased the time before a crash. The number of visits on this wordpress are around 1000 a month.  How can i prevent mysql from crashing? Maybe it would be easier just to restart mysql every week?  EDIT : the VM has 1200 mo of ram, I may have some config problem related to memory, what should i do?


bash + how to calculate very long numbers in bash?

How to calculate very long numbers in bash?  param=$(( 3247238523785623478565 + 53453453252345346534563412634 ))  echo $param 3420247196502465471   as we see here, this isn't the right answer because of the limit of integer numbers.


Given a field $F$ and a subfield $K$ of $F$. Let $A$, $B$ be $n\times n$ matrices such that all the entries of $A$ and $B$ are in $K$. Is it true that if $A$ is similar to $B$ in $F^{n\times n}$ then they are similar in $K^{n\times n}$?   Any help ... thanks!


If $\frac{\tan(a+b-c)}{\tan(a-b+c)}=\frac{\tan c}{\tan b}$, then $\sin(b-c)=0$ or $\sin 2a + \sin2b + \sin 2c=0$

If $$\frac{\tan (\alpha + \beta - \gamma )}{\tan (\alpha - \beta + \gamma )}=\frac{\tan \gamma}{\tan \beta}$$ then prove  $$\sin (\beta - \gamma)=0$$ or $$\sin 2\alpha + \sin2\beta + \sin 2\gamma =0$$ here my try goes -  To prove $\sin (\beta - \gamma)=0$, sin x = 0, only when x = 0 or 360 degree, but for the sake of simplicity let's take x = 0, then we've to prove that $\beta - \gamma =0$ or $\beta = \gamma$.  Now,   If $\beta = \alpha$, then first equation will be $\frac{\tan \alpha}{\tan \alpha}= \frac{\tan\gamma}{\tan\beta}$  or $\frac{\tan\gamma}{\tan\beta}=1$  and   $$\frac{\tan x}{\tan y}=1$$, only if $$\tan x = \tan y$$  So, also in this case $\tan \gamma$ must be equal to $\tan \beta$ so, as to prove that $\sin (\beta - \gamma)=0$.  So, how to prove that $\beta = \gamma$?  and how to solve the second part of the question here?


I work with a web-based platform with lots of data and various tools to view the data, perform analysis. Users are often impressed by one or two features and stick with them. The platform adds new features regularly; too many and too often for most users (and the sales team) to keep up. We have release notes that are emailed out and the occasional press release, but we're still in search of organic ways for users to discover new features.   One idea we had was a pop-up that included "Did you know?" text and some graphics. We know that most users ignore these. Has anyone been successful with popups like that? Or Are there other interfaces that have seen more success?


Anime where they summon monsters using crystal balls attached into their body parts

I need help identifying this anime where the lead character is a white haired guy and he's got crystal balls attached into his left arm which enables him to summon monsters. I remember one of his monsters is a green humanoid ladylike monster.   One of his friends is a girl with the crystal balls on her chest and her monster is a humanoid lady + jellyfish or something.  I think it was aired around early 2010's... I'm not sure.


What is the structural and mechanical differences between a weather sealed body and a non weather sealed body? Is weather sealing still effective if the lens isn't weather sealed?


How to prove that for every real number $x\geq0$ and every integer $n\geq0$ $$1+(n+1)x \le (1+x)^{n+1}.$$ I'm  trying with the geometric mean and arithmetic mean inequality, but I don't know what $x_1, x_2, ... $ to get to this.


What is the basis for calling HOME a preposition?

I have gone through many a post here and elsewhere that treats home in such sentences as  Stay home.   Go home.  prepositions. Admittedly, this is a fairly new perspective of looking at the POS, thanks largely to Otto Jespersen. However, beyond a smattering of information about this new approach to classify the POS, nothing more is to be found anywhere on the internet. Maybe, I can't zero in on the right information. My question then is what makes home a special word that we treat it, and not other such words (say, factory, store, shop, etc.), as a preposition? Could it be that such sentences as above became idiomatic through word of mouth and forced a novel classification of home? And how does this change the definition of a preposition, which traditional grammar defines as: A word that shows in what relation a noun or a pronoun stands to other elements of a clause or a sentence.


What would be the milestone based on ratings that would give expert validation in StackOverflow? Are there such specific process?

Let's say user A has received different milestones. Does StackOverflow have any ways of identifying that this user A now belongs to an expert community for this specific subject?


How can I get single "a" to deslect in 2.8?

I'm using the 1-25-19 version of 2.8 beta. You have to double tap "a" every time you want to deselect something which is very annoying. Is there a way to make "a" work the old way where "a" selects all if nothing is selected and "a" deselects all if something is selected? ie. no double tap and no alt?


Newton's Law of Graviation: Why $G$ and not e.g. $\dfrac{1}{4\pi G_0}$?

I've been wondering, in Coulomb's Law, $k_e = \dfrac{1}{4\pi\epsilon_0}$. Therefore, why do we use $G$ in Newton's Law of Gravitation? What if the constant is more like Coulomb's Law, e.g. $G = \dfrac{1}{4\pi G_0}$ where $G_0$ is some constant.  This would make Newton's Law of Gravitation look like the following: $$\bf{F}_{12} = -\dfrac{m_1 m_2}{4\pi G_0 |\bf{r}_{12}|^2} \bf{\hat{r}}_{12}$$  $GM = \mu$ is used for calculations but so could $\dfrac{M}{4\pi G_0} = \mu$.  If this is not the case, what is the significance of this definition?


Let $f:[0, 1] \to \mathbb R$ be a continuous function and $g: [0, 1] \to \mathbb R$ be defined through $g(x) := \int_0^x(x - t)f(t)dt$. Prove that $g'' = f$ in $[0, 1]$.  My work so far: I've defined a function $h(t) = (x-t)f(t)$, so that now   $g(x) = \int_0^xh(t)dt$   and I can use the fundamental theorem of calculus to obtain:  $g'(x) = \frac{d}{dx}\int_0^xh(t)dt = H'(x) = h(x)$, where $H(x)$ is the antiderivative of $h(x)$. So $h$ is the antiderivative of $g$, meaning that   $g''(x) = h'(x)$ where $h'(t) = [(x - t)f(t)]' = -f(t) + (x-t)f'(t)$, so $g''(x) = -f(x)$.   I'm almost there, but I get a minus to the front... Where am I doing wrong? Thanks in advance!


Getting out-of-memory error, too many images in one activity

I´m getting out of memory errors on "slower" phones (512mb of RAM).  My app has some tabs on the main activity and in those tabs it has some image buttons that link to a webview.  I think the error comes from loading ALL the images at once, even the ones that aren't seen on the first tab. I already tried the "android:largeHeap="true"" but it still crashes.  Can anyone help me make my app not load images until the tab where those images are is pressed? Changing the visibility to INVISIBLE or GONE doesn't help either.  EDIT:  I'm loading my images as buttons:  XML:      <Button     android:id="@+id/jn"     android:layout_width="match_parent"     android:layout_height="100dp"     android:layout_marginTop="3dp"     android:background="@drawable/b_jn" />   JAVA:       Button bjn = (Button) findViewById(R.id.jn);      bjn.setOnClickListener(new View.OnClickListener() {   @Override      public void onClick(View v) {  // TODO Auto-generated method stub  startActivity(new Intent("applandia.quiosquedigitalfree.JN"));          }     });   Now I have about 50 of these in a row in the same activity. I'm not an expert coder.


Find the possible values of |A + B + C |

$ |A |= |B | = |C | = 1 $ ,where A B and C are complex nos  $$ \frac{A^2}{BC}+ \  \frac{B^2}{ \ {CA}} \ +\  \frac{C^2}{ \ {AB}} + 1 = 0$$  Find the possible values of $ |A + B + C |$  Tried substituting cos(theta) + i sin(theta)


Compare the content of two objects for equality

I have two complex (i.e. objects with string, int, double, List and other home made data type) objects of the same type. I would like to compare the content of both of them to ensure that they are identical. Note: The object doesn't implement .Equals (I have no control on that) and doesn't implement IComparable.   Is there a generic way (reflection?) to compare the content of the two objects?  Thanks!


I have activated the Keychain Menu Bar icon so I can relatively easily click Lock Screen to lock the screen of my MacBook. Is there a way to do this with a shortcut or via the command line? I know you can lock the keychain via the commmand line, but I cannot seem to find the how to lock the screen as well.


Defender of the Realm hat broken, or just badly worded?

Description of the hat unlock requirement:     at least 5 flags dismissed as helpful and at most 20% of non-disputed flags declined   Does "dismissed" mean something unusual here, or is this hat not unlocking properly? I'm not sure if that means "since winter bash started" or "since your account was created": if the former, I've flagged 8 items so far today, of which 6 were marked "helpful" (the other two are still active; none have been disputed or declined). If the latter, the flag page indicates I've flagged 391 items (plus 6 for spam), of which 1 was declined (which incidentally, I assume that was by accident, given that the question was closed soon after for the reason I flagged it for), 1 was disputed (that one was legitimate), and 21 are still open. That is definitely way under 20%.  So what's up with that unlock?  edit: it appears to be the case (further edit: this has now been confirmed first-hand) that this hat unlock disregards any flags that are the flag equivalent of voting to close. I put forth that if this is intended behavior, well, it shouldn't be (if it's to equalize the playing field for over-3k-rep people, it should just also count votes-to-close. Though granted, I suppose in the scheme of things it really doesn't matter much, as it'll all go away in a couple weeks anyway. But dang it, I want to show off all the flagging I do! :p)


$IS \mid JS$ implies that $I\mid J$ where $I$ and $J$ are ideals of a number ring contained in another number ring $S$

$K$ and $L$ are number fields and $K \subset L$ . Now, if $I$ and $J$ are two ideals in number ring of $K$ and  $IS \mid JS$ then we have to show that $I \mid J$.     Here, $S$ is number ring of $L$. The book suggests to factor $I$ and $J$ into primes of number ring of $K$ and then consider what happens in $S$.  This question has been asked here before:     once but it doesn't use the hint the book gives and instead part $(b)$ of the same problem to prove this result.  Can anybody explain what the author means by 'considering what happens in $S$' or give hints but no full solution please


I came across this sentence in an e book. "Why aren't I afraid?"  Is this the proper way to phrase the question?


Red5-Server intall fails on Ubuntu 14.o4

Trying to install red5-server (as part of Kaltura installation process)  on Ubuntu 14.04, I got these messages:  The following packages have unmet dependencies:  libtomcat7-java : Conflicts: libtomcat6-java but 6.0.39-1 is to be installed. The following actions will resolve these dependencies:      Keep the following packages at their current version: 1)     libtomcat7-java [Not Installed]                          Leave the following dependencies unresolved:          2)     libmina2-java recommends libtomcat7-java              Accept this solution? [Y/n/q/?] y   Manual install of missing packages is useless, as well as not accepting the proposed solution and following others.  I'm on AWS instance an dlooking at the source repo I find this line:  http://eu-west-1.ec2.archive.ubuntu.com/ubuntu/ trusty/universe red5-server all 1.0~svn4374-3 [111 kB]   So I'm getting release 1.0 while the current release is 1.6?


I have learnt that there are 2 types of hormones:  peptide hormones (hydrophilic, mostly bind to receptors on cell membrane) steroid hormones (hydrophobic, can pass through cell membrane and bind to receptors on nucelus membrane)  I know that steroid hormones are enclosed by a protein (Is it lipoprotein or others?) when transported in blood. But I think the protein should be  relatively big outer layer should be hydrophilic (since it can dissolve in blood easily).  If these 2 descriptions are true, then how can it EASILY pass through the cell membrane and enter cytoplasm directly?


U1256 Underground Ticket - How many journeys permitted?

I have an off-peak return ticket which is marked:  From: BRIGHTON To: U1256 LONDN   The ticket does not say "travelcard" anywhere.  Just what does that entitle me to in terms of LU travel? I'm scheduled to arrive into London Bridge – am I then able to travel to any station within the zones listed making any necessary line changes along the way? I can't recall if you have to go through barriers in order to change line, thus making it count as an 'exit'.


What open source and free wireframing tools are there?

I am writing a tutorial on how to do wireframing:  and I would like to be able to recommend an online, free and open source wireframing tool to others. However I am struggling to find one that is open source, free and online.  I have come across this SO question:  and this article   However neither of them detail currently free and open source tools aside from  which is desktop only and was last updated in 2017.


How to animate text over a twisted mesh (or text flowing along an infinity loop)

Do you know I can do something like this?  How to animate text over a twisted mesh, or Text flowing along an infinity loop      I get that there is a shape (cube / rectangle / cylinder being extruded, made into the shoe, but, how am I best doing a texture, and then make it loop etc.


I am stuck in a java code and i dont understant why it is not return true

This Java code below is not returning true in if else statement...  public class DecimalComparator {      public static void main(String[] args) {         System.out.println(areEqualByThreeDecimalPlaces(25.367876,25.367873));     }      public static boolean areEqualByThreeDecimalPlaces(double a, double b){          DecimalFormat threePreshizen = new DecimalFormat("###.###");         String aNew = threePreshizen.format(a);         String bNew = threePreshizen.format(b);          System.out.println(aNew);         System.out.println(bNew);          if (aNew == bNew){             return true;         }else {             return false;         }     } }   I expect it to return "true".


I'm working my way through a probability textbook, and i have encountered the Gamma function through the Gamma distribution.   I understand that the Gamma function is an interpolating function that can give pretty accurate values of factorials across the entire Reals, in between the Natural numbers that factorials typically work for, but HOW was this function even conceived? I want to see the thought process behind this function. How did Euler decide that the Gamma function described factorial 'curve' one can draw between the discrete factorial function? He didn't just pull this function outta nowhere, there has to be a reasoning behind it, i take it?


Understanding type of force interaction in particle decays

Are there any fundamental rules of thumbs that can be used to identify the type of force interaction (weak, electromagnetic, strong) in a particle decay without drawing the Feynman diagrams at the beginning of the problem. At least to rule out some types of forces from a given decay reaction, before start drawing the Feynman diagrams.


Is it possible to use /summon a tipped arrow in bedrock?

I am trying to summon an arrow of instant damage 2 in Minecraft bedrock edition, and I cannot figure a way to do it. Is it possible to do this in bedrock? If so, how?


Is there a programmatic (or otherwise portable) way to convert E00 ArcInfo interchange files into ESRI format?


apt-get update failure returns 0 error code

When we run apt-get update and if it fails, a non zero error code should be returned, but in my case its still 0. See below:  root@ubuntu-base:/home/user# apt-get update Err http://security.ubuntu.com trusty-security InRelease  Err http://packages.siawai.com:8085 trusty InRelease  Err http://ppa.launchpad.net trusty InRelease  Err http://ppa.launchpad.net trusty Release.gpg   Could not resolve 'ppa.launchpad.net' Err http://security.ubuntu.com trusty-security Release.gpg   Could not resolve 'security.ubuntu.com' Err http://packages.siawai.com:8085 trusty Release.gpg   Could not resolve 'packages.siawai.com' Err http://in.archive.ubuntu.com trusty InRelease  Err http://in.archive.ubuntu.com trusty-updates InRelease  Err http://in.archive.ubuntu.com trusty-backports InRelease  Err http://in.archive.ubuntu.com trusty Release.gpg   Could not resolve 'in.archive.ubuntu.com' Err http://in.archive.ubuntu.com trusty-updates Release.gpg   Could not resolve 'in.archive.ubuntu.com' Err http://in.archive.ubuntu.com trusty-backports Release.gpg   Could not resolve 'in.archive.ubuntu.com' Reading package lists... Done W: Failed to fetch http://in.archive.ubuntu.com/ubuntu/dists/trusty/InRelease    W: Failed to fetch http://in.archive.ubuntu.com/ubuntu/dists/trusty-updates/InRelease    W: Failed to fetch http://in.archive.ubuntu.com/ubuntu/dists/trusty-backports/InRelease    W: Failed to fetch http://security.ubuntu.com/ubuntu/dists/trusty-security/InRelease    W: Failed to fetch http://ppa.launchpad.net/ondrej/php/ubuntu/dists/trusty/InRelease    W: Failed to fetch http://packages.siawai.com:8085/repos/dists/trusty/InRelease    W: Failed to fetch http://security.ubuntu.com/ubuntu/dists/trusty-security/Release.gpg  Could not resolve 'security.ubuntu.com'  W: Failed to fetch http://packages.siawai.com:8085/repos/dists/trusty/Release.gpg  Could not resolve 'packages.siawai.com'  W: Failed to fetch http://ppa.launchpad.net/ondrej/php/ubuntu/dists/trusty/Release.gpg  Could not resolve 'ppa.launchpad.net'  W: Failed to fetch http://in.archive.ubuntu.com/ubuntu/dists/trusty/Release.gpg  Could not resolve 'in.archive.ubuntu.com'  W: Failed to fetch http://in.archive.ubuntu.com/ubuntu/dists/trusty-updates/Release.gpg  Could not resolve 'in.archive.ubuntu.com'  W: Failed to fetch http://in.archive.ubuntu.com/ubuntu/dists/trusty-backports/Release.gpg  Could not resolve 'in.archive.ubuntu.com'  W: Some index files failed to download. They have been ignored, or old ones used instead. root@ubuntu-base:/home/user# echo $? 0   What could be the issue? I am running ubuntu 14.04.


Selecting a security team that includes at most one of the oldest man or oldest woman

A security company consists of $7$ men and $6$ women. Determine the number of ways to form the night shift team of $3$ men and $3$ women if it can include at most one of the oldest man or oldest woman.  I know the first step is to pick $3$ from each group which is   $_6C_3 \cdot _7C_3 $  but I am not sure how to account for the "include at most one of the oldest man or oldest woman"   The answer is $_6C_3 \cdot _7C_3 + _6C_3 \cdot _5C_3 + _6C_2 \cdot _5C_3 $  Also, how do I account for it in my calculations if I want to include the oldest man and oldest woman from the group?


How to Create custom Workflow in SharePoint online (not using SPD)

i am working on SharePoint online and i have got one requirement of workflow which is almost 10-12 level.  if it is SharePoint on-premise then i can achieve it by sequential workflow  using visual studio. but i have no idea how to do the same in the SharePoint Online Do i need to go by app model (SharePoint hosted/provider hosted app)? if i will create app also how it will trigger the workflow automatically when a new item would be added on a SharePoint List.   eg: if i am creating a list item and List workflow it will be triggered when ever a new item will be created or item will be updated.  In My case Item created from List is also from different application using CSOM?  My question is how app will be triggered while creation/update of List item


Why does a passport have a place of birth field on it?

Almost all passports I have seen have a place of birth field on them. For instance, on the US Passport,    Is there a specific reason to this?


Show there are infinitely many primes that are equivalent to 1 mod 8.

Show there are infinitely many primes that are equivalent to $1 \pmod{8}$.  Hello there! I have been trying to do this problem for a pretty long time with no avail.    I noticed that this is really similar to Euclid's proof that there are infinitely many primes.  However, I can't find a way to use that here.  Can anyone help me?


Should the expected observed fisher information matrix be positive definite in Fisher Scoring algorithm?

I want to use the Fisher Scoring Algorithm in Newton-Raphson method.  I(theta_m) in above that calculated at each iteration, has to be positive definite? Is it possible this matrix be indefinite?


I'm trying to debug a plugin which I didn't develop and I want to list all the registered actions. I've read this SO thread:    - StackOverflow   But it's specific to one hook and it's about filters, not actions.  Is there any variable like $wp_filter or something?


raster calculator (spatial analyst) tool not working in arcpy

I am using arcpy and while running the script it is unable to find RasterCalculator() method? Even after imporiting arpy module  >>> RasterCalculator("IDSI_2002.img + IDSI_2007.img","D:/PythonScripts/test.img") Runtime error  Traceback (most recent call last):   File "<string>", line 1, in <module> NameError: name 'RasterCalculator' is not defined   Calculator' is not defined


Tile Based Sprite Collision With Lots of Sprites

I am running into lag when loading many sprites onto the screen. If I have less than 12 on the screen it runs smoothly until I add a couple more and then it bogs down.  I currently have this as my detection code;  public void Collision(Sprite sprite, Rectangle newRectangle, bool passable, bool speedRestricted, int xOffset, int yOffset)         {// Tile boundaries             if (sprite.Bounds.Top(newRectangle) && passable == false)             {                 animation.Position = new Vector2(sprite.Position.X, (newRectangle.Y - sprite.Bounds.Height));             }             if (sprite.Bounds.Left(newRectangle) && passable == false)             {                 animation.Position = new Vector2((newRectangle.X - sprite.Bounds.Width), sprite.Position.Y);             }             if (sprite.Bounds.Right(newRectangle) && passable == false)             {                 animation.Position = new Vector2((newRectangle.X + sprite.Bounds.Width), sprite.Position.Y);             }             if (sprite.Bounds.Bottom(newRectangle) && passable == false)             {                 animation.Position = new Vector2(sprite.Position.X, (newRectangle.Y + sprite.Bounds.Height));             } }   It is called in like this;  foreach (var tile in map.CollisionTiles)         {             player.Collision(player, tile.Rectangle, tile.Passable, tile.SpeedRestricted, map.Width, map.Height);              foreach (var sprite in sprites)             {                 sprite.Collision(sprite, tile.Rectangle, tile.Passable, tile.SpeedRestricted, map.Width, map.Height);             }         }   Now collision detection works perfectly so I don't have an issue there it's just when there are lots of sprites in my List<Sprite> sprites does it lag. If I remove the collision detection from the code I can load thousands of sprites onto the map.  Question: How do I limit the detection area for the sprites so it only compares the tiles around the sprite instead of all the tiles on the map for each sprite.  I have looked through the other questions and found none when it comes to multiple sprite detections for tile maps, just the main player's collision detection.


Lets say I need to update a project and allow anyone to distribute the updates, however I need it to be secure, so I hash the data and sign the hash, this project uses MD5.  How likely would it be that a person could obtain the signing key or falsely sign files that could be distributed using the following information? If so would switching to MD6 fix this issue or is it deeper. Do I need to pad my messages?  Signing: $ \textrm{MD5}(M)^D \bmod(N) = S$  Retrieving hash: $ \textrm{MD5}(M) = S ^ E \bmod (N)$  Variables:   $M$ = File contents (public) $\textrm{MD5}(M)$ = Hashed file contents (public) $S$ = Signed hash (public) $D$ = Decryption key (private) $N$ = Modulus (public) $E$ = Exponent (public)


Does stoppage time actually equal all non-playing time during a half?

After every half during a football (soccer) game, the refs add stoppage time to the clock to compensate for lost time due to injuries and penalties.  But how closely does stoppage time equal real game time lost? (Are there different stoppage time calculations for different leagues?)  And if it's nearly exact, then what's the logic in delaying or faking injuries, as players on a winning team are often accused of doing. Wouldn't that delay just be tacked on at the end of a game or half?


wifi adapter not found. 18.10 19.04 lenovo 330

I enclose more info, although I'm a bit of a newbie. Have seen several workarounds for 18.04 but when I installed it I had no wifi or touchpad. This is done with sudo lshw -c network  *-network UNCLAIMED        description: Network controller        product: RTL8821CE 802.11ac PCIe Wireless Network Adapter        vendor: Realtek Semiconductor Co., Ltd.        physical id: 0        bus info: pci@0000:01:00.0        version: 00        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress cap_list        configuration: latency=0        resources: ioport:2000(size=256) memory:f0c00000-f0c0ffff   *-network        description: Ethernet interface        product: RTL810xE PCI Express Fast Ethernet controller        vendor: Realtek Semiconductor Co., Ltd.        physical id: 0        bus info: pci@0000:02:00.0        logical name: enp2s0        version: 07        serial: e8:6a:64:54:fb:a8        size: 100Mbit/s        capacity: 100Mbit/s        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress msix vpd bus_master cap_list ethernet physical tp mii 10bt 10bt-fd 100bt 100bt-fd autonegotiation        configuration: autonegotiation=on broadcast=yes driver=r8169 duplex=full firmware=rtl8106e-1_0.0.1 06/29/12 ip=192.168.0.170 latency=0 link=yes multicast=yes port=MII speed=100Mbit/s        resources: irq:33 ioport:1000(size=256) memory:f0b00000-f0b00fff memory:f0800000-f0803fff


Repeated measures ANOVA: Mauchly's test undefined

I'm doing a two-way between-within ANOVA in SPSS. I have two groups with 9 subjects each (so total = 18), and 24 levels of one repeated measure.  I understand why Mauchly's test of Sphericity has no meaning when there are are only 2 levels of a repeated measures factor, but I notice (using General Linear Model.....repeated measures in SPSS) that Mauchly's test of Sphericity also appears to be undefined (or gives the useless output of Mauchly's W = '.0' , p = '.') when the number of levels of a repeated measure is equal to or greater than the number of cases (subjects). In these instances, even though Mauchly's statistic is not calculated, Greenhouse-Geisser, Huynh-Feldt, and Lower-Bound Epsilon values are calculated.  I would be really happy if someone could provide some insight on why Mauchly's statistic is not calculated in these cases and what should be done to assess sphericity in the absence of Mauchly's statistic.


I have a method that returns the List of data for Kendo scheduler. My problem is, There are 39 unique records I can get from the DB.   Here also I got the 39 records but all records are the last indexed record data:  protected object GetData()         {             cal_details cal = new cal_details();             List<cal_details> lst = new List<cal_details>();             DataSet dSet = new DataSet();             try             {                 dSet = (DataSet) DAL.SC(1, 1, 0, 0, 0, "", "", "", 1, "tblCal");                 if (dSet.Tables["tblCal"].Rows.Count > 0)                 {                     lst.Clear();                     for (int i = 0; i <= dSet.Tables["tblCal"].Rows.Count - 1; i++)                     {                         cal.Description = "Test";                         cal.isAllDay = true;                         //cal.OwnerID = 2;                         cal.Start = Convert.ToDateTime(dSet.Tables["tblCal"].Rows[i]["working_date"].ToString());                         cal.End = Convert.ToDateTime(dSet.Tables["tblCal"].Rows[i]["working_date"].ToString());                         cal.OwnerID = dSet.Tables["tblCal"].Rows[i]["date_cat"].ToString();                         cal.TaskID =i;                         cal.Title = "Test Title";                         lst.Add(cal);                        }                 }                 return lst;                 }             catch (Exception ex)             {                 throw new HttpResponseException(new HttpResponseMessage() { StatusCode = HttpStatusCode.NoContent, Content = new StringContent("There were some Errors") });`enter code here`             }         }


allow sudo to another user without password

I want to be able to 'su' to a specific user, allowing me to run any command without a password being entered.  For example:  If my login were user1 and the user I want to 'su' to is user2:  I would use the command:  su - user2  but then it prompts me with   Password:


How can I remove referral spam using a .htaccess file?

I have three websites on various topics, but I can't decrease the bounce rate for them. Some spam referrers have been increasing my site's bounce rate day-by-day.       How can I remove this type of referral spam via a .htaccess? Can you provide an example for one such referrer?


Is there one word for "selfless to a fault"

What one word describes someone who spends so much time and effort looking after others, they neglect their own needs?  The other question/answers does not address the neglect of one's own needs.  I'll think about a sample sentence.


I am learning a chat application in php, I am configuring the project and stuck with the following error  In my it is showing all the code in main.php with the followin error,     Fatal error: Class 'SimpleLoginSystem' not found in C:\xampp\htdocs\chatApp\main.php on   line 14  my index.html is :     <frameset rows="65%,35%" framespacing="1" frameborder="yes" border="1" bordercolor="#FF0000">    <frame src="messages.php" name="main_frame">    <frame src="main.php" name="login_frame" scrolling="no" noresize target="middle"> </frameset>   my main.php is :   <?php  // set error reporting level echo "php ::::::::::::::::::::::::::::::::::"+phpversion(); if (version_compare(phpversion(), "5.3.0", ">=") == 1)  error_reporting(E_ALL & ~E_NOTICE & ~E_DEPRECATED); else  error_reporting(E_ALL & ~E_NOTICE);  require_once('inc/login.inc.php'); require_once('inc/chat.inc.php');  // initialization of login system and generation code $oSimpleLoginSystem = new SimpleLoginSystem();  $oSimpleChat = new SimpleChat();  // draw login box echo $oSimpleLoginSystem->getLoginBox();  // draw chat application $sChatResult = 'Need login before using'; if ($_COOKIE['member_name'] && $_COOKIE['member_pass']) {  if ($oSimpleLoginSystem->check_login($_COOKIE['member_name'], $_COOKIE['member_pass'])) {  $sChatResult = $oSimpleChat->acceptMessages();  } } echo $sChatResult;  ?>   my login.inc.php file is :  <?  // class SimpleLoginSystem class SimpleLoginSystem {  // variables var $aExistedMembers; // Existed members array   // constructor function SimpleLoginSystem() {     $this->aExistedMembers = array(         'User1' => 'd8578edf8458ce06fbc5bb76a58c5ca4',         'User2' => 'd8578edf8458ce06fbc5bb76a58c5ca4',         'User3' => 'd8578edf8458ce06fbc5bb76a58c5ca4'     );     echo "ssss"; }  function getLoginBox() {     ob_start();     require_once('login_form.html');     echo "In login_inc.php";     $sLoginForm = ob_get_clean();      $sLogoutForm = 'logout';      if ((int)$_REQUEST['logout'] == 1) {         if (isset($_COOKIE['member_name']) && isset($_COOKIE['member_pass']))             $this->simple_logout();     }      if ($_REQUEST['username'] && $_REQUEST['password']) {         if ($this->check_login($_REQUEST['username'], MD5($_REQUEST['password']))) {             $this->simple_login($_REQUEST['username'], $_REQUEST['password']);             return 'Hello ' . $_REQUEST['username'] . '! ' . $sLogoutForm;         } else {             return 'Username or Password is incorrect' . $sLoginForm;         }     } else {         if ($_COOKIE['member_name'] && $_COOKIE['member_pass']) {             if ($this->check_login($_COOKIE['member_name'], $_COOKIE['member_pass'])) {                 return 'Hello ' . $_COOKIE['member_name'] . '! ' . $sLogoutForm;             }         }         return $sLoginForm;     } }  function simple_login($sName, $sPass) {     $this->simple_logout();      $sMd5Password = MD5($sPass);      $iCookieTime = time() + 24*60*60*30;     setcookie("member_name", $sName, $iCookieTime, '/');     $_COOKIE['member_name'] = $sName;     setcookie("member_pass", $sMd5Password, $iCookieTime, '/');     $_COOKIE['member_pass'] = $sMd5Password; }  function simple_logout() {     setcookie('member_name', '', time() - 96 * 3600, '/');     setcookie('member_pass', '', time() - 96 * 3600, '/');      unset($_COOKIE['member_name']);     unset($_COOKIE['member_pass']); }  function check_login($sName, $sPass) {     return ($this->aExistedMembers[$sName] == $sPass); } }  ?>   Pls help me... Thanks in advance..


Can $k\mathbb{Z}$ and $m\mathbb{Z}$ ever be isomorphic as rings?

Can  $k\mathbb{Z}$ and $m\mathbb{Z}$ , $k, m \in\mathbb{Z}$,ever be isomorphic as rings ?  This question came upon me when I'm doing/proving that   $2\mathbb{Z}$ and $3\mathbb{Z}$ are not isomorphic as rings, but the proof is rather ad-hoc. Hence this leads me to wonder does there exist a $m, k,m\neq k$ such that $k\mathbb{Z}$ and $m\mathbb{Z}$ is isomorphic rings?  Thank you in advance. :)


Why do my SATA devices show up under /proc/scsi/scsi?

I have 3 SATA devices on my system. They show up under /proc/scsi/scsi, although these are not SCSI devices. Why do my SATA devices show up under the SCSI directory?  $ cat /proc/scsi/scsi  Attached devices: Host: scsi0 Channel: 00 Id: 00 Lun: 00   Vendor: ATA      Model: WDC WD2500AAJS-6 Rev: 01.0   Type:   Direct-Access                    ANSI  SCSI revision: 05 Host: scsi1 Channel: 00 Id: 00 Lun: 00   Vendor: TSSTcorp Model: CDDVDW TS-H653Z  Rev: 4303   Type:   CD-ROM                           ANSI  SCSI revision: 05 Host: scsi4 Channel: 00 Id: 00 Lun: 00   Vendor: ATA      Model: ST3320620AS      Rev: 3.AA   Type:   Direct-Access                    ANSI  SCSI revision: 05


This is related to  so I'll use his sentence as an example.  I agree that it should be a parenthetical statement, not a separate sentence (which is was the solution to the previous answer)... But what if it is artificially segregated? Imagine you send this text message:     How do we handle the case when the list is empty?   And THEN you decide you wish to add an example, so you send another text:     I.e., if the filter matched no entries?   What is the correct capitalization? "i.e. If", "i.e. if", "I.E. If", "I.e. If", "I.e. if", etc?


Find a formula relating $\arcsin (x)$ and $\arccos (x)$

From the formula $\sin(\frac{\pi}{2}-x)=\cos x$, find a formula relating $\arcsin (x)$ and $\arccos (x)$.  I have no idea where to start.


How to capture error messages generated by calling bpy.ops commands?

Say I allow the user to call an ops command on an object, for example, bpy.ops.object.transform_apply. If you call that via Blender's own interface (Ctrl +  A > Location) on an object like a camera, Blender gives an error message (Object has no data to transform). If I give the user a custom operator that simply calls bpy.ops.object.transform_apply() on an incorrect object, no message is displayed. I can check the object's type and make my own message (via self.report) or even disable the operator unless correct object types are selected, but I was just curious if it is possible to capture error messages generated by Blender and pass them on to the user?


How to get the name of the current method from code

I know you can do  this.GetType().FullName   To get  My.Current.Class   But what can I call to get  My.Current.Class.CurrentMethod


What is the purpose of using the word "why" in "why, thank you"?

I sometimes have heard somebody replying with Why, thank you. instead of Thank you.  What is the meaning of the first phrase? What is the difference between the two phrases?


I'm trying to prove the group isomorphism $(\Bbb Z[x]/(x^{n+1}))^\times\cong\Bbb Z/2\Bbb Z \times \prod _{i=1}^n \Bbb Z$.  Obviously I tried to establish a ring isomorphism from $\Bbb Z[x]/(x^{n+1})$ to some ring $R$, a direct product of easier rings, and prove that $R^\times$ equals the RHS of the original isomorphism. In the solutions of similar problems I've seen, one defines a surjective ring homomorphism $\phi : R^\prime[x]\rightarrow R$ of substituting $x$ with an element of $R$ such that the kernel of $\phi$ equals the dividing ideal, and uses the fundamental homomorphism theorem and CRT to show the ring isomorphism.  However this doesn't work for this particular problem; since $x^{n+1}$ has a (unique) multiple root, the kernel of homomorphism of plugging in does not equal to the dividing ideal.  Moreover, since $\Bbb Z[x]$ is not an Euclidean domain, I have no idea what the units of $\Bbb Z[x]$ modulo some ideal are like.  I would appreciate your help.


Calculating time break in rate & work question

Working alone at their respective constant rates, Audrey can complete   a certain job in 4 hours, while Ferris can do the same job in 3 hours.   Audrey and Ferris worked together on the job and completed it in 2   hours, but while Audrey worked this entire time, Ferris worked for   some of the time and took 3 breaks of equal length. How many minutes   long was each of Ferris’s breaks?   My approach is  Rate of A = 1 unit of work in 4 hours = 1/4  Rate of B = 1 unit of work in 3 hours = 1/3  Actual Ra + Rb = 1/2 (given in question) or 1 unit of work in 2 hours (120mins)  Ideal Ra + Rb = (1/4)+(1/3)=(7/12)  Basically 7 unit of work in 12 hours or 1 unit of work in 1.71 hours (~102 mins)  Therefore I can conclude that (120-102 mins)18 mins time was wasted. Hence 6 minute break each.   But the answer is 10.   Can anyone guide me where am I going wrong ?


Prove for any vectors $\mathbf{a}$ and $\mathbf{b}$  (i) $|\mathbf{a}—\mathbf{b}|\ge|\mathbf{a}|—|\mathbf{b}|$  (ii) $|\mathbf{a} — \mathbf{b}|\ge |\mathbf{b}| — |\mathbf{a}|$  (iii) Deduce that $|\mathbf{a} — \mathbf{b}|\ge |\ |\mathbf{a}| — |\mathbf{b}|\ |$  I have drawn parallelograms for (i) and (ii) so I know what $|\mathbf{a} — \mathbf{b}|$ looks like but I cannot prove them.   I cannot even fathom out what (iii) means.


I am using the OREGONSTATE_PRISM_Norm81m data set on Google Earth Engine and I am trying to clip the data to only Washington State. I uploaded a shapefile from the Washington Department of Natural Resource GIS Open Data. This is the code I currently have, I only have added the shapefile and changed the map center from the original data.  var dataset = ee.ImageCollection('OREGONSTATE/PRISM/AN81d')                   .filter(ee.Filter.date('2018-08-01', '2018-08-15')); var precipitation = dataset.select('ppt'); var precipitationVis = {   min: 0.0,   max: 50.0,   palette: ['red', 'yellow', 'green', 'cyan', 'purple'], };  var state = table.filter(ee.Filter.eq('JURISDIC_3', 'Washington State')); var rain = precipitation.clip(state);  Map.setCenter(-120.332, 47.448, 7); Map.addLayer(precipitation, precipitationVis, 'Precipitation'); Map.addLayer(table);   The error message states that "precipitation.clip is not a function" and I am very confused because I have used a similar code several times before.


While writing a sentence , I used all of my books  , I got stuck with the usage of "of".  Which of the two shall I write:     all of my books   vs     all my books


Adding multiple paragraphs between aligned equations

Some people have asked about how to add multiple paragraphs (when \intertext and \shortintertext no longer work), a fix was proposed by Peter Grill :  He wrote:     My first thought was to hack apart the result of an align and dole   out the lines one-by-one wherever you want them. Alas, align   produces a list of considerable complexity and it is not worth the   effort to unravel it (if that's even possible).      So I made my own alignment environment that, as far as I can tell,   does what you'd want align* to do but produces a very simple list.   My macro \ALineAgain then picks that list apart and drops the lines   one at a time wherever you ask.      Because the lines are not printed where the alignment is actually   given, it makes no sense to have an AlignAgain*; it never prints   equation numbers. Instead, the \ALineAgain macro takes a star that   suppresses the addition of an equation number.   The problem with this code is that the equation numbers seem to be messed up once you try referencing them. Below, I've added only a few lines to Peter's code (notably: \numberwithin{equation}{section}, two section commands, and then a single line at the very end that attempts to reference the two equations).   Rather than printing (1.1) and (1.2), it prints (1.1) and (1.1). There seems to be something wrong with the equations portion of the code. Can anybody spot the problem?   \documentclass{article} % \usepackage{showframe} \usepackage{amsmath}  \numberwithin{equation}{section}  % It's like {align}, but simple! \newenvironment{SimpleAlign} {%  \let\\=\cr  \tabskip 0pt plus 1fil\relax  \halign\bgroup   &\hfil$\displaystyle ##$\tabskip 0pt\relax   &$\displaystyle {}##$\hfil\tabskip 0pt plus 1fil\relax\cr } {%  \crcr\egroup }  % Saves its contents typeset like SimpleAlign.  You can give it a name. \newenvironment{AlignAgain}[1][AlignBox] {%  \expandafter\let\expandafter\AlignAgainBox\csname #1\endcsname  \setbox\AlignAgainBox=\vbox\bgroup\SimpleAlign } {%  \endSimpleAlign\egroup  \ReBox\AlignAgainBox } \newbox\AlignBox  % Prints the lines from {AlignAgain} one-by-one, with or without equation numbers as starred.  If you named the {AlignAgain}, use it here. \makeatletter \newcommand\ALineAgain{%  \@ifstar   {\AlignAgainStartrue\@ALineAgain}   {\AlignAgainStarfalse\@ALineAgain}% } \newcommand\@ALineAgain[1][AlignBox]{%  \expandafter\let\expandafter\AlignAgainBox\csname #1\endcsname  \begin{equation*}   \PutFirstBox\ifAlignAgainStar\AlignAgainBox  \end{equation*} } \makeatother \newif\ifAlignAgainStar  % Reboxes a box in the format: {[1][2]...[n]} -> {[1]{[2]{...}[n]}} % {...} = \hbox \newcommand{\ReBox}[1] {%  % To enter internal vertical mode, where \lastbox is valid  \setbox0=\vbox{%   \unvbox#1\relax   \global\setbox#1=\hbox{\hbox{}}   \loop    \unskip    %\box0 is the box currently at the end of #1    \setbox0=\lastbox   \ifvoid0\relax   \else    \global\setbox#1=\hbox{\box0\box#1}%   \repeat  }% }  % Puts the first box in a nested-box list into the display, saving the rest back in #1 % Optionally places an equation number \newcommand{\PutFirstBox}[2]{%  \hbox to \displaywidth{%   \unhbox#2\relax   \global\setbox#2=\lastbox   \setbox0=\lastbox   \unhbox0%   #1\else\refstepcounter{equation}\llap{(\theequation)}\fi  }% }  \begin{document}  \section{First section} \subsection{A subsection} Hello \begin{AlignAgain}  a &= b & c &= d \label{firsteqn} \\  f(x) &= g(x) & h(x) &= e^{-1/x^2} \label{myeqn} \\ \end{AlignAgain}  This is a paragraph with a lot of redundant words whose only purpose is to extend it onto a new line or two so it's dramatic when I display this equation: \ALineAgain and then follow it with a bunch more text.  And also a new paragraph, just for good measure.  I wonder if the two equations will line up?  I sure hope so! \ALineAgain This is sort of fun.   Can we reference equations by section? Try (\ref{firsteqn}) and (\ref{myeqn}).  \end{document}


Why is sample variance squared? (Basic Question)

I have two questions, each of which I think might be related to each other but I'm not sure. Both concern the definition of variance as:     $var(x) = s_x^2 = \dfrac{1}{n-1}  \sum_{i=1}^{n}(x_i - \bar{x})^2$   (1) How do we prove that $\sum_{i=1}^{n}(x_i - \bar{x}) = 0$? I can see that this is true using a few examples but I'm unsure how to do a general proof.  (2) In this definition, what is the conceptual motivation for having the squared difference squared, as opposed to cubed or some other exponent?


Need advice on best strategy for removing these bad links

We recently took on a new client whose previous SEO company had partaken in some dodgy link building tactics.  They appear to have done some blog comment spam, very poorly.  The situation we are now in is this:  We have a site with an internal page deemed more important than the homepage (the homepage has 60 linking root domains and the internal page 879). It looks as though the previous SEO company submitted a disavow request, there's a message in Webmaster Tools from a few weeks back saying it had been received, but no further correspondence.  I have doubts as to whether this disavow request was done correctly... Plus I'm not sure that Google has issued the site a warning yet as they are ranking position one for the keywords on the internal page.  Our clients want us to handle this in the correct manner, whether it be to simply ignore it and wait for Google to send a warning about the links, remove the offending internal page and leave a 404, or try to disavow the links that Google doesn't know about yet from 800+ websites.  Suggestions for the best practice for dealing with this situation?


How to get the extension of a file in an array using php

I have filenames stored in a database table along with other info. In a report I want the file extensions of the stored data. The database connection is made earlier in the code and not shown. Here's the code I use to retrieve the data:   <php     $query = $con->query('SELECT distinct(d.log_time), d.address, d.filename , i.country, i.area, i.city FROM download as d, lookup as i WHERE filename is not null and d.ref = i.id ORDER BY log_time, address, filename,country,area,city');   while ($row = $query->fetch())  {     echo "
";     echo "" . $row['log_time'] ."	";     echo "" . $row['address'] ."	";     echo "" . $row['filename'] ."	";     echo "" . $row['country'] . "	";     echo "" . $row['area'] . "	";     echo "" . $row['city'] . "	";     echo "
"; } ?>   How do I get just the file extension for each filename?


Adding name of used coordinate system using alabel in QGIS Layout?

Is there a way to display the name of the used CRS in the layout?  The expression "project_crs" displays the code of the used CRS but I'd like to use the common name of the reference systems.  This question was asked and answered before as , however the api the answer used changed with QGIS 3.0 and the solution is not valid anymore.


I have a Python program which prints json objects (from intermittent messages from a game's API). When I run the program by itself, each message immediately appears in the console output.  $ python myprog.py {"SG_MSG":{"obj_id":"SD748","aspect":"0","time":"42"}} {"SG_MSG":{"obj_id":"SD748","aspect":"6","time":"75"}}   But when I pipe the output into jq, jq outputs nothing for ages, and sporadically spits out a bunch of messages at once:  $ python myprog.py | jq .   I've tried prepending each message with the record separator character (ascii 30) and using jq --seq . but the result is the same.  Piping to od shows the record separator character is appearing as the jq manual says it should:  $ python myprog.py | od -t d1 … … … 125 125 10 30 123 … …   which is }, }, LF, RS, {  And piping to od shows the same behaviour, where no output is shown until a bunch of messages have backed up.  I'm guessing there's something elementary about bash I'm overlooking here…?


Is there a simpler expression for the following sum? $(n\in\mathbb{N})$ $$S_n =\binom{n}{0}\binom{n}{1} + \binom{n}{1}\binom{n}{2} + \dots + \binom{n}{n-1}\binom{n}{n}$$ It seems like $S_n = \binom{2n}{n-1}$, however I have no clue as to how I can prove that relation. I also tried re-writing the sum as $$S_n = \binom{n}{0}\binom{n}{n-1} + \binom{n}{1}\binom{n}{n-2} + \dots + \binom{n}{n-1}\binom{n}{0} = \sum^{n-1}_{j=0}\binom{n}{j}\binom{n}{n-j-1}$$ Which resembles a special case of . Is there a connection between the two?


I have found this has happened on several occasions. Whilst making a suggested edit, if another user then edits the same post simultaneously, when I go to submit my changes, I get the error 'This Edit Would Have To Be a Suggested Edit'; which I have circled in yellow in the image provided.    It's like my user id is mixed up with the other editor of higher rep. Is this a bug?


Flair: 500 Internal Server Error - http://stackexchange.com/error?aspxerrorpath=/users/flair/378431.png

My question is the same as . I put my stackexchange flair at the bottom of my sites:     And get a "profile for Ninsuo on Stack Exchange, a network of free, community-driven Q&A sites" link instead of my nice flair. By opening Firebug, I can read the following error:  Or as text:  NetworkError: 500 Internal Server Error -   I did not tried to update a new picture - just in case you want to get further first. Good luck!


I need to rename an iOS project. Is there a way to do this without starting a whole new project?   All other info I found were related to Xcode 4 or old and those methods seem to crash the project - I created a snapshot before I tried any name changing.


How do I change any variable into a string without itoa()?

It is very easy to convert any variable into a different kind in many languages, which gave me an idea for another converting function, which should act like str() from Python. So what I found out is that itoa() is a function that turns an int to a char * (string): #include <stdio.h> #include <stdlib.h>  int main() {     int num = 200;     printf("%s", itoa(num)); }  But as it turns out, itoa() doesn't actually exist in my version of C, which they claim is C99: make_str.c:6:18: error: implicit declaration of function 'itoa' is invalid in C99 [-Werror,-Wimplicit-function-declaration]     printf("%s", itoa(num));                  ^ make_str.c:6:18: error: format specifies type 'char *' but the argument has type 'int' [-Werror,-Wformat]     printf("%s", itoa(num));             ~~   ^~~~~~~~~             %d  So I went to make my function instead called make_str(), though I still don't have a plan about how to convert variables into strings: char *make_str(void *var) {      }  Q: What other functions can I use to change the variables into strings?  No, not floating-point values, only int.


If a wormhole connects between ground and sky, does an object require extra energy to pass through it?

As we know, if we bring an object from ground to sky (higher position) by normal methods, extra energy is required to overcome the gravitational potential energy.  Then if a wormhole connects between ground and sky, does extra energy also require to overcome the gravitational potential energy if an object passes through it? If so, when, and how would the extra energy is supplied? (eg: Does extra force required to push the object pass through the wormhole? Or the object loss mass to overcome the potential energy?)


We have some Ubuntu 16.04 servers. unattended-upgrades are automatically enabled since 16.04 and /boot is a separate partition. Due to the automatic security updates, the boot partition is running out of space with new kernels. We can't reboot the systems (for availability reasons), so the machine is still using the penultimate kernel. Which kernels should I remove? All but the current, the oldest and the newest? Do you guys have some recommendations? I have also noticed that the newest kernel has the status "Half Configured". This kernel would probably not work, so should I remove this one and use an older kernel? Output of dpkg -l | grep linux-image: ii  linux-image-4.4.0-21-generic --> old kernel ii  linux-image-4.4.0-34-generic --> current kernel ii  linux-image-4.4.0-36-generic --> new kernel ii  linux-image-4.4.0-38-generic --> new kernel ii  linux-image-4.4.0-42-generic --> new kernel ii  linux-image-4.4.0-45-generic --> new kernel ii  linux-image-4.4.0-47-generic --> new kernel ii  linux-image-4.4.0-51-generic --> new kernel ii  linux-image-4.4.0-53-generic --> new kernel iF  linux-image-4.4.0-57-generic --> new kernel


Euler's phi function and Multiplicative inverse

We can solve the linear congruence with Euler's phi function: $$105\hspace{3pt} X ≡ 15\hspace{3pt} mod \hspace{3pt}24 $$ Where $$a = 105, b=15,m=24$$ As $$\phi(m)=\phi(24)=8\rightarrow (105)^7 ≡ 9\hspace{3pt} mod \hspace{3pt}24 $$ $$\rightarrow X ≡ 15\hspace{3pt}\hspace{3pt}(9)\hspace{3pt} mod \hspace{3pt}\hspace{3pt}\hspace{3pt}24 ≡ 15\hspace{3pt} mod \hspace{3pt}24$$ The solution is: $$ X ≡ 7\pm 8 N $$ Where N is a natural number.$$$$ But when we try to solve this linear congruence with Euler's phi function: $$192\hspace{3pt} X ≡ 24\hspace{3pt} mod \hspace{3pt}27 $$ Where $$a = 192, b=24,m=27$$ We find that $$\phi(m)=\phi(27)=18\rightarrow (192)^{17} ≡ 0\hspace{3pt} mod \hspace{3pt}27 $$ That's mean we cannot solve this second linear congruence with Eules's phi function$$$$ I know that the solution for the second linear congruence is: $$ X ≡ 8\pm 9 N $$ I do not know why i can not solve this second linear congruence with Euler's phi function ? Can any one help me?


fatal error: Class 'mysqli' not found in C:\xampp\htdocs\data01\connectionSer.php on line 16

here is the code  // connecting the hosting Server  $conn = new mysqli($HostServer,$userName, $pw) or die("unable to connect"); if ($conn) {     echo ('successful connected');//echo successful if connect  }    In php.ini  I uncommented the extension=php_mysqli.dll  In http.config I uncommented  extension_dir = "./" and extension_dir="C:\xampp\php\ext"


What's the difference between "cabinet" and "cupboard"?


I have problems with the startup from a USB flash. It asks for a login and a password and I don't know the login or password can anyone help? It writes ubuntu 16.04 LTS ubuntu tty1 in a prompt.


First a tiny bit of background: I customized my father's OS X keyboard layout to add him a few specific characters (specific to Polish) on his regular azerty layout.  On OSX you can do this by creating / modification an XML file which you then place at a specific spot somewhere in the user's directories. This is all working very well. And it's important because this can be done without needing the "root" password, it can be done on a per-user basis.  It is working flawlessly seen more than one year.  Now I need to do the same on Windows and hence my question. I know next to nothing about Windows so I would need very detailed steps as to how I could do that.  And first I need to know if this can be done without needing to be "admin" on Windows?  Then, how should I go about it? Is auto-hot-key (AHK) the way to go? If so can AHK itself be installed without being root? And how would I then configure it?  And where can I "find" the characters? (can I copy/paste them from a website into AHK somehow?)  It looks like a lot of questions but it's really just one simple question:   How can I customize a Windows keyboard layout to add a few characters to an AZERTY layout without being admin?  It's basically the equivalent of the following SuperUser question (3 upvotes and two favorites), but this time for Windows:


I was surprised to only recently notice that      An object of any density can be large enough to fall within its own   Schwarzschild radius.   Of course! It turns out that supermassive black holes at galactic centers can have an average density of less than water's.  Somehow I always operated under the assumption that black holes of any size had to be superdense objects by everyday standards.  Compare the Earth to collapsing into a mere 9mm marble retaining the same mass, in order for the escape velocity at the surface to finally reach that of light.  Or Mt. Everest packed into one nanometer.  Reading on about this , it increases proportionally with total mass.  Assuming matter is accumulated at a steady density into a spherical volume, the volume's radius will only "grow" at a cube root of the total volume and be quickly outpaced by its own gravitational radius.  Question: For an object the , what would have to be its diameter for it to qualify as a black hole (from an external point of view)?  Would this not imply by definition that:   The Earth, Solar system and Milky Way are conceivably inside this black hole? Black holes can be nested/be contained within larger ones? Whether something is a black hole or not is actually a matter of perspective/where the observer is, inside or outside?


A gambler rolls two unbiased dice and stands to loss of $ \$2$ if he fails to throw a six, to win $ \$4$ if he throws one six and to win $ \$10$ if he throws two sixes. Is the game fair?  I can find probability for all three cases but to decide whether game is fair or not? Could someone help me with this?


Distinct roots of $ \int\limits_0^x {\frac{{{t^2}}}{{1 + {t^4}}}dt} = 2x -1$

The total number of distinct $x\in[0,1]$ for which $ \int\limits_0^x {\frac{{{t^2}}}{{1 + {t^4}}}dt}  = 2x -1$ is ________. My approach is as follow $y = \int\limits_0^x {\frac{{{t^2}}}{{1 + {t^4}}}dt}  - 2x + 1$ $y' = \frac{{{x^2}}}{{1 + {x^4}}} - 2$ $y' = \frac{1}{{{x^2} + \frac{1}{{{x^2}}}}} - 2$ ${x^2} + \frac{1}{{{x^2}}} \ge 2\left( {AM \ge GM} \right)$ Hence $y'<0$ decreasing $y\left( 0 \right) = \int\limits_0^0 {\frac{{{t^2}}}{{1 + {t^4}}}dt}  - 2 \times 0 + 1 = 1$ The official answer is $1$ but how we will find whether $y(1)<0$


Why is angular displacement not a vector?

How can one mathematically demonstrate that angular displacement is not a vector and is not commutative?


Combinations: dividing students into 3 groups

How would you solve a problem: we have $30$ students in a classroom. How could we divide them into three groups, if there needs to be $5$ students in the first group, $10$ students in the second group and 15 students in the third group. The result is: $\frac{30!}{5!×10!×15!}$ . Why isnt it $\frac{30!}{3!×5!×10!×15!}$ since we have three groups with $3!$ permutations.


Prove that $A\ge0, B\ge0$ and $A\ge B$ implies $B^{-1}\ge A^{-1}$

Does anyone know how to prove the following:       Suppose $A$ and $B$ are both positive definite and $A - B$ is positive semi-definite.   Show that $B^{-1} - A^{-1}$ is also positive semi-definite.    I really appreciate any comments!


How do you give people prefixes for their usernames?

How do you give people tags/prefixes on your Minecraft server? I have a server but I do not know how to make it say I am the owner in the chat.  Example: Owner Kieranpb7: <text>


Should I create a table separately for each employee or one table for all?

I'm trying to figure out how to set up the Database structure.  There are ~10000 employees.There will be a table to store the basic details of the employee, and another table for storing transactions of the employee, so I decided to create separate tables for all the employee to record their transactions, which means ~10000 tables.  So my question is, is it efficient to create that much of tables(~10000), or any other approach you can suggest, I will be using MySQL as database and a Java client, in a LAN.


Is Maximum Likelihood Estimation (MLE) a parametric approach?

There are two main probabilistic approaches to novelty detection: parametric and non-parametric. The non-parametric approach assumes that the distribution or density function is derived from the training data, like kernel density estimation (e.g., Parzen window), while parametric approach assumes that the data comes from a known distribution.  I am not familiar with the parametric approach. Could anyone show me some well known algorithms? By the way, can MLE be considered as a kind of parametric approach (the density curve is known, and then we seek to find the parameter corresponding to the maximum value)?


What country is Durmstrang in? There are certainly a lot of mentions of aspects of the school (especially how cold it is) but the books and movies never actually say what country it is in. For example:    Krum is from Bulgaria and plays for the Bulgarian national Quidditch team but that doesn't necessarily mean that the school is in Bulgaria. Krum mentions to Hermione that it is "over the mountains" but doesn't specify which mountains. In the movie, Dumbledore introduces Karkaroff and the Durmstrang students as his "friends from the North" (Bulgaria is far to the South of Scotland). Ron says in the book that he wished Malfoy went to Durmstrang because it would be easy to push him off of a glacier. Fur coats are a standard dress item of the Durmstrang students.    So where is Durmstrang? It's said to be "", like Hogwarts, but at least we know that Hogwarts is in Scotland.


I need to show that  $$\binom{p^{\alpha}-1}{k} = (-1)^k\pmod{p}$$  for $0 \leq k \leq p^{\alpha}-1$. Not really sure how to start going about this... how should I transform the term on the left? Thanks.


Does there exist $y\in[0, 1]$, such that $f(y) = g(y)$ for each pair of functions $f$ and $g$ under specific conditions?

Suppose $f, g: [0,1] \rightarrow [0,1]$ are continuous functions, such that for each $x$ from $[0,1]$ the identity $f(g(x)) = g(f(x))$ is true. Does there always exist $y\in[0, 1]$, such that $f(y) = g(y)$?  That statement seems to be true, but I do not know how to prove it.  Any help will be appreciated.


Find all root :   $p(x)=x^4+2x^3-x^2-2x+7=0$  Where $p(\alpha)=0$ ,   $\alpha=\sqrt{2}+\omega$  $\omega=e^{\frac{2iπ}{3}}$  My try :   Since : $\alpha$ root of equation then   $\bar\alpha$   also root   But I don't know how I complete to find all root   Answer is :   $x_1=\alpha$  $x_2=\sqrt{2}+\bar\omega$   $x_3=-\sqrt{2}+\bar\omega$   $x_2=-\sqrt{2}+\omega$


How to call a variable from other functions in JavaScript?

I am trying to compute the total cost and using alert to display the total cost when the user hit the Submit button. I don't know how to call a var from other functions. Is there a way to do it? Any help will be appreciated. Thank you!    <script type = "text/javascript"> function CostCalculate(){     var TotalCost = AppleCost + OrangeCost + BananaCost;     alert("Your total cost is $ " + TotalCost); } function getQuantity1(){     var promptNum = prompt("Enter numbers of Apple: ");     var AppleNum = parseInt(promptNum);     var AppleCost = AppleNum * 0.59; } function getQuantity2(){     var promptNum = prompt("Enter numbers of Orange: ");     var OrangeNum = parseInt(promptNum);     var OrangeCost = OrangeNum * 0.49;       } function getQuantity3(){     var promptNum = prompt("Enter numbers of Banana: ");     var BananaNum = parseInt(promptNum);     var BananaCost = BananaNum * 0.39; }


var position = prompt("position:"); var manager = ["John", "Alex", "Joe"]; var admin = ["Texas", "Jesus", "Rick"]; var tech = ["Nexus", "Thomas", "Fred"] if (position == manager) { alert("manager")}  if (position == admin) {   alert("admin")}  if (position == tech) {   alert("tech") }  else {   alert("Incorrect position")   }  I would like to ask how it is possible to this program work. When I will enter in prompt John I would like to get alert manager when I will enter in prompt Rick I would like to have alert tech etc...   And also if I will enter something what is unknown random value it will get me Incorrect position.   Also I would like to ask if there is way when I will enter in prompt for example jOHN or john it will work. I am total beginner in JS and coding.


Using a parameter multiple times in a single line bash command

I occasionally need to run a command such as:  mv "very-long-file-name.x" "very-long-file-name.y"   I would like to achieve this without repeating the very long file name twice...  I know how to do this by passing just "very-long-file-name" once to a bash script which would then use $1 ... but how can I do this without a script?


I got an initial mean $\mu_1$ and std $\sigma_1$ by sampling samples, these samples are generated by an unknown distribution and later I drop these samples. Then I sampled some samples and got the mean $\mu_2$ and std $\sigma_2$ from the new sample and I kept the new samples. So how can I get the new std?   My idea is $(\sigma_1+\sigma_2)/2$ but I think this result is biased.   Another idea is $\mu_3=(\mu_1+\mu_2)/2$, and I reconstruct the previous samples by making an array with all items are $\mu_1$. Then combine the previous samples with the new samples and use the $\mu_3$ to get the $\sigma_3$.  Update: I clarify my question  I want to estimate mean and variance from unknow sample, due to memory cost, I can sample the data and get the mean and variance and then drop these samples, and then I sample data from the distribution and compute the mean and variance of the new samples, before dropping the new sample, I want to estimate the mean and variance of the distribution based on the current mean and variance and that of the previous step.


How to add plugins without Bukkit on a Minecraft 1.9.4 server?

So recently I decided to make a server with a friend. I made the server successfully (I hosted it for free) but when it came to adding plugins... Well I couldn't find anything! So I don't know how to make my vanilla server into a bukkit server for free. I was wondering how to add plugins in a vanilla server, or if I could add bukkit for free, that would also work.    I am using a Mac book pro 2010 build.


Pgfplot - Compiling with Luatex - Problem with standalone class

I am trying to plot a huge data set. When I tried to compile this with PDFLatex, this gave me memory issues. So I decided to compile this with Luatex. This is giving me error messages which I don't understand fully.  ! Undefined control sequence.\sa@placebox ->\newpage \global\pdfpagewidth=\wd \sa@box \global \pdfpageh... \end{document} ! You can't use a prefix with `the character ='.= \end{document} ! You can't use a prefix with `the character ='.= \end{document} ! Undefined control sequence.\sa@placebox...wd \sa@box \global \pdfpageheight=\ht \sa@box \global \pape...\end{document} ! You can't use a prefix with `the character ='.= \end{document} ! Missing number, treated as zero.\global \end{document} ! Illegal unit of measure (pt inserted).\global \end{document}  Here's my MWE \documentclass{standalone} \usepackage{pgfplots} \usepackage{tikz} \pgfplotsset{compat=newest} \def\axisdefaultwidth{15cm} \def\axisdefaultheight{15cm} \pgfplotsset{every axis/.style={scale only axis}} \begin{document} \begin{tikzpicture} \begin{axis}[unbounded coords=jump, xtick pos=left, ytick pos=left,   xlabel= $\omega_r$,   ylabel= $\omega_i$,   legend columns=-1,   legend style={/tikz/every even column/.append style={column sep=0.25cm}},   xmin=-1000, xmax=3000,   ymin=-200, ymax=100,   xtick={-1000,-500,0,500,1000,1500,2000,2500,3000}    ] \addplot [only marks, color=blue,mark size=1.5] table [x index=0, y index =1] {e50_full.dat}; \addplot [only marks, color=black,mark size=1.5] table [x index=0, y index =1] {e55_full.dat};  \addlegendentry{$50\times50$} \addlegendentry{$55\times55$}           \end{axis} \end{tikzpicture} \end{document}  Here are the data ,  What is going wrong here? Edit: I solved the issue following pschulz's suggestion by changing from standalone class to article. The problem still persists for standalone class. Why is that so?


How to choose the parent category that shows when using multiple custom categories

When a post is in two or most custom categories, how can I specify the parent category name that I want to show up?  An example is the custom post type "tour".  It is in the following categories:   Alaska sailing Alaska Best selling tours   I want only "Alaska" category name to display and not others.


Solving $7^{2020} \equiv x \operatorname{mod} 10000$ using CRT

I want to compute the last four digits of $7^{2020}$ using the Chinese Remainder Theorem (CRT). Here is what I've got so far: Obviously \begin{align} 10000 = 10^4 = 2^4 \cdot 5^4, \end{align} so due to CRT we know \begin{align} \mathbb{Z}/10000\mathbb{Z} \cong \mathbb{Z}/16\mathbb{Z} \times \mathbb{Z}/625\mathbb{Z}. \end{align} I also do know that \begin{align} \varphi(16) = 8 \quad \text{and} \quad \varphi(625) = 500 \end{align} and therefore \begin{align} 7^8 \equiv 1 \operatorname{mod} 16 \quad \text{and} \quad 7^{500} \equiv 1 \operatorname{mod} 625. \end{align} (I know that one can find a lot of almost similar questions here on MSE, but I am only interested in solutions, which use CRT. That's due to the fact that I struggle to see how CRT works for those kind of problems. Up to now I used CRT only to compute a solution for multiple congruences. Hence, I would appreciate solutions/hints which straight forward show how to apply CRT here (without any fancy tricks etc.).)


If I'm not wrong, torque is perpendicular to both the radius and force i. e. It is along the axis of rotation. Questions that arise are- why do we consider the length between the axis/point of rotation while calculating torque? More importantly why is torque a cross product?


flatpak in a script, how to auto answer "Use this remote?"

When trying to install flapaks in a script,  $ flatpak install program_I_am_installing  I get prompted with  Found similar ref(s) for 'program_I_am_installing' in remote 'flathub' (subsystem).  Use this remote [Y/n]:  The default goes to "n" when running the script since I have no way of entering Y withing the script.  I tried giving flatpak the full Application ID, but that didn't stop the question from being asked.  I'd either like to find how to answer the question Y in the script or know how to more specificaly state the program name so this question isn't asked.


I was trying to install and run "Origin" games. But something went wrong.   The error message was:'error: opening the cache (E:Malformed entry 57 in list file/ect/apt/sources/list /etc/apt/sources.list, E:type'"deb' is not know on line 1 in source list/ect/apt/sources.list.d/lutris.list, E:the list of sources could not be read.)'  I don't know how to undo it. And it seems to not let get updates.


Sizeof template returns unexpected values

I am wondering why the sizeof operator on a template of different types returns results I would not expect.  Given  #include <iostream> #include <string>  template <class T> class Item {   public:     T data;     int32_t test; };  template <class T> class Q {   public:     Q(){         std::cout << sizeof(T) << " ";         std::cout << sizeof(Item<T>) << " \n";        } };  int main() {     Q<int64_t> q1;     Q<int32_t> q2;     Q<char> q3; }   I would expect an output of  8 12 4 8 1 5   But instead  8 16  4 8  1 8    Why?


I am a bit of a newbie to RSA encryption, so please be patient.  I understand that for a 4096 bit RSA, the numbers p and q should be prime. And to have the best security, the p and q should both be about 2048 bits long.  However, we don't have a way of generating and verifying a 2048 bit prime number with 100% accuracy. The implementation for prime generation that gpg uses goes through 64 rounds of miller-rabin which is enough to give a prime probability of $1 - 2^{-128}$.  Given that these primes are only probabalistically prime, what happens if we selected composite values for p or q?  Does the RSA algo run into any sort of problem?  My guess is that there will be no problem and RSA continues to function normally (encryption and decryption both) because, if there was a problem, we could use that problem as a way to detect that the numbers are not prime. This would give us a really fast way to verify extremely large prime numbers. I am guessing this is not the case.  So, my conclusion is that RSA works with prime or composite p, q... but using composite p, q makes it easy to break the encryption (because its easier to derive p, q from n).  Is this conclusion correct?


I'm looking for a web service providing a full address based on coordinates (and reverse).  I'm ready to pay for that service.  I don't want to use Google's API.


How to give href tag to p tag which is assigned to javascript how to give mailing functionality on clicking the href?

function incorrectAuthentication() {       var msg = "Please click the BACK button to return to the log-in screen. If you see the incorrect Personal Message after a second log-in attempt please contact  " + ' <a href="#"> info@hayscompanies.com </a> ' + " for assistance.";     alert(msg);     return false; }   It displays all the text including href. I have give the screen shot of alert. How I will alert by giving href to 'info@hayscompanies.com' and mailing functionality on clicking it.    i do not have a page i can make only alert not popup and i have to include mailing functionality


jquery onclick not working on element from .load() function

I have a PHP snippet in a separate file which I am loading in a javascript file using jquery:  let signUpMode = $(".modal");   signUpMode.load("login_signup_popup.php");   This works because I am able to show this on screen. However, this snippet contains a button which I would like to click in the same javascript file where I loaded the snippet. something simple like:  $(".signupbtn").on("click", function(){     console.log("signed Up");   });   This click is, however, not working. signupbtn is a div element in the snippet. Somehow I am missing an extra step since jquery seems to not be recognizing the elements in the snippet.


Can't update 20.10 W: Target source is configured multiple times

W: Target Sources (restricted/source/Sources) is configured multiple times in /etc/apt/sources.list:2 and /etc/apt/sources.list:7 W: Target Sources (restricted/source/Sources) is configured multiple times in /etc/apt/sources.list:2 and /etc/apt/sources.list:7  Output of ls /etc/apt/: apt.conf.d   preferences.d  sources.list.d     trusted.gpg.d auth.conf.d  sources.list   sources.list.save  Content of sources.list: # deb cdrom:[Ubuntu 20.10 _Groovy Gorilla_ - Release amd64 (20201022)]/ groovy main restricted deb-src http://archive.ubuntu.com/ubuntu groovy main restricted #Added by software-properties  # See http://help.ubuntu.com/community/UpgradeNotes for how to upgrade to # newer versions of the distribution. deb http://archive.ubuntu.com/ubuntu groovy main restricted deb-src http://archive.ubuntu.com/ubuntu groovy universe restricted multiverse  ## Major bug fix updates produced after the final release of the ## distribution. deb http://archive.ubuntu.com/ubuntu groovy-updates main restricted deb-src http://archive.ubuntu.com/ubuntu groovy-updates universe main restricted multiverse  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu ## team. Also, please note that software in universe WILL NOT receive any ## review or updates from the Ubuntu security team. deb http://archive.ubuntu.com/ubuntu groovy universe # deb-src http://br.archive.ubuntu.com/ubuntu/ groovy universe deb http://archive.ubuntu.com/ubuntu groovy-updates universe # deb-src http://br.archive.ubuntu.com/ubuntu/ groovy-updates universe  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu  ## team, and may not be under a free licence. Please satisfy yourself as to  ## your rights to use the software. Also, please note that software in  ## multiverse WILL NOT receive any review or updates from the Ubuntu ## security team. deb http://archive.ubuntu.com/ubuntu groovy multiverse # deb-src http://br.archive.ubuntu.com/ubuntu/ groovy multiverse deb http://archive.ubuntu.com/ubuntu groovy-updates multiverse # deb-src http://br.archive.ubuntu.com/ubuntu/ groovy-updates multiverse  ## N.B. software from this repository may not have been tested as ## extensively as that contained in the main release, although it includes ## newer versions of some applications which may provide useful features. ## Also, please note that software in backports WILL NOT receive any review ## or updates from the Ubuntu security team. deb http://archive.ubuntu.com/ubuntu groovy-backports main restricted universe multiverse deb-src http://archive.ubuntu.com/ubuntu groovy-backports main restricted universe multiverse  ## Uncomment the following two lines to add software from Canonical's ## 'partner' repository. ## This software is not part of Ubuntu, but is offered by Canonical and the ## respective vendors as a service to Ubuntu users. # deb http://archive.canonical.com/ubuntu groovy partner # deb-src http://archive.canonical.com/ubuntu groovy partner  deb http://archive.ubuntu.com/ubuntu groovy-security main restricted deb-src http://archive.ubuntu.com/ubuntu groovy-security universe main restricted multiverse deb http://archive.ubuntu.com/ubuntu groovy-security universe # deb-src http://security.ubuntu.com/ubuntu groovy-security universe deb http://archive.ubuntu.com/ubuntu groovy-security multiverse # deb-src http://security.ubuntu.com/ubuntu groovy-security multiverse  # This system was installed using small removable media # (e.g. netinst, live or single CD). The matching "deb cdrom" # entries were disabled at the end of the installation process. # For information about how to configure apt package sources, # see the sources.list(5) manual.   What is wrong with the sources.list?


I would like to find a solution $x$ for $x^x = c$ where $c$ is a positive constant.  Firstly I'm looking for an approximative solution when $c$ tends to infinity.  Thank you in advance


There is a problem with Freemind 0.9, which is the version I get if I use sudo apt-get install freemind.   When trying to share a .mm file between Windows Freemind and Ubuntu Freemind, I get the error      Error while parsing file:freemind.main.XMLParseException: XML Parse   Exception during parsing of a map element at line 1: Expected: =   Googling, I find advice at  to instead use Freemind 1.0.   I don't do a lot of manual installs in Linux.   I first download, then unzip, and put the directory in /opt/. I then add to ~/.profile the line export PATH=$PATH:/opt/freemind-bin-max-1.0.0_RC_4/.   But this seems to only work for calling freemind.sh from the terminal. I'd like to call from the launcher.   Is there a better way to do all this? Is there a relatively easy way that is also better?   I've checked the  site, they only provide 0.9 for Debian.   Note: I am Kubuntu user.


Y cap between AC ground and DC ground in SMPS

I have seen in many SMPS there is a Y cap placed between AC ground and DC ground. What is the need of this Y cap?


I know that $A_5$ is simple. But how do I tell which even conjugacy classes of $S_5$ split into two conjugacy classes of alternating permutations. When we know that $A_5$ is normal and normal subgroup is a disjoint union of conjugacy classes.


I have forgotten sql server sa password and I cannot connect with windows auth. How can I reset sql server password?

I have got only admin role windows login. How can I reset sql server password?


"Input/output error" when accessing a directory

I want to list and remove the content of a directory on a removable hard drive. But I have experienced "Input/output error":  $ rm  pic -R rm: cannot remove `pic/60.jpg': Input/output error rm: cannot remove `pic/006.jpg': Input/output error rm: cannot remove `pic/008.jpg': Input/output error rm: cannot remove `pic/011.jpg': Input/output error  $ ls -la pic ls: cannot access pic/60.jpg: Input/output error -????????? ? ?    ?         ?            ? 006.jpg -????????? ? ?    ?         ?            ? 006.jpg -????????? ? ?    ?         ?            ? 011.jpg   I was wondering what the problem is?  How can I recover or remove the directory pic and all of its content?  My OS is Ubuntu 12.04, and the removable hard drive has ntfs filesystem. Other directories not containing or inside pic on the removable hard drive are working fine.    Added:   Last part of output of dmesg after I tried to list the content of the directory:  [19000.712070] usb 1-1: new high-speed USB device number 2 using ehci_hcd [19000.853167] usb-storage 1-1:1.0: Quirks match for vid 05e3 pid 0702: 520 [19000.853195] scsi5 : usb-storage 1-1:1.0 [19001.856687] scsi 5:0:0:0: Direct-Access     ST316002 1A               0811 PQ: 0 ANSI: 0 [19001.858821] sd 5:0:0:0: Attached scsi generic sg2 type 0 [19001.861733] sd 5:0:0:0: [sdb] 312581808 512-byte logical blocks: (160 GB/149 GiB) [19001.862969] sd 5:0:0:0: [sdb] Test WP failed, assume Write Enabled [19001.865223] sd 5:0:0:0: [sdb] Cache data unavailable [19001.865232] sd 5:0:0:0: [sdb] Assuming drive cache: write through [19001.867597] sd 5:0:0:0: [sdb] Test WP failed, assume Write Enabled [19001.869214] sd 5:0:0:0: [sdb] Cache data unavailable [19001.869218] sd 5:0:0:0: [sdb] Assuming drive cache: write through [19001.891946]  sdb: sdb1 [19001.894713] sd 5:0:0:0: [sdb] Test WP failed, assume Write Enabled [19001.895950] sd 5:0:0:0: [sdb] Cache data unavailable [19001.895953] sd 5:0:0:0: [sdb] Assuming drive cache: write through [19001.895958] sd 5:0:0:0: [sdb] Attached SCSI disk [19113.024123] usb 2-1: new high-speed USB device number 3 using ehci_hcd [19113.218157] scsi6 : usb-storage 2-1:1.0 [19114.232249] scsi 6:0:0:0: Direct-Access     USB 2.0  Storage Device   0100 PQ: 0 ANSI: 0 CCS [19114.233992] sd 6:0:0:0: Attached scsi generic sg3 type 0 [19114.242547] sd 6:0:0:0: [sdc] 312581808 512-byte logical blocks: (160 GB/149 GiB) [19114.243144] sd 6:0:0:0: [sdc] Write Protect is off [19114.243154] sd 6:0:0:0: [sdc] Mode Sense: 08 00 00 00 [19114.243770] sd 6:0:0:0: [sdc] No Caching mode page present [19114.243778] sd 6:0:0:0: [sdc] Assuming drive cache: write through [19114.252797] sd 6:0:0:0: [sdc] No Caching mode page present [19114.252807] sd 6:0:0:0: [sdc] Assuming drive cache: write through [19114.280407]  sdc: sdc1 < sdc5 > [19114.289774] sd 6:0:0:0: [sdc] No Caching mode page present [19114.289779] sd 6:0:0:0: [sdc] Assuming drive cache: write through [19114.289783] sd 6:0:0:0: [sdc] Attached SCSI disk


I am trying to add the formulae in the workflow mentioned below:   AND( ISCHANGED (Account.Name),OR( ( Account.Type  =  'Client')))    but it shows the error as Error:      The ISCHANGED function cannot reference the Account.Name field   Basically I trying to do here is when I change the account name field on contact and account type field on account is client,the contact owner should get an email alert.  The account name is a lookup value here. Can you suggest me a correct formulae?


We have two eigenvalues $\lambda_1$ and $\lambda_2$, with $\lambda_1 = \lambda_2 < 0$. Consider the case we have only one linearly independent eigenvector. Then the phase portrait is a (stable) degenerate node. I have seen two different phase portraits for this case:    In general, how we decide which phase portrait we need?


Set theory; sets and subsets; Is an empty set contained within a set that contains real numbers?

Here is the context for my question:  Let A = {1,2,5,8,11}.   Here is my question:  Is ∅ ⊆ A?  Why or why not?


What's the difference betwen " and ' - and when to use it?

I'm used to type strings with quotation marks, but from now and then when I surf through config files and recommendations, I see apostrophes being used.  I often copy apostrophe things into my config files and substitute it with my quotation marks so that the code fits together.  But what is their difference? (I mostly target this for bash. If other Linux-based scripting does it different, that would be an extra.)  For example:  echo "Hello World!" and echo 'Hello World!'  Has it something to do that I maybe can't use (formatted) variables if I use one or the other, or is it simply personal preference?


I have seen in several textbooks that say that when we connect a conductor with a battery then electrons start moving (drifting) in the battery in random up and down motion in the opposite direction of the applied electric field, the average velocity of electrons during this motion is then said to be the drift velocity , but it is also claimed that this drift velocity is constant.   Why is it so? If a constant electric field is present then why wouldn't the drift velocity just increase?


I'm trying to write a function -- dict_reverse(inputDict) that returns a dictionary that has inputDict's keys and values swapped. (You can assume that no values are repeated in inputDict.)  I'm not really sure how to approach this problem as I am new to dictionaries. I understand their concept and how to use them, but I am stuck as for reversing them.  def dict_reverse(inputDict):     '''dict_reverse(inputDict) -> dict     returns dict with keys/values of inputDict swapped'''     # add my code here  testDict = {'adam':80,'betty':60,'charles':50} reversedDict = dict_reverse(testDict) print(reversedDict) # should output {80:'adam',60:'betty',50:'charles'} in some order   it should output {80:'adam',60:'betty',50:'charles'}


My multimeter is rated for 600V but I need to measure a 10kV AC source. I was thinking of building a voltage divider but I wouldn't know how many resistors it would take to safely measure this high of voltage.


Very basic question, just started to use QGIS. I've been trying to import my own csv file with lat/long into QGIS. No luck, thought it was my excel file that was not with the proper format.   I tried with the file 'us_states_locations-1.csv' provided with QGIS when you download it. No luck either, same result. Here is the print screen. When I click ok, the system crash. Any idea of what I do wrong?


How do you change directories using FtpWebRequest (.NET)?

Can someone tell me how to change directories using FtpWebRequest?  This seems like it should be an easy thing to do, but I'm not seeing it.  EDIT  I just want to add...I don't have my heart set on FtpWebRequest.  If there's a better (easier) way to do FTP in .NET please let me know.    Apparently there's no way to do it using a live connection, you need to change the uri to trick ftpwebrequest into using a different request (thanks Jon).  So I'm looking for a 3rd party client...  Some of the open source solutions I tried didn't work too well (kept crashing), but I found one open source solution that's passed some of my preliminary tests ().


Splitting a string across multiple lines in class file

Lets say I have a really long string that I need to have across multiple lines in the text editor for readability. Should I use StringBuffer or does it not matter? In other words is this:  string my_string = "there are lots of " + "words here";   The same as this as far as performance goes?  string my_string = "there are lots of words here";   In other words, will I be creating multiple string objects in the first example and only one in the second? I want to make sure performance doesn`t suffer for readability purposes.


A single word meaning "success but not without hard work"?

Looking for a very niche definition for a friend, she wants to find a single word that encapsulates the general meaning, "success, but not without hard work" for an article she is writing.


What is the solution to Nash's problem presented in "A Beautiful Mind"?

I was watching the said movie the other night, and I started thinking about the equation posed by Nash in the movie.  More specifically, the one he said would take some students a lifetime to solve (obviously, an exaggeration).  Nonetheless, one can't say it's a simple problem.  Anyway, here it is  $$V = \{F:\mathbb{R^3}/X\rightarrow \mathbb{R^3} \text{ so } \hspace{1mm}\nabla \times F=0\}$$ $$W = \{F = \nabla g\}$$ $$\dim(V/W) = \; 8$$  I haven't actually attempted a solution myself to be honest, but I thought it would be an interesting question to pose. I have done a quick search on this site and Google, but there were surprisingly few results.   In any case, I was curious if anyone knew the answer aside from the trivial.


Counting the number of solutions of $x^2\equiv 1 \text{ (mod n)}$ for even $n\geq 4$?

I am trying to solve the following problem:    Given the context in the book, I have noticed the following: Suppose $n=30$ then we write the following system of equations: $$x^2\equiv 1 \text{ (mod 2)}\\x^2\equiv 1 \text{ (mod 3)}\\x^2\equiv 1 \text{ (mod 5)}$$ And use the chinese remainder theorem. The solutions for $x^2\equiv 1 \text{ (mod 30)}$ are then the solutions for the previous system. I made a table on Mathematica which seems to confirm my suspicion. Whenever the previous system of equations is satisfied, $x^2\equiv 1 \text{ (mod 30)}$.  $\quad \quad\quad\quad\quad\quad\quad\quad\quad\quad\quad$  I have two questions:  Why the solutions of that equation are found in that system of equations? How can I count the solutions? I kinda guessed the previous one and it seems to work but I have no clue on how to count them. I've been able to see that there must be an even number of solutions because $a^2\equiv (n-a)^2 \text{ (mod n)}$ but aside from this, I didn't make much progress.


Is there a way to append a header to a "grepped" output?

I have quite a large csv file (call it file.csv). It looks like this one:  col1,col2,col3,... 1,2,3 1,2,5 ...   So after doing something like this cat file.csv | grep "_some_pattern_" I receive only the output values. Is there a way to append the header (the first line) to the output?   It would be very convenient...


Finding the likelihood function of parameter vector

I am trying to do an excerise on likelihood functions and score vectors and I am having some trouble extending it to parameter vectors. The question is stated below. Suppose we have two independent samples: $X_{1}, ..., X_{n}$ are iid Exponential random variables with mean $θ_{1}$ and $Y_{1}, . . . , Y_{n}$ are iid Exponential random variables with mean $θ_{2}$. Find the likelihood and log likelihood functions for the parameter vector $θ = (θ_{1}, θ_{2})^{T}. $ In this case would the likelihood function be $$\prod{θ e^{-θ x_{i}} = θ ^ne^{-θ\sum x_{i}}}$$ (same as one with one parameter)? Or would it be the product of the two functions as shown below: $$\prod{θ_{1} e^{-θ_{1} x_{i}} θ_{2}e^{-θ_{2}y_{i}} = θ_{1} ^ne^{-θ_{1}\sum x_{i}}} θ_{2}^{n}e^{-θ_{2}\sum y_{i}}$$ Or would it be something different? Thanks!


I would like to be able to change the default CSS used by chrome, such as removing the underlines for links, etc. However, I cannot find the default CSS file used by Chrome. Does anyone know where it is?