ppa repositories removed for raring. How do you install packages using old-releases.ubuntu.com

Using a Ubuntu/Debian variant (Navigatrix) release based on Raring, which is no longer supported in the Ubuntu Repositories.  Current etc/apt/source.list is:  deb (http removed) pa.archive.ubuntu.com/ubuntu/ raring main restricted universe multiverse deb (http removed) pa.archive.ubuntu.com/ubuntu/ raring-updates main restricted universe multiverse deb (http removed) pa.archive.ubuntu.com/ubuntu/ raring-backports main restricted universe multiverse deb (http removed) security.ubuntu.com/ubuntu raring-security main restricted universe multiverse deb (http removed) archive.canonical.com/ubuntu raring partner deb (http removed) extras.ubuntu.com/ubuntu raring main   Need to install a couple of Gimp libraries (libgimp2.0-dev and libpcre3-dev) but attempts to apt-get install result in the expected 404 errors.   Know packages have been moved to old-releases.ubuntu.com/ubuntu/dists/raring/ but don't know how to rewrite etc/apt/source.list to point at the packages?   Updating to newer release is not currently an option.


Is there any way to connect to SE Chat's WebSocket or access the socket response object in browser console?

I'm writing a script to send messages using a browser console for an SE Chat bot. Now, I need the user name and timestamp of each message. I found that it is sent in WebSockets. But the only global variable I can access in the console is CHAT. But it doesn't contain all the latest data. So, is there any way I can create a new WebSocket connection using the socket URL given in the Network tab of the browser console? I tried to connect using this, but it returned errors in console: var aWebSocket = new WebSocket('wss://chat.sockets.stackexchange.com/events/1/329e38906dcf4684b9e6cc3ab51c3a78?l=125410106');  Error: VM4510:1 WebSocket connection to 'wss://chat.sockets.stackexchange.com/events' failed: Connection closed before receiving a handshake response  Recently, someone told me we can use WebSocket response to access necessary data for a chatbot. So I am curious about it if it's really possible in JS. If no, any way to access that response object/JSON?


What do I do when i have the zip file for a Minecraft mod?

I have the zip file from the site but im confused what i should do next.


Proving the Complex Conjugate is Analytic

Let G be a region and deﬁne $G^∗ = \{z : z̅ ∈ G\}$. If $f : G \to \mathbb{C}$ is analytic, prove that $f^* : G^∗ → C$, deﬁned by $f^*(z) = \overline{f(\overline{z})}$ is also analytic.


First Word or Letter taking two lines or three in a paragraph

Some articles start with its first word or letter in its first paragraph taking up the space of two lines or three lines. For example, it might look like the picture below (ignoring the rules). Is there a way to do this in LaTeX, please? Thank you! I did not find any similar question. Please let me know if this is a duplicate.


$x-\left\lfloor x \right\rfloor +\frac { 1 }{ x } -\left\lfloor \frac { 1 }{ x } \right\rfloor =1\implies x$ is irrational.

If $x-\left\lfloor x \right\rfloor +\frac { 1 }{ x } -\left\lfloor \frac { 1 }{ x }  \right\rfloor =1$, then $x$ is irrational.  I am thinking of using the contrapositive: If $x$ is rational, then $x-\left\lfloor x \right\rfloor +\frac { 1 }{ x } -\left\lfloor \frac { 1 }{ x }  \right\rfloor \neq 1$  However, I don't know how I would approach this after that point. My first guess it to create a rational number, $\frac { a }{ b } $ such that $a,b\in\mathbb{Z}$, but I don't know how to manipulate it from there to get to the right hand side. I guess the floor function is throwing me off.   I would appreciate a hint/nudge in the right direction so that I can arrive at the solution by myself.


How to remove warnings like `Unknown media type ...`

Each time apt-get tries to process triggers for shared-mime-info, it reports warnings like:  ... Processing triggers for shared-mime-info... Unknown media type in type 'all/all' Unknown media type in type 'all/allfiles' Unknown media type in type 'uri/mms' Unknown media type in type 'uri/mmst' Unknown media type in type 'uri/mmsu' Unknown media type in type 'uri/pnm' Unknown media type in type 'uri/rtspt' Unknown media type in type 'uri/rtspu' Unknown media type in type 'interface/x-winamp-skin'   I've checked /usr/share/mime-info but doesn't see any of them:  /usr/share/mime-info$ grep 'url/rtspu' * (Got nothing)   So, how to clean up my system so it won't report these unknown media types?


What English dialect adds an 'r' after a 'w' in certain cases?

While watching videos online I've heard multiple brits pronounce "drawing" as "drawring". What dialect does that? Please contribute more examples of this as well, as that is the only one I can currently think of.


I have to take a soup to a party but my kids only like the Pacific brand of tomato soup. I am wondering if it's safe to put in the crock pot to heat up and take it with me. Thanks, Kay


Is there a t-test equivalent to Stouffer's z-test?

I have $k$ pairs of samples from different distributions. For each pair of samples I want to check if the samples are taken from a normal distribution with the same mean and variance. I assume the normal distributions for each pair is different and independent of other pairs. I do not know the mean and variance of any of the distributions.  I am doing a two sample t-test for each of the pairs. I want to combine the $k$ resulting p-values.   I could use Fisher's method but I am wondering about the distribution of the average t-value. If these were z-values rather than t-values I would use Stouffer's z-test. I could also approximate the t-distribution with a z-distribution and than use Stouffer's z-test, but I am not sure if that is a good approximation.  Is there a test like Stouffer's z-test for t-values?  Is there a better way to combine the t-values?


Let's say I have a document that has many pages and some pages have different formats. For example, most of the pages are fine with \documentclass{article} but there may be pages in the middle that I want to be \documentclass{letter}. I want my letter pages to be numbered inline with the other pages and have them show up in the Table of Contents.   Is it possible to change the class used for an individual or range of pages while still keeping things like page numbering consistent across them?   EDIT I'm trying to create a "welcome to the company" sort of document that has a cover page, table of contents, welcome letter, then various sections of information. I've never tried this in anything other than a word processor where it's easy to set "master pages" or "template pages" for individual pages in the document. So I could use a letterhead template page for the welcome letter part and a standard article-type template for the rest and still have the letter numbered/referenced in the ToC.   So the idea was to take advantage of the classes written, if possible, rather than have to format a single page by hand differently from the rest.


I'm trying to write some code to work with an htdigest password file. The documentation I can find seems to claim that the format of that file is:  user:realm:MD5(user:realm:pass)   If that is the case, then why doesn't this work for me? I created a file with the command line htdigest thus:  htdigest -c test b a   When prompted for a password I entered 'c'. This creates a file with the contents:  a:b:02cc8f08398a4f3113b554e8105ebe4c   However if I try to derive this hash I can't,  echo a:b:c | md5   gives me "49d6ea7ca1facf323ca1928995420354". Is there something obvious that I'm missing here?  Thanks


Assign value to private static variable in a class

I have a file A.hpp as such:  class A { private:    static std::string s; public:    void modify_string(); };   I am implementing this in a file A.cpp as such:  #include "A.hpp"  void A::modify_string() { s = "something";  // Error here.  }   My main class:  int main() { A a; a.modify_string(); }   I understand static variables are shared by all the class instances. I also went through this SO post where it says how to access the static member. . Could you please let me know where my concept is missing at?   Edit: I am getting this error: error: undefined reference to A::s


In The Lord of the Rings: The Fellowship of the Ring when the Fellowship is climbing the mountains and are pretty much overcome by the snow; Legolas is quite able to walk on the snow, when the rest have to wade through the snow:     Slowly they moved off, and were soon toiling heavily. In places the snow was breast-high, and often Boromir seemed to be swimming or burrowing with his great arms rather than walking.      Legolas watched them for a while with a smile upon his lips, and then he turned to the others.      `The strongest must seek a way, say you? But I say: let a ploughman plough, but choose an otter for swimming, and for running light over grass and leaf or over snow-an Elf.'      With that he sprang forth nimbly, and then Frodo noticed as if for the first time, though he had long known it, that the Elf had no boots, but wore only light shoes, as he always did, and his feet made little imprint in the snow.      'Farewell!' he said to Gandalf. `I go to find the Sun!' Then swift as a runner over firm sand he shot away, and quickly overtaking the toiling men, with a wave of his hand he passed them, and sped into the distance, and vanished round the rocky turn.      -The Fellowship of the Ring (The Ring Goes South).   [Emphasis added is mine]  How is this so? Is there any canon explanation of this (or any similar) ability?


apt update Error. Every Reboot first two times. This is normal?

OS : Linux kaushal 5.8.0-36-generic #40~20.04.1-Ubuntu SMP Wed Jan 6 10:15:55 UTC 2021 x86_64 x86_64 x86_64 GNU/Linux Every Day when my pc boots up and write the first command apt update I got the following error. After some time it auto resolved. This is normal? kaushal@kaushal:~$ sudo apt update [sudo] password for kaushal:  Reading package lists... Done E: Could not get lock /var/lib/apt/lists/lock. It is held by process 2346 (packagekitd) N: Be aware that removing the lock file is not a solution and may break your system. E: Unable to lock directory /var/lib/apt/lists/ kaushal@kaushal:~$ sudo apt update Reading package lists... Done E: Could not get lock /var/lib/apt/lists/lock. It is held by process 2346 (packagekitd) N: Be aware that removing the lock file is not a solution and may break your system. E: Unable to lock directory /var/lib/apt/lists/ kaushal@kaushal:~$ sudo apt update Hit:1 http://in.archive.ubuntu.com/ubuntu focal InRelease Hit:2 http://dl.google.com/linux/chrome/deb stable InRelease                         Hit:3 http://in.archive.ubuntu.com/ubuntu focal-updates InRelease                    Hit:4 http://ppa.launchpad.net/git-core/ppa/ubuntu focal InRelease                   Hit:5 http://in.archive.ubuntu.com/ubuntu focal-backports InRelease                  Hit:6 http://security.ubuntu.com/ubuntu focal-security InRelease                     Get:7 https://mega.nz/linux/MEGAsync/xUbuntu_20.04 ./ InRelease [2,441 B] Fetched 2,441 B in 2s (1,115 B/s)          Reading package lists... Done Building dependency tree        Reading state information... Done All packages are up to date. kaushal@kaushal:~$


What is the large lowercase $n$ symbol in math?

What is $\prod$ and how can I use it? I have seen it used under numerous occasions and on the  graphing calculator keyboard-menu. I could not get it to work, and wanted some pointers.


How do I cite same reference multiple times in a paper?

I am writing a report on CPUs and I need to constantly need to cite technical information from a single reference multiple times throughout the report, specifically the datasheet for an Intel processor. Should I be citing my reference every time I cite some information from the datasheet like this?     This sentence has some information. [1]   ....4 pages later...   This sentence has more information. [1]   Or should I only need to reference the data sheet once? I've searched around and it seems like it's a bad thing to cite the same reference multiple times, but I'm not sure how to handle this.


Which free VPN providers support Ubuntu?

Can't find any free VPN provider for Ubuntu. I tried looking into old questions but they seem to be outdated.


If you were to be crossed by a wire the width of a single atom, would you still be split in half?

Supposing it is solid and wouldn't snap or break. Would it guillotine you or just pass through leaving you unwounded?


Expired Maltese residency permit and need to leave and return EU while waiting for the renewal

I am currently waiting for the renewal of my expired residency permit from Malta. I have in hand an authorisation to stay in the country.  I need to travel back home to Canada before I receive the new card and then enter the EU again. Will I be entitled to use the 90-day visa free on my way back?  Thanks for your help :)


How to find strongly connected subgraphs in a graph?

I have a simple, undirected graph where I'd like to detect "natural" subgraphs where vertices are connected intensively internally but sparsely externally. The problem is that I have no exact hint what could be here "intense" and "sparse", I wonder which graph statistics could give some hints here.  I'm also thinking to apply some kind of clustering on the vertices but no idea how to convert the "closeness" in a graph into feature for a node to apply traditional unsupervised method on these.


Windows Vista malware changed my admin password

I accidentally installed malware on my computer and it changed the admin user account password.  Is there any way to bypass putting in the password, so I can run anti-malware?


Is possible to reset the timer on a disabled iPhone without Wi-Fi or Cellular?

After the screen was replaced on my iPhone 4S, I a got "disabled for 24+ millions minutes" text on my screen due to battery being unplugged. Unfortunately I have disabled cellular data and I wasn't connected to any Wi-Fi network. Is possible to unlock my iPhone without erasing data? I know the device's passcode.


I want to make a header a link with css. Not Duplicate, the other one is 2008

I want to make a <h1 class="header"> Some Title </h1> a link with only css, without adding the href="google.com" in the html part.  Anyone knows how to do this?


What is it about company performance that causes the perceived value of its stock to rise?

Many stocks don't pay dividends, and it's not like a shareholder has any direct financial gain from increased company earnings. Plus, they can only benefit from earnings if the company goes bankrupt and has to sell its assets. Then what influences demand for stocks?  I get that investors can make money through dividends and through capital gains, but I don't get how they make those gains. Earnings, or future earnings, can lead to gains because it shows the health of the company. But it seems too arbitrary for investors to just invest in a company just based on earnings alone, since they won't get to enjoy those profits.  I also don't understand how investors are expected to make money since they "have a claim to the company's assets", since they can only enjoy those assets if the company goes bankrupt, and usually what's left over for common stock shareholders is negligible (that is, when compared to what creditors are getting).  So do investors only make money based on arbitrarily following the profits of a company's stocks and by observing analyst estimates of future earnings? This doesn't make sense to me since stock value can sometimes go down even if there is an earnings surprise or the company is reporting an increase in profit...  Is it the appreciation in the stock's book value that attracts investors?


Is the system of equations of electrostatics underdetermined or overdetermined?

The following equations are equations of electrostatics: $$\nabla \times \vec E=0$$ $$\nabla\cdot\vec E=\dfrac{\rho}{\epsilon_0}.$$  These are 4 independent equations, while $\vec E$ has only 3 independent components. Yet these equations do not completely specify the field, as after adding the gradient of a scalar $\nabla \lambda$ that satisfies Laplace equation ($\nabla^2 \lambda$=0) to $\vec E$ leaves the equations unchanged: $$\cases{\nabla \times \vec E=0\\\nabla\cdot\vec E=\dfrac{\rho}{\epsilon_0}}\xrightarrow[\nabla^2\lambda=0]{\vec E'=\vec E+\nabla  \lambda}\cases{\nabla \times \vec {E'}=0\\\nabla\cdot\vec {E'}=\dfrac{\rho}{\epsilon_0}}$$ (note the primes on the RightHandSide $\vec E$s)  The system should be overdetermined (4 equations, 3 unknowns) but apparently it is underdetermined.   Is the system overdetermined or underdetermined?  How do we usually choose the arbitrary $\lambda$ in a problem with $\rho$ given and (say) Neumann boundary condition?  Why the first equation (curl) is not enough?


Grammar of titles - wh-clause vs. question

I found  with the title:     Why We Listen to Music   This seem somewhat incomplete to me, because "why we do something" is usually used as the subject of dependent clause like "This is why we listen to music."  I found  titled as follows:     Why Do We Listen to Music?   The second one sounds fine for me. My questions are these:   Is "Why We Listen to Music" grammatically correct? What's the difference between "Why We Listen to Music" and "Why Do We Listen to Music"?   Thanks in advance.


Is there a specific age timeline in Detective Conan?

Do the characters in Detective Conan age according to time? I am asking how the characters age, or if the characters age at all.


Suppose k is an integer such that $6k + 1$, $12k + 1$, $18k + 1$ are primes. Show that $n = (6k + 1)(12k + 1)(18k + 1)$ is a Carmichael number.  This is a question on a past exam that I find difficulty to answer. Can anyone help?


jQuery keypress is not working with dynamic textbox

I am working in an application where i have to use keypress event for the data manipulation on dynamic textboxes.But the problem is that when i am trying to apply the  keypress event on the dynamic text box then  it is not working,I am giving a fiddle .  $("#DynamicTextBox").keypress(function (e) {      alert('hiii');   });   I want to apply keypress on DynamicTextBox,myPicker1,myPicker2 but it is not working


Is there a way to play Minecraft with a friend using "open to LAN" while not on the same network?

I have a two person map that I want to play with a friend and want to know if I can play the map using "open to LAN", but without being on the same network?   I don't want to hassle with the server setup and all, so is there a simple way to play the world across LAN but on different Wifi networks?


Get Client's Mac address at server side in WCF service C#\

I have WCF service hosted as windows service, I am trying to get clients (WPF client) Mac address at server end (WCF side). I have tried using following line of code but it gives me IP address of client that too in ::1 format. RemoteEndpointMessageProperty prop = OperationContext.Current.IncomingMessageProperties[RemoteEndpointMessageProperty.Name] as RemoteEndpointMessageProperty; prop.Address is ::1 How can I get client Mac address so that I can differentiate among the client hitting my service. There could be scenarios where clients under same network may give me same IP address and that is reason I am looking for Mac address to identity client's call.


Suppose G is a group with x and y as elements. Show that $(xy)^2 = x^2 y^2$ if and only if x and y commute.  My very basic thought is that we expand such that $xxyy = xxyy$, then multiply each side by $x^{-1}$ and $y^{-1}$, such that $x^{-1} y^{-1} xxyy = xxyy x^{-1}$ , and therefore $xy=xy$.  I realize that this looks like a disproportionate amount of work for such a simple step, but that is what past instruction has looked like and that is perhaps why I am confused. Moreover, "if and only if" clauses have always been tricky for me since I took Foundations of Math years ago, but if I remember correctly, the goal here should be to basically do the proof from right to left and then left to right, so to speak. Anyhow, I think that I am overthinking this problem.


Is it possible to remove a soul from a Horcrux?

I was wondering if it is possible to remove the portion of a soul inside a Horcrux without the person whose soul is actually in the Horcrux. I’m writing a Harry Potter fan fiction, and would really appreciate it if anyone could tell me.


Find the smallest positive integer k such that $p^k = 1A$

Given: $$p = \begin{bmatrix} 1 &2  &3  &4  &5  &6  &7  &8  &9 \\   1&5  &7  &4  &6  &9  &3  &2  &8  \end{bmatrix}$$ How would I go about determining $k$ such that: $$p^k = \begin{bmatrix} 1 &2  &3  &4  &5  &6  &7  &8  &9 \\   1&2  &3  &4  &5  &6  &7  &8  &9  \end{bmatrix}$$ I know I can continuously multiply the permutations till I reach the answer but is there a quicker or "right way" of determining the answer?


Nouns of plural form preceding another noun

I was reading Computers, Communications, and Information A User's Introduction (Seventh Edition) by Sarah E. Hutchinson and Stacey C. Sawyer.  The authors consistently used such terms as communications hardware and applications software. I thought we should use communication hardware and application software instead. Why did the authors use nouns of plural form this way?  EDIT: As far as I can remember from English grammar courses, a noun should typically be modified by a single noun preceding it. Rarely have I seen such usages as in the book.


Deleting an element from a JavaScript array

I am deleting an element from an array using delete  I ave this object:  obj = {     Variables: [ {         Name: "test",         Type: "Int",         Control: "U",         Value: "123"     }, {         Name: "ftr",         Type: "DateTime",         Control: "UA",         Value: "123123"     }, {         Name: "wertwe",         Type: "Int",         Control: "SA",         Value: "435345"     } ] };   using this code:   delete data["Variables"][2];   Now obj contains the value:  {"Variables":[{"Name":"test","Type":"Int","Control":"U","Value":"123"},{"Name":"ftr","Type":"DateTime","Control":"UA","Value":"123123"},null]}   Is there any way to delete an element without a null value appearing in the object?


Replacing a keyword inside html but excluding matches inside button, image and anchor tags

I am trying to replace all occurrences of a keyword inside an html document except those that are found inside a button, anchor or image tag. I have created a fiddle with the code that I am working with: Could I please have some help getting the correct regular expression to exclude occurrences found inside images, anchors and buttons?   jQuery(document).ready(function($) {   var keyword = 'ARC';    $('p, h1, h2, h3, h4, h5, h6, td, th, li').each(function() {     var src_str = $(this).html();     var pattern = new RegExp('(?<!<button.*?>||)' + keyword + '(?!\/?>|<\/a>|<\/button>)', "gi");      var match = pattern.exec(src_str);     if (match) {       $(this).html(src_str.replace(pattern, '' + keyword + ''));     }   }); });
   About the ARC

   ARC activity & recreation center Columbia Parks And RecreationThe ARC is Columbia, Missouri’s popular health club, fitness center, and place to exercise and have fun. This 73,000 sq. ft. facility has an indoor leisure pool, gymnasium (including basketball,   volleyball, and pickleball), strength training equipment and weights, cardio equipment, indoor track, group exercise classes, and much more! ARC Link <button>ARC Link</button>


Creating a list of values of the same index from another list

I was wondering how you can create a list of values of the same index from another list, when the amount of values is not known beforehand.  for example I have the list  list = [[25,75,94,63],[55,13,0,99],[41,63,93,25]]   I want a second list that would be  [[25,55,41],[75,13,63],[94,0,93],[63,99,25]]   If possible I would like the answer to only use simple python functions and without the use of importing a module. And if possible how to do so using a loop (probably nested?)  Thanks


Missing files (basic sty files) when TEXINPUTS is set

Below is my files tree:  .../Doc/Tex/book.tex .../Doc/Tex/images/im.jpg .../Doc/TexBase/myTemplate.sty .../Doc/TexBase/baseImages/logo.jpg   On Windows it was enough to set TEXINPUTS evironment variable with some paths and then I was able to compile with:  pdflatex Tex/book.tex   my document book.tex which uses package myTemplate.sty And now im trying to do teh same on Ubuntu 18.04. When i move all things to one folder (book.tex and myTemplate.sty and folder with images) then compilation is succesfull. But i would like to keep my foder structure as it is more clearly. So i tried to export TEXINPUTS:  export TEXTINPUTS=.:./TexBase/   but my compilation fail because of unfound many sty-files wchich are part of texlive-latex-extra that i already installed. When i UNSET this variable - it compiles ok. So my question is: Am i correctly set TEXINPUTS variable? Maybe i should add some other paths? What is the path to those "latex basic STY files"?


How to mount a USB drive partition as read/write?

I have a USB drive with three partitions:   sdb1 is an EFI partition sdb2 is an HFS+ partition sdb3 is an MSDOS fat partition with Kali linux on it   I can boot into Kali linux using this USB stick on a MacBook and the sdb2 partition shows up on the desktop as HD (the name I gave it when I formatted it on the Mac).  As referenced in  thread, I installed hfsprogs and tried:  sudo mount -o force /dev/sdb2 /media/root/HD   The partition is still read only.  sudo df -hT   gives  Filesystem     Type      Size  Used Avail Use% Mounted on udev           devtmpfs  7.8G     0  7.8G   0% /dev tmpfs          tmpfs     1.6G  9.5M  1.6G   1% /run /dev/sdb3      vfat       26G  3.4G   23G  14% /lib/live/mount/findiso /dev/loop0     iso9660   2.8G  2.8G     0 100% /lib/live/mount/medium /dev/loop1     squashfs  2.5G  2.5G     0 100% /lib/live/mount/rootfs/filesystem.squashfs tmpfs          tmpfs     7.8G     0  7.8G   0% /lib/live/mount/overlay overlay        overlay   7.8G  356M  7.5G   5% / tmpfs          tmpfs     7.8G     0  7.8G   0% /dev/shm tmpfs          tmpfs     5.0M     0  5.0M   0% /run/lock tmpfs          tmpfs     7.8G     0  7.8G   0% /sys/fs/cgroup tmpfs          tmpfs     7.8G     0  7.8G   0% /tmp tmpfs          tmpfs     1.6G   24K  1.6G   1% /run/user/0 /dev/sdb2      hfsplus   3.7G   25M  3.7G   1% /media/root/HD   I tried to unmount the partition:  sudo umount /media/root/HD   and get  umount: /media/root/HD: target is busy         (In some cases useful info about processes that          use the device is found by lsof(8) or fuser(1).)   So, it seems that Linux thinks the HD partition is busy for some reason. Maybe because the boot partition is sdb3? Here is some more info that may help.  issuing:  sudo fdisk /dev/sdb   gives  Welcome to fdisk (util-linux 2.28.1). Changes will remain in memory only, until you decide to write them. Be careful before using the write command.  A hybrid GPT was detected. You have to sync the hybrid MBR manually (expert command 'M').   I have no idea what that means. So then I tried:  fdisk -l   which gives  Disk /dev/sda: 465.9 GiB, 500277790720 bytes, 977105060 sectors Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 4096 bytes Disklabel type: gpt Disk identifier: D4AAF120-967C-41B9-9FA4-EB4EBD806D19  Device         Start       End   Sectors   Size Type /dev/sda1         40    409639    409600   200M EFI System /dev/sda2     409640 898785143 898375504 428.4G Apple HFS/HFS+ /dev/sda3  898785144 900054679   1269536 619.9M Apple boot /dev/sda4  900055040 977104895  77049856  36.8G Microsoft basic data   Disk /dev/sdb: 29.6 GiB, 31742492672 bytes, 61997056 sectors Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disklabel type: gpt Disk identifier: E93D7B7D-38FD-404B-9163-63AAA9A39ED5  Device       Start      End  Sectors  Size Type /dev/sdb1       40   409639   409600  200M EFI System /dev/sdb2   409640  8010815  7601176  3.6G Apple HFS/HFS+ /dev/sdb3  8272960 61734871 53461912 25.5G Microsoft basic data   Disk /dev/loop0: 2.9 GiB, 3076767744 bytes, 6009312 sectors Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disklabel type: dos Disk identifier: 0x77e6cfe3  Device       Boot   Start     End Sectors  Size Id Type /dev/loop0p1 *         64 5794271 5794208  2.8G 17 Hidden HPFS/NTFS /dev/loop0p2      5794272 6009311  215040  105M  1 FAT12   Disk /dev/loop1: 2.5 GiB, 2634285056 bytes, 5145088 sectors Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes   You can see the Kali Linux partition on sdb3 which I had formatted as  MSDOS fat. How can I get sdb2 to be read/write? Or even unmount it?


Attempting to send user input/randomly generated numbers into an Int array - JAVA

Hi there I'm trying to make a lottery, generating 6 random numbers adding them to an array and then getting a users numbers and adding them to an array. This is what I've tried so far.  Heres my lottery class,  class Lottery {     Random rand = new Random();     // generating lottery numbers     int cpnum;     int[] allCpNumbers = new int[100];      // bets placed     int betsPlaced; }   Here's my for loop to generate the random numbers and add them into my array  // printing lottery numbers for(int i = 0; i <= 6; i++) {     lottery.cpnum = rand.nextInt(50) + 1;     lottery.allCpNumbers[i] = lottery.cpnum; }   When printing the random numbers it gives me this   System.out.println(lottery.allCpNumbers);   Output:  [I@1b6d3586  I want it to be a set of 6 random numbers arranged like 3,13,10,43,12 etc.


Xcode : How To Customize Text Field Font With My Own TTF Font?

I have a simple question :  how to add / import my TTF font into Xcode so that it can be seen on 'Attributes Inspector' custom font list, so that it can be used on any components (text field, button, label, etc).  thank you.


My referees are in their Ph.D. final year, can they recommend me for Ph.D. Admission?

Please I need orientation on this issue. All my undergraduate lecturers that know much about me are in their Ph.D. final year, but they all have been in the system since 16years ago with MSc degree. My MSc supervisor is the only professor that can say much about my research capability. All my undergraduate lecturers are now in their Ph.D. final year. Can I they recommend me for Ph.D. admission? I need three referees, my MSc supervisor and two others would come from my undergraduate degree lecturers. Is this advisable? Thanks.


Prove that: set $\{1, 2, 3, ..., n - 1\}$ is group under multiplication modulo $n$?

Prove that:   The set $\{1, 2, 3, ..., n - 1\}$ is a group under multiplication modulo $n$ if and only if $n$ is a prime number without using Euler's phi function.


Reason for the negative sign in the gravitational potential $-GM/r$?

why the gravitational potential comes out to be negative  that is $-GM/r$? where G is gravitational constant M is mass of the body r is position at which the mass has to be brought from infinity.


I want to prove the following, however, not sure where to start.  $\int\Phi(a)\mathcal{N}(a|\mu,\sigma^2)da=\Phi\left(\frac{\mu}{\sqrt{1+\sigma^2}}\right)$  Where $\Phi(\cdot)$ is the probit function, defined as $\Phi(a)=\int_{-\infty}^a\mathcal{N}(x|0,1)dx$


Reducing number of point features considering minimal distance and spatial distribution

I have a certain number of generated node features using FME 2016. They are coming as output of one FME workbench and actually representing characteristic points of underground cables. Total number of these points is several hundreds of thousands and, as you can imagine, they are unevenly distributed accross the area of the city.  My task is to reduce the number of points in the way that there are no two points on the distance less than 50 m. Points should be treated equally and they do not have assigned weights. Point features after reduction should be loaded into ESRI geodatabase.  What I can do is to take each of these points at the time and to remove all others in the circle of 50 meters. In that case my only requirement, that there are no two points on the distance less than 50 meters, will be fulfilled, but distribution of the points is in some areas very poor.  What I am thinking of, is there has to be some kind of comprehensive solution which will not analyze each point individually but complete set of features and result is best possible distribution of the points in complete area.   Don’t hesitate to advise me any kind of ESRI tool or even mathematical approach that you can think of, since as far as I see, we do not have built-in FME transformer which will do this job for me.  Current result   Needed result


Calculate $\int_{-\infty}^\infty {dx\over (1+x^2)^{n+1}}$

The question:      Prove $$\int_{-\infty}^\infty {dx\over (1+x^2)^{n+1}}={1\cdot3\cdot...\cdot(2n-1)\over 2\cdot4\cdot...\cdot2n}\pi$$   My attempt:  I've got to a different solution:  $$\begin{align}I:&=\int_{-\infty}^\infty {dx\over (1+x^2)^{n+1}}=2\pi i\cdot \operatorname{Res}({1\over{(1+z^2)^{n+1}}},i)\\&={2\pi i \over n!} \cdot((z+i)^{-n-1})^{(n)}=...\\&={2\pi i \over n!}(-n-1)(-n-2)...(-2n)\cdot 2i\\&={(-1)^{n}4\pi\over (n!)^2}\cdot (2n)! \end{align} $$  In a 'contradiction' to what I need to show.


Recieving a NullPointerException Error when attempting to Initialize multidimentional array in java

I am struggling to figure out why the initialization of a multidimensional array in java is not working properly when I try to insert elements in the array one by one. My code is shown below:  public char[][] board; public Board() {       for (int i = 0; i < ROWS; i++) {           for (int j = 0; j < COLUMNS; j++) {               board[i][j] = ' ';           }       }   }   I tried to initialize the board array in setting it to "new char[6][7]" but that did not work. ROWS = 6 and COLUMNS = 7. Any help to figure out why this is giving such an error would be greatly appreciated. Thank you!


Bonus Actions Are Actions? Combining Two Weapon Fighting and Extra Attack (Newly Expanded)

Let me first start by clarifying, I believe there is a point that has been missed in this question before. Consider that before marking it a repeat:  What is the precise differentiation between a bonus action and an action?  I believe that the combination of two weapon fighting and Extra Attack (granted at Level 5 Paladin) allows for a total of 4 attacks. Can anyone confirm this? Let me outline.  Extra attack: "Beginning at 5th Level, you can attack twice, instead of once, whenever you take the Attack action on your turn."  Two Weapon Fighting: "...you can use a bonus action to attack with a different light melee weapon...".  Most answers I've seen say three attacks, i.e. You get the Attack Action, which includes 2 attacks, and the bonus Action which includes 1 attack.  However, I believe the correct breakdown is first to thinking You get the Attack Action, which grants a Bonus Action (Attack Action). Now both of these Attack Actions should benefit from Extra Attack, giving 4 (lower case a) attacks within 2 (upper case A) Attack Actions. Thoughts?  The rules seem clear, that a bonus action is an action. And an action used to attack is an attack action. Thus, a bonus action used to attack is an attack action.  If this is not the case, where is there a clear distinction between bonus action and action?


Mongoose Blank Query finds all, but specific query fails

I am writing a small server with express, mongo and mongoose. My code:      const express = require('express');     const MongoClient = require('mongodb').MongoClient     const mongoose = require('mongoose');      const COLOURS = ["e6194b", "3cb44b", "ffe119", "0082c8", "f58231", "911eb4", "46f0f0", "d2f53c", "fabebe", "e6beff"];      var url = 'mongodb://localhost:27017/test';     mongoose.connect(url);      var app = express();      var db = mongoose.connection;     db.on('error', console.error.bind(console, 'connection error:'));     db.once('open', function() {         console.log('Database connected and open');     });      var deviceSchema = mongoose.Schema({         mac: String,         ip: String,         colourIndex: Number     });     var Device = mongoose.model('Device', deviceSchema);      app.get('/register', function (req, res) {         console.log("Registration: ");         console.log("    MAC: " + req.query.mac);         console.log("    IP : " + req.query.ip);         Device.find({ mac: /req.query.mac/ }, function(err, deviceList) {             if (err || deviceList.length == 0) {                 console.log("  Cannot find " + req.query.mac + ": " + err);                 Device.count({ mac: /req.query.mac/ }, function( err, count){                     var index = count;                     console.log("There are " + count + " matching");                     var device = new Device({ mac: req.query.mac, ip: req.query.ip, colourIndex: index }); //                  device.save(function (err, device) { //                      if (err) { //                          res.status(500).send("Internal error"); //                          return console.error(err); //                      } //                      res.status(202).send(COLOURS[index]); //                  });                     res.status(202).send(COLOURS[0]);                 });             } else {                 console.log(deviceList);                 res.status(202).send("Success");                       console.log("  Colour index: %s", deviceList[0].colourIndex);             }         });     });   When I try to use mac: /req.query.mac/ to find the device, it fails EVERY time. If I leave it blank, it does return the devices (I added duplicates to check with the commented out code).  I have tried looking at the  and


OS X updater claims installation is successful, but new OS is not installed

I've got a Mac running 10.10.5 Yosemite, trying to upgrade to 10.11 El Capitan. When I run the installer, it claims installation requires 7 Mb of disk space, it installs some files, and ends with "Installation successful".    But the OS is not updated: after a reboot 'About this Mac' still shows it running Yosemite.   The same thing happens on this Mac when running the 10.12 Sierra installer. The goal is to get to Mojave, but that installer won't run at all so I'm trying incremental updates.   In both cases I made sure to download the full (~6 Gb) installer beforehand (from the app store), and I'm running the installer from the mounted disk image.  What could cause this error, and how do I get rid of it?


What are the differences between NoSQL and a traditional RDBMS?  Over the last few months, NoSQL has been frequently mentioned in the technical news. What are its most significant features relative to a traditional RDBMS? At what level (physical, logical) do the differences occur?  Where are the best places to use NoSQL? Why?


Why separation of variables works in PDEs?

The method of separation of variables is used in many occasions in the upper level physics courses such as QM and EM. But when it is used there is no clear reason why using it is permitted it except that it works, or that let us try and see.   Is there a theorem which provides the condition(s) that if satisfied then the method of separation of variables will be guaranteed to work in PDEs?


Prove that $n^{2003}+n+1$  is composite for every $n\in \mathbb{N} \backslash\{1\}$.  I tried with expanding $n^{2003}+1$, but I got nothing pretty not useful. I also couldn't get any improvement, let alone contradiction for assuming $n^{2003}+n+1=pq$ where $p,q\not= 1$. How should I do this and are there general tips on how to approach these problems, what to think about?


Synchronizing Outlook 2010 Calendar with Sharepoint 2010 website Calendar

How do I synchronize my Outlook 2010 calendar to SharePoint 2010 website?  I am able to synchronize SharePoint Calendar into my Outlook calendar but not able to do Outlook Calendar (meetings, Data) into SharePoint Calendar.  When my office people go into our intranet site, I just want them to see my calendar in SharePoint which updates the data from Outlook and displays it but this calendar data on SharePoint should only be read-only to other users.


Add ability to Flag a User or Suggested Edit

However, new features on the site may warrant a fresh look.  Specifically, suggested edits on tag wikis.  I've recently hit 10k on the main site and have been reviewing a lot of suggested edits.  Today I ran across  that seems to be making edits with spam content.  The ones I found today were for xml related tags in the tag wikis and the suggested content was about buying cheap shoes from china.  Previously the answer to this was "flag their posts!" which was very reasonable.  Now, however, users like this are able to cause issues without ever posting a question, answer, or comment to flag.  Does the ability to flag a user need to be added?  Alternatively, should we be able to flag suggested edits?  For clarification, here are the edits suggested by this user:  to the xml-parsing tag:      The US markets opened just minutes ago,china shoes wholesale now       let's cross over to our correspondent Natalie Carney in New York,   factory shoes wholesale cheap to see how it's reacting to the   downgrade.      Q1. It was pretty ugly today on from shoes wholesale the Asian   markets. And it doesn't look like Wall Street will be much better off   today, its first session since the downgrade. Tell us, how are   investors there reacting?      Q2. There's panic selling on the equity china wholesale markets, but   yields on US Treasury bonds have been moving rather modestly, though   the risks are supposed to be higher. Looking ahead, will Treasuries   remain a safe haven in all this uncertainty?      Website:  MSN: igshox@hotmail.com Yahoo:   Igshox@yahoo.cn   To the excerpt for the same tag:     How can I found the cheap shoes from china factory or chinese   wholesale supplier   EDIT TO CLARIFY:  This user only posted a suggested edit to a tag wiki and a tag wiki excerpt, and there is no way to flag those for moderator attention.


Today on sidebar, Worldbuilding SE:  As you can see, chat room name turned out to be too long and unsplittable due to question link and decided to run out of sidebar. I think that long links can be safely broken into parts by splitting after slashes.


It is really annoying that I cannot add comments or follow-on questions to topics without enough "reputation points".  I recently upgraded to Ubuntu 20.04 and now my fslint won't work. I found a discussion about fslint here, but I cannot ask a simple followup question. How do I: #1 increase my reputation points, and #2 run fslint in Ubuntu 20.04 after installing it?  (see thread below)


Applying for ESTA while in possession of a valid B1/B2 visa

I am planning to travel to the United States this year. In 2014 I was issued a B1/B2 visa which hasn't expired yet; My first and only trip to the US so far was for business reasons, but I now intend to enter the US as a tourist.  Some of my friends suggested it's not ideal that I reuse my visa for this purpose (saying that being rejected at the border when showing my visa would make me ineligible for another visa or ESTA for life).   I'm struggling to understand whether there's an inherent risk in using my current B1/B2 visa again for a purpose different than the original (tourism vs. business), and whether I should apply to ESTA instead.  Furthermore, it is difficult to understand whether one can apply for ESTA while in possession of a valid B1/B2 visa, as the language on official documents is confusing at best. All I could glean is that, while in possession of a B1/B2 visa, an ESTA application is not a requirement, however it is not clear whether they are mutually-exclusive—will my B1/B2 visa limit my ability to apply for ESTA?  My questions are:   Is there a clear difference between traveling on my current B1/B2 visa as a tourist, and applying for ESTA instead? Which one is preferable? While my B1/B2 visa is still valid, am I actually allowed to apply for ESTA?


Irreducible Markov chain with µ as the stationary distribution.

Prove that if $\mu$ is a stationary distribution for an irreducible Markov chain on $S$, then $\mu(j) > 0 \ \forall j \in S$. (only using the fact that Markov chain is irreducible and that $\mu P = \mu$)   How can I do that? I have used this fact while proving other limit theorems but can't think about how to do it.


I have a iPod 5 touch with the iOs 7.0.4 and I can't get through the Activation Lock and I have no contact with the Apple ID owner. Is there any bypass for this? Please Help


App "unfortunately stopped" when inserting data by a button click

So, this is my database helper class   public class DBHelper extends SQLiteOpenHelper {     public static final String DATABASE_NAME =  "EventManager.db";     public static final String TABLE_NAME =  "EventManager";     public static final String Col_1 =  "NAME";     public static final String Col_2 =  "DATE";     public static final String Col_3 =  "TIME";     public DBHelper(Context context) {         super(context, DATABASE_NAME, null, 1);     }      @Override     public void onCreate(SQLiteDatabase db) {         db.execSQL("create table " + TABLE_NAME + " (NAME TEXT, DATE TEXT, TIME TEXT)");     }      @Override     public void onUpgrade(SQLiteDatabase db, int oldVersion, int newVersion) {         db.execSQL("DROP TABLE IF EXISTS " + TABLE_NAME);         onCreate(db);     }     public boolean insertData(String name, String date, String time){         SQLiteDatabase db = this.getWritableDatabase();         ContentValues contentValues = new ContentValues();         contentValues.put(Col_1, name);         contentValues.put(Col_2, date);         contentValues.put(Col_3, time);         db.insert(TABLE_NAME, null, contentValues);         return true;     } }   I am trying to call insertData() from another class like:  public void addData(View view){     if(dbHelper.insertData(editTitle.getText().toString(), date.getText().toString(),                      time.getText().toString()))          Toast.makeText(AddEventActivity.this, "Event saved", Toast.LENGTH_LONG).show();                     else          Toast.makeText(AddEventActivity.this, "Event not saved", Toast.LENGTH_LONG).show(); }   addData() is called when a button is clicked.  So, whenever I attempt to save data using the code, my app is crashing. The issue is with database connection, I have checked all the editTexts, button calling, everything is fine. It's crashing only when database is being involved and when I tried without DB and a simple toast displaying editText values on a button click, it's working fine. Please help.  Logcat :  Caused by: java.lang.NullPointerException: Attempt to invoke virtual method 'boolean com.example.yogith.exampleevent.DBHelper.insertData(java.lang.String, java.lang.String, java.lang.String)' on a null object reference                                                                                at com.example.yogith.exampleevent.AddEventActivity.addData(AddEventActivity.java:87)                                                                                at java.lang.reflect.Method.invoke(Native Method)                                                                                at android.support.v7.app.AppCompatViewInflater$DeclaredOnClickListener.onClick(AppCompatViewInflater.java:288)                                                                                at android.view.View.performClick(View.java:5201)    error  07-02 12:56:37.235 9949-9949/com.example.yogith.exampleevent W/System: ClassLoader referenced unknown path: /data/app/com.example.yogith.exampleevent-1/lib/arm   Solved: The DBHelper object, 'dBHelper' that is used call addData() wasn't declared properly. Thanks


How do I let the world know about my role-playing system?

I have been working on a short narrativist system for quite some time now. I intend to offer it freely to anyone interested but I'm not sure about a couple of things:  First, how do I package it? One option is to make a website with the rules. In that case, is making lots of small interconnected pages a good idea? Or is it better to keep it linear and on as few pages as possible? Another option is to make a book-like pdf, possibly using LaTeX. Assuming people go as far as the download page, will they be willing to get the pdf? Is it easier to read?   Second, how do I let other people know? I can't just barge into forums spamming about how great my system is. Should I look for contests or challenges, like the 24Hour RPG? Is there any point to posting on social news/bookmarking sites? Is it good form to contact game review sites and ask them to consider my game?  Feel free to ignore the secondary questions if you want to; they're there only to expose my reasoning thus far and to inspire answers.


Splitting a set into two uncountable pieces

Suppose I have an uncountable set $S$ that I obtained in a non-constructive way, like from the Axiom of Choice. In my particular example I'm thinking about a basis for $\mathbb R$ as a vector space over $\mathbb Q$.   I'd like to remove uncountably many elements into a set $T$ but in a way that leaves uncountably many elements behind. But because I don't know anything in particular about the specific elements of $S$ I don't know how to use the Axiom of Specification or some other method to be confident that I can correctly make a subset of the right size. For example, I could try $\{s \in S : s \geq 0\}$ but my basis doesn't have to have any negative elements, right? Or it could have all negative elements or a mix. If I just wanted $T$ to be countable or finite I could just draw a single element from $S$, say $s_1$, and then draw $s_2$ from $S \backslash \{s_1\}$, and so on (right?). But if I want $T$ to be uncountable this doesn't seem to help.  So can I simply say "Let $T$ be an uncountable subset of $S$ such that $S \backslash T$ is also uncountable"? Is that a thing I can just say that I can make? Or do I need to come up with a formula $\phi$ such that I can use Specification via $\{s\in S : \phi(s)\}$? For a set like $[0,2]$ I have no problem doing this because $\{s \in [0,2] : s \leq 1\}$ does the trick, and since I know it's possible in some way I'm not worried about not exhibiting a particular formula $\phi$. But with a set where I don't even know a single element of it, I'm not sure what to do.  Can I prove that $S$ must have such a subset $T$? If not, then I'd have an uncountable set where every subset is either countable or cocountable. Is there an issue with that?


Limit of this recursive sequence: $x_{n+1}=\bigl(1-\frac{1}{2n}\bigr)x_{n}+\frac{1}{2n}x_{n-1}.$

Consider the following sequence :  $x_{0}=a$ , $x_{1}=b$ ,  $x_{n+1}=\bigl(1-\frac{1}{2n}\bigr)x_{n}+\frac{1}{2n}x_{n-1}.$ Find $\displaystyle \lim_{n\to \infty}x_{n}.$  I calculate $x_{2}$ , $x_{3}$ ,$x_{4}$ ,but I could not find any relationship  between any two consecutive pair. But I found that the sum of the coefficients of $a$ & $b$ is equal to the term in denominator in each $x_{i}$.  How we find this limit...?


Do I need to reindex my table in mysql after delete?

I have a table in mysql with a lot of INSERT and SELECT at every second. And there is a bulk delete of some older data once in a day. Do I need to reindex the table after delete? I want to increase the performance. Can anybody suggest some tips? Using 'innodb' as engine. Do I need to change it? I think its better for concurrent insert and select. pls give your suggestions. Do I need reindexing?  Thanks in advance..


Change font size mid document consistently

How can I cange the fontsize mid document to have the same effect locally as setting the fontsize in the documentclass globally.   Consider the following minimal example:  \documentclass[a4paper,12pt]{article}  \pagestyle{empty}  \begin{document}  \section*{Text in 12pt}  Some text  \footnotesize footnotesize  \small small  \normalsize normalsize \large large    \newlength{\FSize} \setlength{\FSize}{10pt} \newlength{\Baselineskip} \setlength{\Baselineskip}{1.2\FSize} % Compare http://tex.stackexchange.com/a/94385/4011  \section*{Text in  10pt}  \fontsize{\FSize}{\Baselineskip}\selectfont  Some text  \footnotesize footnotesize  \small small  \normalsize normalsize \large large   \end{document}   This gives the following output     As you can see, this is not what I wanted, setting the font size this way locally it doesn't have locally the same effect as correspeondingly setting the fontsize in the option of the documentclass globally. For example commands like \section or \small are not changed (but if I change the font in the documentclass they do change).  So is there an easy way to achieve this?


The number $e$ (and the exponentiation function $e^x$) appears in so many places in mathematics and engineering. There seem to be a multitude of applications of it. I want to know why.


I found a user that have only . Trying to open main profile via  on the meta profile page gives 404 error. I don't think this is normal.  is currently banned in chat for 189 days:    Parent user link refers to already mentioned 404 page.


Virus on vdi files dangerous for host machine?

I want to use the preinstalled vdi files from virtualboxes.org because it saves me time having it already built for me (what's not to like?). I don't know if they have viruses on them (they very well might). I am running a Windows 8.1 host, and I want to use a linux distribution from this site (specifically Damn Small Linux) So does running these files in VirtualBox pose a threat to my windows 8 system?


Could the Android App be made available via Stack Exchange?

I own a Amazon Kindle Fire tablet, and was slightly disappointed not to see the  available on the , although there are some third-party apps available:    My original request was going to be this:     Could the Stack Exchange Android app be made available on the Amazon Appstore?   However as I thought this, it could start to get tricky maintaining the app (e.g, for each new version, submission to three appstores & two different platforms), and I'm uncomfortable sideloading or using the third-party apps available:   I don't want to risk my data being sent off to some hidden server, to be mined (especially my username & password); The designs of thirty-party apps aren't... in the spirit of Stack Exchange; Sideloading would mean I would have to download the app from a third-party, which may have infected it with malware/naughty things   Despite being relatively low-rep, I have worked hard for my reputation and have no intention to lose it (so please don't say "you're low-rep, it wouldn't matter if your account got stolen").  This leads me to ask this: Could the Stack Exchange Android App be made available via the Stack Exchange website?


What would Xt and delta Xt equation look like?

I have this SARIMA model, but I need to make final equations out of it. Can you help me out with this one? I am lost for 4 days.    This is not DUPLICATE! I know there are a few "explanations" how to make it. I'm stupid sorry. I just need to pass this stupid class and never look at it again


smartsputnik.ru became my default search engine, replacing Google search

I had a major problem trying to get smartsputnik.ru from being my default browser. I'm pretty sure that it came from some weird Japanese game my neighbor's kid downloaded recklessly from some site.   I tried removing it from Google Chrome through the settings but I can't remove it. This is what Chrome tells me:      This setting is enforced by your administrator.   I haven't seen that before, nor did I know that was even possible. I checked the only other browser on my PC, IE. And smartsputnik was there as well. Also I went to regedit and looked for the "smartsputnik" keyword using 'Find'. All I saw was one value and I deleted it. I ended process trees of those that I haven't seen before. But I saw some of them coming back.  I've reset Chrome settings afterwards but the problem persists.  I don't want to mess anything else since I'm more of the game developer type.   I also tried SystemLook program from what I've read in the internet. But that was for another malware. I didn't understand the logs I got and don't want to mess with it as well.  I'm all out of options here.  I need to remove this search engine and anything related to it. It's in Russian language so I don't need it even more.


Printing a handout of a Beamer presentation, the resulting pdf is shrunk!

I use the code below to produce handouts of my presentations.  When I open the resulting pdf with any pdf viewer, it is viewed correctly, but when I print it, it is always printed very small, no matter the program I use (Okular, Evince, Acrobat...). Bonus to anyone that can make the pdf be printed correctly by Okular under Ubuntu! Thanks!  MWE here:  \documentclass[handout]{beamer} \usepackage{pgfpages} \pgfpagesuselayout{2 on 1}[a4paper,border shrink=5mm] \setbeameroption{show notes on second screen=bottom}  \setbeamercolor{background canvas}{bg=pink}  \mode<presentation> {     \usetheme{Singapore} } \begin{document}   \begin{frame}[plain]     \titlepage   \note{     Notes for the title page } \end{frame}   \section*{Outline} \begin{frame}[plain] \frametitle{Outline}     \tableofcontents  \note{     Notes for the table of contents } \end{frame}   EDIT:   If I place the line "\pgfpagesuselayout{2 on 1}" after the line "\setbeameroption{show notes}" I do not experience the printing problem anymore!! However, the slide preview and notes that appear at the bottom belong to the NEXT SLIDE, instead of to the CURRENT SLIDE!! What is going on with that?


Cannot set the value of lightning:inputfield when its a picklist and using lightning:recordEditForm

Related to a previous question but with a reproducible example, i just can't seem to set the value of any picklist fields when using lightning:inputField, any ideas?  Component  <aura:component implements="flexipage:availableForRecordHome, force:hasRecordId">     <div class="slds-p-bottom_large slds-p-left_large" style="width:500px">         <lightning:recordEditForm aura:id="recordViewForm"                                       recordId="{!v.recordId}"                                      objectApiName="Contact">             <lightning:messages />             <lightning:inputField fieldName="FirstName" />             <lightning:inputField fieldName="LastName" aura:id="lastname"/>             <lightning:inputField fieldName="Birthdate" />             <lightning:inputField fieldName="Phone" />             <!--Picklist-->             <lightning:inputField fieldName="Country__c" aura:id="Country__c"/>             <lightning:button label="Update" variant="brand" onclick="{!c.update}"/>         </lightning:recordEditForm>     </div>     </aura:component>   Controller  ({         update: function(component, event, helper) {         //alert(component.find("Country__c"));         component.find("Country__c").set("v.value", "Ireland");     },  })


Stuck calculating the derivative of $f(x)=\log_{10}{\frac{x}{1+\sqrt{5-x^2}}}$.

I have to calculate the derivative of this:  $$f(x)=\log_{10}{\frac{x}{1+\sqrt{5-x^2}}}$$  But I'm stuck. This is the point where I have arrived:  $$f'(x) = \frac{(1+\sqrt{5-x^2})(\sqrt{5-x^2})+x^2}{x(\ln 10)(1+\sqrt{5-x^2})(\sqrt{5-x^2})}$$  How can I simplify? I didn't include all the passages.


Check if multiple elements with same class exist

Wonder if there's any way to check if elements with the same class exists in a document.  For example:
panel 1

panel 2

panel 3
   JS:  if ( $('.panel')[0] ) {     console.log('exists') }   .. but I want to check if MORE THAN ONE panel element exists, alteast 2.


I have a game that is 44 days since the opponent played and one that is 22 days. When will they be closed? I play on Android


How can I convert an integer into its verbal representation?

Is there a library or a class/function that I can use to convert an integer to it's verbal representation?  Example input:     4,567,788`   Example output:     Four million, Five hundred sixty-seven thousand, seven hundred eighty-eight


HashMap - Getting "Can only iterate over an array or an instance of java.lang.Iterable"

How do I search for a Hashmap that contains String as a key and list of objects as value?  HashMap<String,List<PageObjectBaseClass>> ObjList1;   When I used  for (HashMap<String,List<PageObjectBaseClass>> map : ObjList1)   Am getting the error "Can only iterate over an array or an instance of java.lang.Iterable"


How do I make the following question precise?(TIFR GS)

This is a question from TIFR GS $2011$.But I think this is a stupid question or the question is not precise.This question asks if given $A,B$ matrices of order $3\times 3$ ,and $A$ invertible,there exists any $n\in \mathbb Z$ such that $A+nB$ is invertible.My simple answer would be yes,because $n=0\in \mathbb Z$ and $A+nB=A+0B=A$ which is of course invertible as $A$ is invertible.  Can someone help me to figure out if this question is stupid or the question should be made precise.If it the latter case,then one may write the precise version.I am also looking for a proof of this problem with linear transformations.  Also can someone suggest similar or more general results related to this problem?


Why should a diode be placed parallel to the coil?

I'm looking at connecting relays,  In the schematic found on this site, the diode is placed in parallel. Why would this be the case? If the diode is there to circumvent large voltage flow back, wouldn't this skip pass the diode and go straight to the arduino?


Setting up a Home Sync/File/Backup Server

I'm about to buy a new laptop, and I would like to turn my old PC into a file/backup server.  I have 5 "client" computers beside the server machine. 1 of the clients (mine) will run Arch Linux, and the rest Windows (7/XP). The server will also run Arch Linux.  Here's the setup I would like to have:   Each client has a configurable list of directories it synchronizes with the server periodically. These directories should be stored in a separate directory on the server for each client (i.e "the client's directory on the server"). There are "shared" directories to which multiple clients synchronize, each machine can modify the directories and the changes will appear in all other machines when synchronized. Those shared directories are, too, stored on the server under "the shared directory on the server". It is important that the clients won't be over-privileged on the server, and each client would only be able to backup/restore his own directories and the shared directories - but nothing beyond that It is preferred that the transfer be encrypted, but not mandatory...   So, to conclude - a dropbox-like mechanism with private directories for each client and shared directories between clients, with a central server hosting a copy of the contents and coordinating the synchronization between the clients.    Some other points (which I am technically capable of implementing at the moment):   I can then make copies of the data locally on the server from time to time (versions). Each client will be able to SFTP into his directory on the server (to which he's chroot'd) and access his files remotely, and all clients will have chroot'd access to the shared directory via a shared user.     After describing my thoughts, can you advise me how to implement the "dropbox-like" part, following the requirements I mentioned? (or something close, I'm flexible)


When I make a cross reference with \ref inside the paragraph, resultant chapter includes extra vertical space after the reference line.    When I make a \ref at the end of the paragraph, space between that paragraph and next paragraph becomes more than normal. So adding a cross reference adds extra vertical space in any case.    When I add multiple cross references in a paragraph, this makes this vertical space bigger. For example 4 reference makes that space 4 times bigger.    What would be the cause for this extra vertical space ?  You can find my example from following link


What's the "limit" in the definition of Riemann integrals?

Consider one of the standard methods used for defining the :       Suppose $\sigma$ denotes any subdivision $a=x_0<x_1<x_2\cdots<x_{n-1}<x_n=b$, and let $x_{i-1}\leq \xi_i\leq x_i$. Then if    $$|\sigma|:=\max\{x_i-x_{i-1}|i=1,\cdots,n\},$$   which we shall call the norm of the subdivision, we define:   $$\int_a^bf(x)dx:=\lim_{|\sigma|\to 0}\sum_{i=1}^nf(\xi_i)(x_i-x_{i-1}).$$   When one talks about the limit of a function $\lim_{x\to x_0}f(x)$, one has exactly one value $f(x)$ for every $x$. However, for every $|\sigma|$, the value of the Riemann sum $\sum_{i=1}^nf(\xi_i)(x_i-x_{i-1})$ is not necessarily unique. Using the $\epsilon$-$\delta$ language, one may restate the definition as follows:     Suppose $f:[a,b]\to{\mathbb R}$, $J\in{\mathbb R}$. If for all $\epsilon>0$, there exists $\delta>0$ such that for any subdivision $\sigma$ and $\{\xi_i\}$ on $\sigma$ (i.e. $x_{i-1}\leq \xi_i\leq x_i$), $|\sigma|<\delta$ implies   $$|\sum_{i=1}^nf(\xi_i)\Delta x_i-J|<\epsilon,$$   we call $J$ is the Riemann integral of $f$ on $[a,b]$ and denote   $$J=\int_a^bf(x)dx.$$   Here are my questions:   How should I understand this kind of limit? It seems that this is not the "limit of a function" I learned in elementary real analysis. Where does it appear in mathematics besides the definition of Riemann integrals?


Which SI units should I use to describe the length of this question?

I’d like to describe the length of the question text. I’m fairly certain that is not outside the realm of physics, however if I measure it in “bytes” it’s not clear to me how to convert that to SI units. My best guess would be to find the temperature $T$ of the hard drives where copies of this string are (it gets sent from the Stack Exchange server  over EM waves to the antenna on my phone, then stored locally on the hard drive, then transmitted via light in the visual range from my screen to the cameras in my head [my eyes!], then stored locally in my brain), and get a bound using Landauer’s limit $kT\ln(2)$ for the minimum energy it takes to erase one of those bits. If the length of this string can’t be measured in SI units, is it outside the realm of physics? Another way to phrase this question is why, exactly, isn’t “bit” an SI unit directly, and does that imply that physicists are not yet ready to admit that information is part of the physical world?


Does the Detect Magic spell reveal the presence of a wizard?

The  spell description states:     For the duration, you sense the presence of magic within 30 feet of you. If you sense magic in this way, you can use your action to see a faint aura around any visible creature or object in the area that bears magic, and you learn its school of magic, if any.   In  question it is said that detect magic can reveal the presence of a sorcerer. What about other classes, like clerics (whose magic has a divine origin), or wizards?


Debian package with dependency to package in unconfigured PPA

I'm creating a debian package primary.deb (custom, home-made package for internal use) that depends on secondary.deb (hosted in external PPA). I'd like the users of primary.deb to not explicitly have to add the PPA to their package manager by running a command before installing it. Is there a way to pre-download secondary.deb, include it in primary.deb and have it automatically installed during the installation of primary.deb? There is a  that answers this question with no. However, almost 7 years have passed and I'm wondering if the situation changed.


Update HTML when change is noticed in MySQL Database

So sorry if this is a total newbie question, but I can't seem to find any answers to my question out here on the great web...  I'm building a site, where it depends that some of the data on the page needs to be updated automatically....  More specific, when a change is made in the MySQL Database. Let's say for instance that the value of a row in the database is 10, and that changes to 11, I need the page to automatically get this from the database, and update it on the site. Also, if possible, is there any way I could make the numbers "pop out" a little bit, when the actual data is changing?

Test Data Change

231

7

14532

   Let' say that these numbers are fetched from the database, how would I use 'AJAX' to auto change this data when a change is made to the database?  If this is possible at all, I would appreciate every contribution.....


Did this character lose a limb in “The Force Awakens?”

Inspired by  which states limb loss as a recurring theme, I started thinking about the final lightsaber battle. After watching The Force Awakens the second time, I was not sure if      Kylo Ren   lost a limb or just lost his lightsaber. We definitely see      Rey slash at Ren’s right hand.   So knowing that context:      Did Kylo Ren actually lose his arm/hand?


An example of a non-abelian group of order $p^3$

Let $p$ be prime and consider the set of all matrices $$\begin{bmatrix} 1 & a & b \\ 0 & 1 & c \\ 0 & 0 & 1 \end{bmatrix}$$ where $a,b,c \in \mathbb{Z_p}$. This set forms a non-abelian group of order $p^3$.  Any ideas how to prove using group actions?


Why don't you say "the" in this sentence?

I asked a friend of mine who lives in France, who isn't so good at speaking the English language, if she has a favorite animal and she answered with:     Yes I like the cats.   I told her that you don't say "the" in this sentence but I don't know why; I just know that it its wrong. Can anyone help me explain why this is so?


Rotation, cats landing on their feet, and conservation of angular momentum

Let θ be the orientation (angle) of a body (such as a cat), and let ω be its angular velocity.  It is well-known that θ can change even when the body is not rotating, using the conservation of angular momentum; that is, even when ω = dθ/dt = 0. That's how cats land on their feet so well.  But how can θ possibly ever change, when its derivative is zero?! What's wrong with the math?


I saw a function like   public FuncA(string param1, IList<SqlParameter> sqlParamsList)   I wonder why the author was using IList instead of List? Which one is better? I know the difference between them is one is interface, the other one is class. So my final question is when to use which?


How to fill in areas surrounded by line segments?

I have a rectangular shape and I added an "extension area" to it with several line segments and closed it back to the rectangle.   Specifically, I clicked on an anchor point off a corner of the rectangle drew several line segments off this point and connecting each by the anchor point of each segment. I drew and closed off this shape by drawing the line segment back to the rectangle's anchor point.   How do I fill in this new area with a color?   In the example below I'd like to fill in the "polygon shape" that's extended off of the rectangle with some non-white color. When I select the rectangle and polygon, I get a question mark: "?" in the fill area.


What's the actual speed limit on highways in California?

I am travelling in California this month with my car. I noticed that while the speed limit on highways is 65 MPH in most sections, people typically drive at 75-80 MPH. What's the actual speed limit on highways in California above which we get taxed speeding tickets?


Prove Binom Sum $\sum_{k=0}^n(-1)^k \binom{n}{k} = 0$

Let: $$ (-1)^0=1 $$ I need to prove that: $$ \sum_{k=0}^n(-1)^k \binom{n}{k} = 0 $$  Thanks!


A voltmeter is connected in parallel across the load. Why?

Voltmeter is connected in parallel across the load. Why?


Proving this identity $\sum_k\frac{1}{k}\binom{2k-2}{k-1}\binom{2n-2k+1}{n-k}=\binom{2n}{n-1}$ using lattice paths

How can I prove the identity $\sum_k\frac{1}{k}\binom{2k-2}{k-1}\binom{2n-2k+1}{n-k}=\binom{2n}{n-1}$?  I have to prove it using lattice paths, it should be related to Catalan numbers  The $n$th Catalan number $C_n$ counts the number of monotonic paths along the edges of a grid with $n\times n$  square cells, which do not pass above the diagonal.  See for example    For example $\frac{1}{k}\binom{2k-2}{k-1}$ is exactly $C_{k-1}$, and the other terms can also be expressed in terms of the Catalan numbers.  The second part of the exercise ask to prove the recurrence formula $C_n=\sum_{k=1}^n C_{k-1}C_{n-k}$ using similar reasoning (i.e. lattice paths). So we can't use this formula to prove the first.  Could you help me please?


Continuous and discrete basis of Hilbert Space

Any state in Hilbert space $|\phi\rangle$ can be expressed in terms of a complete basis $\{| v_i\rangle, i=1,2,...\}$ as  $$|\phi\rangle=\sum|v_i\rangle \langle v_i |\phi\rangle . $$ Now, if I understand this correctly, Hilbert space has the dimensionality of the complete basis. In other words, if any state can be expressed as a linear combination of, for example, three orthonormal vectors, then Hilbert space has dimension $d=3$.  Now, in many examples of QM the wavefunction can be expresed in terms of a discrete basis (like the energy eigenstates): $$|\phi\rangle=\sum_i|E_i\rangle \langle E_i |\phi\rangle , $$ or in terms of a continuous basis (like the momentum eigenstates):  $$|\phi\rangle=\int|p\rangle \langle p |\phi\rangle dp . $$ Is this correct? How can any state in Hilbert space be expressed in terms of a discrete sum and an integral? What is the dimension of Hilbert space then?  Also, the $\{|p\rangle\}$ doesn't behave like the discrete basis because the state $|\phi\rangle$ can't just be any linear combination of this basis.  There are some posts here that are related to this question but none of them point specifically to this issue. For instance  a similar question was addressed. However, the context of that question implied that the basis functions must be square integrable, which then resolved the issue. However, here the question is placed in a broader context that also allows basis functions that are not square integrable, such as for instance the momentum basis. So I hope it can help to enlighten the problem.


How to calculate the shortest geographical distance between a line and a point?

I'm trying to calculate the shortest distance between a line (described as a pair of [lat, long]s) and a point (lat, long) accurately. I've read many Wikipedia pages, but I'm new to the topic. I've read  question, but I'm still confused, because they say that      Literally, a "straight line" will pass beneath the earth's surface.   while my line lies on the surface of the Earth. How can I calculate this?


Keyboard shortcut to lock the screen on macOS 10.14 Mojave?

Is there a keyboard shortcut to lock the screen on macOS 10.14 Mojave like Command + L or something easy without setting up Hot Corners/Spaces etc.  The app  used to work fine till maOS High Sierra, but isn't starting up on macOS Mojave. It is showing this popup as soon as I try to run it:    Is there an app that works on Mojave which helps to customize the lock keyboard shortcut to Command+L? I am used to using Command+L on windows and older Mac OS (using "Lock me now" app).


Let $w$ be a primitive root. That is $w$ has order $p-1 \mod p$. Evaluate $$\left(\frac{w}{p}\right)$$ This is the task I am faced with so far I have only $w^{p-1}\equiv 1 \mod p$  I am having some difficulty with this problem could anyone point me in the right direction thanks. I normally like to note more of my thoughts but I have been thinking about this for a while and nothing of substance has appeared?


Here's what I have currently, and I'm looking to upgrade the RAM to 4Gb. Trouble is I have no idea what to buy! Main Circuit Board  Board: ASUSTeK Computer INC. P5KPL-AM  Serial Number: MT7088K00628521 Bus Clock: 200 megahertz BIOS: American Megatrends Inc. 0309 05/20/2008  Memory Modules  2040 Megabytes Usable Installed Memory Slot 'DIMM A1' has 1024 MB Slot 'DIMM B1' has 1024 MB


Let $X$ be an integral scheme of finite type over a field $k$, having function field $K$. We say that a valuation of $K/k$ has center $x$ on $X$ if its valuation ring $R$ dominates the local ring $O_{x,X}$. In part (c) of the question, we are asked to show if every valuation of $K/k$ has a unique center on $X$, then $X$ is proper over $k$. I am awared that this question was asked in  and I also found a solution in . It seems to me that, by using induction, this question come down to showing that for any irreducible reduced closed subscheme, $Z$, of $X$, $Z$ satisfies the conditions on $X$. That is, I want to show, if every valuation of $K/k$ has a unique center on $X$ and $L$ is the function field of $Z$, then every valuation of $L/k$ has a unique center on $Z$. How do I show this?


Why are beta distributions commonly chosen for priors?

Is there any specific reason why a Beta distribution would be chosen as a prior, other than that it is conjugate for the Binomial?


If a massless observer is going at the speed of light, what speed will it measure of a light beam going parallel to it?


Root volume /dev/mapper/centos-root full

On one of my host, i have /dev/mapper/centos-root reporting almost full (99%), here is output of df -h.  ==  [root@LA3QSSD02-20217 /]# df -h Filesystem                                       Size  Used Avail Use% Mounted on /dev/mapper/centos-root                           50G   50G  540M  99% / devtmpfs                                          63G     0   63G   0% /dev tmpfs                                             63G   64K   63G   1% /dev/shm tmpfs                                             63G   18M   63G   1% /run tmpfs                                             63G     0   63G   0% /sys/fs/cgroup /dev/sdy1                                        494M  210M  285M  43% /boot /dev/mapper/centos-home                          411G   33M  411G   1% /home /dev/mapper/datastore-datastore                   11T  548G  9.1T   6% /datastore  /dev/mapper/data-sdx                             734G   73M  734G   1% /data-sdx  /dev/mapper/data-sdf                             734G   73M  734G   1% /data-sdf /dev/mapper/data0                                734G   80M  734G   1% /data0  /dev/mapper/data-sdd                             734G   73M  734G   1% /data-sdd  /dev/mapper/data-sdt                             734G   73M  734G   1% /data-sdt  /dev/mapper/data-sdg                             734G   73M  734G   1% /data-sdg  /dev/mapper/data-sdu                             734G   73M  734G   1% /data-sdu  /dev/mapper/data-sdb                             734G   73M  734G   1% /data-sdb 10.253.48.21:/vol/eq1ag4rdtest01/kvm_ostemplates 3.0T  1.8T  1.3T  58% /vol/eq1ag4rdtest01/kvm_ostemplates tmpfs                                             13G     0   13G   0% /run/user/0   ==  Im unable to find out what is causing / to report full, here is some more details.  ++++  du -sh *  0       bin 229M    boot 5.5M    data0 0       data-sdb 0       data-sdc 0       data-sdd 0       data-sde 0       data-sdf 0       data-sdg 0       data-sdh 0       data-sdi 0       data-sdj 0       data-sdk 0       data-sdl 0       data-sdm 0       data-sdn 0       data-sdo 0       data-sdp 0       data-sdq 0       data-sdr 0       data-sds 0       data-sdt 0       data-sdu 0       data-sdv 0       data-sdw 0       data-sdx 698G    datastore 152K    dev 24M     etc 320K    home 0       lib 0       lib64 0       media 0       mnt 171M    opt 0       proc 160M    root 115M    run 0       sbin 20K     sharedstore 0       srv 0       sys 40K     tmp 2.6G    usr 1.8G    var 1.7T    vol   +++++  Please help me in find out what is consuming space on / and how to free it.   Thanks  Regards Aun


How can have a unit vector symbol without bold?

This is the following question from   This given have bold, but I just want ordinary without bold. How can I do that?    \documentclass{article} \usepackage{bm} \newcommand{\uvec}[1]{\boldsymbol{\hat{\textbf{#1}}}} \begin{document} $\uvec{\i} \uvec{\j} \uvec{k}$ \end{document}   I had tried:  \newcommand{\uvec}[1]{\hat{\textbf{#1}}}   and   \newcommand{\uvec}[1]{\boldsymbol{\hat{#1}}}   not working.


Remove blank pages in twosided book class without openany

I am writing my thesis using   \documentclass[12pt,a4paper,twoside]{book}   At the end of chapters, I get a blank page. This is because chapters start from right side (Odd page number, [RO] and that at the end of each chapter book.cls has a \clearpage by default. I do not want Openany as a solution.  How do I adjust my TeX document then to remove these blank pages?  thanks


Transmission tracker and/or torrent traffic through proxy

I am trying to get Transmission to connect through a SOCKv5 proxy.  I am not able to find any settings in the graphical interface to Transmission that allows me to change proxy server for the program.   Is there any other program that could help me tunnel the transmission traffic - for example like Proxifyer for Windows?


Confusion on Derived Sets and the $n$-the Derived Set

I want to solve the following exercise 1.3.C. from page 27 of R. Engelking: General Topology.  For every positive integer $n$ the $n$-th derived set $A^{(n)}$ of a subset $A$ of a topological space $X$ is defined inductively by the formulas: $$  A^{(1)} = A^d \quad \textrm{and} \quad A^{(n)} = (A^{(n-1)})^d. $$ (a) Give an example of a set of real numbers that has three consecutive derived sets distinct from each other.  (b) Give an example of a set of real numbers that has infinitely many derived sets distinct from each other.   The definition is $$   A^d := \{ x \in X \mid x \in \overline{A \setminus \{ x \}} \}. $$ I am confused, cause the set $A^d$ ist closed, i.e. $\overline{A^d} = A^d$. And closed means it already contains all its limit points, so how can than $(A^d)^d$ be different from $A^d$?


Does $f(x) = 1 = \frac{x-1}{x-1}$ have a hole at $x=1$?

While learning about asymptotes and holes in rational functions in Precalculus, I came across a problem that shouldn't happen, but I don't understand. Something just doesn't add up in my head... Here we go:  Let f(x)=1. Since $\frac aa=1$ and $a*1=a$, obviously $a={a*b \over b}$. Let $b=(x-1)$. We can multiply f(x) by 1, technically, by saying that: $$f(x)=1={x-1 \over x-1}$$ However, a bit of precalc knowledge shows us that ${x-1 \over x-1}$ has a vertical asymptote at x=1, and an x-intercept at x=1 as well. This means that the graph has a hole, or is undefined at, x=1. (Because plugging in 1 for x yields a denominator of 0, which is undefined.) However, this is absurd because the graph of $f(x)=1$ obviously has no holes, anywhere. Somehow, multiplying this extremely simple function by something equivalent to 1 makes it undefined at a particular point...  Whaaaaa...?  EDIT: I realize that the above function does not have a vertical asymptote. However, my statement was referring to the fact that it appears to have both a vertical asymptote and an x-intercept at the same x-value, which means that it has neither of those things, just a hole.


$$\sum\limits_{n=1}^\infty {(-1)^n \over (2n+1) 4^n}$$  I know the methodology of solving this kind of equations, though I'm having trouble preparing the expression for integrating. I have no idea what to do with -1 and how to go to 2n power.


Is there any tool to give me the merged version of two .css files?

I have two .css files that I want to merge them. Something like what git dies. All I'm looking for is a tool like git which gets two files as input and generates a file as output which is the merged version of those two input files. Is there such a thing?  For Example: /* file1.css */ .header{     background-color: #f1f1f1;     font-size: 13px; }   /* file2.css */ .header{     background-color: #f1f1f1; } .footer{     background-color: gray;     position: reletive; }   /* expected_result.css */ .header{     background-color: #f1f1f1;     font-size: 13px; } .footer{     background-color: gray;     position: reletive; }


I want the symbol of partial derivate  exactly like this Because I don´t like the original symbol of partial derivate


Do spells like burning hands specify specific non-material components?

In , it has been established that burning hands does indeed require touching thumbs. A question that is danced around there is, "is the touching thumbs the somatic component?" This question also extends to spells like dissonant whispers (verbal component) and message (verbal/somatic component). In other words, when a spell specifies something in its description, outside the component list, that could be nonetheless be construed as the component, is it in fact a component, or even the component? I'm inclined to think such descriptions are the component, but am unsure. This does have some weird implications if so, like "how loud does one dissonantly whisper?" and "can someone else hear my whispered message?" (I don't need these answered here; I just include them because they are related, depending on the answer.)


How to check what TLS protocol FuelSDK-PHP is using?

I think the FuelSDK-PHP is using TLSv1, so the question is how to check it.. and how to get it to v1.2, if thats even possible?  This is for PHP not for JAVA, as the other thread is.


Any two points in a Stone space can be disconnected by clopen sets

Let $B$ be a Stone space (compact, Hausdorff, and totally disconnected).  Then I am basically certain (because of Stone's representation theorem) that if $a, b \in B$ are two distinct points in $B$, then $B$ can be written as a disjoint union $U \cup V$ of open sets where $a \in U, b \in V$.    However, I can't seem to prove this directly.  The proof should be fairly straightforward, so I am sure I'm missing something obvious.  (As an exercise for myself, I'm trying to prove Stone's representation theorem, and I need this as a lemma.)


Select 2 lowest values from a query in SQL

I am trying get information of 2 lowest salary holders from default "scott" table.   This is the query I am trying:  SELECT TOP 2 * FROM emp ORDER BY sal ASC   But I'm getting this error:     ORA-00923: FROM keyword not found where expected   Screenshot:


How to reload environmental variables in .profile using source for entire session?

So I need to reload my profile after making changes (this time due to a typo). I run source ~/.profile and everything works perfectly fine.  However the source command only applies to that terminal session. This means I'm running the command every time I open up a new terminal. I want to find a way to apply the .profile/environmental variables to the entire user session without logging out, not just the current terminal.   Is there a package or command that can execute this type of change by reloading the profile like it loaded on login?  EDIT: To clarify that it is not a duplicate I don't want to use:  source ~/.profile   or   . ~/.profile   As they only effect changes on one terminal session. I want to effect changes across all started terminals from my user session. I already have changes in the current terminal session using those commands. I need them in newly opened terminal after I run the command (which to clarify I don't currently have. the changes are only effecting the current terminal and my question is to effect these changes across multiple terminals


Is there a field on the Case object that specify the Email-to-Case email address that created the case?


Create a better way to organize favorites

I've got six pages of favorites on Stack Overflow. Many of those questions are on different topics. I'd really like to have some way of organizing them.  Of course those questions are already tagged so that should be enough, but I can't find any way of showing only favorites with a certain tag.  If it's possible, how do I do that? If it's not possible, then please implement that :)


I have already burned the DVD from the ISO for Kubuntu 15.10.iso image. ISO verifies fine. But I read we are to verify the DVD also. I ran:  $ sha256sum /dev/cdrom 758061ca3be30128dca74e3f73b5dd6e76fb5047c0c4e0743f22786fb0a02dd0  /dev/cdrom   The only thing is, the download site tells you how to do the checksum, but there is no listing of what the hash response should be. I checked the entire site I believe.  Can someone please share the correct hash response for Kubuntu 15.10 64bit ISO? And provide  link to where it is officially listed please.


So I download a web page video game player. And I think it infected my system with a fake explorer.exe that uses from 100,000k RAM to 5,000,000k RAM. I have done everything in my power to get remove the virus. I have run anti virus programs and even run them in safe mode. Nothing has helped. If anyone have any ideas, please help me. Thank you.  Edit 1-1-2015  After removing Adobe Flash 15. The usage of RAM was down sized.


Prove that $\frac{\partial x}{\partial y}\frac{\partial y}{\partial z}\frac{\partial z}{\partial x}=-1$ given a function

I am trying to solve the following exercise. I have the feeling that it is a very simple one, but I am lost. I do not know where to start, because you do not have an specific function. The exercise says:     If   $$F(x, y, z)=0$$   prove that   $$\frac{\partial x}{\partial y}\frac{\partial y}{\partial z}\frac{\partial z}{\partial x}=-1$$   I would appreciate any help you could offer.


What is the Python equivalent of Perl's chomp function, which removes the last character of a string if it is a newline?


I received 4 upvote on an answer with accepted but I received 35 Reputation only.  It should be 55. Why I received only 35?  Any reason?


In middle school I read a 'young adult' book - again I don't remember the name of the book or the author, and in this one, the year is more flexible, I got it from the school library in the mid-80s, which means there's a good chance it was originally published in the 60s or 70s.    In this story the protagonist is a teenager who wakes up from a coma in the future.  I specifically remember the opening scene when he wakes up - there's a guy with robot eyes (it turns out the doctor had somebody throw acid in his face prior to the events of the story) and three nurses who were identical (clones) but with brightly colored hair (blue, purple etc, at a time when dying one's hair as such was a lot more novel than it is now).  I can't remember what put him in the coma or why he was revived when he was (he may have simply woken up).    I recall a lot of it was about him trying to make sense of the new world he was in, and there was an ecology theme, cause the oceans were an oily yellow and lifeless (I remember one character telling him that maybe since he remembers the oceans as they were before mankind ruined them, that he'd be able to figure out a way to revive them - this seems like an insignificant detail, but I just read on the 'How to write an ident question' page that no detail is too measly), and the overall the state of society was worse than that of the one he'd left behind.   I also don't remember how this ends, although I'm pretty sure it was along the standard lines of 'hope for the future despite uncertainty'.


Copy the Entire SharePoint Online Site Collection to another Office 365 Tenant

I've developed a Site Collection for one client of mine (custom pages, webparts, lists, libraries modified master pages, customized settings, custom people groups, SPD workflows etc.).  Now I have another client that requires the completely same Site Collection (another branch of the company) on another Office 365 tenant.  I am wondering what would be the best way of migrating everything as it is, so I don't lose any of the data/configuration.  I had a look  and , but I am not 100% sure if that will migrate everything.  Could somebody please advise me on this?  Thanks in advance!


I heard you have to go to a guild or be at like level thirty-something. So how do I find that guild?


Factorial Inequality problem $\left(\frac n2\right)^n > n! > \left(\frac n3\right)^n$

I met an inequality, I ask, do not mathematical induction to prove that:     Prove \[ \left(\frac n2\right)^n > n! > \left(\frac n3\right)^n \] without using induction


How did Neo destroy Smith in The Matrix Revolutions?

In the final fight between Neo and Smith, Smith absorbs Neo and then blows up. Why did this happen?  I've heard some theories suggest that it was because Smith fulfilled his purpose and the system deleted him. But I have 2 problems with this:   Smith normally didn't play by the rules and didn't listen to the Matrix, for example he came back from death once before. This makes for a poor story because that means at any time if Neo lost to Smith, the same results would happen and the Matrix would get rebooted. For example, if Neo had died in the first movie after he was shot then wouldn't the ending be the same?   Whatever the reason was that Smith blew up, was it necessary for him to absorb Neo or could he have just killed him?


How to order by StartDate and UserLikeProduct? I need to sort by StartDate but show by UserLikeProduct first.  public IEnumerable<Check> GetHomeCeeck() {         return this.Query()                .Where(c => c.IsPublish && c.IsHomepageProduct)                .OrderBy(c => c.StartDate)                .Take(30)                .ToList(); }


In a bash sub shell I get the following error when running cd  sudo: cd: command not found   This is expected because I don't have a path. Usually to work around this I just provide the full path like so:  (/usr/local/bin/foo)  Much to my surprise, cd does not appear to be in any of the normal places.  which cd whereis cd ls /bin | grep cd   By comparison, ls is right where I would expect.   which ls /bin/ls   Where is the cd command located? And why is different from all the other commands?   Update  Another interesting tidbit, cd does not show up in hash  hash 0   /bin/ls 2   /usr/bin/find 2   /sbin/ip 1   /usr/bin/updatedb 1   /usr/bin/apt-get


What Ownership should `public_html` have so it can use 750? (And not 751)

Question: What ownership does Apache need so that it does not require execute permissions for the world on public_html (751)?  Background: When I changed the php.ini settings through cPanel, there was an error "Error: The EUID, 1005, does not own /home/my_user_name/public_html/.htaccess." I understood this because it was the .htaccess file was owned by root:root,   So, as a green SHELL user I changed the ownership of every file using chown -R my_user_name:my_user_name .[^.]*. Sweet, I could now save my php.ini through MultiPHP INI in cPanel.  That's when this pretty error appeared when trying to visit any page on my Drupal 8 site:     Forbidden You don't have permission to access / on this server. Server   unable to read htaccess file, denying access to be safe      Additionally, a 403 Forbidden error was encountered while trying to   use an ErrorDocument to handle the request.   Even after deleting, reuploading, and changing the ownership back to root:root, it didn't work.  The only thing that worked was changing public_html to 751 (instead of 750). Why does Apache need the execute permissions for the world? And which owner/group do I need to change it to fix it?  754 also didn’t work


Example of closed strict subspace of $L^p$ that is dense in $L^r$ for $r<p$

This is a Stanford Analysis qual question. Any hints\ solutions\ references are highly appreciated.  Let $\mu$ be the Lebesgue measure on $[0,1]$. For $1<p<\infty$ construct   a subspace of $L^p([0,1],\mu)$, which is not dense in $L^p$ but is dense in $L^r$ for all $r<p$. a subspace of $L^\infty([0,1],\mu)$ which is dense in $L^p$ but not in $L^s$ for any $s>p$   I find is interesting that such a thing would hold because:  For 1. by Holder's inequality, for $1\leq q<p\leq \infty$, we have $L^p \subset L^q$.  But of course, the norms are different so I guess what we need is a subspace $M$ closed in $L^p$ but dense in $L^r$ for $r<p$.  Any help will be appreciated. Thanks in advance


I downloaded the latest version of hplip (3.19.5) from . Following the installation instructions, I ran:  sh hplip-3.19.5.run   It all worked well until the last step, where I got the following output:  PRE-BUILD COMMANDS ------------------ OK   BUILD AND INSTALL ----------------- Running './configure --with-hpppddir=/usr/share/ppd/HP --libdir=/usr/lib --prefix=/usr --enable-qt4 --disable-qt5 --enable-doc-build --disable-cups-ppd-install --disable-foomatic-drv-install --disable-libusb01_build --disable-foomatic-ppd-install --disable-hpijs-install --disable-class-driver --disable-udev_sysfs_rules --disable-policykit --enable-cups-drv-install --enable-hpcups-install --enable-network-build --enable-dbus-build --enable-scan-build --enable-fax-build --enable-apparmor_build' Please wait, this may take several minutes... Command completed successfully.  Running 'make clean' Please wait, this may take several minutes... Command completed successfully.  Running 'make' Please wait, this may take several minutes... error: 'make' command failed with status code 2   Indeed, when I run make I get:  make: *** No targets specified and no makefile found.  Stop.


Is there a full featured, job scheduling package available for PHP? I'm looking for the PHP equivalent to Java's . I'm fine having things triggered externally from cron to drive the system. The functionality I'd be looking for:   Ability to register task (class/method) to be called at given intervals. Ability to specify whether a given task can be run multiple times (potentially long running methods should not be run multiple times in certain cases). All registered entries/methods could be run in parallel (jobs are backgrounded so that they do not block other timed tasks). Ability to set a timeout for a given task. Ability to update job control dynamically, so for instance you could disable some tasks or change their frequency without code changes.   I know it is a lot to ask, but it seems like a useful batch of features and I thought someone might have put together some portion of them.  If this or some portion of this does not already exist, any pointers to putting one together or an open source project that has a reasonably featureful implementation of some subset of these?


Inversion of Control (IoC) can be quite confusing when it is first encountered.   What is it? Which problem does it solve? When is it appropriate to use and when not?