What restrictions can I put in my contract when designing a logo for a non-profit?

I'm designing a logo for an event put on by a non-profit, and I am giving them a really good deal on it as they cannot afford what it is worth. It is a cause I believe in so I would like to help them succeed.  That being said, if they decide to sell merchandise with the logo, would it be inappropriate to expect a portion?  I am thinking of granting rights to all printed and online media, but merchandising rights would be a separate licensing fee (is this how I would word it?).  Would this be alright to put in a contract? I know most logos sign over all-rights, but the client would also pay more for this clause.   Edit: the non-profit is not a charity, and receives funding and grants. They also make quite a bit of money from this event and others, as well as member fees. I am privy to their available accounts and know they can afford to pay, but they don't understand the value of graphic design.  Also, if this question has been asked before, please send me a link. I looked and couldn't find one.


Error message while opening VMM:     Unable to connect to libvirt.  You need to install openssh-askpass or   similar to connect to this host.


How do I return multiple variables from a single function in python 3?

I am a student who is currently learning the basics of Python. I understand how functions work, but I do not know how to return multiple variables from a single function. I am able to reach the same effect by just using copy + paste, but that's not accepted by the teacher. I wish to run the function twice, and I want the program to save both of the outputs, but only in seconds. Below is the program in question, and when you enter your birthday, it will give you your age in seconds, minutes, hours, days, weeks, months, and years.   #Age Finder Program #This program will calculate a person's age   import datetime  #Get current dates current_month = datetime.date.today().month current_day = datetime.date.today().day current_year = datetime.date.today().year  def age():  #Get info name = input('What is your name?') print('Nice to meet you, ', name,) print('Enter the following information to calculate your approximate age!') month_birth = int(input('Enter the numerical month in which you were born:    ')) day_birth = int(input('Enter the numerical day in relation to the month of which you were born: ')) year_birth = int(input('Enter the year in which you were born : '))  #Determine number of seconds in a day, average month, and a year numsecs_day = 24 * 60 * 60 numsecs_year = 365 * numsecs_day  avg_numsecs_year = ((4 * numsecs_year) + numsecs_day) // 4 avg_numsecs_month = avg_numsecs_year // 12  #Calculate approximate age in seconds numsecs_1900_dob = ((year_birth - 1900) * avg_numsecs_year) + \                     ((month_birth - 1) * avg_numsecs_month) + \                     (day_birth * numsecs_day)  numsecs_1900_today = ((current_year - 1900) * avg_numsecs_year) + \                     ((current_month - 1) * avg_numsecs_month) + \                     (current_day * numsecs_day)  age_in_secs = numsecs_1900_today - numsecs_1900_dob age_in_minutes = age_in_secs / 60 age_in_hours = age_in_minutes / 60 age_in_days = age_in_hours /24 age_in_weeks = age_in_days / 7 age_in_months = age_in_weeks / 4.35 age_in_years = age_in_months / 12  #Output print('Well,',name,', you are approximately', age_in_secs, 'seconds old!') print('Or', age_in_minutes, 'minutes old!') print('Or', age_in_hours, 'hours old!') print('Or', age_in_days, 'days old!') print('Or', age_in_weeks, 'weeks old!') print('Or', age_in_months, 'months old!') print('Or', age_in_years, ' years old!')  #Extra if age_in_years < 18:     print('Have fun in School!\n')  age()


"States Party to" or "State Parties to" or "States parties to"?

When discussing a treaty or international agreement, which is correct?  "There are 100 states party to the treaty." (for example, as used )  Or:  "There are 100 state parties to the treaty." (for example, as used )   Or: "There are 100 states parties to the treaty."  (for example, as used )


How to install Chromium Web Browser on Ubuntu 15.04

I am trying to install Google Chrome,or Chromium Web Browser on Ubuntu 15.04, I tried:  sudo apt-get update sudo apt-get install google-chrome-stable   in Terminal,but it says:  E: Unable to locate package google-chrome-stable   So what do I do to install Chromium Web Browser on Ubuntu 15.04?


Why is the regex pattern '?!' not working with grep?

One could use -v to exclude a single word from a file, but I'm wondering why the regex pattern ?! is not working with grep/egrep.  I was searching for a pattern to exclude a single word from my search in a file in atom editor and found  link. The ?! works perfectly in atom. In bash I had to turn off histexpand with set +H first, otherwise you get -bash: !xxx: event not found as !pattern searches the history. After that I tried stuff like echo "no" | grep "^(?!yes).*", but grep does somehow not recognize the ?! pattern - why is that so?


How to copy a file in current directory? e.g. I have  a file at /abc/xyz and I am in the current directory mno -- I want to copy a file from /abc/xyz/file.txt into mno.   cp command:   cp /cp_file_path /Destination_path    But what about destination path as my current directory?


I have a drive on /dev/sda1 that's mounted to   /media/<username>/mydrive   Everytime I reboot my computer I have to execute the following two commands to change mount path:  sudo umount /media/<username>/mydrive sudo mount /dev/sda1 /home/<username>/media/<username>/mydrive   How do I automate this? or change it so the default mount path can be:  /home/<username>/media/<username>/mydrive


Great Theorem - Help name the Sci-fi book read long ago

I'm trying to find a book I read long back. This book may have won a Hugo/Nebula (Trust me I've googled to death this one!).  Don't remember much of the story (that's why I want to re-read it). What I remember is that some of the powers in the book are called "Gods". And they have brains the size of the planets (or planets being their brains).  The protagonist in the climax, solves a theorem (The Great Theorem, perhaps) by remembering one of the obscure theorems (Jacuzi (?)) and incorporating it. This [Great] theorem helps spaceships helps find the shortest route from point A to B. He surprises the antagonist by reaching the vantage point quickly with the help of his new knowledge, and blasts his enemy's spaceship.  The ending of the book - as I remember it is - that the protagonist wants to become a God himself.  Please let me know the title & author of this book if you've read it.  PS #1:  BTW, It's not Asimov's The Gods Themselves :) PS #2:  It's published at the least before 1998


Which is correct - "Do you have..." or "Have you..."?

Example:     [1] Do you have an English book?      [2] Have you an English book?    Which of the two sentences is correct in terms of language and use?


How do I determine number of damage sources for calculating Damage Reduction?

Damage reduction reduces damage from each source:  Consider having  DR2, if you were attacked by 6 sources each dealing 3 damage, you would take 6*(3-2)=6, however, if it was 1 source dealing 18 you would take 1*(18-2)=16.  My question is how to determine the number of sources of damage in regard to DR when dealing with "AOE-ish" situations. Consider the two following scenarios:   A classic trap of a moving wall that crushes you (to the wall in front of it).   If the wall is blunt, it deals all its damage as one object and can be considered a single source and so DR applies once. If the wall is spiky, then you can argue that the damage is distributed by each spike, thus DR applies multiple times. In this case, you might also be able to argue that a creature of size tiny (or whatever is small enough) would not get hit at all since it can move between the spikes (and the wall can't close on it all the way). You could not make this argument if you treat the wall as a single damage source, or could you?  A classic (densely) spiked shallow pit (shallow enough you could stand inside it).   You stand in the pit with both feet and the trap can be considered a single damage source. You partition the pit between your feet so that now you have 2 pits, with one foot in each. Is it now 2 damage sources so that DR applies twice?    I'm not saying you should treat a sword as 10^20 atoms each dealing its own damage, but would you just treat "a trap" as "a single source of damage" regardless of how complicated it is?


I have migrated from Windows 7 to Ubuntu just yesterday. Windows 7 was in my C: drive. I did not realise that if I wipe Windows 7 and install Ubuntu, Ubuntu would be installed in the C: drive only. So I didn't make any backups, and I deleted Windows and installed Ubuntu. But, Ubuntu has formatted my hard drive and I have lost all my important data!  How can I recover my data now?


The wrong window opens when the program starts

I am making a pyqt program to register and authorize a user. I want to have a start window with buttons that, when clicked, will open either an authorization window or a registration window. But when I import the registration module, for example, the registration window opens instead of the main window. Can you please tell me where I made a mistake? Main module: from PyQt5 import QtWidgets, QtCore from start import Ui_Form #py file with start window ui properties  import registration #registration module class StartWindow(QtWidgets.QMainWindow):     def __init__(self):         super(StartWindow, self).__init__()         self.ui = Ui_Form()         self.ui.setupUi(self)         self.ui.RegButton.clicked.connect(reg_clicked())         self.openreg=registration.mywindow(self)         #self.ui.AuthButton.clicked.connect()      def reg_clicked(self):         self.openreg.show()          app = QtWidgets.QApplication([]) application = StartWindow() application.show() sys.exit(app.exec())  Part of registration module: from PyQt5 import QtWidgets, QtCore import record_proc from reg import Ui_Reg  class mywindow(QtWidgets.QMainWindow):     number_of_samples=1     def __init__(self):         super(mywindow, self).__init__()         self.ui = Ui_Reg()         self.ui.setupUi(self)         self.ui.RecordButton.clicked.connect(self.Recording)         self.ui.AuthButton.clicked.connect(self.Register)         self.ui.CheckLogin.clicked.connect(self.CheckLogin) app2 = QtWidgets.QApplication([]) application2 = mywindow() application2.show() sys.exit(app2.exec())


How to get align environment in the same line as text

I would like to have an align environment which is not automatically written in a new line. For example in the following code, the formulas should appear in the same line as the itemize-dot or the Proof. :  \documentclass[10pt,a4paper]{article} \usepackage[latin1]{inputenc} \usepackage{amsmath} \usepackage{amsthm} \begin{document}  \begin{itemize}     \item     \begin{align*}     x & = 0 \\     y & = 15     \end{align*} \end{itemize}  \begin{proof}     \begin{align*}     x & = 0 \\     y & = 15     \end{align*} \end{proof} \end{document}   I know that I could use $\displaystyle x=0$ for single lines but the align environment is clearly better when aligning more than one line of formulas. Does anybody have an idea?


The absence of some strings in Transifex

I cannot find these strings using Transifex:      (name hidden from user)       Regards,   {site name} Moderation Team          There is  and it seems like this string does not work ok (it is translated and approved, but, unfortunately, not rendered on the site).   All of the strings are taken from Moderator Private Messages interface.   Could you please fix it?


Does starting a sentence with "it is" make it passive?

Suppose I say:     It is foolish to lick a metal pole.   Is this in the passive voice?  Would this sentence be better as:     To lick a metal pole is foolish.   How about:     Licking a metal pole is foolish.


Is there a known well ordering of the reals?

So, from what I understand, the axiom of choice is equivalent to the claim that every set can be . A set is well ordered by a relation, $R$ , if every subset has a least element. My question is: Has anyone constructed a well ordering on the reals?  First, I was going to ask this question about the rationals, but then I realised that if you pick your favourite bijection between rationals and the integers, this determines a well ordering on the rationals through the natural well order on $\mathbb{Z}$ . So it's not the denseness of the reals that makes it hard to well order them. So is it just the size of $\mathbb{R}$ that makes it difficult to find a well order for it? Why should that be?  To reiterate:   Is there a known well order on the Reals? If there is, does a similar construction work for larger cardinalities? Is there a largest cardinality for which the construction works?


Can an Indian travel to India with 50 days before passport expires?

My wife is travelling from Philadelphia to India in January 2019 and, on her outbound trip, she will only have 50 days validity left on her passport. However, while in India, she will be renewing her passport. The reply from a similar question seems to answer point 1 below, but I wanted a second opinion to be sure.  Here are the questions we have:  Can she travel from the US to India via Doha, Qatar with passport validity of only 50 days? Can we make a reservation on Qatar Airways for the roundtrip travel using her current passport and before the return from India to the US update passport information on the reservation?


OS X 10.9: where are password hashes stored

I think on previous versions of OS X, password were stored in the /etc/shadow file.  Nevertheless, this file doesn't appear to exist in the later versions of the operating system - specifically OS X 10.9 which is the first of the non-cat named OS releases.  Does anyone know where the password hashes are stored on OS X Mavericks?


I want to test my pages in IE7 and need a good debugging toolbar like Firebug.. I know there is the default IE Developer toolbar which comes, but that does not seem very helpful, specially for script debugging..  I need a tool like Firebug which can be very useful (like I can view what is there in the markup as well after script execution)


How can I replace ubuntu with Windows 8.1?  I got my Windows CD, but Ubuntu cannot read it or I just don't know how to run it on Ubuntu.


On Join Message That is Only Sent Once Per Join

I'm wondering about a potential command block program that will give a player a Unique id that I can use for multiple things. Just I need the command to pick up every single id that has joined that day (All ids reset at midnight) And know when they leave, so they can tag that id with leave when they join however it gives them the tag join. Once they join and lose the leave tag, they are given an actionbar message. If there is a simpler way please tell me!  Note: basically my goal here is to detect when someone leaves, and when they join gives them a message that is once per join. When they rejoin they get the message again, but never get it again per that session on the server.  Edit: So Its Kinda Of A Arena server so when you join I want to to say in the actiobar &7Welcome, You Are In Arena &C&l1. And Then Shut Off after about 2 seconds or so. The session is when someone joined until they leave. Not a first time join thing, it is sent every time the player joins.


How to derive relation for time derivative in a rotating reference frame

I am looking for an appropriate derivation of the $(\frac{d}{dt})_{\text{laboratory}} = (\frac{d}{dt})_{\text{rotating}} + \omega \times $ relationship that enables one to calculate all desired quantities in a rotating referece frame. Does anybody know a good way how to understand this transformation?


Why is the order of $GL(d,F) = (q^d-1)(q^d-q)...(q^d-q^{d-1})$?

$F$ is a field of order $q$.  We are essentially counting the total number of possible ordered bases in the vector space $F^d$.   The first vector has $q^d - 1$ possibilities because we need to exclude the zero vector.  The second vector cannot be a scalar multiple of the first vector, and there are $q$ scalars in $F$, so once we have chosen the first vector, there are $q^d-q$ possible ways to construct the second vector such that $v_1$ and $v_2$ are linearly independent.  But what about the third vector? Why are there $q^d-q^2$ possibilities?


Difference between reflection and re émission of light

I would like to understand the difference between reflection of light and re emission.  Indeed in both case an observer far from the object will se an electromagnetic field coming to him.  When we take a perfect conductor an a E.M wave going to it, we know that the wave is "reflected" but can we also see it in the way that the material absorbed the light and re emitted it ?  Is the difference based on the fact that in re emission the energy is stored for a finite amount of time in the material and the re emitted as a ray whereas in reflection the energy of the incident beam is never stored by the material ?  Thank you for your answers.


I have a linkage error with the following example:  In a file named a.h:  namespace n { class A {     ...  public:   template<class Function, class... Args>   void a_member(Function &&f, Args &&...args);  private:   std::thread *t_; }; }   In A.cpp:  #include "A.h"  template<class Function, class... Args> void n::A::a_member(Function &&f, Args &&...args) {     this->t_ = new std::thread(std::forward<Function>(f), std::forward<Args>(args)...); }   In a file named B.h:  #include "a.h" #include "c.h" /* declaration of class C */  class B {  public:   void b_member1();   void b_member2(C c);  private:   A *a_; };   In B.cpp:  #include "B.h"  void B::b_member1() {     C c;     this->a_ = new A();     this->a_->a_member(&B::b_member2, c); }   I'd like to wrap the call to the thread callback with a member function with a parameter of class C.  EDIT:  Since the method has been moved in the header, an error still persist: the call to thread constructor seems to be incorrect (signature of function mismatch):  this->t_ = new std::thread(std::forward<Function>(f), std::forward<Args>(args)...);


How is momentum conserved in magnetic field?

In a uniform perpendicular magnetic field , force on charged particle cause change in direction of momentum. How do we explain it using conservation of momentum?  I don't know what is Hamilton or canonical or something like that.


My internet package is 60mbps. When I check the speed of internet in my computer (which is connected directly to the ethernet port and the router) via speedtest.net (Ookla) its showing 60mbps which is perfectly alright. But when I check the speed of the other devices that are connected to the internet through WiFi, via the same website, its not crossing 20mbps. That too the speed is not at all consistent, it ranges anywhere between 0mbps(no internet) to 20mbps. Is my router spoiled?


Integral $\int_0^1 \log \left(\Gamma\left(x+\alpha\right)\right)\,{\rm d}x=\frac{\log\left( 2 \pi\right)}{2}+\alpha \log\left(\alpha\right) -\alpha$

Hi I am trying to prove$$ I:=\int_0^1 \log\left(\,\Gamma\left(x+\alpha\right)\,\right)\,{\rm d}x =\frac{\log\left(2\pi\right)}{2}+\alpha \log\left(\alpha\right) -\alpha\,,\qquad \alpha \geq 0. $$ I am not sure whether to use an integral representation or to somehow use the Euler reflection formula $$ \Gamma(z)\Gamma(1-z)=\frac{\pi}{\sin \pi z} $$ since a previous post used  that to solve  this kind of integral.  Other than this method, we can use the integral representation  $$ \Gamma(t)=\int_0^\infty x^{t-1} e^{-x}\, dx. $$  Also note $\Gamma(n)=(n-1)!$.


If $R=\mathbb{Z}[\sqrt{p}]$ with $p$ an odd prime and $I=(2,1+\sqrt{p})$, then $I^2=(2)$

I'm trying to show that if $R=\mathbb{Z}[\sqrt{p}]$ with $p$ an odd prime such that $p \equiv 3 \hspace{1mm} (\operatorname{mod} 4)$ and $I$ is the ideal generated by $2$ and $1+\sqrt(p)$ then $I^2$ is the ideal generated by $2$ I know that $$I^2=(4,2+2\sqrt{p},1+p+2\sqrt{p})$$ and that $4,2+2\sqrt{p},1+p+2\sqrt{p} \in (2)$, so I just need to prove that $2 \in I^2$ but I cannot prove it. Any ideas?


Dual nationality, not sure how to switch passports!

I am a US and EU citizen residing in the US. I am going backpacking throughout Africa and want to travel on my EU passport. My flight is US–Paris–Tunis–Cairo. When do I use each passport? Do I book my flight on the US passport or the EU passport? Can I leave the US on my US passport and then switch mid-flight and enter Paris with my EU passport?


Internet download manager alternative for OS X?

I was a longtime windows/linux user and just purchased a Mac, everything is great except that I need a good download manager for Mac which works like Internet Download Manager for Windows, I know some things would be different but I am specifically looking for following feature   ability to resume downloads automatic capture of downloads from browsers such as firefox   I use Downthemall in firefox right now but it is not as reliable as it was on Windows.


What happened to the art style in Fairy Tail?

What happened to the art style in Fairy Tail after episode 175?  Old art style:    New art style:


Php foreach remove duplicate using value

I have an array like this   Array (     [0] => Array         (             [idvox_business] => 5             [logo] => 1fJCb1_walmart_logo.jpg             [name] => Walmart             [icon] => http://maps.gstatic.com/mapfiles/place_api/icons/shopping-71.png             [lat] => 32.931393             [lng] => -96.840333             [miles] => 1             [place_id] => ChIJATuR8y0nTIYRQuI_GuSYqNs         )      [1] => Array         (             [idvox_business] => 41             [logo] => tqkuHo_bestbuy.png             [name] => Best Buy             [icon] => http://maps.gstatic.com/mapfiles/place_api/icons/shopping-71.png             [lat] => 32.9274             [lng] => -96.837284             [miles] => 1             [place_id] => ChIJVVVVVSknTIYReq3C1jDTAeM         )      [2] => Array         (             [idvox_business] => 41             [logo] => tqkuHo_bestbuy.png             [name] => Best Buy             [icon] => http://maps.gstatic.com/mapfiles/place_api/icons/shopping-71.png             [lat] => 32.927357             [lng] => -96.837275             [miles] => 1             [place_id] => ChIJs5gXoC0nTIYR-TFzaCpxVvE         )      [3] => Array         (             [idvox_business] => 16             [logo] => C25fIa_macys_logo.jpg             [name] => Macy's             [icon] => http://maps.gstatic.com/mapfiles/place_api/icons/shopping-71.png             [lat] => 32.92978             [lng] => -96.81953             [miles] => 2             [place_id] => ChIJWb8Ag9sgTIYRiPwoJIqw2rc         )      [4] => Array         (             [idvox_business] => 41             [logo] => tqkuHo_bestbuy.png             [name] => Best Buy             [icon] => http://maps.gstatic.com/mapfiles/place_api/icons/shopping-71.png             [lat] => 32.956207             [lng] => -96.815811             [miles] => 3             [place_id] => ChIJnVzmzT0hTIYRsWuHSl2p1Ig         )  )   I want to remove duplicates from this array but i need to omit only last unique array output need like this   Array (     [0] => Array         (             [idvox_business] => 5             [logo] => 1fJCb1_walmart_logo.jpg             [name] => Walmart             [icon] => http://maps.gstatic.com/mapfiles/place_api/icons/shopping-71.png             [lat] => 32.931393             [lng] => -96.840333             [miles] => 1             [place_id] => ChIJATuR8y0nTIYRQuI_GuSYqNs         )      [1] => Array         (             [idvox_business] => 41             [logo] => tqkuHo_bestbuy.png             [name] => Best Buy             [icon] => http://maps.gstatic.com/mapfiles/place_api/icons/shopping-71.png             [lat] => 32.9274             [lng] => -96.837284             [miles] => 1             [place_id] => ChIJVVVVVSknTIYReq3C1jDTAeM         )        [3] => Array         (             [idvox_business] => 16             [logo] => C25fIa_macys_logo.jpg             [name] => Macy's             [icon] => http://maps.gstatic.com/mapfiles/place_api/icons/shopping-71.png             [lat] => 32.92978             [lng] => -96.81953             [miles] => 2             [place_id] => ChIJWb8Ag9sgTIYRiPwoJIqw2rc         )   )


IPv6 Loopback Addresses (equivalent to 127.x.x.x)

I have a development environment set up where I have a separate loopback address for multiple websites.  For example, I have the following:  127.0.0.1 www.example.com 127.0.0.2 foo.example.com 127.0.0.3 bar.example.com 127.0.0.4 waffles.example.com   I'd like an equivalent solution for IPv6.  I already know that you can use ::1 as a loopback address, but ::2, ::3, etc don't seem to work.  Are there any other loopback addresses in IPv6?  Is there a way to have multiple unique loopback addresses?


I accidentally pressed some unknown key combination, and now I can't use Undo nor Redo in Blender


How can I rotate a Transform over a specified time in a single line of code?  I have had a lot of trouble with this in the past.  I wrote a script which rotates a Transform by a specified rotation over n seconds, or rotates a Transform towards a Vector3 over n seconds, in a one liner.  I hope it helps others in the future.  See below.


Gauss circle problem : a simple asymptotic estimation.

Find the number of integer points lying in or inside a circle of radius $n\in \mathbb N$ centered at the origin.   The problem asks for all $(a,b)\in \mathbb Z^2$ such that $a^2+b^2\leq n^2$. Looking at such points lying strictly in the North-East quadrant, pick an $a\in \{1,\ldots,n\}$ and let $b$ run through $\{1,\ldots,\lfloor \sqrt{n^2-a^2}\rfloor\}$ : there are exactly $\displaystyle \sum_{k=1}^n \lfloor \sqrt{n^2-k^2} \rfloor$ integer points strictly in the quadrant.  Multiply that by $4$ to account for all $4$ quadrants, add the origin and points on the $x$ and $y$ axis and the total number is $$1+4\sum_{k=0}^n \lfloor \sqrt{n^2-k^2} \rfloor$$  I'm interested in asymptotics of this sum. A trivial estimate is the following:$$\begin{align}\sum_{k=0}^n \lfloor \sqrt{n^2-k^2} \rfloor &= \sum_{k=0}^n \sqrt{n^2-k^2} + O(n)\\ &= n^2\cdot \left(\frac 1n \sum_{k=0}^n \sqrt{1-\frac{k^2}{n^2}}\right) + O(n) \\ &=n^2 \left( \int_0^1 \sqrt{1-t^2}dt + o(1)\right) + O(n) \\ &= \frac \pi 4n^2 + o(n^2)\end{align} $$  Hence $$1+4\sum_{k=0}^n \lfloor \sqrt{n^2-k^2} \rfloor = \pi n^2 + o(n^2)$$     Is there a way to refine the estimate above and get $\pi n^2 + O(n)$ instead (or something better) ?


I am running Ubuntu 14.04 LTS, 64-bit. I know there are a lot of topics on ".tar.gz" but it didn't answer my questions and/or I didn't undetstand the answers.   I am trying to install from a .tar.gz file and I am having difficulties. The file is from  I download it to my home directory and extract it to mentioned directory, there are 3 files in the folder and I don't know what to do with these (usually there is a readme file). Double-clicking them doesn't do anything.   What to do? I would to prefer to solve this within the GUI and avoid the terminal, if possible.  As requested by Xen2050; these is the content of the .tar file:   @fz-System-Product-Name:~/Popcorn-Time-linux64$ ls -la total 103176  drwxrwxr-x  2 fz fz     4096 jan 22 12:15 . drwxr-xr-x 33 fz fz     4096 jan 22 12:42 .. -rwxrwxrwx  1 fz fz  2395800 apr 28  2014 libffmpegsumo.so -rwxrwxrwx  1 fz fz  4031601 apr 28  2014 nw.pak -rwxrwxrwx  1 fz fz 99207331 apr 28  2014 Popcorn-Time


$x_n^3- y_n^3 \rightarrow 0 \ as \ n \rightarrow \infty$, then $x_n- y_n \rightarrow 0 $ if

Consider two real valued sequences $\{x_n\} and \{y_n\}$ satisfying the condition $x_n^3- y_n^3 \rightarrow 0 \ as \ n \rightarrow \infty$, then (A) $x_n- y_n \rightarrow 0 $ (B) $x_n- y_n \rightarrow 0 $  only if  $\{x_n\}$ converges (C) $x_n- y_n \rightarrow 0 $  only if  $\{|x_n|-|y_n|\}$ converges (D) $x_n- y_n \rightarrow 0 $  only if  $\{|x_n^2 +x_ny_n+y_n^2|\}$ converges As suggested in the answer (d) may not be necessarily true, and additionally I can eliminate (b).


This is my code:    This is my first value. That is 8.    This is my next value. That is 11.    This is my integer value. That is 107.    My expect return value is 271.78 but it return back me 271.78(0)3. That make me wonder why? I tried to casting foot and inch to double but it not work.     show me how to compare but i need to return a right number. It can't help me.


Does the wash rule apply for naturally expired option contracts

Does the wash sale rule apply to options expired worthless? for example, my BA Aug 18 call expired worthless (Just expired not sold) will this loss be considered a wash sale if I purchase BA long call option again today? Thanks, Prashantha


I am a citizen of St.Vincent and Antigua, I have a USA visa in my St.Vincent passport but I will be holidaying in the USA but I want to go over to Canada, can I use my Antigua passport to go to Canada because Antiguans don't need a visa for Canada. So my question is can I go into the usa on my St.Vincent passport then leave the usa on my Antigua passport for Canada?


Whats the cmd/powershell equivalent of `which` on bash?

I would like to find out which version of an executable the CMD shell uses. In any unix shell, I would use which to find it.  Is there an equivalent command in one of the Windows shells?


Check for specific driver support (Ubuntu 20.04 and RTL8125B))

New PC build with RTL8125B network chipset. I know its not yet supported in Ubuntu and I want to check before (!) creating a live USB stick if the new driver is integrated in any version updates. How can I check for specific driver support without creating a live USB or full installation?


What is the coefficient of $x^{10}$ in the expansion of $(5x^2 +3)^{14}$  Leave answer as an expression rather than number.  Do I have to expand using the pascal triangle 10 times or is there a formula cos they said leave it as a mathematical expression?


I am trying to prove that $(G, *)$ is an abelian group with $G=(-1,1)$ and $a*b=$$\frac{x+y}{1+xy}$.  Thus far I have found that the identity element $e=0$. From here, I set $a*b=0$ and found $a^{-1}$ to be $-a$.   My work for trying to prove closure and that the set is abelian is:  Let $a,b \in G$, where $a=e$ and $b=a^{-1}$. Does  $a*b=b*a$?  Evaluating, I see that $a^{-1}=a^{-1}$ which then proves that G is closed and G is an abelian group.  Did I go about this proof correctly and efficiently?


coding on Bluej with open university packages installed (not for course work)

this is a block of code that im writing (OUDialog is a package from the open university version of bluej that acts like a msgBox):    public void addItems(String accName){       for (int i=0;i<Accounts.size();i++){          if (Accounts.get(i).getName()==accName){             adding = true;             while (adding==true){                String choose = OUDialog.request("enter 'y' to continue.");                if (choose=="y"){                   Accounts.get(i).addEntrie();                }else{                   adding = false;                }             }          }       }          }  as far as i can tell everything should be working but when i run this method this if statement refuses to cooperate: if (choose=="y"){    Accounts.get(i).addEntrie(); }else{    adding = false; }  I have know idea why it cant detect when I enter "y" and cant find answers anywhere else. P.S. im asking here because i already finished my java programming course w/ the OU and cant ask my tutor.


First some code:      import java.util.*; //...  class TicTacToe  { //...  public static void main (String[]arg)  {       Random Random = new Random() ;      toerunner () ; // this leads to a path of                     // methods that eventualy gets us to the rest of the code  }  //...   public void CompTurn (int type, boolean debug)  {  //...          boolean done = true ;          int a = 0 ;          while (!done)          {              a = Random.nextInt(10) ;             if (debug) { int i = 0 ; while (i<20) { System.out.print (a+", ") ; i++; }}              if (possibles[a]==1) done = true ;          }          this.board[a] = 2 ;    } //...  } //to close the class    Here is the error message:   TicTacToe.java:85: non-static method nextInt(int) cannot be referenced from a static context             a = Random.nextInt(10) ;                       ^   What exactly went wrong? What does that error message "non static method cannot be referenced from a  static context" mean?


If I have velocity at perihelion/apphelion, distance away from sun at perihelion/apphelion, and orbital period. How can I find the angular velocity function for earth and subsequently all the other planets in the solar system?


WLAN hard blocked but working on windows

I have a Ubuntu 18.04 + windows10 dual boot. Recently my ubuntu crashed and i had to run boot-repair using a live disc. Since then my wifi on ubuntu hasn't been working. However the wifi works fine on windows.    I made sure the WLAN is enabled in BIOS. I am using lenovo ideapad 500-15ISK. I can't turn it on from the UI, no matter how many times i try.   Also, some off my hot keys like volume up/down, mute, touchpad disable and airplane mode don't seem to be working.  I reckon if the reason for hard block is a constant airplane mode signal to the network card somehow   here is the detailed output of my network card:   Edit 1  I had repaired the crash using a live disc and the wifi was working fine for that. Is it possible to do something using a live disc to repair this ?


How are administrators supposed to read root's mail?

What is the Ubuntu way for system administrators to receive system notifications, which typically take the form of e-mail sent to the root account?  Examples of such notifications are the output of cron jobs, or .  On a pretty much default Ubuntu 10.04 installation, I can't find any way that anything happens to root's mail other than being deposited in /var/mail/root. How are users supposed to 1. discover it and 2. read it as it arrives?  I observe that on a warty, the installer added root: myusername to /etc/aliases. So back then the user who installed the system if (s)he read the local mail. So there seems to have been a regression somewhere along the way. Still this was not a complete solution, because Ubuntu users can't be expected to be aware that they have local mail and should set up their mail client to read it.  ADDED: given current replies, a server user should be able to cope, provided he's aware of the issue. Fair enough. But consider J. Random Desktop User, who doesn't know how to use a command line, and only knows how to click the mailbox icon to read his mail. How can he be notified that his system wants to tell him something? (Allow a one-time intervention by a more competent user if that's unavoidable.)


When is a norm induced by an inner product?

Do inner products come from a norm,  or norms come from an inner product?  How do I prove that this is true?  Just want to know what comes from what, the chicken or the egg came first kind of thing.


Something like 'KDE Present Windows' / 'Compiz Scale' / 'Mac OS X exposé' in Openbox / LXDE / Xfce?

Is there a DE-independent utility to show all windows beside each other in more lightweight DEs like Openbox, LXDE or Xfce?  Something like this:


$a\mathbb{Z} +b\mathbb{Z} = \text{hcf}(a,b) \mathbb{Z}$

So I have shown that $a\mathbb{Z}+b\mathbb{Z}=k\mathbb{Z} $ for some k since it’s  a subgroup of $\mathbb{Z} $.  I have shown that $h\mathbb{Z} \subset k\mathbb{Z} $. Here’s $h=\text{hcf}(a,b) \mathbb{Z} $. I just need to show the opposite opposite inclusion using elementary arguments.


I want to put output information of my program to a folder. if given folder does not exist, then the program should create a new folder with folder name as given in the program. Is this possible? If yes, please let me know how.  Suppose I have given folder path like "C:\Program Files\alex" and alex folder doesn't exist then program should create alex folder and should put output information in the alex folder.


Find the limit of the function $f(x,y)=\frac{x^2 y^2}{x^2 y^2 + (x-y)^2}$ whenever $x^2 y^2 + (x-y)^2 \not= 0$ as $(x,y) \to (0,0) $

Find the limit of the function $f(x,y)=\frac{x^2 y^2}{x^2 y^2 + > (x-y)^2}$ whenever $x^2 y^2 + (x-y)^2 \not= 0$ as $(x,y) \to (0,0) $   I thought I can split this question into 4 limit question like  $$\lim_{(x,y) \to (0^+, 0^+)} f(x,y)$$ $$\lim_{(x,y) \to (0^+, 0^-)} f(x,y)$$ $$\lim_{(x,y) \to (0^-, 0^+)} f(x,y)$$ $$\lim_{(x,y) \to (0^-, 0^-)} f(x,y)$$  Logically, this way of looking the question should not be a problem, but it is to a efficient way to do it, especially if f(x,y) is more complicated than the one in this question.  So, how can I solve this question  more efficiently ? and what is the correct solution ?


Proving that if $n>2$ then $n!>n^{n/2}$ using induction.

How to prove that if $n>2$ then $n!>n^{n/2}$ using induction?


What is the reason Men play 5 sets & Women play 3 sets in a Grand Slam in Tennis?

In the ATP & WTA events, both Men & Women tennis players play best of 3 sets. But when it comes to Grand Slams, the Men play 5 sets. At the risk of sounding a misogynist, I always believe the reason to be strength & endurance. After all, a 5 set EPIC match lasts 5 hours while a 3 set EPIC last 3 hours.    Is that the only reason. Or am I a naive misogynist? Also was that the case since the history of Grand Slams or did Men play 3 sets before?


is there a way to downgrade Ubuntu 12.10 to 12.04 without any installation cds AND WITHOUT LOSING ANY DATA. Sorry for the caps, some people miss the improtant part. Also I know an alternate cd would work but they don't make them for newer Ubuntu releases so if I need to do this with 14.10-14.04 I'll be prepared.


How can we explain spin of electron, or the spin of other fundamental particles?  If we think the spin of electron is similar to the spin of a ball or planet we make a mistake.  We say it is an intrinsic property. However, in calculating magnetic momenta and other cases we consider it as spinning entity. It's too difficult to abandon the model which we see. Without which to explain abstract one becomes challenging.


Purpose of int with respect to main code in C++

I am just starting out in C++ and we are learning about typical statements in code.  One that we typically use is int main() at the start of the actual program portion.  I understand we can also use void main(). My question is, why do we use int? I thought this was for defining variable types.  Are we actually declaring that the whole code is a variable?


How is the /tmp directory cleaned up? Is it automatic? If so, how frequently is it cleaned up?


How can I display the appropriate data in a triple inner-join table?

I am new-ish to SQL queries and I'm trying to write a query properly which displays an event, its information, and the categories to which it belongs.  I want a result which looks like this:     TITLE: Band Battle!      WHEN: 7:00pm      VENUE: Parkland School      CATEGORIES: Music, School, Public   In my example, I have an event with three categories and I'm having trouble displaying this properly. I can get it to display all information including ONE category, or repeat three times displaying one category for EACH repeated listing. I also notice that if I have the same row in two tables, it'll only display the one it loads last. Is there a way I can tell it which row cell to load?  I've done this successfully in the past by having multiple SQL queries, but I know that's not proper. I'd have a query which displays all items, and each time one displays, have another query go out and get associated data, and then another for that data, etc. I'd run several hundred queries on each page load!  I'm sure that's not the best approach, so I'm trying to write one query to handle everything. I think JOINS are the way to go, specifically inner joins.   The information I need to display is spread across a few tables: an Events table, which has info regarding the event, including IDs associating it to the Venues table and EventCategories list.  Here's my SQL query:  from     `Events` e         inner join     `EventCategories` c         on e.ID = c.EventID         inner join      `Venues` v         on e.ID = v.ID   In my PHP, I call each data cell like this:  $row["Title"]   or   $row["CategoryID"]   It works, but there are a couple problems. I can only display one category at a time. Also, if I call something like $row["image"], and I have this row in both my Events and Venue table, it displays the wrong one.  I don't get any error messages, but I think I know the problem and solution, and I just don't know how to write it.  I THINK I have to say which table from which to call when I put a variable down, like $row["v.Title"] will call from Venue (but it won't). I also think I have to take a variable like the $row["Categories"] and break it down in to components, but I can't seem to find any information on how to do that either.  Any help would be much appreciated!  Here's my data, showing relevant parts only:  EVENT ID    Title         Time     Image      VenueID 20    Band Battle!  7:00pm   band.jpg   1  VENUES ID    Address      Name             Image 1     123 Street   Parkland School  school.jpg  EVENT_CATEGORIES ID    EventID    CategoryID 1     20         54 2     20         12 3     20         84  CATEGORIES ID    Name 12    School 54    Music 84    Public     Not a duplicate:   This might not be the solution to my problem (though it may be a part of it) and it doesn't seem to address how to grab multiple pieces of information from another database, which is the main part of my question.


Why is dark matter the best theory available to explain missing mass problems?

Why is dark matter the best theory to explain the missing mass problem?    Why is dark matter mathematically necessary to explain the missing mass problem?    On a side not I believe dark matter is definately intuitive the next logical step in physics is to accept the fact the direct observations can not always be the determining factor in the acceptance of a theory.  Positivism is not going to be the only driving force in physics forevermore.    One theory that seems almost as good is the supersymmetric particle. What determination which are actually detectible and how would we distinguish the differences between the two?    References:   .


How can I determine whether a conference is reputable?

I recently received an invitation to a conference and I'm trying to determine how reputable it is. Is there a good way to go about this?


Special chart of a compact connected manifold.

A friend of mine asked me if the following question is true:     Question: Let $M$ be a compact connected smooth manifold without boundary, then if $a_1,$ $a_2$ $\in$ $M$, there is a chart $(\varphi,U)$ of $M$ such that $a_1,$ $a_2$ $\in$ $U$.    Despite this seems like a lie, I wasn't able to find a counterexample or prove this statement.  Anyone know how to demonstrate this or know a counterexample for this question?


How to render just one render layer?     and  explain how to separate the rendering into "normal render" and freestyle-only. Unfortunately they do not explain how to render only one layer.  An code method is explained in :   Open a Python Console Run bpy.ops.render.render(layer="FreeStyle")   This appears to not be working:   It freezes Blender (no progress bar or view) It takes as long as pressing the render button, so it seems to not work and just renders all layers.   I suspect there might be a non-code UI way to do it. Is there?


How to use induction to prove the product rule for higher derivatives?

How do I show through mathematical induction that   \begin{equation} \frac{d^n}{dx^n}[f(x)\cdot g(x)] = \sum_{k = 0}^{n} \binom{n}{k} \frac{d^k}{dx^k} [f(x)] \cdot \frac{d^{n-k}}{dx^{n-k}} [g(x)] \end{equation}  which is the product rule for higher derivatives?


Is it possible to narrow down the possible keys used for AES CBC encryption, knowing a given plaintext and its ciphertext, where IV=0?

I'm brute forcing a ciphertext with a given dictionary to figure out which key was used. However, it's been hinted at that there is a way to narrow down the dictionary to a smaller subset of possibilities.  I know the plaintext, its ciphertext, and the IV (0). It was encrypted using AES-128-CBC and no salting was used during encryption.  At first I thought I was onto something because of: $C_j = E_k(P_j \oplus IV)=E_k(P_j)$ for IV = 0. But I was dead in my tracks right after. Is this situation even plausible or am I barking up the wrong tree?


Use squared correlation in regression without intercept

If I want to compare the goodness-of-fit of two regression models, with and without intercept, is it valid to compare the squared correlation coefficient between the fitted values and the data? Since the squared correlation would get back the $R^2$ for the model with intercept, it seems to make sense to compute the squared correlation for the model without intercept and use that to make comparison. I am not entirely sure whether this is legitimate. Am I missing anything? If this approach is not valid, what methods can I use to make such comparisons?


How is your position on the Clash of Clans war map determined.?

At first I thought it was by trophies, because I am the top 6th player in our clan, and I'm 7th on the war base but that's not it. And I have previously been the top 2nd of trophies, but like 13th on the war map. And then some other forums said it was based on your village level or something? But there's at least two people below me that have better villages than me. They have better walls, and stuff. So now I'm confused.


Can we use definite article "the" with meal of the day?

I have a question about using definite article. I'm Azerbaijanian that's why I don't know English grammar very well. In English lesson our topic was "Article". And I wanna know can I use "the" with "lunch", "breakfast" or "dinner"


I want to learn Vim. The vast majority of people advise me to use vimtutor. I downloaded the package and ran it, but I just get given a blank screen.    I see on  that there should be tons of things on there. But I am not getting it...How can I fix this?  Originally, I was told by the terminal to install vim-runtime in order to run vimtutor, and I did and it ran, albeit with a blank screen. I was able to run this tutorial after I installed vim-gtk. Anyone know why it didn't show up the first time?


Java Enum why static line executes only once?

The result is:  1 3 1 3 1 3 2   The constructor runs for A,B and for C (3 times). But if you use static keyword it runs only once. What is the reason of this? And why does this line executes last?  enum Enums {     A, B, C;      {         System.out.println(1);     }      static {         System.out.println(2);     }      private Enums() {         System.out.println(3);     } }  public class MainClass{     public static void main(String[] args) {         Enum en = Enums.C;     } }


I just var_dump(false==0) it outputs bool(true)   Why false== 0 is true.I know true==1 is true Because  if i  echo true; It will output 1 so numeric value of true is 1,    But numeric value of false is not 0, because when i echo false;  It display nothing(empty), So how can false has same value as 0 AS we know == operator compares the values , if they same it will return true, and if their values is not same it will return false , so in the case of false==0  It should be false.  Any idea ?


We have a 5 hr layover in Osaka do we need a transit visa?

We are Filipino Citizens moving to Canada via Jetstar and Air Canada. Our flight itinerary brings us to Osaka for a 5 hr layover before our next flight. We'd like to know if we need to have a VISA for that short amount of stay?


What is the next step in solving the time derivative of expectation value of the momentum of a particle

So this question is a direct follow on from  I am trying to get an expression for $\frac{d\left<p\right>}{dt}$. I have my working out below, which was thanks to the 's help, (not to mention all the patient people in the mathematics chatroom) I have got to this expression: $$ i\hbar \left( \int\limits_{-\infty}^{+\infty}{ \frac{-i\hbar}{2m} \dfrac{\partial^2 \Psi^*}{\partial x^2} \frac{\partial \Psi}{\partial x} + \frac{i}{\hbar}V \Psi^* \frac{\partial \Psi}{\partial x} }dx + \int\limits_{-\infty}^{+\infty}{ \Psi^* \frac{\partial}{\partial t} \frac{\partial \Psi}{\partial x} }dx \right). $$ And now I'm stuck. What can I do about $$ \int\limits_{-\infty}^{+\infty}{ \Psi^* \frac{\partial}{\partial t} \frac{\partial \Psi}{\partial x} }dx $$ In particular how to deal with $$ \frac{\partial}{\partial t} \frac{\partial \Psi}{\partial x}? $$ With the $\partial t$ in play I don't know how solve the integral... As before, I really would appreciate hints to get me moving in the right direction more than an outright solution. My working so far We are given $\left<p\right>$ in the text, which is determined by computing $\frac{d\left<x\right>}{dt}$ and multiplying by $m$. Lets just start with what we know: $$ \left<p\right> = \int{\Psi^*\left[-i\hbar \frac{\partial}{\partial x}\right]\Psi}dx. $$ So taking the time derivative, $$ \frac{d\left<p\right>}{dt} = \frac{d}{dt}\int{\Psi^*\left[-i\hbar \frac{\partial}{\partial x}\right]\Psi}dx. $$ We probably should at this point pause, and listen to Ted, (). So take out the constants before going any further. We get, $$ -i\hbar \frac{d}{dt}\int\limits_{-\infty}^{+\infty}{         \left(             \Psi^*                 \left[                     \frac{\partial}{\partial x}                 \right]             \Psi         \right)         }dx. $$    Bringing the time derivative into the integral, gives us $$ -i\hbar \int\limits_{-\infty}^{+\infty}{\frac{\partial}{\partial t}\Psi^*\left[\frac{\partial}{\partial x}\right]\Psi}dx. $$ Then differentiating with the product rule yields, $$ -i\hbar \int\limits_{-\infty}^{+\infty}{ \frac{\partial \Psi^*}{\partial t} \frac{\partial \Psi}{\partial x}+  \Psi^* \frac{\partial}{\partial t} \frac{\partial \Psi}{\partial x} }dx. $$ Now we have two terms in our integral, let's split em up. Let's consider the left handside first, we have $$ \int\limits_{-\infty}^{+\infty}{ \frac{\partial \Psi^*}{\partial t} \frac{\partial \Psi}{\partial x} }dx. $$ By Schrödinger this can become, $$ \int\limits_{-\infty}^{+\infty}{ \left(\frac{-i\hbar}{2m} \dfrac{\partial^2 \Psi^*}{\partial x^2} + \frac{i}{\hbar}V \Psi^* \right) \frac{\partial \Psi}{\partial x} }dx. $$ Expand to get, $$ \int\limits_{-\infty}^{+\infty}{ \frac{-i\hbar}{2m} \dfrac{\partial^2 \Psi^*}{\partial x^2} \frac{\partial \Psi}{\partial x}+ \frac{i}{\hbar}V \Psi^* \frac{\partial \Psi}{\partial x} }dx. $$ So, just to review, our full problem can be written as, $$ i\hbar \left( \int\limits_{-\infty}^{+\infty}{ \frac{-i\hbar}{2m} \dfrac{\partial^2 \Psi^*}{\partial x^2} \frac{\partial \Psi}{\partial x} + \frac{i}{\hbar}V \Psi^* \frac{\partial \Psi}{\partial x} }dx + \int\limits_{-\infty}^{+\infty}{ \Psi^* \frac{\partial}{\partial t} \frac{\partial \Psi}{\partial x} }dx \right). $$


I have recently posted a question on . Today, I was again searching for solutions to the problem and found  link with exactly the same content. I'm not sure if this is wanted behavior, but to me this looks as if they use content from Stackexchange on their site to attract traffic. So, is this a known problem or an accepted partner site?


Removing name if case matches from ArrayList not working

I am trying to write a program that will remove names from an ArrayList if the name has specific value, but I am unable to do this.  class UserNamesTest {     public static void main(String[] args) {         ArrayList<String> names = new ArrayList<>();         names.add("John");         names.add("Jerry");         names.add("Jim");         names.add("Todd");          for(String name : names) {             if(name.equals("John")) {                 System.out.println("true");                 names.remove(names.indexOf(name));             }         }     } }   When I execute this code, I am getting an exception:  Exception in thread "main" java.util.ConcurrentModificationException         at java.util.ArrayList$Itr.checkForComodification(Unknown Source)         at java.util.ArrayList$Itr.next(Unknown Source)         at UserNamesTest.main(UserNamesTest.java:13)   How can I accomplish this?


Does downvoting an answer on Meta cost rep now?

I recently (an hour or so ago) downvoted  (which had been at a score of 0 before my downvote, in case that's relevant), and I saw my Meta.SE rep go from 101 to 100 (and got a notification in the "trophy" menu that I had lost 1 rep point).  This is contrary to what I had previously believed: that downvotes in Meta cost no rep either for the votee or for the voter. Did that change recently?


What are some examples where a sequence follows a regular pattern out to very large numbers, but not forever?

This question is inspired by this old paper by Euler: . In it, Euler considers a particular sequence, and finds that the next number in the sequence can be computed by a certain recurrence relation. He doesn't have a proof, but verifies it manually up to a a large index, and is convinced of its veracity. Much later, it was proven that Euler's conjecture was true. This got me thinking, have there been cases where a sequence was thought to follow some pattern for a long time, but it was eventually shown that the sequence deviates from said pattern? I am not talking about questions that are still open, only those conclusively shown to be false.


What is the current way to handle no-effort questions on SO?

Since the old insufficient effort close reason has been removed, are questions showing no effort at all no longer meant to be closed? Just downvoted? If they're meant to be closed, what's the current appropriate close reason?  still refers to the "must demonstrate a minimal understanding of the problem being solved" reason that no longer exists.  I did find , but I don't see any clear answer about what we do about them there.  Recently this question was asked on Stack Overflow (with this formatting):     Title:      How do you create a sorted list in case it is youngest to eldest and shortest name to longest name?      Question text:      public class Person      {      public static void main(String args[])      {      }   I don't believe a question like that has a place on SO, but none of the current close reasons seems (on the surface) to apply. (In this case, the OP deleted it after it was downvoted, but they frequently don't.) Sadly we all know there are plenty of these. We used to dispatch them quite quickly with the "insufficient effort" close reason.  (I certainly saw it get abused), and I could certainly see a strong case for rewording it. But I think there's a gap that needs filling.  So is there a current close reason for this? Or are we not closing these? Are we flagging them? What?    There are a couple of old meta questions on this that no longer apply:


Multiline label for shape 'tape' in tikz

I would like to draw a tape in tikz with a multiline label in it. The normal way of just using \\ doesn't work here.  MWE  \documentclass[tikz,border={5pt}]{standalone} \usetikzlibrary{shapes.symbols,shapes.geometric} \tikzset{ multidocument/.style={ shape=tape, draw, fill=white, tape bend top=none } } \begin{document} \begin{tikzpicture} \node [multidocument]{Multi line\\Label}; \end{tikzpicture} \end{document}


node--view--[machine-name] ignored in production

On my development, local site (twig debug enable, cache disable), I create node template for specific view block by Drupal suggestions:  <!-- THEME DEBUG --> <!-- THEME HOOK: 'node' --> <!-- FILE NAME SUGGESTIONS:    * node--view--promoted-content--block-promoted-content.html.twig    x node--view--promoted-content.html.twig    * node--7398--teaser.html.twig    * node--7398.html.twig    * node--news--teaser.html.twig    * node--news.html.twig    * node--teaser.html.twig    * node.html.twig --> <!-- BEGIN OUTPUT from 'themes/custom/anime24/templates/content/node--view--promoted-content.html.twig' -->   And exactly: node--view--promoted-content.html.twig, and all seams to work perfectly:    But when I move site to production (standard hosting, disable twig debug, enable cache), Drupal ignore my node--view--[machine-name].twig.html templates, and load node--teaser.html.twig:    It looks like some weird cache issue, because, when I reload one of Block with AJAX filter, it loads an proper twig template:    And after click:    Has anyone encountered this error and is able to help me with the solution?  Thanks!


Length of message in RSA and splitting of long messages

If I understand correctly in (unpadded) RSA the length of message M must be shorter than modulus n.  Encryption gives ciphertext that is also shorter than n.  Let's say I want to send a message of 2.5x length of n.  Is the split of message into chunks inferred somehow, or is that encoded somehow within ASN.1 keys? What are the different options/standards for this?  EDIT: Probably RSA is not used for messages longer than n but symmetric keys are generated with RSA and then they are used for longer messages?


Formula for combining relative uncertainties

Different sources are giving me different formulae for combining relative uncertainties. One tells me to simply add the relative uncertainties together to get the combined uncertainty while another gives me this formula. $ \sqrt{(\delta x/x)^2+ (\delta y/y)^2} $. Which is the correct method?


I am running pstree on MacOS Majave and wan to Show branches of processes using VT100 graphic chars:  $ pstree -g 2 | head -n 3 ─┬◆ 00001 root /sbin/launchd  ├──◆ 00049 root /usr/sbin/syslogd  ├──◆ 00050 root /usr/libexec/UserEventAgent (System)   Tried to show it from less  ESC(BESC)0^Nqw`^O 00001 root /sbin/launchd ^N tqq`^O 00049 root /usr/sbin/syslogd ^N tqq`^O 00050 root /usr/libexec/UserEventAgent (System) (END)   How could I solve such a problem?


KeyEvent.getKeyText(keycode); Dose not understand that its equal to something

if(Game.gameRoom == Room.RoomThree){                 if(key != KeyEvent.VK_SPACE){                     keycode = e.getKeyCode();                     Code += KeyEvent.getKeyText(keycode);                     Code = Code.toLowerCase();                     System.out.println(Code);                     if(Code == "switch horses"){                         handler.addObject(new KeysBtn(300, 385, ID.Key));                         System.out.println("Correct");                         Code = "";                     }                 }   For this code it types out what I type on the key bord the only problem even though i have typed the Code "switch horses" it dose not print Correct in the consol.


Probability a product of $n$ randomly chosen numbers from 1-9 is divisible by 10.

I'm working on a problem where each number is chosen randomly from 1-9. Given $n$ numbers chosen in this manner, we multiply all of these together. I'm looking for the probability that this product is divisible by 10.  I reasoned that we only get a multiple of 10 when we multiply 5 and an even number together. So if either all $n$ numbers are odd or if none of the $n$ numbers is 5, then the product will not be divisible by 10, and we can take 1 - P(Not Divisible by 10).   From here, I'm not sure how to come up with a numerical answer when there is an ambiguous number of $n$ randomly chosen numbers. Is there some way to get there? Or is this reasoning flawed?


I'm facing the following problem:  Let $ F $ be a field, and let $ F(x)  $ denote all rational functions over $ F $ (functions of form $\frac{P(x)}{Q(x)}$, where $ P,Q$ are polynomials over $ F $). Find the degree $$ \left[ F(x): F \left( x^2 + \frac{1}{x^2}\right)\right] $$  Actually it's a homework exercise and I'm not sure what $ F \left( x^2 + \frac{1}{x^2}\right) $ is supposed to mean. Is it the smallest field contained in $ F(x) $ containing $ F \cup \{x^2 + \frac{1}{x^2}\} $?   If so, how do I find the degree of the extension? I'm not even sure where to begin.


Ubuntu MATE 20.04 - How to remove Reminders indicator from panel

I tried out evolution and decided I didn't care for it. During the process this Reminders indicator appeared on the panel.  I've now uninstalled and purged evolution but I still have this, now non-functional indicator on the panel. How do I get rid of it?


Isn't there a section for the Persian/Farsi language?

I just wanted to ask if there is a section for the Persian language OR if there isn't one, do you have any plan on creating such a section?  Because I saw most of Persian questions asked on "English.stackexchange", and I did not find such a specific place for that.


Evaluating $\int_0^\infty \frac{\ln x}{x^2+2x+2}dx$

$$\int_0^\infty \frac{\ln x}{x^2+2x+2}dx$$ A question similar to this one has been asked before , but there the quadratic doesn't have a constant term.  I tried to use completing the square and use the answers in the linked question but since the log term in the numerator has $x$ not $x+1 $(after completing the square the quadratic is $(x+1)^2 + 1$) so that doesn't seem to work.


difference between independent binomial variables

It is well known that if $X \sim B(m, p)$ and $Y \sim B(n, p)$ are independent then $X+Y \sim B(m+n, p)$ but what is the distribution of $X-Y$?  Here is what I have tried. $\Pr[X-Y = c] = \sum_{i=0}^n \Pr[X = c+i] \Pr[Y = i]$ which can be simplified to $\left(\frac{p}{1-p}\right)^c (1-p)^{m+n} \sum_{i=0}^n \binom{m}{c+i} \binom{n}{i} \left(\frac{p}{1-p}\right)^{2i}$. Letting $q = \left(\frac{p}{1-p}\right)^2$, simplifying this expression reduces to simplifying $\sum_{i=0}^n \binom{m}{c+i} \binom{n}{i} q^i$. But I am stuck here and perhaps there is a better approach.


How can I install Pages or iWork on a Mac running High Sierra 10.13.6?

Is there  any way now of installing a version of Pages or iWork on a Mac running High Sierra 10.13.6?


What settings do I use for 400 speed film on a Nikon f

I recently started using the Nikon f and I’m unsure about what settings are supposed to be used with 400 speed film!


Undefined subroutine error when running biber

I am trying to compile tex document using biblatex to handle references with no success. I am aware of the cycle Latex > Biber > Latex. I always use pdflatex, therefore it should be  pdflatex main.tex biber main[.bcf] pdflatex main.tex   In the first step, I get e.g. Citation 'citekey' on page 53 undefined which is normal as I have not generated the proper reference text. But upon running biber main I get error  Undefined subroutine &Biber::Config::biber_error called at /var/folders/zv/ds3zw_xs2dv4c1jp7m1t44f80000gt/T/par-6973776168797574616d61/cache-ec7adafccc6b3891989ad6eb09778d44c1fecb97/inc/lib/Biber/Config.pm line 640. Any idea how to fix this?


Sentinel's last function. What comes first, the attack or the reaction?

Quick question of the order between enemy actions and friendly reactions.  Sentinel  When a creature within your reach makes an attack against a target other than you (and that target doesn't have this feat), you can use your reaction to make a melee weapon attack against the attacking creature.   Does this happen before the enemy's attack goes through? So the player have a chance to kill the attacking creature before he attacks the players party member? Or does the enemy's attack connect first, giving the player an opportunity to attack the enemy?


Server/storage choice for very low bandwidth video hosting

I have a unique project where I'm needing host several terabytes of short ~15mb mp4 video files, of which each video will only be viewed once.  Is a CDN recommended here? Or would a basic storage solution like AWS S3, or DigitalOcean's Block Storage solution work well for me needs?  Thank you


Proving the limit of x to infinity of x!/x^x is 0

I have found that the limit of x to infinity of x!/x^x is zero by doing this:  x^x = xxxx...(x amount of times) x! = x(x-1)(x-2)(x-3)...(x amount of times)  So obviously, x^x grows much faster, because x is greater than x-1 and x-2 and x-3 and all those other terms. Therefore the limit must be 0.  But how to actually prove this with equations. And why does Wolfram Alpha disagree with me when I do the infinite summation of x!/x^x and it says by the limit test that the summation diverges:


Variable declaration space sensitivity in C

Consider the following ANSI C code:  int* var1, var2; //line 1 int *var3, var4; //line 2 int * var5, var6; //line 3 int var7, *var8; //line 4   Are lines 1, 2 and 3 functionally equivalent? Does the spacing associated with '*' matter syntactically? Are 'var2', 'var4' and 'var6' also pointers here? Is line 4 legal?  I come from a Java background, so I've grown too comfortable with its verbosity and object-orientedness. Consequently, it's difficult now to gel with the primitivities of C.


Deleting output shapefiles which have no data/features using ArcPy?

Still working on cleaning this up but it runs fine. Below is the rough code for a tool that iterates through field rows and clips accordingly to that row's shape. Everything outputs nicely but there are some outputs that do not contain data. What can I add to have arcmap check for shapefiles containing no data and delete them?   Added an if statement to check for empty SHP's but not sure how to define where to have it check the output folder?   import arcpy from arcpy import env  arcpy.env.workspace = r'path\folder'   field = "PARISH" fc = arcpy.GetParameterAsText(0) Name = arcpy.GetParameterAsText(1) Path = arcpy.GetParameterAsText(2) rows = arcpy.SearchCursor(arcpy.env.workspace)   for row in rows:     feat = row.Shape     outputName = Name.replace(" ", "_")     outputField = row.getValue(field)     outputFieldmod = outputField.replace(" ", "_")     arcpy.Clip_analysis(fc, feat, str(Path) + r'/' + str(outputName) + "_" + str(outputFieldmod))  for file in arcpy.ListFiles():     if arcpy.management.GetCount(file)[0] == "0":         arcpy.management.Delete(file)         arcpy.AddMessage('Deleted "{}" because it contains no features!'.format(file))


How to calculate the maximum current that a wire can handle?

What are the methods that manufactures used to do so ? What is the formula used if there is a one to do so?


No Man's Sky: How the “colored placement” bonus to upgrades (in Exosuit / Multi-tool / Starship) works?

There is an idea that (from ):     If upgrade items of the same type are placed adjacent to each other, they may provide different bonuses. If a bonus is awarded, the player will be notified of this effect with a colored light linking the relevant upgrades.   So:   How does it work? / What is mechanics behind it? Do the bonuses stack up? E.g., whether two in one place and two in another give the similar bonus than four next to each other? Should the updates be placed next to its related tool? E.g., “Beam Focuses” next to “Mining Beam”. Will it give the greater bonus? How to update Jetpack if it is in the corner? “Jetpack Boosters” next to each other are highlighted with yellow.


Does Google consider W3C validation errors of a website? If so why www.google.com has 23 Errors, 4 warning(s)

Some SEO analysts says that fixing W3C validation errors of a website is an important On Page Optimization if so why www.google.com has 23 W3C validation errors, 4 warning(s)? Does Google consider those errors?


Weight of liquid with something swimming on it

I was wondering about the following situation: If you'd weigh a whole body of liquid and then let something float on it, how would the weight of the liquid change? E.g. if you could weigh a whole lake with a scale and then put a 1 tonne boat on it, would the weight of the lake increase by 1 tonne? I'm no physicist and my brain tells me "where else would the weight go?" but something feels not quite right about that.


I have a density matrix defined as  $$\rho(t) = \int_{-\infty}^{+\infty} \sigma(t,x) \otimes |x\rangle\langle x|$$  I want to show that  $$\hat{P} \rho(t) \hat{P} - \frac{1}{2} (\hat{P^2} \rho(t) - \rho(t) \hat{P^2}) = 2\frac{\partial^2 }{\partial x^2} \sigma(t,x)$$ where $\hat{P}$ is the momentum operator.   The question is similar to , but this doesn't help me in getting the answer. $\hat{P} = -i \frac{\partial}{\partial x}$ in the position  basis, but I am unable to get the final answer. Can someone help me?


How is $\lim_{x \to a}\left(\frac{x^n - a^n}{x - a}\right) = n\times a^{n-1}$?

In my book this is termed as a theorem and the proof given is as follows :-  $$\begin{align} \lim_{x \to a}\left(\frac{x^n - a^n}{x - a}\right) &=\lim_{x \to a}\left(\frac{(x - a)*(x^{x-1} + x^{n-2}*a + x^{n-3}*a^2 + x^{n-4}*a^3 + \cdots + x^1*a^{n-2} + a^{n-1})}{x - a}\right) \\ &=(a^{n-1} + a*a^{n-2} + \cdots + a^{n-1}) \\ &=(a^{n-1} + a^{n-1} + \cdots + a^{n-1}) \\ &=(n*a^{n-1}). \end{align}$$  Everything made sense to me except   $$x^n - a^n = (x - a)*(x^{x-1} + x^{n-2}*a + x^{n-3}*a^2 + x^{n-4}*a^3 + \cdots + x^1*a^{n-2} + a^{n-1})$$  Somebody please enlighten me on this topic.


How is Chasles' Theorem, that any rigid displacement can be produced by translating along a line and then rotating about the same line, true?

in its strong form says:     The most general rigid body displacement can be produced by a translation along a line (called its screw axis) followed (or preceded) by a rotation about that same line.   Now,  simply says that any rigid body displacement can be decomposed into a rotation plus translation. This is easy to visualize. But what Chasles' Theorem says is something much stronger.   Unfortunately, I am just not able to visualize it. Perhaps, I am comprehending it wrong. I mean how is it possible to have the axis of rotation and translation the same (or parallel) for the most general displacement.   I mean, think of this case:     A body is given a finite rotation about the X-axis and then a finite translation about the Z-axis. How can we find that "screw" axis along which both of them can be described?


My F3 button changes my volume instead of doing what it should

Every time I press F3 it changes my volume instead of opening the debug overlay. Is there a way I can fix this in settings?  I use the latest version of Minecraft.


I got a NullPointerException error with this.  if(Cb_Ar.isChecked())         toPass = Cb_Ar.toString();     else if (Cb_Db.isChecked())         toPass = Cb_Db.toString();     else if (Cb_Hb.isChecked())         toPass = Cb_Hb.toString();   Here is my LogCat;  03-06 20:38:54.907 3274-3274/? E/AndroidRuntime:  Caused by: java.lang.NullPointerException: Attempt to invoke virtual method 'boolean android.widget.CheckBox.isChecked()' on a null object reference  03-06 20:38:54.907 3274-3274/? E/AndroidRuntime:     at com.example.jello.letscook.showmenu.showList(showmenu.java:73)  03-06 20:38:54.907 3274-3274/? E/AndroidRuntime:     at com.example.jello.letscook.showmenu.onCreate(showmenu.java:46)  03-06 20:38:54.907 3274-3274/? E/AndroidRuntime:     at android.app.Activity.performCreate(Activity.java:6237)


How to recover my password using finger print in HP client security?

In my HP Laptop, I use both password and fingerprint for login. Unfortunalely i did not use my laptop long while. now I forgot my password. still i can able to access my system using my fingureprint.   The issue is some times the fingureprint not working properly. Now I forced to reset my password or recover my old password. Even I prefere to recover my old password. Any one help me here please?  I use Windows7 64 bit.  Thanks in Advance.


Meteor Templates helpers and access to collections' fields

I have two collections:  Group = {   users: [Array_of_User] }  User = {   name: _string_ }   I'm listing groups ans I'm trying to know in the template if a user is in the groups:  mytemplate.js  Template.mytemplate.helpers({   groups: function(){       return Groups.find();   },   currentUsername: 'test' });   mytemplate.html  <template name="main">   <ul>     {{#each groups}}     <li>       {{#if [the group contains currentUsername] }}       contains       {{else}}       doesn't contain       {{/if}}     </li>     {{/each}}   </ul> </template>   The question is: what can I put on the helpers and instead of [the group contains currentUsername] to make it work?  Also, I'm not saying this is the way to do it. I'm open to any suggestions even if it means I have to change a lot.


simulate.p.value option in chisq.test in R

I have the low expected values problem in my data set and cannot solve with regular methods (e.g. combining levels, etc). I cannot use Fisher's test either because of the fixed marginals assumption of the Fisher's test.   I want to try the permutation test in the chisq.test function in R (that is  simulate.p.value option in chisq.test). However, I would like to know whether this simulation assumes fixed marginals in the data or not? (My data is not suitable for fixed marginals assumption, marginals may change depending on the sample taken.)


Only the 'object mode' is visible from the menu. Cannot edit anything.


How to easily save all open Safari tabs on iOS?

On macOS, I can choose Add Bookmarks for These 108 Tabs... which let's me save all open tabs to a bookmarks folder.  Is there an equivalent on iOS?     My workaround is to use iCloud tabs to copy the tabs from iOS to macOS and then do the above.   edit: as of iOS 13 this function is built in. See answer below.


Suggestions for a batch audio converter?

Any suggestions for a good, free audio converter for Mac?  I used to use Max.app but it has long become abandonware and is now super buggy and crashy. I just need something I drop a couple (or 20 thousand) Apple Lossless files into and let it crank away making me some AAC compressed files or some MP3 or whatever.


Math equation - to PDF - fully searchable?

I'm a complete newbie to Latex, and I am trying to use it for creating small pdf images with equations. My requirements are:   Aligned equations Clear font (bold and italic) Minimal sized image in PDF format Searchable in PDF format   This version finally creates a small PDF without margins, but the problem I run into is with searching. For some fonts, I can't search for comma (in case I want to find "x,y". In some versions, the first letter of a word isn't searchable with the rest of the word, so "Sample" is not searchable. In some fonts, I can't search for a word ending in ff, the second f is not searchable. Is there an easy solution to this?  To create the file:  pdflatex --file-line-error --interaction=nonstopmode testcode.tex   Thank you so much!  \documentclass{amsart} \usepackage{txfonts} \usepackage[T1]{fontenc} \usepackage[margin=0pt]{geometry} \usepackage[active,tightpage]{preview} \usepackage{varwidth} \begin{document} \begin{preview} \begin{varwidth}{\linewidth} \begin{equation} \nonumber \begin{aligned} &Example\_VAL_{x,y} &&= \sum\nolimits_{i=0}^{MARK\_n}VAL_{x,y,i} * VAL_i \\ &Example\_VAL2_{x,y} &&= \sum\nolimits_{i=0}^{MARK\_n}VAL2_{x,y,i} * VAL_i \end{aligned} \end{equation} \end{varwidth} \end{preview} \end{document}   Latest version after help from Ulrike, and trying to simplify code writing for myself:  \documentclass[varwidth=\maxdimen,border=2pt]{standalone} \usepackage{luatex85} \usepackage{amsmath} \usepackage{unicode-math} \usepackage[italic]{mathastext} \setmainfont{TeX Gyre Termes} %Times clone \setmathfont{TeX Gyre Termes Math} %accompagning math.  \begin{document} \[ \nonumber\begin{aligned}         &Example\_VAL_{x,y} &&= \sum\nolimits_{i=0}^{MARK\_n}VAL_{x,y,i} * VAL_{i}         \\         &Example\_VAL2_{x,y} &&= \sum\nolimits_{i=0}^{MARK\_n}VAL2_{x,y,i} * VAL_{i}     \end{aligned} \] \end{document}   Curious how to get a slanted more normal font in the equation - without embedding myvar throughout.


iptables default rules numbers in square brackets what do they mean?

I've just installed iptables and have ran the command below.  /sbin/iptables-save > /etc/iptables/rules.v4   When I then went to edit the file "/etc/iptables/rules.v4" I found it contained the lines below.  :INPUT ACCEPT [15079:4118707] :FORWARD ACCEPT [0:0] :OUTPUT ACCEPT [153:28387]   Is anyone able to shed some light on what those numbers in the square brackets mean?  I found the article linked below on securing a raspberry pi which has a section on iptables, but the numbers in the square brackets aren't the same as what I have which has led me to ask the question.    For reference the article has this instead.  :INPUT ACCEPT [0:0] :FORWARD ACCEPT [0:0] :OUTPUT ACCEPT [0:0]   I had mistakenly posted this question on stackoverflow, and was told to post it here, but someone did answer and state that they were ports, and that iptables would only allow connections to the port range specified.  This didn't really make a whole lot of sense to me as I am able to connect to port 22 for SSH which is outside of the IP range mentioned in the square brackets.  Is anyone able to explain it further perhaps?


I am trying to show cache size files in MB, used by my App. but my app crashing. Error : Caused by: java.lang.NullPointerException  private void initializeCache() {     long size = 0;     size += getDirSize(this.getCacheDir());     size += getDirSize(this.getExternalCacheDir());     this.text_view_cache_value.setText(getResources().getString(R.string.label_cache)  + readableFileSize(size));  }  public long getDirSize(File dir){     long size = 0;     for (File file : dir.listFiles()) {         if (file != null && file.isDirectory()) {             size += getDirSize(file);         } else if (file != null && file.isFile()) {             size += file.length();         }     }     return size; }


The problem is:  If $G$ is a finite group with order not divisible by 3, and $(ab)^3=a^3b^3$ for all $a,b\in G$, then show that $G$ is abelian.  I have been trying this for a long time but not been able to make any progress. The only thing that I can think of is: $$ab\cdot ab\cdot ab=aaa\cdot bbb\implies(ba)^2=a^2b^2=aabb=(\text{TPT})abba.$$ Now, how can I prove the last equality? If I write $aabb=abb^{-1}abb$, then in order for the hypothesis to be correct, $b^{-1}abb=ba\implies ab^2=b^2a$. Where am I going wrong? What should I do?


Word for a person who always wanted to get his expected results

What do you call a person who always wanted to get his expected results?  I'm looking for a trait of a person that means who always wanted to get his expected results.  For example: a person ordered a soup and he feels upset when the taste doesn't satisfy him because he is expecting some taste in the soup he ordered.


According to , my Recent page on StackOverflow shows I have gained 221 reputation today. So why don't I have the Mortarboard badge?


Ubuntu 18.04 install fails on new laptop "watchdog: BUG: soft lockup - CPU#0 stuck for 22s!"

I just purchased an Acer Aspire A315-41-R3RF. It comes with a Ryzen 3 2200U processor. I'm trying to install Ubuntu 18.04, which I just downloaded. I boot into the USB stick, choose the option to try Ubuntu, and I immediately get these errors:  watchdog: BUG: soft lockup - CPU#0 stuck for 22s! watchdog: BUG: soft lockup - CPU#1 stuck for 22s! watchdog: BUG: soft lockup - CPU#2 stuck for 22s!   They just loop perpetually. Windows 10 (which was preinstalled) runs fine. I disabled secure boot in the BIOS. Any ideas?  I should add that the USB stick is good -- it worked fine on another system.


Camera fulcrum visible in solid mode cutting off objects

I seem to have enabled some camera fulcrum option, this is only visible in wireframe and solid modes. Can anyone tell me how to disable it as it's clipping my objects, also is there a hotkey combo i've maybe hit by mistake?


I have a csv file called scenario1.csv in which the second column has column names like "0-4 years high risk", "65+ years first responder" etc. There are 20 such values. The 21st row, 2nd column has the same entry as in the 1st row of the 2nd column. I would like to rename these values to p1-p20 respectively. So the 21st row would have the p1 tag with it. Everything without quotes. I have a 150 such files, named scenario1.csv, scenario2.csv ... How do I do this? Below is an example for a shorter file:  t,  group,               1,  3,  5 0,  0-4 years low risk,  0,  0,  0 0,  0-4 years high risk, 0,  0,  1 .....,  ....  0,  0-4 years low risk, 0,  0,   0   Expected output for each file:     t,  group,  1,  3,  5    0,  p1,     0,  0,  0    0,  p2,     0,  0,  0     .....,  ....     0,  p1,     0,  0,  0    Here's the dictionary I need:  0-4 years first responder   p1 0-4 years high risk         p2 ....... 65+ years low risk          p19 65+ years pregnant women    p20


The main reason of this post is to provide a writeup of what I think is a correct solution to . I'll quote the poster to phrase the problem:  What is the chance that an infinite series of random numbers will, at some point, repeat all previously generated numbers in that order?  While there was some confusion in the comments, I believe what the poster means is something like the sequences below: $$7,7,...$$ $$3,2,3,2,...$$ $$7,8,6,7,8,6,...$$ Where the dots afterward are arbitrary as the condition has already been fulfilled. If we start writing out a sequence of digits in this way, where the probability of selecting any digit is equal, what is the probability that something like this will happen? I'll post my solution below. Feel free to comment or correct me.


Proof of observations on natural numbers being expressed as differences of squares.

Inspired by this Hagon Von Eitzen's answer( ) I started investigating how I could express natural numbers as differences of squares. Using the method explained in the solution, I investigated natural numbers up to $60$ manually. I observed the following:  There is no way to express numbers of the form $4k+2$ as a difference of two squares.  2.There is one and only one way to express prime numbers (except $2$) as a difference of two squares.  The smallest number that can be expressed as a difference of two squares in two different ways is $15$ and the smallest number that can be expressed as a difference of two squares in three different ways is $45$.  As, $15= 8^2-7^2=4^2-1^2$. $45=23^2-22^2=9^2-6^2=7^2-2^2$. I could prove point $2$ easily but could not prove point $1$. Also I am interested in knowing how I could find the smallest natural number that could be expressed as a difference of two squares in four different ways without manual calculation.


In several different OOP languages I can make a class that inherits from another class. Can I do a similar things with models in databases or is that strictly not allowed? Is it possible to make model inherit from another model? I ask this thinking about a products class.  Generally speaking each product will have  a name (nails, bolts, nuts), type (steel), some sort of size parameter and price. But could I maybe make an abstract model because different products may have different parameters that I care about, and then could I leave some columns as null?  Or do I need to declare all the different types of products and each product will have its own table?


If you have a 6-sided dice, what is the probability of getting less that $k$ on it? I am really trying to figure out the $Pr[U=u \cap V=v]$ but I assume that that is equivalent to calculating $Pr[u < v]$. Am I correct in assuming this?


first off sorry if this question has been asked before (if it has i couldn't find it) this is my code public class Methods {      public static void main(String[] args) {         String playerOne = "this is blank";         lols(playerOne);         System.out.println(playerOne);     }           public static String lols(String playerOne) {         playerOne = "this is filled";         return playerOne;              } }  I want the playerOne String to change to "this is filled" but when it prints it says "this is blank" i am unsure why this code is not working. thanks for the help.


I recently encountered:   vernal adj. of, in, or appropriate to spring  And I truly wonder if there is also equivalents for the other seasons (summer, autumn, and winter).  EDIT:  I just found aestival n. relating to summer.  Please feel free to contribute words that have the similar/same meaning to spring and summer even though I have found those.


How to create a shortcut that executes an xdotool command to simulate a key press?

I'm trying to simulate a media key press using a custom shortcut.  So far, I've been able to achieve the simulation I need using the command:  xdotool key XF86AudioPlay   It works perfectly, it pauses or starts the music player every time it is run.  The problem comes when trying to run it as a shortcut.  First I tried to run an alias with a custom shortcut, but it did not work.  As explained on :     The commands run by keyboard bindings are not parsed via a shell. Your best bet is to create a directory bin in your homedir.   Next I created the suggested script and named it simplay:  #!/bin/sh xdotool key XF86AudioPlay   It is located inside a bin folder which is part of the PATH, this works fine and can be run from any location.  When trying to create the Custom Shortcut, I was unable to get it to execute, the configuration is the following:  Name: test Command: simplay  Shortcut: Ctrl+Alt+R   After searching a bit more I found another way to execute the shortcut:  gnome-terminal -e simplay   I tried it on a terminal and noticed that when executing it it would rapidly open a new terminal window, execute the child process, pausing the music and immediately close the window.  I changed the command on the shortcut and when hitting it I noticed the same behavior opening a terminal and immediately being closed but this time the child process did not pause the music, which makes me think that the script has been called on all my previous attempts but it is somehow not being able to execute.  How can I solve this problem according to your knowledge?


I want to implement a basic timer program that starts a 15 second timer on start button and stops on stop button Here is what I have done so far JS  var timeleft = 15;  function timer(){  var downloadTimer = setInterval(function(){     if(timeleft <= 0){     clearInterval(downloadTimer); document.getElementById("countdown").innerHTML = "Finished";  } else {    document.getElementById("countdown").innerHTML = timeleft + " seconds remaining";  }  timeleft -= 1;   }, 1000);   function timerstop(){  clearInterval(downloadTimer);   }  }  HTML

 <button onclick="timer();">start</button> <button onclick="timerstop();">stop</button>  The reason I had to use the nested function approach was to access the variable downloadtimer, the start button works as expected but on clicking the stop button I get the following error  Uncaught ReferenceError: timerstop is not defined  I would like to know if is this is a programming error or should I change my approach Thanks in Advance


Why do mobile games have delays for certain actions?

Many phone games restrict the number of actions you can take in a given amount of time. I don't get what is the purpose of this limitation. Is it only to force the player to buy additional turns? Some games don't even allow this for some turn "kinds" (like action A can be played again by spending real money while action B cannot be played again by spending money).  Another possible reason would be to limit the bandwidth usage to their server and make it more predictable over time, but I can't see phone games using so much data.


Suppose that $G$ is a group with $n$ generators and $r$ relations whether $r < n$. Prove that $G$ is infinite.

Let $X=\{x_1,...,x_n\}$ be the set of generators and $\Delta=\{s_1(x),...,s_r(x)\}$ be the set of relations. There is a homomorphism $G\to \langle t\rangle$, where $\langle t \rangle$ is the infinite cyclic group, that sends every generator into $t$. It is easy to prove. So, the set of all the nontrivial homomorphisms from $G$ to $\langle t\rangle$ is not empty. Let $\theta$ be one such homomorphism. Then $\theta$ sends $x_i$ into $t^{n_i}$ for some $n_i\in Z$. Now suppose $x_1^2x_3^{-1}=1$ is a relation in $G$. Then   $$\begin{align}t^{2n_1-n_3}&=t^{2n_1}t^{-n_3}\\ &=(x_1^2)\theta (x_3^{-1})\theta\\ &=(x_1^2x_3^{-1})\theta\\ &=1\theta\\ &=1. \end{align}$$  But $t$ has infinite order. So $2n_1-n_3=0$. More generally in this way I get a system of $r$ equations in $n$ unknowns with $r<n$. I know this system has a solution in the reals. I'll assume it has a solution in the integers. I'm not sure. If it has, then I have $L=\langle m_1,...,m_n: s_1(m),...,s_r(m)\rangle$. Here $L$ is generated by $n$ elements which satisfy the same relations as in $G$ and, by von Dyck's theorem, there is an epimorphism $\varphi:G\to L$. But $L$ is a subgroup of $Z$ the integers and, as such, it is infinite. Therefor $G$ is infinite.   There remains one thing to be proved. That a system of $r$ linear equations in $n$ unknowns and coefficients in $Z$ with $r<n$ has a solution in the integers. Honestly I do not know if this is even true. Assuming it is true, is the proof valid?  EDIT: I think the system has a solution in the rationals. Then I multiply each equation by the least common multiple of the denominators and I get a solution in the integers.


One of the selling points of Lollipop was that it will now support shooting in "Raw" mode, so that you can get the raw sensor data and then process it on the computer.  I just installed CM12.1 on my Samsung S3.   Will my phone support "Raw" shots in the future (My camera app doesn't support it yet) or does it require specialized hardware and I shouldn't even count on it being supported in an old phone?


Is L'Hopital for $\lim\limits_{x\to0}\frac{\sin(x)}{x}$ circular?

I was considering using L'Hopital for $\displaystyle\lim\limits_{x\to0}\frac{\sin(x)}{x}$, but I was told that this is circular, because we use this limit to show $\displaystyle\frac{\mathrm d}{\mathrm dx}\sin(x) = \cos(x)$.  Do we have to use this limit to find the derivative of $\sin(x)$, or is there a legitimate counter-argument here?


Where to find Birth and Death Records for Bucharest, Romania?

My husband's family came from Bucharest. Specifically his mother was born in Sibiu.  I have been able to piece together names and relations of several grand and great grandparents from word of mouth and some fortunate pictures they had of the cemetery in Sibiu.  I cannot however find any records of birth's and death's for any of them.   Are there sites or organizations that hold records for Romania?


How to add and sync folders outside SkyDrive folder?

I have folders with documents all over my hard drive, some which I would like to include in SkyDrive without moving them into the SkyDrive folder.  E.g. my SkyDrive folder is in C:\Users\Name\SkyDrive, but I have some files in C:\Users\Name\SyncMePlz that I also would like to be synced with SkyDrive so that I can reach them from other devices.  How can this be achieved?


Let z be a complex number such that $\frac{z-i}{z-1}$ is purely imaginary. Then the minimum value of $|z-(2+2 i)|$ is ? My approach:- $$ \begin{array}{l}  \\ \left|z-z^{\prime}\right| \geqslant| \ |z|-\left|z^{\prime}\right|| \end{array} $$ where, $z^{\prime}=2+2 i$ $$ \left|z^{\prime}\right|=\sqrt{8}=2 \sqrt{2} $$ $Let, \quad z=x+i y$ $$ \begin{array}{l} \frac{z-i}{z-1} \\ =\frac{\{x+i(y-1)\}\{(x-1)-i y\}}{(x-1)^{2}+(i y)^{2}} \\ =\frac{x(x-1)+y(y-1)+i(x-1)(y-1)-x y}{(x-1)^{2}-(i y)^{2}} \end{array} $$ ${}{} \frac{z-i}{z-1}$ is purely imagivery $$ \begin{array}{c} \text { Hence, } x(x-1)+y(y-1)=0 \\ x(x-1)=-y(y-1) \\ x^{2}+y^{2}=x+y \end{array} $$ What to do next?


When I try to boot I get this message: error: unknown filesystem. Entering rescue mode... grub rescue>   results of: grub rescue> ls  Is as follows:  (hd0) (hd0,msdos1)


Is it possible to install NFS carbon on Ubuntu? If so can you tell me how ? I have the setup.exe for the bonus edition of the game


Does Polymorph end spells that only target humanoids?

If I cast Charm Person on a human and then he or she is Polymorphed into an animal, does the spell end?


Setting an object to render transparent with shadows

I'm composting a blender scene into live footage. I have objects interacting with my "ground." what I want to do is set up the ground to render out transparent so that we can't see it in the composite video, but the objects interacting with the ground still need shadows. How can I set this up?


What is the mathematical rigorous proof that L1 regularization will give sparse solution?

It is given in the book Machine Learning A probabilistic Perspective, but i am not able to understand it. Can some one provide an explanation for that ?  I am not clear with the way sub gradient is defined and how is it helping in the optimization  .


Negative binomial distribution - sum of two random variables

Suppose $X, Y$ are independent random variables with $X\sim NB(r,p)$ and $Y\sim NB(s,p)$. Then $$X + Y \sim NB(r+s,p)$$  How do I go about proving this? I'm not sure where to begin, I'd be glad for any hint.


Let G be non abelian and |G| = $p^3$ , where p is a prime. Prove that Z(G) = G′ . What is the order of Z(G)?

Let G be non-abelian and |G| = $p^3$ , where p is a prime. Prove that Z(G) = G′ . What is the order of Z(G)?


Examples of a commutative ring without an identity in which a maximal ideal is not a prime ideal

In a commutative ring with an identity, every maximal ideal is a prime ideal. However, if a commutative ring does not have an identity, I'm not sure this is true. I would like to know the counterexamples, if any. The more examples, the better.  EDIT I would like to know the counterexamples other than $2\mathbb{Z}$. The more examples, the better.  EDIT I also would like to know the counterexamples that are not given in  if any, namely an example of a non-prime maximal ideal which does not contain $R^2$.


I want to know how can I set a "selector layer" (L.Control.Layers) outside the container in Leaflet. Like this screenshot of an OpenLayers application:


How do I solve this Discrete Math problem in the picture?

I am basically stuck at the part where it says w1 + w2 = 7 is equal to the number of integer solutions of x1 + x2 = 5. After that I am not sure how the book got n = 2 and r = 5. I am mainly confused and clueless about how x1 + x2 = 5 is equal to w1 + w2 = 7. Please explain and show me the steps and formulas and such used to figure this out


Imagine three observers(top, right and left). From the top observer's point of view left and right's speed is the same, so they would go equally slower. From the right observer's point of view, the top observer has X speed, and the left observer has 2X speed. That means that for the top and the right observers, the difference of time flow of the left and the right is different. How is this possible? Did I misunderstand something?


How can I split all the lines in a feature class where they intersect with a second line feature.  I have a roads feature and a rail feature. I want the lines in the rail feature to split where ever it crosses a road. I'm looking to do it all at once with an overlay analysis tool. Like the Split Line at Point tool, but using lines as the input. Too many to do it manually.


How to prove that in an arbitrary graph the number of vertices with odd degree is even

I know that degree of a vertex of an (undirected) graph is the number of edges incident to the vertex. I need to prove that in an arbitrary graph the number of vertices with odd degree is even. How to formally prove it?


Sci-fi book/series with feline aliens, and a female astronaut

From what I remember, the astronaut made first contact with a race of felines that live on the other side of the Galaxy.  They had always been able to see Earth, but Earth couldn't see them because they were blocked by the Sun.  There are various corporations that do drilling on various asteroids and the feline race helps in saving someone, or stopping an explosion at one of these complexes.  After this (possibly in a second book) she comes back to Earth and is the ambassador to the feline race because they know her.  This is upsetting for her because she had worked so hard to become an astronaut, but had a very short career because of this incident.  She ends up getting some sort of connection with them, and takes on some of their characteristics.  I think this connection followed some sort of either transformation or psychic episode they were able to induce in her on their ship, where she was able to see what it was like to be one of them.  The alien technology is way more advanced than the human, and they are stronger and faster as well.  A final note, I recall the female astronaut having red hair.


Windows 10 update screwed up grub-not getting any options to dual boot to Linux

I was away from Linux for quite some time(around 3 months or so)...haven't even booted...but my grub menu was working fine...i believe during last 3 weeks or so some Windows 10 update happened and now i am not seeing any grub screen which can give me the option to boot into Linux. After boot - it straight away goes into Windows 10.  Just wanted to tell I had Windows 10 only(not upgrade from Windows 7 or Window 8.1 to Windows 10).  I used to just try out this command:  bcdedit /set {bootmgr} path \EFI\ubuntu\shimx64.efi   I forgot last time what i used in place of {bootmgr} etc... Please help me try to recall and fix this issue.  I just need to create the live USB for Ubuntu Desktop 16.04 LTS and then try ubuntu and follow the steps after wards, right? Please let me know.  Update If i follow the above question. I have some doubts about step # 2 and # 3  Determine the partition number of your main partition. GParted (which should      already be installed, by default, on the live session) can help you   here. I'm going to assume in this answer that it's /dev/sda2, but make   sure you use the correct partition number for your system! Mount your   partition: sudo mount /dev/sda2 /mnt  #Replace sda2 with your   partition number      I have two hard drives and my entire Ubuntu is on second drive /dev/sdb. /dev/sdb also contains windows. /dev/sda is all windows.  So what should be the commands for me for:  sudo mount /dev/sda2 /mnt #Replace sda2 with your partition number