I think we need a close reason for generally bad questions that are hard to find a close reason for. Ones that are usually getting shoehorned into "Too Broad" or "Unclear What You're Asking". Something like:     This question shows a complete lack of understanding of the general concepts, and as such is unlikely to be answerable in its current form. A tutorial is likely in order.   and/or     This answer is asking for code or homework help, and shows no effort at solving the problem. It is unlikely to be able to be edited to get better.   If anyone knows what the consensus is on what to do with these questions when they come up, please enlighten me.  TL;DR: It's too hard to choose an accurate close reason for homework / give me code / complete misunderstanding of the language/concepts as a whole questions.


Almost uniform convergence - does $f'(0)$ always exist?

This was a bonus question on an exam:  Suppose $f_n$ is $H(\mathbb{C})$ and $f_n \to f$ almost uniformly. Does that mean $f'(0)$ exists(either always or with some assumptions)?  (Perhaps I'm working on wrong translation - "almost uniformly" means it converges uniformly on every compact set.) I know that if $f_n \to f$ a.u. then $f_n^{(m)} \to f^{(m)}$ a.u. But $f_n$ is entire, so $f_n'(0)$ exists and the answer is yes, always. Is that correct or some assumptions need to be made? I am worried because a.u. convergence means the $f_n$ converges uniformly to $f$ but only on compact sets and that might break my answer somehow.


I am trying to use dynamic_cast - with no success.  I have a BASE class, and a class A derived from BASE.  I want to have a pointer to a BASE class object which I later want to cast to class A.  I clearly am not doing this correctly.  The following code compiles:  #include <cstdio>  class BASE { private:      int i;  public:       BASE(void) {i = 1; }      virtual ~BASE(){}       virtual void id() { printf("CLASS BASE\n"); }  };  class A : public BASE { public:     A(void): BASE() {}     A(const BASE & base) : BASE(base) {}     A& operator = (const BASE & base) { static_cast<BASE&>(*this) = base; return *this; }      void id() override { printf("CLASS A\n"); }; };   int main() {      BASE* base = new BASE();      base->id();      A* a = new A(*base);      a->id();      A* anotherA = dynamic_cast<A*>(base);      if(!anotherA)          printf("anotherA is NULL\n");     else             anotherA->id(); }   but running it gives:  CLASS BASE CLASS A anotherA is NULL   I am sure I'm missing something very basic, but I keep staring at the code and can't see what I'm doing wrong.  Any help would be very much appreciated.  I have looked at    but don't understand why dynamic_cast doesn't work - isn't this just a simple downcast?


Is a rational-valued continuous function $f\colon[0,1]\to\mathbb{R}$ constant?

Let $f\colon[0,1]\to\mathbb{R}$ be continuous such that $f(x)\in\mathbb{Q}$ for any $x\in[0,1]$. Intuitively I feel that $f$ is constant, since $\mathbb{Q}$ is dense in $\mathbb{R}$.  How can I formally write this down?


Avoid splitting of math expressions in text

I am writing a math expression, $P = \omega \tau$, in the middle of my text, and LaTeX splits it such that "P =" is on one line and "\omega \tau" is on the next line. I would like the whole expression to be on the same line. Is there any way to do this in LaTeX? I tried hyphenation, but that only works for words... Thanks in advance!


How to use transactions with SQL Server DDL?

I have a login table into which all inserts are done by a single stored procedure.  CREATE TABLE dbo.LogTable(     LogRefnr int IDENTITY(1, 1) NOT NULL,     LogQuery varchar(255) NOT NULL,     LogTime datetime NOT NULL,     logQueryDuration int NULL,     LogSessionID int NULL,  CONSTRAINT PK_Log PRIMARY KEY CLUSTERED  (LogRefnr) ) go   Create procedure DBO.LogInsert ( @Query varchar(255), @time datetime, @duration int, @SessinID int) as begin     Insert into LogTable ( LogRefnr, LogQuery, logQueryDuration, LogSessionID)     Values  (@Query, @time, @duration, @SessinID); end; GO   Currently there are about 45500000 rows in that table and I want to direct logging to a different table.  My idea is to use the following script  begin Transaction  exec sp_rename LogTable, LogTableOld;  CREATE TABLE dbo.LogTable(     LogRefnr int IDENTITY(46000000, 1) NOT NULL,            -- greater than select max(LogRefnr) from LogTableOld     LogQuery varchar(255) NOT NULL,     LogTime datetime NOT NULL,     logQueryDuration int NULL,     LogSessionID int NULL,  CONSTRAINT PK_Log2 PRIMARY KEY CLUSTERED  (LogRefnr); ) go  sp_recompile LogTable; go  Commit;   Does this work and has minimal impact to other procedures calling LogInsert?


Let $A$ be a subset of $\mathbb N$.$A$ contains 5 elements.sum of any three elements is prime.does $A$ exists ?please give some hints .


I am a student of functional English. My teacher told me to search a difference between two sentences that have almost same structure except the article "THE". And because of this article the meaning of both sentences differ. I have searched many websites but i don't find the appropriate answer. So help me to find the appropriate difference between these following sentences:  1: He goes to School.  2: He goes to the School.


How do I extract the timestamps associated with frames ffmpeg extracts from a video with the -r option?

ffmpeg -i myvid.mp4  -r  25  -t  100  image-%d.jpeg    Is the command I'm using to extract frames and it's working just like I expected. However I'd also like to look at the timestamps of the frames. At whatever precision. 100 miliseconds is good enough for me. Can ffmpeg do this?  Providing additional details,  When I run the above command i get around 100 JPEGs, I guess there is a 1 to 1 (or many to 1) correspondence between these JPEGS and frames of the video. I would like to know the timestamp of the frame that was output as a JPEG image 'i'.   Additionally I tried ffprobe but I find it reports even the video duration inaccurately :(


How can I pack Windows XP ISO that is unpacked into a folder on Ubuntu?

I want to make a multiboot USB stick. I extracted XP.iso into a folder then added winvblock driver that lets ISO load into memory. Now I want to pack folder into iso but it's not that simple since it must be bootable. Is there such a tool that let me pack folder into iso?  EDIT: It's not a duplicate of above mentioned link. I asked to make a bootable iso from folder. In the link it mentions how to create iso image from a folder which is very easy. Anyway I found the answer here:


Are there (or could there be) electrically charged particles that move at the speed $c$?

A photon, a neutrino (if it has zero rest mass) move at $c$ but what about charged particles? If the answer is no, is there a fundamental reason or just because of the radiation it emits?


Was Darth Sidious's "Force Scream" the reason the other masters died so quickly?

So the title says it all really, was the only reason Darth Sidious killed the other masters so quickly down to the fact he used a "Force Scream" did it disrupt or disorientate the other masters apart from Windu? The description of a force scream is:  If a Dark Jedi or Sith Lord was being beaten and frustrated by his foe, he might let out an enraged scream (amplified through the Force) that triggered shock waves that rippled through the Force. This caused devastation to any that were unfortunate enough to be in proximity. Like many dark side Force powers, it allowed the user to use powerful negative emotions as a weapon, albeit involuntarily in this case. The Force scream had been called "a wave of hatred, amplified and fueled by the dark side, that is capable of smashing through mental and physical defenses with ease." A number of references to Dark Jedi in Old Republic archives often mentioned the Dark Jedi violently losing control in the final moments of battle.   Could this mean that it disrupted the other Jedi Masters except Mace?


Bibliography style numeration with parentheses instead of square brackets

I'm trying to set the enumeration style in my bibliography into parentheses instead of square brackets. I was not able to find a solution for it. I'm not talking about the in-text citation style, just about the enumeration style in the Bibliography. Here you can see the general structure of my code:  \documentclass[a4paper,12pt]{scrreprt} \usepackage[super,sort&compress,comma]{natbib}    \begin{document} ... \bibliographystyle{achemso} \bibliography{mybib}  \end{document}   My goal is, that my Bibliography style looks like     I have no experience with this or any forum at all. So if my question does not fit the formalities just let me know. Thank you all in advance!


Calculating the difference between 2 dates using the UK date standard of dd/mm/yyyy

I need your help.  How can I compare 2 dates and finding out what the date difference is, using the date format of dd/mm/yyyy? (uk date standard)  Ie.1  var date1 = "26/11/2013" var date2 = "29/11/2013"  if (date1 < date2) { difference is -3 }   Ie.2  var date1 = "26/11/2013" var date2 = "22/11/2013"  if (date1 > date2) { difference is +4 }   Ie.3  var date1 = "26/11/2013" var date2 = "26/11/2013"  if (date1 > date2) { difference is 0 }


Given an aggregation of class instances which refer to each other in a complex, circular, fashion: is it possible that the garbage collector may not be able to free these objects?  I vaguely recall this being an issue in the JVM in the past, but I thought this was resolved years ago.  yet, some investigation in jhat has revealed a circular reference being the reason for a memory leak that I am now faced with.  Note: I have always been under the impression that the JVM was capable of resolving circular references and freeing such "islands of garbage" from memory.  However, I am posing this question just to see if anyone has found any exceptions.


How to calculate $\sum\limits_{k=0}^{n}{k\dbinom{n}{k}}$

I derived this sum from a problem I have been working on. Somehow I don't know how to proceed. I only know some basics like $\sum\limits_{k=0}^{n}\dbinom{n}{k} = 2^n$. Meanwhile I am reading the related topics trying to derive a formula. But it's like shooting in the dark.


While watching Harry Potter and the Half-Blood Prince this morning, my son asked a lot of plot questions, and one of his inquiries about Tom Riddle stumped me. So, here I am, asking all you fine people for help!   Who knew first that Tom Riddle was the Heir of Slytherin: Tom Riddle or Dumbledore?  I would love to see a definitive canon answer to this question, if at all possible.   There were obviously different clues dropped over the years that pointed toward Tom Riddle being the Heir of Slytherin. A few examples:   Tom Riddle disclosed he could speak with snakes to Dumbledore when Tom was eleven and did not yet know the implications of being a Parselmouth. Merope Gaunt's Slytherin lineage.  The diary Horcrux and the Chamber of Secrets. The basilisk and Myrtle's death.   Is it established in canon -- in reference to the Heir of Slytherin, Dumbledore, and Tom Riddle -- who knew what, and when? Who knew first that Tom Riddle was the Heir of Slytherin?  As I already mentioned, I'm looking for an answer grounded in canon -- the books, interviews and/or quotes by J.K. Rowling, or Pottermore. Speculative answers within the spirit of canon are totally fine by me. I did search the site to ensure this question has not been asked already and I didn't find anything -- if this is a duplicate, vote accordingly :)


What is the probabilty that there are no 2 people in 12 people room with the same birthday month?

What is the probabilty that there are no 2 people's in 12 people room with the same birthday month ?  I thought about $\frac{12!}{12^{12}}$,but , i think its wrong. What do you think ?  Thanks.


Windows: are file attributes such as Date Modified and Date Created timezone aware?

Basically, I'm looking for a yes/no answer to this question:   example: a colleague creates a file in USA at 11AM (GMT-5), I copy this file onto my laptop, which has the UK time-zone settings (GMT in winter). What's the time am i going to see as a value of "Modified Date" file attribute?


Ray-Casting algorithm in Ray-triangle intersection

Currently I started studying about ray-casting when I came across this following problem based on ray-triangle intersection. The problem was:  You are provided with a triangle with vertices ,(x1,y1,z1), (x2,y2,z2) and (x3,y3,z3). A ray with origin (a1,b1,c1) and direction (a2,b2,c2) is also given. Your task is to find:   1)Whether or not the ray intersects the triangle  2) If the ray intersects the triangle, what's the point of intersection and also find the distance of theat point from the origin of the ray  Examples:  1) For (x1,y1,z1)=(-2,2,6), (x2,y2,z2)=(2,2,6), (x3,y3,z3)=(0,-4,6) , (a1,b1,c1)=(1,0,0),(a2,b2,c2)=(-0.2,0,1) the answer is: coordinates of intersection:(-0.2,0,6) and the distance of the origin of the ray from the point of intersection is 6.12  2) For (x1,y1,z1)=(-2,2,1), (x2,y2,z2)=(2,2,1), (x3,y3,z3)=(0,-4,1) , (a1,b1,c1)=(0,0,0),(a2,b2,c2)=(0,0,1) the answer is: coordinates of intersection:(0,0,1) and the distance of the origin of the ray from the point of intersection is 1      3) For (x1,y1,z1)=(-10,-2.3,0), (x2,y2,z2)=(4.4,20.3,9.5), (x3,y3,z3)=(9.8,-10,0) , (a1,b1,c1)=(0,0,0),(a2,b2,c2)=(0.68,-1.14,1.82) the answer is: coordinates of intersection:(0.67, -1.12, 1.79) and the distace of the origin of the ray from the point of intersection is 2.22    All I need is to understand the general equations to solve this question. I need to know how the equations are formed and how the problem is solved. This seems a pretty hard question for me.


Story identification sci fi series two authors early nineties

In the early nineties, I was reading a science fiction series that was written by two authors. The series was not complete at the time, but there were probably like four to six books in the series.  I don't remember much about the book except for a few peculiarities. At the beginning of the series, it is clear that one author is attempting to introduce computer-based slang for the characters. I think one character actually says "shove that up your disk drive", or something to that effect. I suspect that the other author wrote the second book, because this was completely dropped, and then reintroduced in later books. Even as a young person, this produced quite a jarring effect.  The only other thing I can remember about the series is that there was some kind of female insectoid creature. At one point, she loses a limb, but isn't too worried because she can grow it back.   Perhaps that is too little to go on, but I figured I'd try.


How to build a generic Order By function for EF Core?

I came into a project where I need to build some dynamic Queries for EFCore and I needed to make the Queries ordarable by different Attributes and also Asc and DESC.  After I implemented a few Queries with switch case I was asking myself for a generic OrderBy function that can order by a given Attribute-Name and a given SortOrder.  So how to implement a function to do a generic orderBy or orderByDesc on an IQueryable?


Why did Microsoft decide to hide Hibernate option?

I used to hibernate my laptop when it was installed with Windows 7. When I update to Windows 10, the option was missing from Start Menu, and I was able to re-enable it after searching using Google. What makes me curious is, why was it hidden by default? Does hibernating have bad effect or something?


What's up with the all the users whose names start with "user"?

Why are there so many user names like user123456?   Is that really their name, or just the name that I'm allowed to see?  I don't believe that so many people chose such a uniform name because they wanted to have a generic name.  Previously I assumed that these were users who deleted their profiles or perhaps died or were imported from another site, but there are certainly a lot of examples of users with great activity and recent activity.    So, where do they come from?


Find all positive integers $n$ such that $n^2$ divides $2^n+1$.

Find all integers $n$ such that $\dfrac{2^n+1}{n^2}$ is also an integer.   (IMO-$1990$)


Markdown in chat fails for multi-line messages

We've come to rename Markdown to Letdown in the  because it lets you down so often. I've now just found a pattern. It seems markdown . That is, this  Letdown can't cope with multi-line comments. Let's see code?  fails to display code marked as code, while this works  But code works.  Now, I think it would be Ok if you said chat messages shouldn't be multi-line. (Although I'd be a bit annoyed, because I like them.) But if so, please don't render them as multi-line (as is the case with comments), so we aren't tempted to use them.


How to add feature class to MXD with ArcPy (Python)?

I am using ArcGIS 10.1 and I am trying to add a feature class that I create to an MXD, so that I can join to it.   This all needs to be done using Python.  Is this possible?


Why does my mouse get stuck in the upper left corner in a multi-monitor setup?

When I move the mouse between monitors (specifically between monitor 2 and 1) and the mouse crosses the top left of the right screen (as its moving left) - it always gets stuck there.    Same thing happens when I try to drag a window across as well.  Is this a feature?  Bug? What is the purpose of it?  Any way to turn it off?


How does one disable IPv6 completely (for all interfaces, resp. for the whole machine?  Keep in mind, I don't want any kind of GUI solution.    OS in question:   Linux Mint 18.x Cinnamon 64-bit GNU/Linux Debian 9.x Cinnamon 64-bit


My teacher asked me a question which is as follow:     There are $1000$ doors numbered $1$ to $1000$, and there are $1000$ men numbered $1$ to $1000$.      Firstly $1$ numbered man goes and open all the doors.      Secondly $2$ numbered man goes and close the doors which are numbered multiple of $2$      Third $3$ numbered man goes and changes the state of doors which are numbered multiple of $3$       For example he closes the door numbered $3$ and opens the door numbered $6$      So after the man numbered $1000$ came back from his work,how many and which doors would be remain opened?   I thought about it for one hour, but couldn't get anything.  My teacher told me that there is a simple & pure mathematical logic behind this  Can you help me with this??


How can I measure the circumference of an ellipse, just by knowing only the width and the height. I would like a nice easy solution. If there is any complex trigonometry, etc., please explain what they do.    Thanks.


Let $A$ be a $2 \times 3$ matrix with real entries and let $B$ be a $3 \times 2$ matrix with real entries. If $\det(AB)=4$ then find the value of $\det(BA)$.  My attempt: I am aware that $\det(AB)=\det(BA)$ when $A$ and $B$ are of same order. But how to do this?


8TB hard drive recognized on Ubuntu, won't mount

I'm having difficulty mounting an NTFS drive in Ubuntu. Connected to a Mac OS 10.14.6 system it works fine and all data is accessible. I got the following from fdisk on ubuntu:  Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 33553920 bytes Disklabel type: gpt Disk identifier: B6143FEE-D307-471A-A86C-078891B51E81  Device      Start         End     Sectors  Size Type /dev/sdb1      34      262177      262144  128M Microsoft reserved /dev/sdb2  264192 15628052479 15627788288  7.3T Microsoft basic data  Partition 1 does not start on physical sector boundary.   Then I ran fdsk:  $ sudo fsck /dev/sdb fsck from util-linux 2.31.1 e2fsck 1.44.1 (24-Mar-2018) ext2fs_open2: Bad magic number in super-block fsck.ext2: Superblock invalid, trying backup blocks... fsck.ext2: Bad magic number in super-block while trying to open /dev/sdb  The superblock could not be read or does not describe a valid ext2/ext3/ext4 filesystem.  If the device is valid and it really contains an ext2/ext3/ext4 filesystem (and not swap or ufs or something else), then the superblock is corrupt, and you might try running e2fsck with an alternate superblock:     e2fsck -b 8193 <device>  or     e2fsck -b 32768 <device>  Found a gpt partition table in /dev/sdb    No luck:   $ sudo e2fsck -b 8193  /dev/sdb e2fsck 1.44.1 (24-Mar-2018) e2fsck: Bad magic number in super-block while trying to open /dev/sdb  The superblock could not be read or does not describe a valid ext2/ext3/ext4 filesystem.  If the device is valid and it really contains an ext2/ext3/ext4 filesystem (and not swap or ufs or something else), then the superblock is corrupt, and you might try running e2fsck with an alternate superblock:     e2fsck -b 8193 <device>  or     e2fsck -b 32768 <device>  Found a gpt partition table in /dev/sdb   No luck again:  $ sudo e2fsck -b 32768  /dev/sdb e2fsck 1.44.1 (24-Mar-2018) e2fsck: Bad magic number in super-block while trying to open /dev/sdb  The superblock could not be read or does not describe a valid ext2/ext3/ext4 filesystem.  If the device is valid and it really contains an ext2/ext3/ext4 filesystem (and not swap or ufs or something else), then the superblock is corrupt, and you might try running e2fsck with an alternate superblock:     e2fsck -b 8193 <device>  or     e2fsck -b 32768 <device>  Found a gpt partition table in /dev/sdb   Attempted NTFS fix:  $ ntfsfix /dev/sdb Mounting volume... Error opening '/dev/sdb': Permission denied FAILED Attempting to correct errors... Error opening '/dev/sdb': Permission denied FAILED Failed to startup volume: Permission denied Error opening '/dev/sdb': Permission denied Volume is corrupt. You should run chkdsk.   More troubleshooting:  ~$ sudo ntfsfix -b -d /dev/sdb Mounting volume... NTFS signature is missing. FAILED Attempting to correct errors... NTFS signature is missing. FAILED Failed to startup volume: Invalid argument NTFS signature is missing. Trying the alternate boot sector Unrecoverable error Volume is corrupt. You should run chkdsk.   Any ideas on how to fix this? Do I need to find a windows rig to bring this drive back? I have all the data, but to back up the whole drive I'd need to purchase another one, which I'm hoping to avoid...  Cheers  ////////  EDIT: Thanks for the help all. Running ntfsfix on sdb2 (as opposed to sdb) fixed the problem immediately.


How to fix slow wireless on machines with Intel wireless cards?

I have looked through all the previous questions but turning power management off for the Wi-Fi card didn't work. This problem seems to be with the Lenovo Thinkpads. I switched to Ubuntu 11.10 from Windows 7 3 days ago so I'm new to the operating system.


I need to move my washing machine for a couple of days to a friends place due to some construction in my place.  I remember that when I first bought it the seller, when delivering it, removed a security brake, that is used to transport the machine without damaging it.  I would like to know how important it is to brake the machine for transport and how to do it.


I'm running 10.04 and want to upgrade.  I've downloaded 12.04 to my machine (not a disc) and can't get it installed.  How do I get it installed?


Why to use Kali Linux instead of "Ubuntu with Kali Tools"?

There are a lot of tutorials which show how to install Kali Linux's tools on Ubuntu distros.  So I was wondering, why do pen-testers use Kali instead of Ubuntu? while it's more reliable & fancy than Kali.  What are the pros of working on Kali?


Is the polynomial $x^4+10x^2+1$ reducible over $\mathbb{Z}[x]$?


I am testing out maven and its capabilities. I am trying to write a string to a text file using commons-io    import org.apache.commons.io.FileUtils; ... public void writeToFile(String fileName){     File file = new File(fileName);     ...     FileUtils.writeStringToFile(file,rowEntry); //rowEntry is a String }     I have added the commons-io to the dependencies    POM.xml    <dependency>     <groupId>commons-io</groupId>     <artifactId>commons-io</artifactId>     <version>2.5</version>  </dependency>     It compiles but it throws an exception when I run it  Exception in thread "main" java.lang.NoClassDefFoundError: org/apache/commons/io/FileUtils at com.RandCollections.StringFinder.writeToFile(StringFinder.java:704) at com.RandCollections.StringFinder.menu(StringFinder.java:123) at com.RandCollections.StringFinderMain.main(StringFinderMain.java:28) Caused by: java.lang.ClassNotFoundException: org.apache.commons.io.FileUtils at java.net.URLClassLoader.findClass(URLClassLoader.java:381) at java.lang.ClassLoader.loadClass(ClassLoader.java:424) at sun.misc.Launcher$AppClassLoader.loadClass(Launcher.java:331) at java.lang.ClassLoader.loadClass(ClassLoader.java:357) ... 3 more      I think Im missing out on some things, can you help point it out please?


I've been trying to buy Allegiant Air tickets for an August 20 trip for several weeks now and every time I check their website I see the following:  Displaying all available flight dates. Now accepting reservations through Tue Aug 15, 2017.  At first I thought that only showed flights like 7 months in advance or some such. Under that hypothesis they'd have added the August 20 flights a few days after I initially checked. But nope - a few weeks has passed and I'm still seeing that message. So now I'm wondering...  when will tickets for flights after August 15 be available for purchase?


Debian 8 apt-get update showing 404 Not Found

I got the following output every time I run apt-get update on my Debian 8.   Is there a way to fix this?   Err http://ppa.launchpad.net jessie/main amd64 Packages                         404  Not Found Ign http://ppa.launchpad.net jessie/main Translation-en                 Err http://ppa.launchpad.net jessie/main amd64 Packages                   404  Not Found Ign http://ppa.launchpad.net jessie/main Translation-en                 Fetched 164 kB in 3s (47.0 kB/s)                                        W: Failed to fetch http://ppa.launchpad.net/certbot/certbot/ubuntu/dists/jessie/main/binary-amd64/Packages  404  Not Found  W: Failed to fetch http://ppa.launchpad.net/ondrej/php/ubuntu/dists/jessie/main/binary-amd64/Packages  404  Not Found  E: Some index files failed to download. They have been ignored, or old ones used instead.   And this is what I have in /etc/apt/sources.list  deb http://ftp.debian.org/debian/ jessie main deb-src http://ftp.debian.org/debian/ jessie main  deb http://security.debian.org/ jessie/updates main deb-src http://security.debian.org/ jessie/updates main  # jessie-updates, previously known as 'volatile' deb http://ftp.debian.org/debian/ jessie-updates main deb-src http://ftp.debian.org/debian/ jessie-updates main  deb http://ftp.debian.org/debian jessie-backports main   And this is the output of cat /etc/apt/sources.list.d/*  deb http://ppa.launchpad.net/certbot/certbot/ubuntu jessie main # deb-src http://ppa.launchpad.net/certbot/certbot/ubuntu jessie main deb http://ppa.launchpad.net/ondrej/php/ubuntu jessie main # deb-src http://ppa.launchpad.net/ondrej/php/ubuntu jessie main deb http://ppa.launchpad.net/ondrej/php/ubuntu jessie main # deb-src http://ppa.launchpad.net/ondrej/php/ubuntu jessie main deb https://packages.sury.org/php/ jessie main deb https://packages.sury.org/php/ jessie main


Travelling to Pakistan on expiring passport

I have a US passport valid for several years, and a Pakistani passport expiring mid-August. I'd like to travel from the US to Pakistan and back in March.  Can the Pakistani immigration authorities create issues as my Pakistan passport is expiring in less than 6 months of when I want to exit Pakistan.  Thanks.


Migrating All Metadata from Developer Org to Sandbox

Is there any way to move all org metadata (Objects, Apex classes, VF pages, Aura) from Developer Edition to Sandbox? I have started my development in Developer Org, Now i have Purchased new Enterprise Edition, Plan to move all metadata to Sand box. Is there any way, Please guide me in this


NullPointerException when trying to use field array as an argument

So I'm trying to test to see if my deckOfCards Array is going to print out properly. Here is the code   public class Deck {     private static final String face[] = {"Ace", "Two", "Three", "Four", "Five", "Six", "Seven",                                              "Eight", "Nine", "Ten", "Jack", "Queen", "King"};     private static final String suit[] = {"Spade", "Club", "Diamond", "Heart"};     private static final Card deckOfCards[] = new Card [52];      public Deck(){         int suitCount = 0;         int faceCount = 0;         int faceValue = 0;         for(int i = 1; i < deckOfCards.length; i++){             deckOfCards[i].setSuit(suit[suitCount]);             deckOfCards[i].setFace(face[faceCount], faceValue);             suitCount++;             faceCount++;             faceValue++;             if(suitCount == 3){                 suitCount = 0;             }             if(faceCount == 12){                 faceCount = 0;             }             if(faceValue == 13){                 faceValue = 1;             }         }     }   As you can see I've defined the face and suit in an array, and I want to assign them to their proper value, however when I try to run it, I get a nullPointerException at the line deckOfCards[i].setSuit(suit[suitCount]);  I cannot seem to figure out why it giving me this error, when I debug it, it seems to initialize all the fields, yet when it gets there it crashes.


Let $A$ be a finite unital ring and let $N$ be the set of nonunits of $A$. I want to show that if $|N|>1$ then $\sqrt{|A|}\leq |N|$.   I have tried to find an injective function from $A$ to $N$, but  I don't know anything about whether $A$ is commutative or not.


If a function is not continuous then is it possible for bounded function in given range?

I  this problem before  .I have satisfied explaination given by  sir and  sir . I also found  .  I have read the Wikipedia posts for  and  and I have concluded that a function should be defined on given range for satisfying conditions of continuity and bounded function .  I posted my answer at GateOverflow(a site old Q/A of GATE ) , but they not accepted my answer and they have given reason answer key is correct , but not my explanation .        Let $f(x)=x^{-(1/3)}$ and $A$ denote the area of region bounded by   $f(x)$ and the $X-$axis, when $x$ varies from $-1$ to $1$. Which of the   following statements is/are TRUE?         $f$ is continuous in $[-1, 1]$   $f$ is not bounded in $[-1, 1]$   $A$ is nonzero and finite        Given answer key of this question $:$   False True True     In my opinion all given statement should be false .    My doubts are $:$   If a function is not continuous then is it possible for bounded function in given range ? What about function in given problem . Is it possible bounded area zero or infinite ? What about statement $(3)$ of problem ?


Submit to arxiv prior to a conference or journal

I'm about to apply for phd soon. I have several papers that I'm currently working on that are almost finished. That said, there is probably not enough to publish them on time. I think it might be a good idea to post them to arxiv so that I can point admission committee to my work as "preprints" in my application. But since I hope to eventually submit them to a journal or conference, what would be appropriate way to do it? for example, which license of the following should I choose? What are the difference? Would that affect my later publication?  arXiv.org perpetual, non-exclusive license to distribute this article (Minimal rights required by arXiv.org)  Creative Commons Attribution license (CC BY 4.0)  Creative Commons Attribution-ShareAlike license (CC BY-SA 4.0)  Creative Commons Attribution-Noncommercial-ShareAlike license (CC BY-NC-SA 4.0)  Creative Commons Public Domain Declaration (CC0 1.0)  None of the above licenses apply


Calculating the determinant of this matrix

Given this (very) tricky determinant, how can we calculate it easily?  $$\begin{pmatrix} \alpha + \beta & \alpha \beta & 0 & ... & ... & 0 \\ 1 & \alpha + \beta &  \alpha \beta & 0 & ... & 0 \\ 0 & 1 & \alpha + \beta & \alpha \beta & ... & ... \\ ... & ... & ... & ... & ... & 0 \\ ... & ... & .... & ... & ... & \alpha \beta \\ 0 & 0 & 0 & ... & 1 & \alpha + \beta   \\ \end{pmatrix} \in M_{n\times n}$$  EDIT:     I have to prove it is equal to $\frac{{\alpha}^{n+1} - {\beta}^{n+1}}{\alpha - \beta}$   Any help is appreciated, I just could not find a trick to ease it up!


I have a solid understanding of most OOP theory but the one thing that confuses me a lot is virtual destructors. I thought that the destructor always gets called no matter what and for every object in the chain. When are you meant to make them virtual and why?


Are modified theories of gravity credible?

I'm a statistician with a little training in physics and would just like to know the general consensus on a few things.  I'm reading a book by  which basically tries to state how GR makes failed predictions in certain situations. I know GR is well extremely tested, but I imagine all physicist are aware it doesn't always hold up.  The book tries to put forth modified theories of gravity that make do without the need of dark matter and dark energy to make GR match real world observations. (ie speed of galaxy rotations etc)  Are modified theories of gravity creditable?  Is dark energy/matter the 'ether' of the 20th/21st century? Is it likely scientists are looking for something that simply doesn't exist and there are unknown fundamental forces at work? What's the best evidence for it's existence other than observations based on the ?


I looked and could not find... How can I show the solutions for $x^y = y^x$?    There (as far as I can tell) are three curves satisfying this. One is $x=y$, one curves through $(2,4) (4,2) (e,e)$ and goes asymptotic in the $++$ and $+-$ quadrants and its mirror image reflected across $x=y$.   But it is not easy to find a closed form expression for the solutions...at least not for me. Thanks


I'm in the second year of my mechanical engineering bachelor and I've recently started exploring the field of machine learning online. My question is this: which specific subjects do people learn, and in what order, when they study machine learning in college? Also, which books would you recommend? I'm NOT asking which online courses to take, I just want to know which SUBJECTS you were taught in college. For example, I've been doing a lot of reading lately, and it was only yesterday that I came across discriminative/generative networks, yet it seems important to me.   I'm nearly done with prof. Andrew Ng's course on Coursera, but I feel like I'm missing out on a lot of details and concepts. I'd like to hear which subjects you studied (and perhaps in what order).


Why is the sky never green?But it can be slightly blue-green?

The colour of the sky is determined by light scattered from the sun reaching the earth from a new direction. The shorter the wavelength the greater the light is scattered. On a dull day, with the sun obscured by cloud, with more moisture in the air, the scattered light could extend beyond the blue to include some green light. Because the light most scattered is blue with in this situation some green, I would expect to see a cyan, perhaps bluish cyan, sky.  Has anyone else seen a cyan sky, perhaps with high thin cloud above an overcast/ cloudy day?   Ron


Getting "permission denied" when trying to append text onto a file using sudo

I'm using Amazon Linux.  I'm trying to append some text onto a file.  The file is owned by root.  I thought by using "sudo", I could append the needed text, but I'm getting "permission denied", see below  [myuser@mymachine ~]$ ls -al /etc/yum.repos.d/google-chrome.repo -rw-r--r-- 1 root root 186 Jul 31 15:50 /etc/yum.repos.d/google-chrome.repo [myuser@mymachine ~]$ sudo echo -e "[google-chrome]\nname=google-chrome\nbaseurl=http://dl.google.com/linux/chrome/rpm/stable/\$basearch\nenabled=1\ngpgcheck=1\ngpgkey=https://dl-ssl.google.com/linux/linux_signing_key.pub" >> /etc/yum.repos.d/google-chrome.repo -bash: /etc/yum.repos.d/google-chrome.repo: Permission denied   How can I adjust my statement so that I can append the necessary text onto the file?


To prove that the integral is the sum of a formula

I want to prove that $$\int_0^1x^{-x}dx=\sum_{n=1}^\infty n^{-n}$$ And I know that $$x^{-x}=e^{-x\log x}$$ and $$e^u=\sum_{n=0}^\infty \frac{u^n}{n!}$$ I get that $$x^{-x}=\sum_{n=1}^\infty \frac{(-x\log x)^n}{n!}$$   Then I have no idea how to prove the rest of it. Any suggestion? Thanks!


Best way to hide a window from the Alt-Tab program switcher?

I've been a .NET developer for several years now and this is still one of those things I don't know how to do properly. It's easy to hide a window from the taskbar via a property in both Windows Forms and WPF, but as far as I can tell, this doesn't guarantee (or necessarily even affect) it being hidden from the Alt+↹Tab dialog. I've seen invisible windows show up in Alt+↹Tab, and I'm just wondering what is the best way to guarantee a window will never appear (visible or not) in the Alt+↹Tab dialog.  Update: Please see my posted solution below. I'm not allowed to mark my own answers as the solution, but so far it's the only one that works.  Update 2: There's now a proper solution by Franci Penov that looks pretty good, but haven't tried it out myself. Involves some Win32, but avoids the lame creation of off-screen windows.


I disabled my admin account and now I can't log in no guest account

So I just bought a used Sony vaio with the ubuntu operating system. I disabled my admit account thinking that when I powered up it would just go to the home screen. Now I can't log in. It recognizes my user name but not the password. How can I get passed the log in screen?


Is it okay to post the same question on both Quora and Stack Exchange?

Assuming the question is sufficiently specific and answerable to be on Stack Exchange too.


Characteristic of an integral domain is 0 (or prime)

The characteristic of an integral domain $R$ is $0$ (or prime).  My lecture has not yet covered infinite integral domain but I'll like to understand the proof.  Basic fact: $R$ is an integral domain so $R$ is a commutative ring with unity (multiplicative inverse = $1$ exists) containing no zero-divisor.  $\space$  By definition of a commutative ring:  $\left ( R,+ \right )$ is an Abelian group.  "$\cdot$" is associative.  Distributive law holds.    $\space$  Definition (Zero-divisor): Let $R$ be a ring. Then an element $a(\neq 0) \in R$ is called a zero-divisor if there exists $b(\neq 0) \in R$ s.t $a\cdot b=0$  By contraposition, since there exists no zero-divisor in the integral domain R, it is true that $a\neq 0$ and there exists no $b\neq 0$. Can someone take me further? Thanks in advance. Edit: finite integral domain in lecture is covered


I have forgot the username and password, how to reset for all even though I enter the back up email


What is the difference between absolute / canonical / relative paths?  I guess that absolute starts with a /. Can it contain /../?  Is a canonical path different from an absolute path in that it can't contain /../?  Is foo a relative path?  Googling posix canonical path didn't turn up much... What are the POSIX references for these terms?


If A and B play a game with a fair coin such that A wins by getting consecutive TT for the first time, while B wins by getting a consecutive TH.  Who has higher probability of winning the game?   I tried the following method but not sure:  For A to win,     TT, HTT, HHTT ... that is, 2-k for each game length k   For B to win,     TH, HTH, HHTH ... that is, 2-k for each game length k   So ultimately I am getting same probability of each to win.


Proving that $\langle x, y \rangle$ is a not principal ideal of $\mathbb{Q}[x, y]$

My idea was to prove that $x, y$ aren't elements of this ideal, the way I thought about it is that being part of this ideal forces $x$ to be written in the form of a product between $2$ polynomials in $\mathbb{Q}[x, y]$, but $1$ of those polynomials will have to be $x$ and the other will have to be $1$, the unit, which isn't possible... I don't know how to formulate this correctly. Could someone please help me with this question?


I'm trying to have a FragmentActivity where User's input in an Editext can store in an array then will show to Listview but after entering a value and click the button, the application stopped.  I'm having this kind of output in my logcat  02-16 21:53:05.950    1315-1315/com.tipmanila.cite.traventurev2 E/AndroidRuntime﹕ FATAL EXCEPTION: main     Process: com.tipmanila.cite.traventurev2, PID: 1315     java.lang.NullPointerException             at com.tipmanila.cite.traventurev2.NotesFragment$1.onClick(NotesFragment.java:53)             at android.view.View.performClick(View.java:4442)             at android.view.View$PerformClick.run(View.java:18473)             at android.os.Handler.handleCallback(Handler.java:733)             at android.os.Handler.dispatchMessage(Handler.java:95)             at android.os.Looper.loop(Looper.java:136)             at android.app.ActivityThread.main(ActivityThread.java:5105)             at java.lang.reflect.Method.invokeNative(Native Method)             at java.lang.reflect.Method.invoke(Method.java:515)             at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:792)             at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:608)             at dalvik.system.NativeStart.main(Native Method)   My FragmentActivity look like this  @Nullable @Override public View onCreateView(LayoutInflater inflater, ViewGroup container, Bundle savedInstanceState) {     View v = inflater.inflate(R.layout.notes_fragment, container, false);      txt = (EditText) v.findViewById(R.id.txtInput);     show = (ListView) v.findViewById(R.id.listView);     save = (Button) v.findViewById(R.id.btnSave);     save.setOnClickListener(new View.OnClickListener() {         @Override         public void onClick(View v) {             String getInput = txt.getText().toString();              if (addArray.contains(getInput)) {                 Toast.makeText(getActivity(), "Note already added", Toast.LENGTH_LONG).show();              } else if (getInput == null || getInput.trim().equals("")){                 Toast.makeText(getActivity(), "Input field is null", Toast.LENGTH_LONG).show();              } else {                 addArray.add(getInput);                 ArrayAdapter<String> adapter =  new ArrayAdapter<String>(getActivity().getApplicationContext(), android.R.layout.simple_list_item_1, addArray);                 show.setAdapter(adapter);                 ((EditText) v.findViewById(R.id.txtInput)).setText("");              }           }     });       return v;


Story about protagonist finding a world that has died with a museum

So my dad told me about a short story he had once read. It must be older like before 1986. It is about two men who traveled through space and found a dead planet. On it was what he calls a super museum. They set it up as a heritage/legacy for those in the universe that were intelligent enough to find it. As a twist it turns out that this planet is actually earth and that the men must have traveled to the future. (Kind of like planet of the apes)  I have found a few topics that looked similar. But it's not resurrection bij a.e van Vogt.(because they know it is earth they are visiting) Although this seems very similar. He also says it is not all the way back from michael Shaara.   Anybody have any idea? If it helps, the story was translated to Dutch and was in a book with other stories as well. I don't know if they were from one author or various. It has been bugging me for years as my dad always told me the story moved him deeply and as I love science fiction I would love to read it. Just found this site so thought to give it a go.thanks in advance!


I have an MSI 2QE Ghost Pro laptop with 2 hard disks, 1 SSD and 1 SATA. I have Windows 10 installed on the SSD and Ubuntu 14.04 on a partition of the SATA.   I have no issues with the windows partition. Whenever I boot into ubuntu, though, my laptop screen stays black. Its not a black light, it just as though the laptop screen just doesn't turn on. Ubuntu functions normal though. I've tried connecting an external monitor from the HDMI port and that monitor works fine. Using that I can also see that my laptop monitor is detected and I can even use it. It just stays black. Has anyone some idea why this might be happening?  I've tried updating my graphics card drivers but that didn't help. I'm not very experienced with Ubuntu and so am not sure what else to do.


What does a question mark represent in SQL queries?

While going through some SQL books I found that examples tend to use question marks (?) in their queries. What does it represent?


Can quantum correlations due to measurement be used for quantum communication?

My understanding of quantum entanglement is that when you measure the state of an entangled particle, its counterpart will measure a correlated state, i.e. we know for sure that if for example Particle A is measured to be in state A, then particle B will definitely be measured to be in a correlated state B at the same instance. So my question is, can we not exploit this property for communication? The way this could be done is that we fix two frequences, say 10 times/second and 20 times/second. At the destination, we always measure 20 times/sec, at the source we measure 10 times/second or 20 times/second depending on whether we want to transmit a 0 or a 1. Then at the destination, based on the measured probability of states, we can decide whether the source was transmitting a 0 or a 1. Would this work?


Why the non-root user can't login with a key in putty?

I read an article and found it very useful:   I made two key pairs for root and the other user. But it only works for root  When it comes to the other one, the server shows:  Using username "theotheruser". Server refused our key theotheruser@mydomain.com's password:


What's the best way of checking if an object property in JavaScript is undefined?


How to change step of volume in Ubuntu 18.04 LTS

How can I change volume step in my Ubuntu? I have tried next ways:   dconf gconf some scripts   Third way didn't work, but if it would works, it doesn't show current volume value, I think


Why are there two sets of the Ctrl, Alt, and Shift modifier keys on the keyboard?

Why are there two sets of the Ctrl, Alt, and Shift modifier keys when only one of each is necessary?


How do I want the output to be in two decimal places?

I am practicing XHTML with JavaScript. I want the cost to be in two decimal places, just like how we calculate money in real life. How would I do that? This is my code in the JavaScript file:  function computeCost() {     var french = document.getElementById("french").value;     var hazlenut = document.getElementById("hazlenut").value;     var colombian = document.getElementById("colombian").value;     var regular = document.getElementById("regular").value;  //Compute the cost     document.getElementById("cost").value =     totatCost = french * 3.49 + hazlenut * 3.95 + colombian * 4.59              + regular * 1.99; } // end computeCost


How do I make a Windows 7 USB bootable key using os x so I can repair a seperate Windows laptop?

I have a Mac. And a windows 7 laptop... I know, but it was cheap, and I needed it. The windows kernel was somehow deleted. I have a copy of win 7 on my Mac that I would like to make a bootable usb key without installing win7 to the Mac. Every thread I seem to read is directed at installing win 7 to Mac. This is something I don't wish at all. How do I make a usb bootable with windows from a Mac?


Selective numbering of equations with align

I have an align environment with 5 equations. I want 3 of them numbered, and the other 2 not numbered. I understand that there's other posts on the issue of selective numbering of those equations that are referred to in the body of the text, but that's different to what I'm trying to achieve.  I want the first three lines (equations) of the following to be numbered and the last two to be without numbering. Thanks.  \documentclass[a4paper,11pt]{article} \usepackage[fleqn]{amsmath} \begin{document}  \begin{align} &R_{i,t} = \alpha_i  \\ &R_{i,t} = \beta_i  \\ &R_{i,t} = \gamma_i  \\ &\mathbb{E}[\epsilon_{it}]=0;\textrm{   } \textrm{Var}[\epsilon_{it}]=\sigma^2_{\epsilon_{i}}\\ &i \in \{1,2,...,N\};\textrm{   } t \in \{1,2,...,T\} \end{align}  \end{document}


Find Polynomials with Integer Coefficients with Particular Roots

Is there any simple way to find a polynomial with integer coefficients so that ($x=\sqrt{2} +\sqrt{3}$) is one of its roots? I know one way is to get rid of all the square roots in the equation to be left with rational numbers, but is there any other simple way?


I clicked on “show pictures” in a malware e-mail

I carelessly pressed “show picture “in a spam e-mail that was in my unwanted folder When i clicked the link just disappeared and no picture was shown.how worried should I be? I did a disk clean-up after and ran my windows defender which found no threats


I am trying two ways to implement this situaiton: when a test-button is clicked, a text Hello World is displayed at <p> element test-text Method 1 function showText(test_button_id) {     let test_text = document.getElementById("test-text")     test_text.innerText = "Hello World";  }  let test_button = document.getElementById("test-button") test_button.addEventListener('click', showText('test-button'))  Method 2 let test_button = document.getElementById("test-button") let test_text = document.getElementById("test-text")  test_button.addEventListener('click', () => {         test_text.innerText = "Hello World"; })  Method 2 works. Method 1 does not. What is wrong with the way I am calling the function in addEventListener? I know the argument test_button_id is not doing anything in this code. I intend to parse it in if the code works. Thanks.


Do particles always flow from high to low pressure?

In , it was stated that     particles in high pressure air always flow to lower pressure.   In a pipe with a constriction, fluid flows from from low to high pressure after the constriction. (From .)  How are these concepts related?


difference between MySQL and noSQL databases

All these days I've been using MySQL, recently I saw a kind of similar named Database NoSQL. What is NoSQL and what is the difference between them ?


GNOME shell extension doesn't work with snap version of web-browser

Got an error from Firefox saying :      Although the GNOME Shell integration extension is active, the native host connector is not recognized. Please consult the installation manual.   Which is an error that seems to never happen, I'm using Ubuntu 18.04 (Dual Boot Windows 10), and yes GNOME shell is installed via   sudo apt-get install chrome-gnome-shell   I'm using Firefox v64.0.2 (64 bits) snap.  Could someone help?


I have created a shortcode that retrives and displays a form.The content of the attribute in HTML.   function check_my_login( $atts)     {          return '<form action="" name="" method="post" enctype="multipart/form-data">
                     Project Description                     <textarea name="p_description" placeholder="Project Description" class="form-control"><?php if (isset($_POST['p_description']) && $_POST['p_description'] != '') echo $_POST['p_description'] ?></textarea>

                     Project Attachment                     <input type="file" name="p_attachment">
 </form>';     }     add_shortcode( 'kentaUser', 'check_my_login' );   Now use this shortcode inside the Post/page.   Like this
[kentaUser]
  But my shortcode content display out side the div.Display upper side in post/page content.

    Any one short out this problem.


Proving Vectors Inside a Subspace Satisfy Given Condition

I have a proof style question regarding vectors and orthonormal bases. It is as follows:  Let V1 and V2 be an orthonormal basis for W which is a subset of R^n. Prove that if w is a vector in W then the following holds:  ||w||^2 = (w . V1)^2 + (w . V2)^2   I have tried a few things here however the first thing I noticed was this provided condition looks very similar to the Cauchy-Schwarz Inequality but was not really sure how that is relevant.  One of the things I have tried was breaking down each part of the equation. I thought if w is inside W which is an orthonormal basis it would have a length of 1 so the left hand side of the equation would be equal to 1 but then I got stuck as I know when orthogonal vectors are dotted against each other their dot product is 0 which would mean the left hand side would be 0 + 0 which is obviously not equal to 1.  I have in my notes all the properties of vector dot products as well as those of orthonormal bases but cannot seem to organise those in such a way that explains the given condition.  Thank you for any feedback or advice.


find sum of ln(1- $\frac{1}{n^2})$. prove it converges


How can Dr. Strange rewind time in these circumstances?

Whilst confronting Dormammu, Strange keeps dying and coming back, in an infinite loop, which eventually persuades the monster into accepting the doctor's terms.   My question is:   How does he use the gem while dead?   He is supposed to make hand gestures for it to work, so how does he do it then?   I thought maybe he set the loop before getting killed for the first time, do you guys agree? Is that even possible?   By the way, there was , but they are not the same. The other one focused on the fact that Dormammu's dimension was beyond time.


Where would I insert an exclamation mark and a comma in the below sentence?     "Look at that boy" he exclaimed.


Show that the product of two consecutive natural numbers is never a square.

I'd like to have my proof verified and if possible, to see other solutions that are interesting.  Proof: Suppose $n(n+1)$ is a square. Then we write $$n(n+1) = \prod_{p} p^{c(p)}$$ where $c(p) = a(p) + b(p)$ are such that \begin{align*} n &= \prod_p p^{a(p)} \\ n+1 &= \prod_p p^{b(p)} \end{align*} Now, by our hypothesis, $c(p)$ is even for all primes $p$. As $(n,n+1)=1$ for all $n$, it must be that $a(p)$ and $b(p)$ are even for all primes $p$ and moreover, $a(p) = 0$ whenever $b(p)>0$ and reversely.  This indicates that both $n$ and $n+1$ are squares. This is impossible as there are no consecutive squares in the natural numbers.


How to install the previous version of a .deb package and pin it?

I am trying to install the latest version of subversion on Sid, and because it has a bug I receive a warning and I abort the installation. How do I get to locate the previous version version, install it and pin until the bug is resolved?  root@server01:~# apt-get install subversion   Reading package lists... Done                                                                                Building dependency tree                                                                                Reading state information... Done                                                                                Suggested packages:                                                                                db5.3-util subversion-tools                                                                                The following NEW packages will be installed:                                                                                subversion                                                                                0 upgraded, 1 newly installed, 0 to remove and 205 not upgraded.                                                                                Need to get 0 B/981 kB of archives.                                                                                After this operation, 4,844 kB of additional disk space will be used.                                                                                Retrieving bug reports... Done                                                                                Parsing Found/Fixed information... Done                                                                                critical bugs of subversion (-> 1.9.2-2) <Outstanding>                                                                                b1 - #803725 - subversion: dump-load of a repository modifies verbose log output: M line lost serious bugs of subversion (-> 1.9.2-2) <Outstanding>  b2 - #803589 - FTBFS with ruby2.2 (only) Summary:  subversion(2 bugs) Are you sure you want to install/upgrade the above packages? [Y/n/?/...] n ********************************************************************** ****** Exiting with an error in order to stop the installation. ****** ********************************************************************** E: Sub-process /usr/sbin/apt-listbugs apt returned an error code (10) E: Failure running script /usr/sbin/apt-listbugs apt


difference between 'Response.Redirect' and 'Server.Tansfer'

Everyone,I must launch my code, The first way:  Response.Write("<script>alert('Succeed,Will be redirect to the target page')</script>"); string path = Server.MapPath(@"~\Forms\MainForm_SQL.aspx"); Response.Redirect(path);   The second way:  Response.Write("<script>alert('Succeed,Will be redirect to the target page')</script>"); Server.Transfer(@"~\Forms\MainForm_SQL.aspx");   Now,back to the issue,The question is :  01)it works nothing when using the 'first way',That is, it either alerts the message nor goes into the 'Page_Load' of the target page.  02),when use the second way,it first goes into the 'Page_Load' of the target,than it goes back to alert the message.  why it that so unreachable to track the architecture ? can some one help me please? thanks.


I entered Schengen area via airplane in Geneva March 2016 and passport got stamped. But when I left by bus from Hungary my passport was not even scanned or stamped. Will I have problem re-entering Schengen again; it has been two years and I only have entry stamp?  I heard that after 180 it has no problems.  I have Serbian Passport.


One among the few shops that offer or offers

One among the few shops in London that offer or offers designer clothes.


Will PS+ allow me to play online with another profile on the same PS4 that doesn't have a PS+ subscription?

I bought a PS4 and it already had a PSN profile, so I created my own profile and used the original PSN profile to play online. Now the PlayStation Plus subscription is about to expire.   Instead of renewing the original profiles PS+ subscription, I want to purchase a new PS+ subscription for my new PSN profile.   The problem is I pre-ordered CoD: Black Ops 3 with original PSN profile and don't want to buy PS+ subscription for my profile if I won't be able play the game online.  I would renew original profiles PS+ subscription if I it meant I could still play the game on my own PSN profile.


when an object is lifted (at a constant velocity) shouldn't the work done on the object be zero?

When I lift an object from the ground (at a constant velocity) I'm applying force on the object equal to its weight and the earth is also pulling it downwards with equal amounts of force. So if the net force on the object is zero shouldn't the WORK also be zero?...(Although the potential energy increases which indicate work done.....I'm a bit confused.)


I have looked at several solutions to solve my issue but nothing seems to be working for me. I want my out put to align all the names, numbers chosen, and prize winnings on this code. Currently it outputs this:   3454 Atkins, Joe  7  6  5  4  3  2  1         7         $20.00     4321 Barber, John      11  22  7  8  45  12  10         1         $0.00     8976 Dollar, Kim      44  33  22  11  10  9  4         1         $0.00   I believe I would need the names to right align to fix this issue but nothing I have tried is working. Here is my code:    cout << student_info[i].id_num;  cout << setw(10) << student_info[i].student_name << setw(10);   for(int j = 0; j < LOTTERYNUMBERS; j++)      cout << student_info[i].lotteryNumbers[j] << "  ";   cout << setw(10) << student_info[i].lotteryMatches << setw(10) << setprecision(2)       << fixed << showpoint << "$" << student_info[i].prizeMoney << endl;


Number of natural solutions to the equation $x_1\cdot{x_2}\cdot{x_3}\cdot{x_4}=1000000$

I'm trying to tackle some question and I think I solved it, but I'm not sure and would like someone to check my work.  The question goes like this:     Find the number of non-negative solutions of the equation $x_1\cdot{x_2}\cdot{x_3}\cdot{x_4}=1000000$.   My try: First I have written the equation as $x_1\cdot{x_2}\cdot{x_3}\cdot{x_4}=10^6=2^6\cdot{5^6}$, hence $x_i$ is of the form $\displaystyle 2^{a_i}\cdot{5^{b_i}}$ where $0\le a_i,b_i \le 6$.  Now we can write $$2^{a_1}5^{b_1}\cdot{2^{a_2}5^{b_2}}\cdot{2^{a_3}5^{b_3}}\cdot{2^{a_4}5^{b_4}}=2^{a_1+a_2+a_3+a_4}\cdot{5^{b_1+b_2+b_3+b_4}}=2^6\cdot{5^6}$$ Thus, we are looking to find the number of non-negative solutions to the equations $$\begin{cases}a_1+a_2+a_3+a_4=6\\b_1+b_2+b_3+b_4=6\end{cases}$$ We know that $0 \le a_i,b_i \le 6$, hence the generating function would be $$g(x)=(1+x+...+x^6)^4=\left(\frac{1-x^7}{1-x}\right)^4=(1-x^7)^4\cdot{\frac{1}{(1-x)^4}}\\g(x)=(1-x^7)^4\cdot{\sum_{n=0}^{\infty}{{n+3}\choose 3}x^n}$$ Now, $\displaystyle (1-x^7)^4=x^0-4x^7+6x^{14}-4x^{21}+x^{28}$, hence the only relavant term is $x^0$ (we want to find the coefficient of $x^6$). We find that the required coefficient is $\displaystyle {9\choose 3}=84$, so we have 84 optional solutions to any of the equations.  Edit: There is no dependence between the equations, hence the number of solutions is $84^2$.  Is my reasoning correct? Please help me fix my errors if there any. Thanks!


Jacob Schulthess Wangen an der Aare records

I'm just getting started researching my husband's family who came from Wangen an der Aare, Bern Canton, Switzerland.  I'm looking for Jacob Schulthess birth record who was born 29 Jan 1892 in Wangen an der Aare.   We are told Jacob's father, also named Jacob died in prison at Wangen an der Aare sometime between 1894 and 1899.  He accidentally shot his mother in law with a gun, intending to shoot his wife who had been unfaithful to him.  Ha! I'd like to know the date of Jacob Schulthess Sr.'s death.  Would there be court records of his trial?       The unfaithful wife was Emma Obrecht born 20 Dec 1869 in Wangenreid, Bern. She eimgigrated to US in 1901 and settled in Monroe, Wisconsin.


I have a schengen visa from Germany. My duration of stay is 30 days. I have been entered late on 14 august and my visa validity date is from 1 to 30 august. Is this possible to stay for unused duration of stay? How is this possible? I have found a website maybe it can help!


Sequence such that every subsequence can have a different real limit

I would like to find a sequence of real numbers $(a_n)_{n\in\mathbb{N}}$ with this property: for any $L\in\mathbb{R}$ there is a subsequence $a_{k_n}$ such that $$\lim_{n\to\infty} a_{k_n} = L$$ Does such a sequence exist?


NBHM QUESTION 2013 Riemann integration related question

Can anyone help me out. I reach to the conclusion that all three inequalities are wrong. But a) , b) are correct.(Answer is given in NBHM site)


Unable to instantiate service > java.lang.NullPointerException

I save config with SharedPreferences and load it in class extends Services.  But error appear when I try get values of config, error like:     Unable to instantiate service kr.co.composer.callrecord.recorder.CallRecordService: java.lang.NullPointerException   at line:  final SharedPreferences mSharedPreference= PreferenceManager.getDefaultSharedPreferences(getApplicationContext());  In layout Configuration I save a EditText:  final SharedPreferences prefs = PreferenceManager         .getDefaultSharedPreferences(this);  serverUrl.setText(prefs.getString("autoSave", "")); serverUrl.addTextChangedListener(new TextWatcher() {     @Override     public void onTextChanged(CharSequence s, int start, int before,                               int count)     {     }     @Override     public void beforeTextChanged(CharSequence s, int start, int count,                                   int after)     {     }     @Override     public void afterTextChanged(Editable s)     {         prefs.edit().putString("autoSave", s.toString()).commit();     } });   And in the other class, I want to get this values by this code:  public class CallRecordService extends Service {     final SharedPreferences mSharedPreference= PreferenceManager.getDefaultSharedPreferences(getApplicationContext());     @Override     public void onCreate() {         serverURL =(mSharedPreference.getString("autoSave", ""));     } }


How can I get a cell in Excel to automatically adjust its height to fit the wrapped text contents?

I have a cell with wrapped text content in Excel and I want to format the cell so that its height will adjust to fit the content which can span over several lines. How can I achieve this behavior?


Convert set of rows to column with list of values

I have requirement where I need to convert list of rows into single column value.  Ex:  ID           Value 1            v1 1            v2 1            v3 2            v4 2            v5 2            v6 2            v7  and so on..   Need to convert as  ID         New Value 1          v1,v2,v3 2          v4,v5,v6,v7   Please let me know how I can write query in SQL server.  Thanks.


there are 30 files named like this:  sample_kmer_41_2.lib1.bowtie.file1.27.faabyss_sample   I need the output to be:   abyss_sample_kmer_41_2.lib1.bowtie.file1.27.fa   I don't know how to do this, I've already screwed the names up a lot. thanks for any help.


I am a bit of a newbee in Ubuntu. I am trying to install liblrdf on my ubuntu 18.04lts system but ./configure gets stuck as it can't find "raptor >=0.9.11".  Can anybody point me in the direction to get this library please.  This is not the flowchart program, my final goal is to run guitarix. Thanks in advance


How can I animate the camera in a perfect circular rotation around a fixed position?

I have an object at a fixed position in 3D space. I would like the camera to circle around it while facing it. I want to path of the camera to be circular in 2D, meaning that it does not move up or down.  I need this to be pretty accurate. I don't want to manually set a keyframe every frame for position and rotation. I would like to do this maybe with an expression, not with manual keyframing. I am not sure how to go about this but I think it is going to involve Python as well as some trigonometry.


What actually slowing down of time means? Is it an illusion? How we can say that time got slower?

If time has slowed down for one person and if other person who is observing an action done by person for whom time got slowed down then the action Which took place at a particular instant be observed by both observers at that same instant while time for both is not same? If we see things moving then we say that time is passing how far is it correct? If nothing literally nothing in universe is dynamic or moving then will the time exist?


Click event not working when class name is same

Why click event is not working here? What is my mistake?    $(document).ready(function() {   $('.dashboardList').click(function() {     alert("hello");   }); });


I recently installed some PHP site on a server for a customer. A guy calls me up and tells me he can't seem to upload to the img directory. I went in and took a look at the owner of said directory.  The owner was set to a user named 518. I was still able to chown -R someuser img/ and fix the issue, but I am more concerned that the owner of the directory was set to 518. I have never seen the owner set as a number and I certainly did not set that owner myself. What does it mean when a user is set to 518? Did I get broken into? When I run cat /etc/passwd I do not see any user named 518 in there. I am running Ubuntu.


Reload Table Cache with Python & ArcGIS 10.1

I am trying to create a button in arcmap that reloads the table cache. Exactly, like the existing button Table Options > Reload Cache. The button is inside when you open an attribute table. I would like to create a custom button that is in a toolbar I made. I tried to search for tools in customization and it isn't present nor could I find any sample code for this.  I have a custom Python Addin Toolbar with comboboxes that manipulates data in a database and since it doesn't update the data upon selection I would like another way to refresh with having to close the table and reopen and//or selecting the existing tool.   Thanks for your help.


How do I hide "hot network questions" on Stack Exchange with Firefox?

I like using Stack Exchange websites. I often find myself clicking on hot network questions and that time is frequently not spend productively.  Is there a way when I use Firefox to hide that element from the page?


So today I wanted to separate the workspace between two monitors and I shift-clicked the view I wanted to put in a new window and it worked.  The problem is that when I wanted to close it (since in any editing program I know closing the main window closes all the others and then at the startup restores them) I accidentally closed the main one and the secondary window stayed open (I was surprised a lot :D) and I don't know how to restore the main one with the top bar (you know, the one which has File, Edit...) and the original layout because in the secondary window there is only the view.  So how do I restore it?


Show that $\sum\limits_{n=0}^{\infty }{2n\choose n}\frac{1}{8^n}=\sqrt {2}$

$$\sum _{n=0}^{\infty }\:\begin{pmatrix}2n\\ n\end{pmatrix}\:\frac{1}{8^n}=\sqrt{2}$$ I know that I should use some Taylor series, but which one I'm not sure.


Biblatex bibliography in beamer does not work (name of the articles in bold)

Using biblatex I don't obtain the name of the reference but the name of the article - in the .bib - file in bold.        Here's my code:  \documentclass{beamer} \setbeamertemplate{bibliography item}{\insertbiblabel}  \mode<presentation> {\usetheme{Madrid}       }  \usepackage{graphicx} % Allows including images \usepackage{booktabs} % Allows the use of \toprule, \midrule and \bottomrule in tables  \usepackage[utf8]{inputenc} \usepackage[spanish]{babel} \usepackage{hyperref} \usepackage{pgfgantt} \usepackage[backend=biber]{biblatex} \addbibresource{presentation.bib}   %---------------------------------------------------------------------------------------- %   TITLE PAGE %----------------------------------------------------------------------------------------  \title[Short title]{Proyecto de Tesis: Holografía y sistemas integrables} % The short title appears at the bottom of every slide, the full title is only on the title page  \author{John Smith} % Your name \institute[UCLA] % Your institution as it will appear on the bottom of every slide, may be shorthand to save space { University of California \\ % Your institution for the title page \medskip \textit{john.smith@example.com} % Your email address } \date{\today} % Date, can be changed to a custom date  \begin{document}  \begin{frame} \titlepage % Print the title page as the first slide \end{frame}  \begin{frame} \frametitle{Outline} % Table of contents slide, comment this block out to remove it \tableofcontents % Throughout your presentation, if you choose to use \section{} and \subsection{} commands, these will automatically be printed on this slide as an overview of your presentation \end{frame}  %---------------------------------------------------------------------------------------- %   PRESENTATION SLIDES %----------------------------------------------------------------------------------------  %------------------------------------------------  \begin{frame}[allowframebreaks] \frametitle{Resumen}  Las p-formas autoduales se definen en dimensión $d=2(p+1)$, donde $p$ es par . Su caso más sencillo, con $p=0$, corresponde al bosón quiral . Esta ecuación aparece como un caso particular de la denominada ``jerarquía de KdV''. Dicha jerarquía se puede formular como una acción de Chern-Simons en una dimensión extra, escogiendo condiciones de borde adecuadas para la conexión. El objetivo de esta tesis es generalizar esta construcción con el fin de generar sistemas integrables para p-formas en dimensiones superiores, con aplicaciones a supergravedad en seis dimensiones \cite{Marcus:1982yu}.  \end{frame}  %------------------------------------------------  %------------------------------------------------   \begin{frame} \Huge{\centerline{Muchas gracias.}} \end{frame}  %----------------------------------------------------------------------------------------  \end{document}    My purpose is being able to use the \footfullcite command. I've read  and  but I don't know the problem.


I just checked my WordPress site () and there is this bar that runs across the top of the page and when you click anywhere on the site it wants to open a spam page. Lucky the functionality of the site does not seem to be too compromised and this does not apply to the mobile version using chrome on an iPhone.   I am aware that many hacks can be different and it is very hard to find them and fix sites but I would appreciate pointers and helpful hints. The only reason I have not upload one of my total backups is because I am trying to fix this in a way that I don't loose orders and customer data off of the site.   Steps that I have taken to try to hunt down this hack are from this post . I have  running a scan and I will report back if I find any script injections.


How to display the current mapping for keyboard shortcuts in realtime?

Is there an app / script which will listen for keyboard events and display the action that is triggered?  I use Better Touch Tool, and want to run a script on Cmd+F1 but I got the message:     The key combination "Command + F1" can't be used because it's already used by a system-wide keyboard shortcut. (If you really want to use this key combination, most shortcuts can be changed in the Keyboard & Mouse panel in System Preferences.)   I couldn't find the triggered action until I did a text search on , and now I'm curious!   In Sublime Text, it's possible to open Sublime's python terminal and sublime.log_commands(True) to log commands triggered as the keys are pressed… is there something similar for system wide key events?


How do you show a list of attendees in an Outlook 2013 calendar event?

A coworker recently enabled an extra view inside Outlook, so that when he opens up a meeting on his calendar he immediately sees a list of the people attending the meeting.  How do you enable this in Outlook 2013?    (I know you can simply switch to the Scheduling Assistant view, but I want to see everything in a single view! First-world problems.)


Answering a duplicate question with a more current answer

I was reading through some meta posts today and I stumbled upon  just now,  After reading this, it started to make me think about the times I have answered duplicate questions. I can see where he is coming from, and I am rethinking whether I should answer those or refer them to previous questions. Then it hit me, what if my answer is a better or more current way of doing something?  Should I then post my answer on the already answered question from two years ago, or on the duplicate question?  This is the question I recently answered that made me start to think about what would be the best option for the person answering a question.      So what does everyone think about this? Which way should the person answering a question, like me, take in this type of situation?


Suppose that Sally’s preferences over baskets containing food (good x), and clothing (good y), are described by the utility function U(x,y)=√x+y  Sally’s corresponding marginal utilities are,  Ux=$1\over2√x$ and Uy=$1$  Use Px to represent the price of food, Py to represent the price of clothing, and I to represent Sally’s income.      Question 1: Find Sally's food demand function, and Sally's clothing demand function. For the purposes of this question you should assume that I/Py greater than or equal Py/4Px.   Even by using the I=Py(y)+Px(x) formula, I tried using $MUx\over MUy$=$Px\over Py$ and letting one of the price be 1. But I am unable to substitute into the income function as I could find y value.


Show that the zeros of $\sum_{k=1}^n kz^{k-1}$ are inside the unit disc

This is a homework problem that I wasn't able to solve, and I feel a little silly about it (the assignment has been submitted). The problem:     Let $P(z) = 1 + 2z + 3z^2 + \cdots + nz^{n-1}$. By considering $(1-z)P(z)$, show that zeros of $P(z)$ are contained inside the unit disc.   This is from Chapter 1 of Bak's Complex Analysis. A solution should only use algebraic manipulations of complex numbers (in other words, this problem is very easy to solve by employing the Gauss-Lucas theorem, but that's not "on the table" -- complex differentiation hasn't been defined in the scope of what's permissible).  What I've done:  $$\begin{align*} (1-z)P(z) &= 1+z+z^2+\cdots+z^{n-1}-nz^n \\  &= \frac{z^n-1}{z-1}-nz^n. \end{align*}$$ Let $z$ be a zero of $P(z)$; then it is a zero of $(1-z)P(z)$. Consequently, $$\begin{align*} nz^n &= \frac{z^n-1}{z-1} \\ nz^n(z-1) &= z^n-1 \\ nz^n(z-1)+1 &= z^n \end{align*} $$  Then $$|z^n| = |z|^n = |nz^n(z-1)+1|.$$ From the triangle inequality, $$ \begin{align*} |z|^n &\le |nz^n(z-1)| + |1| \\ |z|^n &\le n|z^n||z-1| + |1| \\ n|z|^n(|z-1|) &\le 1 \\ |z|^n &\le \frac{1}{n|z-1|} \end{align*} $$  At this point, I am stuck. I feel like I went down the wrong path, or maybe I just made an arithmetical error, but I can't find where.


I am looking for easy way of converting letter to number. In result I need to get.  A - 1,  B - 2, C -3 ... Z-26, AA - 27, AB -28  and so on.  For now, I just created code for converting all letters from [A - Z]  public static int getNumber(String str) {     char[] alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".toCharArray();     Map<Character, Integer> letterWithNumbers = new HashMap<>();     int counter = 1;     for(char c: alphabet) {         letterWithNumbers.put(c, counter ++);     }     return letterWithNumbers.get(str.charAt(0)); }   How can we convert the next values?  Edit: Thanks to Zeb in comments the answer is:  public static int getNumber2(String str) {     int result = 0;     char[] alph = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".toCharArray();     Map<Character, Integer> vals = new HashMap<>();     int i = 1;     for(char c: alph){         vals.put(c, i++);     }     char[] strChar = new StringBuilder(str).reverse().toString().toCharArray();     int base = alph.length;     int pow = 0;     for(char c: strChar){         result+=vals.get(c) * Math.pow(base, pow++);     }     return result; }


Number of solutions of polynomials in a field

Consider the polynomial $x^2+x=0$ over $\mathbb Z/n\mathbb Z$   a)Find an n such that the equation has at least 4 solutions  b)Find an n such that the equation has at least 8 solutions  My idea is to check individual n, and I found the answer for a is n=6 at x={0,2,3,5} f(x)={0, 6, 12, 30)  Is there any shorter way?


Show that there exists a ring homomorphism $f: Z/(m)\rightarrow Z/(n)$ sending 1 to 1 if and only if $n|m$.

Let $f$ such that $f(a+(m))=a+(n)$ I do not know how to prove that is well defined and that $n|m$  ,Could anyone help me, please?


suppose that the domain of variable x is the set of people, and f(x) = "x is friendly" , t(x)= "x is tall" and a(x) = "x is angry". Write the statement using these predicates and any needed quantifiers.  1) some people are not angry  2) all tall people are friendly  3) No friendly people are angry  My solutions:  1) $∃x\sim A(x)$  2) $∀xF(x)$  3) $\sim ∀x A(x)$  I'd like to know if my answers are right or wrong.


Is there any evidence pointing to the planned future development of Arda?

Is there any evidence in Tolkien's writing, notes or letters pointing to the planned future development of Arda?  More specifically, did he envision the Age of Man to usher in the industrial progress a la our Earth, or a forever-feudal Lords-and-serfs society?  I'm only interested in data from source materials, not idle "laws of history" speculations.


What is th difference betwen stat -c %B and stat -c %o?

For academic purposes im trying to demonstrate internal fragmentation of a file. As i understand it, internal fragmentation can be shown as a difference between the size of file and the size of all blocks contatining the file. Finding out the number of block was easy enough. My problem is finding the size of blocks.  Is this the number returned by stat -c %o? (4096) or stat -c %B (512).   What is the difference between these two? I've been trying to find answers online, however I'm only getting more confused. Other commands like blockdev --getbsz /dev/sda2 show my filesystem blocksize as 4096. However after doing caculations is seems that 512 is more fitting to be the asnwer im looking for (size of the file i was testing is 44933 and number of blocks is 88. Multiplying it by 4096 leaves us with 360448 which is more that 8 times size of the file).


This is a question that's been bothering me for the last couple of days:  How is it that the hobbits of the Fellowship were able to survive such cold temperatures throughout their travels without having any foot protection?   I know it's said that they have thick "leather like" soles, with ample amounts of hair for warmth but still, I don't understand how that could provide much more warmth than for instance a regular leather shoe. On top of this I know that multiple days (or even weeks) of their journey was spent crossing mountain ranges, which, near a summit would have a temperature far below freezing. This combined with the assumption that they only have the warmth of shoes on there feet would have presumably resulted in some level of frostbite. But to my knowledge there is no such mention of these problems in the novels or movies aside from the odd "It's cold".  Anyways, I'm just wondering if anyone has some form of explanation to this phenomenon or do hobbits just have really durable feet?


Adding a loop cut between a vertex and edges on a sphere

I have a UV Sphere projected at the pole and the UV to a single point smear issue    I read that this is because blender does not properly map the triangles at the poles. I found that I can "fix" the UV vertices (ouch):     Or, perhaps a much easier way is to add a loop cut close to the pole to the VU has a quad instead of a trip to work with. The issue that I an having is; if I try and add a loop cut I can't seem get it to show up between the last edge loop and the pole.  For example I want to to place a loop cut where the arrow is:   Is there any way to fix this?


If $f'/f=g'/g$ at every $1/n$ then $f=kg$ for some complex number $k$

Suppose $f(z)$ and $g(z)$ are analytic in domain $D$, $f(z)$ and $g(z)$ never vanish at any $z\in D$ and that     $$ \frac{f'(z_n)}{f(z_n)}=\frac{g'(z_n)}{g(z_n)} $$ at a sequence  of points $\{z_n\}$ converging to $z_0\in D$. Show that $f=Kg$ for some $K\in \mathbb{C}$.   My Solution:   As $f,g$ are analytic in $D$ and none of them have any zero in $D$ implies $\frac{f'}{f}$ and $\frac{g'}{g}$ are also analytic on $D$. As $\frac{f'(z_n)}{f(z_n)}=\frac{g'(z_n)}{g(z_n)}$ and $z_n\to z_0 \in D$, using the identity theorem, $\frac{f'}{f}\equiv \frac{g'}{g}$ on $D$.  Now,  \begin{align*} \frac{f'(z)}{f(z)}=\frac{g'(z)}{g(z)},\ \forall\ z\in D. \end{align*} Solving this differential equation gives me $f=Kg$ for some $K\in \mathbb{C}$. Now my question is after doing the integration we will get $\log(f)=\log(Kg)$, is it valid in the complex logarithm?


I have a few commands that I have defined as follows:  \newcommand{\G}{     \ifmmode%     \mathcal{G}     \else$\mathcal{G}$\fi }   Annoyingly, if I write This a graph \G such that it outputs the \G and the such together. I know it is because the space after \G is there to finish the command, and not to be a proper space. So I tried:   \newcommand{\G}{     \ifmmode%     \mathcal{G}     \else     $\mathcal{G}$     \fi }   And this leaves a space behind. But, if I write we have graph \G, which... it will leave a space between the \G and the ,.  Is there a way of saying "automatically leave a space, except if it is punctuation." ?  Thanks


Wifi not working in HP laptop RTL8723DE realtek wireless driver

Bought a new HP 15q laptop with FreeDOS. Installed Ubuntu 16.04 LTS and Wi-Fi icon is not showing in taskbar.   $ lspci -nnk | grep -iA2 net 01:00.0 Ethernet controller [0200]: Realtek Semiconductor Co., Ltd. RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller [10ec:8168] (rev 15)     DeviceName: Hanksville Gbe Lan Connection     Subsystem: Hewlett-Packard Company RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller [103c:8328]     Kernel driver in use: r8169     Kernel modules: r8169 02:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. Device [10ec:d723]     DeviceName: WLAN     Subsystem: Hewlett-Packard Company Device [103c:8319]   My kernel version is 4.13.0. All answers seems to be outdated for my kernel version and also the official Realtek download site only supports up to kernel version 4.7.  If anyone has any idea how to go about this problem, please help me. I would be very much thankful to you for your support and any help will be heartily appreciated.


Postfix + dovecot, disable authentication on port 25

I use postfix 2.9.6 on ubuntu 12.04 (with dovecot if that matters).  I'm trying to disable auth on port 25 and only allow it on port 587, so that I can receive mails normally from other servers but that clients can only connect  on port 587 to send mails.  I tried following answers on here and on found on google, but whatever settings I change I'm always able to connect on port 25.  relevant part of my master.cf:  smtp      inet  n       -       -       -       -       smtpd  -o smtpd_tls_security_level=none  -o smtpd_sasl_auth_enable=no  submission inet n       -       -       -       -       smtpd  -o smtpd_tls_security_level=encrypt  -o smtpd_sasl_auth_enable=yes  -o smtpd_client_restrictions=permit_sasl_authenticated,permit_mynetworks,reject   my entire main.cf:  smtpd_banner = $myhostname ESMTP $mail_name (Ubuntu) biff = no append_dot_mydomain = no readme_directory = no smtpd_tls_cert_file=/etc/ssl/certs/dovecot.pem smtpd_tls_key_file=/etc/ssl/private/dovecot.pem smtpd_use_tls=yes smtpd_sasl_type = dovecot smtpd_sasl_path = private/auth smtpd_sasl_auth_enable = yes smtpd_tls_auth_only = yes smtpd_sasl_security_options = noanonymous smtpd_recipient_restrictions = permit_sasl_authenticated,permit_mynetworks,reject_unauth_destination  virtual_transport = lmtp:unix:private/dovecot-lmtp virtual_uid_maps = static:5000 virtual_gid_maps = static:5000 virtual_alias_maps = mysql:/etc/postfix/mysql/virtual_alias_maps.cf virtual_mailbox_domains = mysql:/etc/postfix/mysql/virtual_domains_maps.cf virtual_mailbox_maps = mysql:/etc/postfix/mysql/virtual_mailbox_maps.cf myhostname = xxxxxxxxxxxxxxxxxxx alias_maps = hash:/etc/aliases alias_database = hash:/etc/aliases myorigin = /etc/mailname mydestination = localhost relayhost = mynetworks = 127.0.0.0/8 [::ffff:127.0.0.0]/104 [::1]/128 mailbox_size_limit = 0 recipient_delimiter = + inet_interfaces = all milter_default_action = accept milter_protocol = 2 #( Postfix ≥ 2.6 milter_protocol = 6, Postfix ≤ 2.5 milter_protocol = 2 ) smtpd_milters = inet:localhost:12345 non_smtpd_milters = inet:localhost:12345 smtpd_client_message_rate_limit = 2 anvil_rate_time_unit = 60s


Use induction to prove $\gcd(m, n) = am + bn$

I tried to prove it with linear combination. Also other information,  $h*\gcd(m, n)=h*am+h*bn$ At each iteration $i$, $y_i=x_iq+r$ Last iteration $t$, so $x_t=\gcd(m, n)$.  Base case: Iteration t. $x_t=h_t*\gcd(m, n)=h_t*am+h_t*bn$. Last iteration, $x_t=\gcd(m, n)$, so $h_t = 1$. Hence, $\gcd(m, n)=am+bn$  I don't know how to prove that m, n are positive integers and a, b are integer.  Assume iteration k, $x_k=h_k*\gcd(m, n)=h_k*am+h_k*bn$, for some integer h, $x_k$ is a multiple of gcd. We need to prove $x_{k+1}=h_{k+1}*\gcd(m, n)=h_{k+1}*am+h_{k+1}*bn$.  I don't know is that correct, if it is wrong, please tell me  Also, I don't know is this prove correct.


How to get the perimeter of a circle from 8r to 2 $pi$ r

A friend showed me a circle inside a square such that the diameter of the circle is equal to the side length of the square. The perimeter of the square is 8r. He then proceeded to take small squares of the corners of the original square, maintaining perimeter as 8r. As this continues the original square begins to appear like a circle, somehow making it seem like the perimeter of the circle is 8r, which I know isn't true.   What is the flaw in the method above to show that it the perimeter is not 8r?


When I do  >>> a = [1]*3 >>> a  [1,1,1] >>> a[0] = a[0]+1 >>> a  [2,1,1]   which is perfectly fine, but when I do the same with sets iget the following  >>> a = [set()]*3 >>> a [set([]), set([]), set([])] >>> a[0].add(1) >>> a  [set([1]), set([1]), set([1])]   Which is a very strange behaviour, any explanation for this?


Let $(X, \rho)$ be a compact metric space.   Suppose that $T: X \rightarrow X$ and for all $u \neq v \in X$,  $$ \rho(T(u),T(v)) < \rho(u,v) $$  Then show that $T$ has a unique fixed point.    I am thinking to first show existence, and then show that it has to be unique.  To show existence, there is a hint to use the fact that $x$ is fixed if and only if $\rho(T(x),x) = 0$.  It is similar to the contraction mapping principle, but not enough that you can use it to prove this.  Also, if the above strict inequality is replaced by a weak inequality ($\leq$) then must $T$ have a fixed point?   I am thinking no, given that the requirement for a fixed point in the contraction mapping principle is that there be a $c \in (0,1)$ such that $ \rho(T(u),T(v)) \leq  c\rho(u,v)$.  I am thinking that a counterexample would be enough to show that this is not true.


error: Caused by: java.lang.NullPointerException: Attempt to invoke virtual method 'double java.lang.Double.doubleValue()' on a null object reference

When defining a double type it gives this error but the error to the ethical one when clicking the button to save  I have already made several attempts to invoke in several different types and nothing  public void save(View view){          if ( validateFields() ){             moviment = new Moviment();             String date = fieldDate.getText().toString();             Double valueRecovery = Double.parseDouble(fieldValue.getText().toString());              moviment.setValue( valueRecovery );             moviment.setCategory( fieldCategory.getText().toString() );             moviment.setDescription( fieldDescription.getText().toString() );             moviment.setDate( date );             moviment.setType( "Expense" );              Double expensA = totalExpense + valueRecovery;             expenseAt( expensA  );              moviment.save( date );              finish();           }       }   The expected output is that it is saved in the firebase but causes this error


How to remove memtest86 menu entries from Grub 2

How to hide/remove memtest86 menu entries from Grub2. I have Ubuntu 15.04


I need to watch properties for changes. Which method is better in terms of performance and memory use: implementing INotifyPropertyChanged or using a DependencyProperty?  Note: Yes, I have read the other question .


I am currently using the below code to email users when a new post is published, but I need it to BCC all users and not TO all users. Any ideas?  function email_members($post_ID)  { global $wpdb; $usersarray = $wpdb->get_results("SELECT user_email FROM $wpdb->users;"); $users = implode(",", $usersarray); mail($users, "New WordPress recipe online!", 'A new recipe have been published on http://www.wprecipes.com'); return $post_ID; }  add_action('publish_post', 'email_members');


When magnetic flux is changed linked with the coil the the electric field is produced inside the coil. But this electric field is non-conservative field whereas the electric field produced by the static charge is conservative. Why when the magnetic flux is changed linked with the coil electric field induced is nonconservative? Why a static charge produce conservative Field?


How much red, blue, and green does white light have?

Different kinds of white light have a different spectrum.  Light from a white LED will have blue at the peak intensity while white light from a CFL or something else will have a different looking spectrum.  I don't understand how this works. Shouldn't pure white light have a unique spectrum no matter what?  For example, a certain white LED's spectrum looks like this:$\hspace{100px}$.


Integration : different answers from two methods

There seems to be no way to get these expressions from both the methods to match. I know the arbitrary constant could vary in different methods but even the strcture of both these expressions are not close to same.  I know there is no calculation error because I differentiated the final expressions in both the methods to get the starting integrand.   Please tell me why the expressions don't match then.


Are there any known how-tos or best practices for web service REST API versioning?  I have noticed that . Is this the only way or are there other ways to accomplish the same goal? If there are multiple ways, what are the merits of each way?


Prove that there does not exist a sequence $I_n=[a_n,b_n]$ such that $\bigcup_{n}I_n=[0,1]$

Prove that there does not exist a sequence $I_n=[a_n,b_n], n=1,2,\ldots $ of nonempty, pairwise disjoint intervals such that $\cup_{n}I_n=[0,1]$.   My solution -- is it correct?  My idea is that taking an open cover $\{A_{\alpha_i}\}$ of  $[0,1]$ then $(\cup_{i}A_{\alpha_i})\cap (\cup_i I_i)=\cup_{i}(A_{\alpha_i}\cap I_i)$ is a open cover of $[0,1]$ as well (correspondence to induced topology).   Moreover, $(A_{\alpha_i}\cap I_i)\cap (A_{\alpha_j}\cap I_j)=\emptyset$ with $i\ne j$.   Since $[0,1]$ is compact, there exists $N$ such that $ \cup_{i=1}^N(A_{\alpha_i}\cap I_i) \supset[0,1]$.   However, $[0,1] \supsetneq \cup_{i=1}^N(A_{\alpha_i}\cap I_i)$ since $\cup_{i=1}^N(A_{\alpha_i}\cap I_i)$ and $I_n=[a_n,b_n], n=1,2,\ldots $ of nonempty, pairwise disjoint intervals.   So, we get contradition $[0,1] \subsetneq [0,1]$.   Could you please give your idea about my solution? Thank you very much for your help.


Path and Fill doesn't line up, anyone got any solutions?

I can't see to work out why the fill within the path doesn't line up with it. I have checked to see if I have any transform effect applied to your path, which there isn't. There is no stroke on this image, it is just a fill that seems to be a couple pixels below the path. There is no brush stroke applied as its just a fill.  So I am pretty stumped, here is the image to get an idea of what it looks like.  Thanks for your time guys, any possible solutions would be greatly appreciated!  ]


"Change their positions" vs. "change their position"

Possible Duplicate:             Should the singular or plural of position should be used in the following sentences?        Why Political Parties Change Their Positions: Environmental...   Do the stars change their position through the course of the night?   Why do stars appear to change their positions through the year?   Why do shadows change their position during the day?      The sentences are from the first page of the .


Solving system of Congruences with Two Variables (x and y)

I know a bit about the Chinese Remainder theorem but what do I do in the case I was asked to solve a system of congruences such as this with two variables:  $3x + y = 7$ (mod 8)  $4x + 3y = 1$ (mod 8)


Why do some people put an extra "DO" in a sentence?

I've seen many people put an extra "DO" in a sentence. I know it's for emphasis, but is there an official name for it?  For example: "I like her" is perfectly correct, yet "I DO like her" is also pretty common.   One of my students asked me this and I just said it's for emphasis, but I can't figure out whether it's just colloquial usage or if there's an official rule for it.


Network namespaces and scripts seem to break $PATH

Assume the following script:  $ cat test.sh #!/bin/bash echo $PATH   This happens:  $ echo $PATH /usr/local/bin:/usr/bin:/usr/local/sbin:/usr/sbin:/home/<user>/.local/bin:/home/<user>/bin $ sudo ip netns exec blue echo $PATH /usr/local/bin:/usr/bin:/usr/local/sbin:/usr/sbin:/home/<user>/.local/bin:/home/<user>/bin $ ./test.sh /usr/local/bin:/usr/bin:/usr/local/sbin:/usr/sbin:/home/<user>/.local/bin:/home/<user>/bin $ sudo ip netns exec blue ./test.sh /sbin:/bin:/usr/sbin:/usr/bin   Why. It's breaking my scripts ecosystem because it means they cannot see many of my binaries.  Out of the two distributions I've tested this in, Fedora 24 is the only one that does it. Ubuntu 14.04 echoes all $PATHs the same as I expect.  I tried adding to the script  $ sudo ip netns exec blue PATH=$PATH   But it errors out, presumably because PATH=etcetc is not really a command.  What is the correct way to do it?


I am looking for an explicit example for a Hamel basis for  $\ell^{p}$?. As we know that for a Banach space a Hamel basis has either finite or uncountably infinite cardinality and for such a basis one can express any element of the vector space as a finite linear combination of these. After some trying I could not write one explicitly. A quick google search did not reveal anything useful except for the proof of uncountability of a an infinite Hamel basis. Maybe I am being a bit silly but I don't think the answer is as obvious as for a Schauder basis for the same case.  So, what is an explicit example for a Hamel basis for $\ell^{p}$??


How do I determine my games minimum hardware/software requirements?

With me going it alone in development I only have limited resources at my disposal i.e one pc with which I develop and test the game. so I only know for certain my game works with that setup.  What options have I got in testing the game on the many different hardware/operating system combinations? Its a windows desktop game.


I am not able to center text in a multirow table, I want all column values to be centered here is the code \begin{table}[]         \caption{$\alpha$ values obtained Analytically}     \label{table:Alphavalues}     \begin{tabular}{|l|l|l|l|}         \hline         OCL                   & Report  (r)     & Selection  & Output \\ \hline         \multirow{2}{*}{99\%} & \multirow{2}{*}{20} & 20\%     & 0.55                  \\ \cline{3-4}          &                     & 40\%     & 0.82                  \\ \hline         \multirow{2}{*}{99\%} & \multirow{2}{*}{30} & 20\%     & 0.77                  \\ \cline{3-4}          &                     & 40\%     & 0.76                  \\ \hline     \end{tabular} \end{table}