I will be honest about it: the following integral is involved in my current investigations about the interplay between Fourier-Legendre series expansions, hypergeometric functions of the $\phantom{}_3 F_2$ and $\phantom{}_4 F_3$ kind and polylogarithms. Significative contributions will be rewarded through a proper mention of the author.  The value of $\phantom{}_3 F_2\left(\tfrac{1}{2},\tfrac{3}{4},1;\tfrac{5}{4},\tfrac{3}{2};-1\right)$ is related to the integral  $$ \mathcal{J}_1 = \int_{0}^{1}\frac{\arctan x}{\sqrt{x(1-x^2)}}\,dx, $$ which on its turn (by Feynman's trick) is related to  $$ \mathcal{J}_2 = \int_{0}^{1}\frac{1-\phantom{}_2 F_1\left(-\frac{1}{4},1;\frac{1}{4};-x^2\right)}{x^2}\,dx.$$ I would be glad to know how to convert $\mathcal{J}_1$ (or $\mathcal{J}_2$) into a combination of standard mathematical constants and polylogarithms. It most certainly can be done since $\arctan(x)=\text{Im}\log(1+ix)$, but my version of Mathematica is not collaborating with me as I wished.  I will be away from keyboard for a few days (time to work for the Italian most celebrated mathematical contest), I hope to find some nice insight after my return.

When playing with the complete elliptic integral of the first kind and its Fourier-Legendre expansion, I discovered that a consequence of $\sum_{n\geq 0}\binom{2n}{n}^2\frac{1}{16^n(4n+1)}=\frac{1}{16\pi^2}\,\Gamma\left(\frac{1}{4}\right)^4 $ is:     $$\int_{0}^{1}\frac{\arctan x}{\sqrt{x(1-x^2)}}\,dx = \tfrac{1}{32}\sqrt{2\pi}\,\Gamma\left(\tfrac{1}{4}\right)^2\tag{A}$$   which might be regarded as a sort of Ahmed's integral under steroids.  I already have a proof of this statement (through Fourier-Legendre expansions), but I would be happy to see a more direct and elementary proof of it, also because it might have some consequences about the moments of $K(x)$ of the form $\int_{0}^{1}K(x)\,x^{m\pm 1/4}\,dx$, which are associated with peculiar hypergeometric functions.


I have a small server that I've been using for stuff internal to our house - running Plex for the TV, mostly. I'd like to make some of the documents on it available for my friends to download over the internet, but I'm wary of installing something like Apache and running a full-on web server if I don't need to.  Would it be a better idea to try to set up an FTP server instead? Or another option? Is there a 'correct' way to do this?  (For the purpose of this question, my friends are capable of following technical instruction to the level of being able to connect to an FTP server, but not much further. They are running a mix of OSes and are in various locations around the country.)

I wanna transfer some files from this PC with Ubuntu to a PC with Windows 7 I don't care how to do it (ftp, samba or whatever) I wanna know the steps, I searched a lot but I can't find anything that works. Thank you.


I am trying to make it look like someone is saying something for a map for a friend, but whenever I do the /say command and use it, it would say something like: EX: [@] Julie > You are doing it wrong. I want it to say : Julie > You are doing it wrong. I have tried both commandBlockOutput and sendCommandFeedback, but nothing has worked. Please tell me if you know what to do!  Thank you in advance.

As most Minecraft command blocks makers know, if we use the /say command to output text, this will happen:     [@]Lorem ipsum   The [@] is actually very annoying, how can I remove it?


We configured Salesforce as an Identity Provider for an External App.  We want to be able to make Idp-Initiated SSO and send custom attributes with the SAML Message, for example the Case or Account ID the user is working on.  However,    In the SAML connected app we are only able to send user/system data. Tried also to add parameters to Idp Start URL attribute1=value1&attribute2=value2... it doesn't relay custom parameters to resource provider.   Did you face a similar requirement ?  What is your recommended approach to send Salesforce data in a SAML Assertion ?  Thanks a lot

I've implemented Single Sign On with Salesforce as Identity Provider scenario using SAML.  I want to pass additional attributes via SAML response to the Service Provider. Out of the box the Connected App allows adding custom attributes based on User/Profile/System objects:    I want to add attributes from other objects.  Is it even possible? Should I implement some interface to have specific fields visible?


I answer  -- which, I'll admit, already has a couple close votes, but which seems to be to be a pretty simple and on-topic ask.  An hour or so later, I get a notification that my answer has been migrated.  Presuming I get upvotes on the answer, what happens to the rep?  I'm not a member there, so I presumably have (and will continue to have) zero reputation -- but the (presumed) upvotes will generate rep.  Does it just go into limbo?  If I were to later join that stack (unlikely, but not impossible, at least in this case) would I get that rep?  Or would I need to join there before the votes to collect?

When a question is migrated, is the reputation earned by its author on the original site subtracted from the author's total? What about votes? Badges? Do the same rules apply to the question's answers?


Year    Value 2012     10 2013     20 2014      0   I need 10 * 20 * 0 for multiple rows. If I use this function  EXP (SUM (LN (Value))), I get an ORA-01428  error:     argument '0' is out of range.   I have seen  but that is for MySQL, not Oracle and my requirement is to include zeroes.

I need an aggregate function that MySQL doesn't provide.  I would like it to be in MySQL's flavor of SQL (that is, not in C).  How do I do this?  What I'm stuck on is creating an aggregate function -- the  don't seem to mention how this is done.  Examples of desired usage of a product function:  mysql> select product(col) as a from `table`; +------+ | a    | +------+ |  144 | +------+ 1 row in set (0.00 sec)  mysql> select col, product(col) as a from `table` group by col; +-----+------+ | col | a    | +-----+------+ |   6 |   36 | |   4 |    4 | +-----+------+ 2 rows in set (0.01 sec)


What car should I buy or which car should I buy, what's the most correct one

Most of the time one or the other feels better, but every so often, "which" vs. "what" trips me up.   So, what's the exact difference and when should you use one or the other?


I want to solve the following exercise from Durrett:  "Let $X_n, n\geq0$ be a submartingale with $\sup X_n<\infty$. Let $\xi_n = X_n - X_{n-1}$ and suppose $\mathbb{E}\left(\sup\xi^+\right)<\infty$.  Show that $X_n$ converge a.s. "  I am not sure to understand the hypothesis on the increments because I have the feeling that I can solve the exercise without it : $\sup X_n<\infty$ implies that we can find $K$ such that for all integer n $X_n<K$ thus we can consider the submartingale $Y_n = X_n - K$ and since $\sup\mathbb{E}(Y_n^+)=0 < \infty$ by the Martingale convergence theorem $Y_n$ converge a.s and thus $X_n$ too.  Is this correct ?

Exercise 5.3.1 in Durrett's "Probability Theory and Examples" states  Let $X_n$, $n\ge 0$, be a submartingale with $\sup X_n < \infty$. Let $\xi_n=X_n-X_{n-1}$, and suppose $E(\sup \xi_n^+)<\infty$. Show that $X_n$ converges almost surely.  Here are my thoughts: It looks like we need to use theorem 5.2.8 (Martingale convergence theorem), which states that $X_n$ converges almost surely if $\sup EX_n^+<\infty$. I am trying to understand why we can just do the following (or at least I'm guessing we can't):  Suppose $X_n > 0$ (edit: on some set with positive measure), then $0< \sup X_n < \infty$, and therefore $EX_n^+ \le \sup X_n < \infty$. So we're done.  Otherwise, if $X_n \le 0$ a.e., then $\sup X_n^+ = 0$ a.e. Once again, we're done.  Am I missing something? Since I didn't use all the information, I probably am.  Thanks for the help.


I plug my Backup Plus Portable Drive (Seagate) into my MacBook Air (10.13.3 MacOS High Sierra Version) into my USB ports, both of them.  The drive lights up, I can hear it running however it is not showing up in Finder.  I have searched the Web for all sorts of solutions however I am unable to find any and Seagate was no help.  thanks for any help, this drive holds valuable information that I need to at most get off of it so I can throw it into a fire pit.  Thanks again.

I have a strange problem. Working on an OS 10.9.5 MacBook laptop.  Last night, I was exporting a 20-something GB Aperture library from my WD 2TB drive to another hard drive. I left, and when I came back the next morning, my computer warned me that I should properly eject my hard drive. I hadn't disconnected it, and my settings are set so that the computer will NEVER go to sleep or shut down when the power supply was connected (which it was). Now, my mac won't recognize the hard drive.       Is it dead?   How can I prevent this from happening again? How can I recover my files if I can't see the disk???   I've tried:   Powering my computer on and off  Using a different USB connector Using a different power cord Plugging the external drive into another mac (did not work)  Plugging the drive into a windows computer (nope) Mounting through disk utility, or using disk utility to repair/verify the disk (got this error message: Disk utility can't repair this disk. Back up as many of your files as possible, reformat the disk, and restore your backed-up files). Suggestions on these sites:  and  e.g., going through terminal to unmount OR eject OR view files in read only mode (all just say the volume timed out)   Read suggestions on this thread about drives disconnecting on their own - wasn't sure what to do, but realized the problem might have had something to do with exporting Aperture files?     This is my time machine disk, and it has some other stuff on it I need. I also don't know whether to trust my machine to plug another hard drive into it. I can't update to a newer OS just yet. I'm terrified to plug in my other hard drives because what if the same thing happens to them!? Unfortunately all my Aperture libraries are stored on external disks!  Info:  Last login: Sun Mar 26 16:39:26 on ttys000 ericaneomputer2:~ erica$ diskutil list /dev/disk0    #:                       TYPE NAME                    SIZE       IDENTIFIER    0:      GUID_partition_scheme                        *320.1 GB   disk0    1:                        EFI EFI                     209.7 MB   disk0s1    2:                  Apple_HFS Macintosh HD            319.2 GB   disk0s2    3:                 Apple_Boot Recovery HD             650.0 MB   disk0s3 /dev/disk1    #:                       TYPE NAME                    SIZE       IDENTIFIER    0:      GUID_partition_scheme                        *2.0 TB     disk1    1:                        EFI EFI                     209.7 MB   disk1s1    2:                  Apple_HFS NEWTON_WD               2.0 TB     disk1s2 ericaneomputer2:~ erica$ diskutil info disk1    Device Identifier:        disk1    Device Node:              /dev/disk1    Part of Whole:            disk1    Device / Media Name:      WD My Book 1140 Media     Volume Name:              Not applicable (no file system)     Mounted:                  Not applicable (no file system)     File System:              None     Content (IOContent):      GUID_partition_scheme    OS Can Be Installed:      No    Media Type:               Generic    Protocol:                 USB    SMART Status:             Not Supported     Total Size:               2.0 TB (2000365289472 Bytes) (exactly 3906963456 512-Byte-Units)    Volume Free Space:        Not applicable (no file system)    Device Block Size:        512 Bytes     Read-Only Media:          No    Read-Only Volume:         Not applicable (no file system)    Ejectable:                Yes     Whole:                    Yes    Internal:                 No    OS 9 Drivers:             No    Low Level Format:         Not supported


I would like to have windows in the Finder sort directories before files, in the manner of Microsoft Windows' Explorer as well as Linux KDE.  I tried following  but it did not yield the desired outcome, specifically some directories had contents sorted that way but some had files first then directories and some were still mixed.  Also, I would like to know what the difference is between sorting and arranging in the Show View Options screen.

I have Mac OS 10.7.4 and I'd like Finder to use "Is Folder?" as its first sort criteria, or in other words, group folders before files regardless of the sorting method.  Windows and Linux both do this by default.


We need to prove that if $n$ is a composite number $>4$, then $n|(n-1)!$. I wanted to ask if my observation is correct or not. What I think is that the statement can be reduced to $n|(n-2)!$ Because $n$ and $n-1$ are always co-prime.

I have a proof and need some feedback. It seems really obvious that the statement is true but it is always the obvious ones that are a little trickier to prove. So I would appreciate any feedback. Thank you!  Here is what I am asked to prove:     If $n$ is composite then $(n-1)! \equiv 0 \pmod n$.   Proof:  $n$ is composite $\implies n=ab$ where $a,b \in \mathbb{Z}$ and $0<a,b<n$.  Case 1: If $a=b$ then $n=a^{2}$. Now $n \mid (n-1)! \implies a \mid (n-1)!$, so $$\begin{aligned} (n-1)! &\equiv 1\times 2\times \dotsb \times a \times\dotsb\times (n-a)\times\dotsb\times (n-1) \\ &\equiv 1\times 2\times \dotsb\times a \times\dotsb\times -a\times\dotsb\times -1 \\ &\equiv 0 \pmod n \end{aligned}$$  Case 2: $0<a<b<n$.  Then, since $a \mid n$, $b \mid n$ and $n \mid (n-1)!$ we have that $a \mid (n-1)!$ and $b \mid (n-1)!$.  So this implies $(n-1)! \equiv 1\times 2\times \dotsb\times a \times\dotsb\times b\times\dotsb\times (n-1) \equiv 0 \pmod n$, Q.E.D.


I have about 2855 folders containing a large number of images and I want to copy or move all the images into one folder.  Please provide a detailed explanation.

I have a large external with many subfolders that I want to move all videos, pictures, and music to another hard-drive, what would be the best way to do this?


Are there any benefits to installing mysql from source, or should I just use apt-get?

This is a  about when to use packaged software and when to build and install it yourself.   When should I install software from packages provided by my OS distribution, instead of building and installing it myself from source?  When is it better to build from source?


Here is my Bash script.  Assuming that : 1) go.sh is the script to execute 2) the user will launch the script this way   # ./go.sh -v file1.txt file2.txt   or   # ./go.sh --verbose file1.txt file2.txt   3) I would like to have a more elegant way to write this :  #!/bin/bash Verbose_Mode=0  until [ "$#" == "0" ]; do    case $1 in      "-v" or "--verbose")       Verbose_Mode=1       ;;   This will result in a syntax error because of :"-v" or "--verbose".   My question : How can I properly write (if possible) the code :   #!/bin/bash Verbose_Mode=0  until [ "$#" == "0" ]; do    case $1 in    "-v")    Verbose_Mode=1    ;;    --verbose")    Verbose_Mode=1    ;;    esac   Thanks in advance for answers.

Say, I have a script that gets called with this line: ./myscript -vfd ./foo/bar/someFile -o /fizz/someOtherFile  or this one: ./myscript -v -f -d -o /fizz/someOtherFile ./foo/bar/someFile   What's the accepted way of parsing this such that in each case (or some combination of the two) $v, $f, and  $d will all be set to true and $outFile will be equal to /fizz/someOtherFile?


When installing Ubuntu Core 13.10 according to the instructions at , step 5 says that Ubuntu 12.04 "Precise Pangolin" development kernel requires the 'wireless-crda' package. This wiki suggest to have a look at . However the  doesn't even mention the 'wireless-crda' package at all.   After reading the Ask Ubuntu articles for 'download +kernel +packages +deb', ,  and "" I still don't know how to figure out all dependent packages.  Update#1  The answers from    1. apt-cache showpkg linux-image-3.11.0-18-generic  doesn't output a 'wireless-crda' dependency:  Reverse Depends:    linux-image-3.11.0-18-generic:i386,linux-image-3.11.0-18-generic   linux-signed-image-3.11.0-18-generic,linux-image-3.11.0-18-generic 3.11.0-18.32   linux-image-virtual,linux-image-3.11.0-18-generic   linux-image-generic,linux-image-3.11.0-18-generic   linux-image-extra-3.11.0-18-generic,linux-image-3.11.0-18-generic Dependencies:  3.11.0-18.32 - initramfs-tools (2 0.36ubuntu6) module-init-tools (2 3.3-pre11-4ubuntu3) dpkg (2 1.10.24) fdutils (0 (null)) linux-doc-3.11.0 (16 (null)) linux-source-3.11.0 (0 (null)) linux-tools (0 (null)) linux-headers-3.11.0-18-generic (0 (null)) grub-pc (16 (null)) grub-efi-amd64 (16 (null)) grub-efi-ia32 (16 (null)) grub (16 (null)) lilo (2 19.1) hotplug (3 0.0.20040105-1) hotplug:i386 (3 0.0.20040105-1) linux-image-3.11.0-18-generic:i386 (0 (null))  Provides:  3.11.0-18.32 - redhat-cluster-modules linux-image-3.0 linux-image kvm-api-4 ivtv-modules fuse-module  Reverse Provides:   2. dpkg -I linux-image-3.11.0-18-generic_3.11.0-18.32_amd64.deb  also doesn't output a 'wireless-crda' dependency:  Depends: initramfs-tools (>= 0.36ubuntu6), module-init-tools (>= 3.3-pre11-4ubuntu3)  Recommends: grub-pc | grub-efi-amd64 | grub-efi-ia32 | grub | lilo (>= 19.1)  Suggests: fdutils, linux-doc-3.11.0 | linux-source-3.11.0, linux-tools, linux-headers-3.11.0-18-generic  Conflicts: hotplug (<< 0.0.20040105-1)  Provides: fuse-module, ivtv-modules, kvm-api-4, linux-image, linux-image-3.0, redhat-cluster-modules   When installing the kernel through apt-get install linux-{headers,image}-generic there is a depending 'wireless-crda' package.  Question:  How to find out - before actually installing the Ubuntu kernel .deb file - all dependent packages that need to be installed?

How can I check dependency list for a deb package. I am running Ubuntu 11.10 and I have backed up all deb packages from var/cache/apt/archives. I want to format my pc and re-install selected applications only. Also how can I get the list of installed packages and dependencies.


The answer for the question  states the following:  For questions: The moderator or gold badge holder who closed or reopened the question, provided they were the only one to do so. Users who have closed or reopened a question without a binding close vote (i.e. without a gold tag badge or a moderator vote), and those who bindingly voted, but other users were also involved (e.g. closed by User1, User2, and Moderator) cannot be notified.  It's not quite clear for me, does a gold tag badge holder get notified from a comment via @ if for instance they are second person who voted to close/reopen?

User who cast a binding close vote on a question should be notified when someone comment-reply him/her, even without ever leaving a comment.  This still works fine when I am the only close voter, e.g.  (tried with my sock and deleted the comment already), however this fails to work when I'm not the only close voter, e.g. .  Tested both with a sock account and with the help of another user - no notification.  I noticed it yesterday and hoped it was a temp glitch, but then today I saw by chance , which is important for me to be notified about, since I can reopen the question with single vote.  Just to prove, a screenshot: (click to enlarge, don't want to clutter)        Can this please be fixed?


I have earned roughly 27k reputation points in total between all the Stack Exchange sites. I notice that when I follow or commit to an Area 51 proposal, I'm usually one of the highest on it when sorted by user reputation. How might one go about finding their rank of Stack Exchange reputation? We can do it individually per site, but that's not what I'm looking for exactly. I have considered something like... pulling a data.stackexchange query of all users with 10k+ rep on each site (just assuming there's not people with 8k rep on four different sites to sneak under the radar) and compiling a list that way, but that is a lot of work and isn't guaranteed to be accurate. And from what I can tell, the data query tool is not capable of hitting multiple databases. What are my options to solve this incredibly not important problem?

I like how Area 51 shows users by their total reputation across all sites, as an indication of the user's general familiarity with the Stack Exchange format.  Is it possible to get a list of all (or a subset) of users' total reputation?  For example, if I wanted to know my ranking in this list, how could I query for this data?


This is what  my sources.list looks like currently:  deb http://ftp.us.debian.org/debian/ jessie main deb-src http://ftp.us.debian.org/debian/ jessie main  deb http://security.debian.org/ jessie/updates main contrib deb-src http://security.debian.org/ jessie/updates main contrib  # jessie-updates, previously known as 'volatile' deb http://ftp.us.debian.org/debian/ jessie-updates main contrib deb-src http://ftp.us.debian.org/debian/ jessie-updates main contrib   As you can see, the repositories are mirrors from the US region. How do I change it to another repository region automatically, without having to change the sources.list manually?   I only know how to delete the old repo and change it manually to the other region repo, like AU repositories or other repositories.  I know that we can change the repo region Debian uses by following this format:   http://ftp.[Region].debian.org/debian/   But how about repositories which do not follow the default format such as: kartolo.sby.datautama.net.id, which is a repo from Indonesia? How can I change this to one from ?

Suppose I install debian,and my Internet network comes down. Install works OK,but at the time to setup the apt mirror from list give error because network Internet is down. I continue to install without mirror(apt/sources.list contain only cdrom entry) Internet work..how to setup the debian mirror after installation? I know how to edit sources.list with vi,but I want the menu with mirror list selection.


If an integer $n$  is coprime to $6$, then prove that $n^2$ leaves remainder 1 on division by 24    I know that $n$ can be written as $6k+1$ and $6k+5$, but how to proceed?

Let $p>3$ be a prime. Prove that $24 \mid p^2-1$.   I know this is very basic and old hat to many, but I love this question and I am interested in seeing whether there are any proofs beyond the two I already know.


Is there a function $f$ such that $f$ is entire and for all $z\in\mathbb{C}$ with $|z|\geq 100:|f(z)|=|z|+1$.  An observation is that $\lim\limits_{z\to\infty}f(z)=\infty$ and so $f$ must be a polynomial.  Therefore, the problem reduces to showing that no polynomial can uphold the given constraint.  My problem is in doing so. Is there another way?  Let $a\in\mathbb{C}$. For a large enough $R>100,|a|$, by Cauchy's formula we get  $$f''(a)=\frac{1}{\pi i}\int_{|z|=R}\frac{f(z)}{(z-a)^3}dz\implies $$  $$|f''(a)|\leq\frac{1}{\pi}\frac{1}{|R-a|^3}\cdot2\pi R$$  The latter goes to $0$ as $R\to\infty$, so $f''(a)=0$. Therefore, $f''\equiv 0$.  We get that $f$ is a linear function $f(z)=az+b$.

Does there exists an entire function such that for each $|z|>C$ for some constant $C$, $|f(z)|=|z|+1$?  Can I assume that since $f$ has a pole in infinity, $Imf$ or $Ref$ must have a pole at infinity too? If so, I can use this fact to define an exponent function of $Imf$ or $Ref$ (the one that goes to infinity) or their minus, and show that function is a bounded entire function, and therefore constant. Which gives a contradiction to the conditions about $f$.


Quite paradoxically, I came across this usage in a blog on  where the author says,      "When I was a neophyte writer..."   Is this a correct usage? Shouldn't it be      "When I was a neophyte in writing..."   Neophyte is not an adjective but a noun so, it has to be a wrong usage there. But I found this on a website which I usually visit to correct my grammar and English usage, therefore, I am perplexed. Later when I googled this word, I found the same usage at few other places as well.   Can neophyte also be used as an adjective?  Edit: While asking this question, I was not aware of attributive nouns so didn't note this question about . But as it stands now, this can be considered a duplicate question.

Nouns can modify nouns: cat food, coffee cup, gold ring, laser surgery, flood insurance. It seems to me there are even cases where a noun sounds better than the corresponding adjective: sociology papers sounds a bit better than sociological papers.  Some noun-noun combinations don’t work. You wouldn't say America gangsters or measurement spoons or greed crimes. If you spilled water on your keyboard you probably wouldn't call it a keyboard spill or even a water spill.  Are there rules that tell which combinations are acceptable?


I am trying to specialize template class member functions:  In valueinput.h  namespace Gui     {     template<class T>     class ValueInput:public TextInput         {         public:                      static ValueInput* create(Gui& gui_obj,uint32_t style_0,uint32_t style_1                 ,Window* parent,T& obj)                 {return new ValueInput(gui_obj,style_0,style_1,parent,obj);}              //Polymorphic implementation inherited from             //TextInput that needs specialization depending on T             void valueUpdate();              //Polymorphic implementation inherited from             //TextInput that needs specialization depending on T             void displayUpdate();          protected:             ValueInput(Gui& gui_obj,uint32_t style_0,uint32_t style_1,Window* parent                 ,T& obj):TextInput(gui_obj,style_0,style_1,parent),ptr_obj(&obj)                 {}          private:             T* ptr_obj;         };     }   In valueinput.cpp  template<> void Gui::ValueInput<double>::displayUpdate()        {     Dialog::messageDisplay(this,{STR("Display Update"),Herbs::LogMessage::Type::INFORMATION},STR("Test"));     }  template<> void Gui::ValueInput<double>::valueUpdate()      {     Dialog::messageDisplay(this,{STR("Value Update"),Herbs::LogMessage::Type::INFORMATION},STR("Test"));     }   Compiler output:  g++ "valueinput.cpp" -g -municode -Wall -c -std=c++11 -o "__wand_targets_dbg\valueinput.o"      valueinput.cpp:21:45: error: specialization of 'void Gui::ValueInput::displayUpdate() [with T = double]' in different namespace [-fpermissive]      valueinput.cpp:21:6: error:   from definition of 'void Gui::ValueInput::displayUpdate() [with T = double]' [-fpermissive]      valueinput.cpp:27:43: error: specialization of 'void Gui::ValueInput::valueUpdate() [with T = double]' in different namespace [-fpermissive]      valueinput.cpp:27:6: error:   from definition of 'void Gui::ValueInput::valueUpdate() [with T = double]' [-fpermissive]   What is wrong?

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


Is there a wubi installer for Ubuntu 13.10 x64?

Since 13.04, there is no Wubi, why was Wubi removed from the installation phase?


I have a datetime object (initialized), how can I output the month part as MM?

How can I format a date as dd/mm/yyyy or mm/dd/yy ?   Like in VB format("dd/mm/yy",now)  How can I do this in C#?


I found  which said that Magma for Windows has a strict memory limit of 1.3 GB as a consequence of something weird with long ints.   Is there any known workaround for this on a Windows machine? Would running in an Ubuntu subsystem or a virtual machine solve the problem, even though such subsystems would still be overlaid onto Windows? Should I expect a large performance hit?

Sorry if this isn't the best place to ask support type MAGMA questions, but I haven't found a single forum or anything for MAGMA users to talk.  I have access to a copy of MAGMA which is running on a server at my school (the operating system is "Windows Server 2008 R2 Enterprise").  I've been told the server has 16GB of memory and there's no limit to how much a single user can use (I'm apparently usually the only person on this server).  But for some reason I keep getting system errors from MAGMA any time it tries to request more than ~1400MB of memory.  Does anyone know how I can determine if this is an error in the way the server is set up or if this is an inherent limitation of MAGMA?


So I am trying to remember how Bayesian updating works and reading the .  I'm reading a lot about how either variance or the mean must be known.  In what cases of real life data does this happen?  For example, lets say I have a basketball team like the Toronto Raptors and I believe that their points scored in the upcoming NBA season will come from some undetermined Normal Distribution.  In the meantime, I want to start with the realized mean and variance from last years results and iteratively update my new distribution as the results come in.  How would I go about doing this?  Please let me know if there is something obvious I am missing or a better way to go about this.   EDIT  I have read the post that I am being marked a duplicate of:       I am trying to understand how to derive the posterior distribution of a parameter $\mu$ given data vector $z$, $P(\mu|z)$, where $$\mu \sim N(0,A)$$ and $$ z|\mu \sim N(\mu,1).$$    I don't understand how it applies to what I asked.   I am struggling to understand the 2nd assumption and how it relates to what I am asking.  Maybe this is obvious to the people who marked it as a duplicate, but I am asking on a more basic level / asking for where I can go to learn about what I originally asked.

I am trying to understand how to derive the posterior distribution of a parameter $\mu$ given data vector $z$, $P(\mu|z)$, where  $$ \mu \sim N(0,A) $$  and  $$  z|\mu \sim N(\mu,1). $$  Obviously from Bayes theorem  $$ P(\mu|z) = g(\mu) f(z|\mu) /f(z). $$  where $$ f(z)= \int g(\mu) f(z|\mu) d \mu . $$  I can write $g(\mu) f(z|\mu)$ as a pointwise product of normal densities:  $$  \frac{1}{2 \pi \sqrt{A}} \exp \bigg(-\frac{\mu^2+A(z-\mu)^2}{2A}\bigg) $$  the solution is given in Efron's book on Large Scale Inference, p. 2. :   $$ \mu|z \sim N(zB,B)$$ where $$B=\frac{A}{A+1} $$  I would appreciate advice on how to approach the problem (and the answer to this question is a proof). In particular I do not understand what to do with the integral in the numerator of Bayes theorem.   EDIT Following answer by @Neil_G I took a next approach:  We have:  \begin{align} g(\mu)   &\propto \exp\bigg(- \frac{\mu^2}{2A}\bigg)  \\[8pt] f(z|\mu) &\propto \exp\bigg(z \mu - \frac{1}{2}(z^2+\mu^2)\bigg) \end{align}  so \begin{align} P(\mu|z) &\propto \exp\bigg(- \frac{1}{2A} \mu^2 + z\mu - \frac{1}{2} z^2 - \frac{1}{2} \mu^2\bigg)  \\[8pt]  &= \exp \bigg(-\frac{1}{2B} (\mu^2+Bz^2-2Bz \mu)\bigg)  \\[8pt] &\propto \exp \bigg(-\frac{1}{2B} (\mu^2-2Bz \mu)\bigg)  \\[8pt] &\propto \exp \bigg(-\frac{ (\mu - Bz)^2}{2B}\bigg)  \end{align}  which completes the proof.


I am trying to write a program in python 2.7 that will first see if a number divides the other evenly, and if it does get the result of the division.  However, I am getting some interesting results when I use large numbers.  Currently I am using:  from __future__ import division import math a=82348972389472433334783 b=2 if a/b==math.trunc(a/b):     answer=a/b     print 'True' #to quickly see if the if loop was invoked   When I run this I get:  True   But 82348972389472433334783 is clearly not even.  Any help would be appreciated.

Is there a benefit to using one over the other? In Python 2, they both seem to return the same results:  >>> 6/3 2 >>> 6//3 2


I'm trying calculate the number of numbers in the long variable. However, if i declare long number = 0123456 -> 5. But when I declare long number = 123456 -> 6. Sorry my English isn't good. Thank you. This is my code:   public static void main(String[] args) {   long number = 0123456;   System.out.println(getSize(number)); }  public static int getSize(long d){         String number = Long.toString(d);         return number.length();     }   Can anyone explain for me please, thank you.

This prints 83  System.out.println(0123)   However this prints 123  System.out.println(123)   Why does it work that way?


I am running into this problem and was told this could help.

I've got an equation that contains   $$x^p - 1$$   $x$ is any positive number (such as 2) and $p$ is a small positive number close to 0 (such as 0.001).  For some reason (that I may have known in High School), this can be approximated by   $$\ln(x) \times p$$  Can anyone explain why this approximation works?  Does it have something to do with approximating a natural log with a series?


From basic principals, how does one prove that energy is conserved? Or a little more specifically - Why does this hold:  $$\Delta \mbox{ PotentialEnergy} + \Delta \mbox{ KineticEnergy} = 0 $$  Or, for extra credit, why does this hold:  $$\Delta \mbox{ PotentialEnergy } + \Delta \mbox{ KineticEnergy} + \Delta \mbox{ ThermalEnergy } = 0 $$

My physics instructor told the class, when lecturing about energy, that it can't be created or destroyed.  Why is that?  Is there a theory or scientific evidence that proves his statement true or false?  I apologize for the elementary question, but I sometimes tend to over-think things, and this is one of those times. :)


I've been fairly happily using Ctrl-C/Ctrl-V, with the occasional Ctrl-Ins/Shift-Ins here and there on Linux for quite some time, but I've recently switched over to urxvt and am finding the clipboard interaction situation pretty intolerable.  I would simply switch back to another emulator, but I'd rather have a go at solving this first.  Right now, I'm using autocutsel to sync CLIPBOARD and PRIMARY, but while this works well for copying text from urxvt to most other apps, it generally degrades the overall usefulness of the clipboard because it gets accidentally overwritten any time I select text anywhere.  The ideal solution would be to disable the PRIMARY "copy on select" behavior system-wide but Googling hasn't found me a solution. , but sadly remains unanswered.  To summarize, desired behavior:   urxvt selection: no-op Ctrl-Ins: copies to PRIMARY (autocutsel syncs to CLIPBOARD) Shift-Ins: pastes from PRIMARY elsewhere selection: no-op Ctrl-C: copies to CLIPBOARD (autocutsel syncs to PRIMARY) Ctrl-V: pastes from CLIPBOARD   NOTE: Please let me know if I'm misunderstanding either what Ctrl-Ins/Shift-Ins do or how autocutsel works.  EXTRA NOTE: There is  but that is about doing exactly the opposite (disabling CLIPBOARD) which will result in copying being implicit rather than explicit; as it says in that answer:     You can ignore PRIMARY if you want (but note that some older applications like xterm may only support PRIMARY   So the specific problem here is (a) supporting the modern explicitly populated CLIPBOARD while (b) still retaining access clipped contents from older applications

I would like to disable the default behavior that seems to happen with every Linux distribution that I've ever tried that any selected text is immediately sent to the clipboard (Mint, Ubuntu, Fedora, SuSE, etc.) and every window manager (Gnome, KDE, Cinnamon), and instead to behave more like the Windows implementation.    I know that this is a beloved behavior by many in Linux, and I'm sure many will think I'm an idiot.  The reason I want to do this, is that I'm a keyboard junky when navigating a GUI.  (e.g.  when I'm in Linux and I copy a URL and then switch to my browser and type Ctrl+L, it selects the address bar and moves my intended paste down one notch and replaces it with what I'm trying to overwrite.)  I know there are MANY workarounds, but I don't really care about that, what I'd prefer is to be able to toggle the behavior for the clipboard.


I am using Postman to test the connected app I set up in a Salesforce sandbox environment. When I send the request to https://xxx--partial.lightning.force.com/services/oauth2/token, I get an invalid_request error with a description of "must use HTTP POST".  Here is the url with parameters: https://xxx--partial.lightning.force.com/services/oauth2/token?grant_type=password&client_id=clientIdHere &client_secret=clientSecretHere&username=myEmailAddress&password=myPassword&Content-Type=application/x-www-form-urlencoded  How can I obtain the access token with username/password in a sandbox?

OAuth 2.0 Auth token request failed with below error   { "error": "invalid_request", "error_description": "must use HTTP POST" }   What does this error mean?  I am using Postman. Have a connected app. I have used Post method, Url has https. Same request works for other Orgs. Did I missed any configuration/Permission check?  https://testOrg.lightning.force.com/services/oauth2/token?grant_type=password&client_id={{CLIENT_ID}}&client_secret={{CLIENT_SECRET}}&username={{USER_ID}}&password={{PASSWORD}}


i've tried to change the logo link in the homepage with this code i've found:  <?php echo esc_url( home_url( '/home' ) ); ?>   this in the header.php but doesn't work, also i tried   add_filter( 'login_headerurl', 'custom_login_logo_url' );function custom_login_logo_url($url) { return '/home';}   doesn't work.  Thanks

I'm trying to change the logo url of the site to "mywebsite.com/side2", but it is not working, can anyone tell me where is the error in the code below?  add_filter( 'login_headerurl', 'custom_loginlogo_url' ); function custom_loginlogo_url($url) {  return home_url( 'side2' ); }


I am new to ubuntu. I am having a PC with Pentium 4 processor 512 MB ram and an  inbuilt graphics card. Can I install Ubuntu on my system? Right now I am having Windows XP. But it is somehow corrupted. Please help. How can I install Ubuntu on my system? Will it work fine with my system specifications?

I'm thinking about installing Ubuntu Desktop, but I don't know what flavor is the best for my system. What are the minimum and recommended hardware requirements? What kind of CPU? How much memory? Should I have Hardware Acceleration? What flavor should I use?  This is an attempt of a canonical answer. My answers have the "official  requirements", the recommended are a mix of official sources and opinion based (along with the answer it's told the source). You can comment or edit if you feel that the information is obsolete or incomplete. It is a good rule of thumb that any system capable of running Windows Vista, 7, 8, x86 (Intel) OS X will almost always be a lot faster with any Ubuntu flavor even if they are lower-spec than described below.


For some tox tests, I need a Python 3.5 interpreter. How can I install it on Ubuntu 18.04?

How can I install a different version of Python using apt-get?  Obviously I realise I can install using the source tar ball, however I would prefer not to install from source and instead use the package manager, as that's what it's there for. Surely somewhere reputable builds .deb files for the latest Python releases (why python.org don't is beyond me) that I can reference.   What do I need to do to reference them and what issues might it create when upgrading to the next version?  If there is no way except for building from source, is there a (pseudo) package that I can can install that will provide all of the dependencies needed without having to find and install each individually? So that I don't get:  The necessary bits to build these optional modules were not found: _bz2                  _curses               _curses_panel       _dbm                  _gdbm                 _lzma               _sqlite3              _ssl                  _tkinter            readline              zlib


Whenever I download a .blend from someone all of the windows and settings are the way they have left them as it is saved in the file. It takes way to long to rearrange every window and toolbar to the way it is by default. Is there any tool or shortcut that can reset the UI to blenders default and just leave the actual contents of the file? The only way I could do this is by creating a new file and using link/append but this is not the best option.

Is there a way to open files without changing the UI layout?  Sometimes in older files the layout will be in the old 2.4x style, which can be annoying.  One way would seem to be appending everything in, but that gets tedious with having to do it over again and again for objects, materials, textures, etc.


We know that every injective module is divisible, but I can't find an example of divisible module such that it is not injective.

On searching for some example of divisible module but not injective, I come across one in T.Y.Lam, Lectures on Modules and Rings.     He considers the $\mathbb{Z}[x]$-module $M=\mathbb{Q}(x)/\mathbb{Z}[x]$, where $\mathbb{Q}(x)$ denotes the quotient fields of $\mathbb{Z}[x]$.   It's clear that $M$ is divisible, but how can I go about proving it's not injective? Can someone please give me a little push on this?  Thanks a lot,  And have a good day,


(Please excuse my English)  In Newtonian mechanics and gravity, these are obvious.   Momentum is conserved in gravity action. Momentum is conserved in real force action. Momentum is not conserved in fictitious force action. So gravity is a real force.   I do not know much about general relativity(=GR). However, I know these.   In GR, gravity is described as moving in spacetime curvature. So gravity is a fictitious force in GR.   Am I right?  If gravity is a fictitious force, momentum is not conserved in gravity of GR?

I'm trying to understand the conservation of momentum in general relativity.  Due to the curvature of space-time by matters and energy, the path of a linear motion appears to be distorted.   Therefore from the frame of reference of an observer who is at a not-so-curved region of space-time, it appears that the velocity vector of an object that is moving along a straight line in a very-curved space-time is changing?   Does that imply that from the observer's frame of reference (in a not-so-curved space-time) momentum of that object (in the very-curved space-time) is not conserved?   In this sense is momentum not always conversed in general relativity or did I misinterpret something?


Source: p 214, With Good Reason, An Introduction to Informal Fallacies (2000 6 ed) by      Fallacy: Appeal to Pity   Definition/Hints: Seeking to persuade not by presenting evidence    but by arousing pity   [1.] Example/Method: "Please, officer, don't give me a ticket. My    parents will take the car away from me and my    life will be miserable."    If the Conclusion is:           I am not guilty of a ticket.   Then 2 is an AtP because criminal guilt is an independent conclusion and question from emotional misery due to the ticket.   Don't give me a ticket.    Then how is 1  an Appeal to Pity (abbreviated to AtP)? Is not 1 a Valid Syllogism as follows? 3 differs from the Protasis of 4, and so 4 and 5 would not apply.   If an officer gives me a ticket, then my parents will take the car away from me. If my parents will take the car away from me, then my life will be miserable.

I know I flunked every exam, but if I don't pass this course, I'll have to retake it in   summer school. You have to let me pass!   Why is this a fallacy? I agree that the speaker desires sympathy and commiseration, but what is fallacious about his objective (reasonable, to me) to avert retaking the course (in the summer)?   This question was motivated by pp 154 of 180, A Rulebook for Arguments, by  Anthony Weston


I've researched many methods on how to prevent Google/other search engines from crawling a specific directory. The two most popular ones I've seen are:   Adding it into the robots.txt file: Disallow: /directory/  Adding a meta tag: <meta name="robots" content="noindex, nofollow">   Which method would work the best? I want this directory to remain "invisible" from search engines so it does not affect any of my site's ranking.  In other words, I want this directory to be neutral/invisible and "just there." I don't want it to affect any ranking. Which method would be the best to achieve this?

I have some web pages that Google has indexed. I have now added a robots.txt file to exclude them, but should I also add a noindex tag? If so, then how do I do so?


I want to dual boot Ubuntu and Windows. I saw a lot of tutorials and they do partitioning, but I'm confused if I should do partitioning or just select the option "Install Ubuntu alongside Windows". Will I get the same result if I choose the first option in the installer?

I want to reinstall Ubuntu keeping my data intact. I have 160 GB hardrive (sata or pata I don't know but it's slim and made in China) with a 40 GB ext3 partition, a 4GB swap memory and 3 other partition with a FAT32 file system. I have around 4GB space on my drive where Linux is installed.  I'd like to keep the data intact, especially the Downloads folder, desktop, and /var/www; And I no longer have access to any other machines or external storage devices.


I am running usb-creator-gtk.  After copying files it says: "system policy prevents installing the bootloader".  Why does it say this?  I am not trying to modify my system.  I am creating a bootable USB drive.  I don't understand why modifying a thumb drive would require administrator privileges.

When you want to create a bootable usb memory stick, then you must identify as a sudoer. Why is that? I have no difficulty understanding why unprivileged users shouldn't be allowed to fiddle with the installed system, but why shouldn't you be allowed to copy grub onto the memory stick if you have write access to it?


I have a budget sized hp laptop that has a small hard drive (not upgradable) and windows use 90%. When my cache gets even a little filled it slows down to a crawl.  I understand ubuntu takes up less hard drive space. Would it be worthwhile to switch to Ubuntu? Is it even possible, considering I have little space for swapping? uses

I'm thinking about installing Ubuntu Desktop, but I don't know what flavor is the best for my system. What are the minimum and recommended hardware requirements? What kind of CPU? How much memory? Should I have Hardware Acceleration? What flavor should I use?  This is an attempt of a canonical answer. My answers have the "official  requirements", the recommended are a mix of official sources and opinion based (along with the answer it's told the source). You can comment or edit if you feel that the information is obsolete or incomplete. It is a good rule of thumb that any system capable of running Windows Vista, 7, 8, x86 (Intel) OS X will almost always be a lot faster with any Ubuntu flavor even if they are lower-spec than described below.


I found these two sentences and I want an explanation for them to illustrate why they go like:         A number of boys were absent.      Although the subject is singular, but the sentence is considered as plural?         three eggs is plenty       And in this example, the writer used is instead of are.

[A number of boys] were absent.   (The Cambridge Grammar of the English Language, p56)   This book says that number is the head of the subject NP, but Angela Downing calls it a "determinative" (that is, a "complex quantifier", English Grammar p.433). When I read the sentence, Downing's term seems more natural. Then what's the possible reason Cambridge Grammar sees number as the head of the NP?


$$\lim_{n\to\infty}\sqrt{n^2+100n} - n=50$$   Why is it $50$? I'm unsure how to solve this.  Is there some transformation to apply first? How do you know?

Let t(n) = $\sqrt{n^2+100n} - n$  Show that $t(n)$ is $O(1).$  I tried solving this using the formal definition of O( ) but am not getting anywhere. Quite confused on how to tackle this question.


I'm having employee objects and i want the sorted list by name in descending order and salary in ascending order.   class Employee {      String name;     Long salary; }

Assume you have some objects which have several fields they can be compared by:  public class Person {      private String firstName;     private String lastName;     private String age;      /* Constructors */      /* Methods */  }   So in this example, when you ask if:  a.compareTo(b) > 0   you might be asking if a's last name comes before b's, or if a is older than b, etc...  What is the cleanest way to enable multiple comparison between these kinds of objects without adding unnecessary clutter or overhead?   java.lang.Comparable interface allows comparison by one field only Adding numerous compare methods (i.e. compareByFirstName(), compareByAge(), etc...) is cluttered in my opinion.   So what is the best way to go about this?


For example, I have these hosts from different subnets:  192.168.0.1/27  192.168.0.33/27 192.168.0.65/27 192.168.0.97/27   How can I supernet them together and find the network address and mask? (These will be used in a static routing table)

This is a  about IPv4 Subnets.      Related:               How does Subnetting Work, and How do you do it by hand or in your head?  Can someone explain both conceptually and with several examples? Server Fault gets lots of subnetting homework questions, so we could use an answer to point them to on Server Fault itself.   If I have a network, how do I figure out how to split it up? If I am given a netmask, how do I know what the network Range is for it? Sometimes there is a slash followed by a number, what is that number? Sometimes there is a subnet mask, but also a wildcard mask, they seem like the same thing but they are different? Someone mentioned something about knowing binary for this?


The reason I'm asking this is because of, quite simply, the Monster Manual. As a DM, I know I'm probably gonna need it, but not all the time. So instead of buying it physically, I want to see if there is a free online way to access it. If you could also find a way to get Xanathar's Guide to Everything the same way, that would be great as well. I'm not talking about campaign books by the way. Someone suggested  as a alternative question with answers, but again, I'm not talking about campaign books (yet)

As much as I like having the hardcover core rule-books in front of me, usually I read or reference most information for RPGs on my computer.  Unfortunately, my google-fu has failed me at finding places to buy a Player's Handbook PDF, or even whether said PDF exists at all.  My question is this: Is there any place I can go to legally buy a D&D 5e core rulebook PDF?  I'm not looking for the starter set or basic rules, since those are incomplete (and free), I'm just looking for the core books in PDF format.


I would like to view photos in Windows 10. Unfortunately, when I double click on a photo it is displayed in a window of the Photos app with a black border. However, I don't want to waste space for a borer but I only want to see my photo as large as possible.  How can I get rid of the border?  (Switching back and forth between full screen and window mode is annoying because of the additional key strokes and therefore not an option for me.)

I am looking for an image viewer software without very large window borders. I don't need any type of toolbar, just a simple image viewer.   It would also be fine if there is no top bar to close, minimize or maximize window.


Are there rules for what happens if a paladin breaks their oath? I haven't found a single one. Am I missing something?

It is stated that when a Paladin falls from grace and does not repent, they must either become an Oathbreaker or choose a new class, but what exactly happens when they fall from grace? Does the Paladin lose all of his/her powers, or does the loss from grace only mean they are abandoned by their deity or order?


Is there a way to get the location mouse inside a <canvas> tag? I want the location relative to to the upper right corner of the <canvas>, not the entire page.

What's the simplest way to add a click event handler to a canvas element that will return the x and y coordinates of the click (relative to the canvas element)?  No legacy browser compatibility required, Safari, Opera and Firefox will do.


To activate a Bankai or its ability, is the user required to perform some verbal command activation?   For example, Ichigo often yells     Bankai: Tensa Zangetsu   However, I'm pretty sure that I've read some silent activations, but I can't remember for sure.  So has a Bankai ever been activated without a vocal command?   Note that this is not a duplicate of , as that question asks whether it is possible. And this question asks if a silent activation has ever happened in the series.

So, this sounds like a stupid question I know but in the bleachverse 'names' are very important and you can only unleash the power of your zanpakuto if you can call out its name. Therefore, if a shinigami is mute, will they ever be able to achieve shikai/bankai? If so then how? Only one case that I know of is for shinigamis who have already achieved bankai to be able to release their shikais without a command.  Answers based on LN are welcome, but if you are citing from a dubious source or a source whose canon status can be question, please specifically mention it. I am mostly interested in an answer based on a  canon source.


I'm trying to open a file browser (similar the browser in the image bellow) where the user can chose a folder and file name to save a new .blend file with the selected objects.  I want make a addon to easely save a new blender file e.g to select a collection and save a new blender file with the collection name and all objects inside there or select only two object and save a new file with that.  To do that I'm using the code bellow but all I get is some errors. Someone know a simple way to open that browser. I read some parts of the blender api documentation but I'm really confusing with some functions that I found in there.  The code I'm using:  class FileExporter(Operator):     bl_idname = "export.file_exporter"     bl_label = "Save"     bl_options = {'REGISTER'}      def export(self, context):         self.file_path = bpy.path.relpath          bpy.ops.wm.path_open(filepath=self.file_path)      def execute(self, context):         self.export(context)          return {'FINISHED'}

How can I get bring up a popup file browser in Blender 2.80 invoked by a button click in my addon, to define the name and location of a file to be exported?  In Blender 2.7x, I did this via the context window manager in the invoke function, but it is very possible that this hasn't been the preferred method for years, as I'm not finding useful documentation when I search for how to update this.  class MYTOOL_OT_write_data(bpy.types.Operator):     bl_idname = "mytool.write_data"     bl_label = "Write data file"      directory: bpy.props.StringProperty(subtype="FILE_PATH")     filename: bpy.props.StringProperty(subtype="FILE_NAME")      def invoke(self, context, event):  # 2.7x method         WindowManager = context.window_manager         context.window_manager.FILEBROWSERect_add(self)  # <-- error here         return{"RUNNING_MODAL"}      def execute(self, context):         directory = self.directory         filename = self.filename         # Write csv data file using normal python functionality         return{'FINISHED'}   In Blender 2.80, I am getting the error "AttributeError: 'WindowManager' object has no attribute 'FILEBROWSERect_add'".  Thanks for your help.    UPDATED SOLUTION based on brockmann's solution below.  The trick is to use the ExportHelper util (which existed long before Blender 2.80):  from bpy_extras.io_utils import ExportHelper  class MYTOOL_OT_write_data(bpy.types.Operator, ExportHelper):     bl_idname = "mytool.write_data"     bl_label = "Write data file"      filename_ext = ".csv"  # ExportHelper mixin class uses this     def execute(self, context):         filepath = self.filepath         # f = open(filepath, 'w')         # f.write(stuff)         # f.close()         return{'FINISHED'}


I was reading the theory of relativity and though I think I understood the effects of it, I am not sure why it happens in the first place. I will summarise below   Time and space are relative:   Why so? I read how clocks move at different speeds when in motion but what is the underlying phenomenom that makes it happen ?   You can never reach the speed of light because As you move faster mass increases and more force is needed for acceleration.   Cool, but then how does light move at the speed of light? What property does light have that no other matter does that enables it to move at this speed?   Space and time are relative but space time is not   What is space time. Not theoretically but from an understanding point of view. Any practical example ?

This is an attempt to gather together the various questions about time that have been asked on this site and provide a single set of hopefully authoritative answers. Specifically we attempt to address issues such as:   What do physicists mean by time? How does time flow? Why is there an arrow of time?


I have a 3 way switch (switch A) that controls a device. I have another three way switch (switch B) that is not connected to anything. I would like to connect switch B to switch A so that it can be part of the same circuit, and control the same device. Is this possible?

I have an existing three way switch hooked up already, it works fine. I would like to add another three way switch by connecting another switch to the existing three way switch. Can this be done with 14/2 romex between the two switches?


Help me, please, to fix the work of biber. When I put in biblatex options backend=biber then during the compilation I get:   This is BibTeX, Version 0.99d (TeX Live 2010) The top-level auxiliary file: test.aux I found no \citation commands---while reading file test.aux I found no \bibdata command---while reading file test.aux I found no \bibstyle command---while reading file test.aux (There were 3 error messages)   I just updated my TexLive 2010 at 23.05.2011 by the command tlmgr update --all Maybe I do something wrong? Please, help.  After correction: code added  \documentclass[12pt]{report}   \usepackage{fontspec} \usepackage[hidelinks]{hyperref}  \usepackage{xunicode} \usepackage[no-sscript]{xltxtra}  \usepackage[babel=false]{csquotes} \usepackage{polyglossia} \setdefaultlanguage{french} \setotherlanguages{german,english,greek,polish,russian} \usepackage[backend=biber,style=verbose-ibid,citepages=suppress,sorting=nty]{biblatex}  \setmainfont[Mapping=tex-text]{Linux Libertine}  \usepackage{setspace} \usepackage{acronym} \usepackage{tocloft}  \usepackage{filecontents}  \begin{filecontents}{fortest.bib}  @Book{Kaluzh, title = {Nowy sobór. Natura, historia przygotowań, tematyka}, author = {Tadeusz Kałużny}, publisher = {wydawnictwo księży Sercanów}, year = {2008}, location = {Krakóv}, }   @Book{AlKarapan, author = {Αλέξανδρος Κ. Καραπαναγοπούλου}, title = {Η Μεγάλη Σ. της ΟΑΕ}, publisher = {Auto-édition}, year = {1990/1998}, volumes = {6}, location = {Αθήνα}, shorthand = {MS-OAE}, }   @Misc{Konst1923, title = {Πρακτικὰ καὶ ἀποφάσεις τοῦ ἐν ΚΠΣ (10 μαΐου--8 ἰουνίου 1923)}, year = {1923}, location = {Κωνσταντινούπολη}, keywords = {primary} }  @Article{Akury, author = {Adolf Küry}, title = {Die Konferenz in Konstantinople}, journal = {Internationale kirchliche Zeitschrift}, year = {1924}, number = {14}, pages = {62--64} }  @Online{Tichon1923enciclic, title = {\textrussian{Послание Патриарха Тихона к православному народу о реформе календаря в РПЦ}}, date = {1923-10-01}, urldate = {2010-10-05}, url = {http://holyrussia.narod.ru/Tykhon_Calendar.html} }  @Article{Echo1932, journal = {Échos d'Orient}, title = {Le préconcile orthodoxe}, author = {J. Lacombe}, number = {31}, year = {1932}, pages = {239-241} }  \end{filecontents}  \addbibresource{conference.bib}   \begin{document} test\footcite[331]{Kaluzh} est\footcite[23--27]{AlKarapan} test\footcite[23--27]{Konst1923} test\footcite[23--27]{Tichon1923enciclic} test\footcite[23--27]{Echo1932} test test  \printbibliography  \end{document}

I'm trying to use biblatex and when I compile my document I get an error like the following:  Windows  data source C:\Users\<username>\AppData\Local\Temp\par-5061756c\ cache-890efc00b3ca6b775c7d44a325c1349fb2a3a3bd\inc\lib/Biber/LaTeX/recode_data.xml not found in .   Mac  data source /var/folders/v2/rld0ls7d2935gkvqv5hfr1x00000gn/T/par-616c616e/ cache-cdd483146f82a9655ce063f848d5139480fbf872/inc/lib/Biber/LaTeX/recode_data.xml not found in .   Linux  data source /tmp/par-6963617269756d/cache-f37ab610b7d79b2720a8ee3732849c6821705520 /inc/lib/Biber/LaTeX/recode_data.xml not found in .


I have a server with a hard drive I'd like to test using smartctl (smartmontools) and badblocks. I would use smartctl first, then badblocks.  My question is three parts:   How can I run the commands over SSH so the process won't stop when I close the Terminal? How can I output the badblocks results and the smartctl info to a file? How can I run smartctl and then badblocks will start automatically (when smartctl is finished) without having to SSH again?   Thank you.

If I'm logged into a remote Linux machine, I know I can suspend a process (cntr-z) and move it to the background (bg 1) but if I disconnect from the machine, the process stops.  Is there a way I can leave it in the background and have it there when I log back in? This is a very long running process.  On Ubuntu, logged in via SSH.


I have tried several methods given on internet but nothing works. Can someone help. I am posting my preamble below. I am also fine with adding keywords in footnote, but if I can add them after abstract, it would be better.    \documentclass[12pt,a4paper]{amsart} \usepackage{amsfonts} \usepackage{amsthm} \usepackage{amsmath} \usepackage{amscd} \usepackage[latin2]{inputenc} \usepackage{t1enc} \usepackage[mathscr]{eucal} \usepackage{indentfirst} \usepackage{graphicx} \usepackage{graphics} \usepackage{pict2e} \usepackage{epic} \numberwithin{equation}{section} \usepackage [left=2.7cm, right=3.0cm, top=3.5cm, bottom=4.0cm,]{geometry} \usepackage{epstopdf}  \def\numset#1{{\\mathbb #1}}  \theoremstyle{plain} \newtheorem{Th}{Theorem}[section] \newtheorem{Lemma}[Th]{Lemma} \newtheorem{Cor}[Th]{Corollary} \newtheorem{Prop}[Th]{Proposition}  \theoremstyle{definition} \newtheorem{Def}[Th]{Definition} \newtheorem{Conj}[Th]{Conjecture} \newtheorem{Rem}[Th]{Remark} \newtheorem{?}[Th]{Problem} \newtheorem{Ex}[Th]{Example}  \newcommand{\im}{\operatorname{im}} \newcommand{\Hom}{{\rm{Hom}}} \newcommand{\diam}{{\rm{diam}}} \newcommand{\ovl}{\overline} %\newcommand{\M}{\mathbb{M}}   \begin{document}  \title{dddfdgs}  \author{sds Ssdasgh} \author{Basdishth}     \address{se \\ University of dsdsDshid \email{dssdasdsogy@gmail.com} \address{Univsasa\\ Deparsastics} \email{sadr@gmail.com}   \begin{abstract} lipsum \end{abstract}    \maketitle   \section{Introduction} blablbalab  \end{document}

I'm using amsart and want to place keywords after abstract but amsart places them in the footnote. Does anyone know how Ι can override this?  An example of the code I've been using:  \documentclass[12pt, reqno]{amsart} \usepackage{ amsthm, amscd, amsfonts, amssymb, graphicx,tikz, color, environ} \usepackage{hyperref} \begin{document}  \title \address \date \keywords \maketitle  \begin{abstract}  \end{abstract}  \end{document}


Today I upgraded from raring to saucy. This brought the Ubuntu One icon back to my indicator applet, which I had disabled.   So I removed the line NoDiplay=true from /etc/xdg/autostart/ubuntuone-launch.desktop.   But still Ubuntu One doesn't show up in gnome-session-properties and I can't disable it.   What gives?

How do I manage (add/remove) all the startup applications in Ubuntu 11.10 and up?  Startup Applications doesn't show all the applications which are started during boot.


This question is inspired to:   I am reading here,   that the suggested SSD are 128GB, 256GB, or 512GB solid-state drive.   Is there any problem if I buy a 240 GB which seems to be easier to find? Someone in the first link even says we can buy up to 2TB. I'm asking because I am having problems in finding 256GB, so I'm worried about compatibility with 240GB.

I'm considering buying a solid state drive for my Unibody White MacBook 2010. The trouble is, I have no idea what to look for. What kind of connector am I looking for? (SATA?) What size? I'm told to get the kind that Apple uses so that I don't void my AppleCare warranty. What model/brand(s) would that be?


I'm aware that Drupal 7 saves the user's password in a more compact way and it's really hard (impossible?) to convert such password back to a human readable text format (even not into database).  Actually I do not want to implement any hack to Drupal, but it's a requirement that a super admin can somehow view the username along with its password for any user. Super admin is a trust worthy role and actually will help through secured communication media to other users after forgetting their password.  So there is a need to create a block to show all the usernames with their corresponding password, which can only be used by a super admin.  Any suggestions about how I could implement all this?  Note:  Users are not allowed to reset passwords, I just want only super admin can access their usernames and passwords and then re-assign to other user if any of them forgot his password.

MY site was created and maintained from a developer I cannot contact, and I need to know the username/password the developer used to access the site.  How can I achieve this?


How many ways are there to form a sequence of 10 letters from 4 a's, 4 b's, 4 c's, and 4 d's if each letter must appear twice?  So typically I would use the theorem like  16! / 4! 4! 4! 4!  (if I was choosing a sequence of 16 and exactly 4 each)  For this example though I would have to lock the spots of 2 of each in place so aabbccdd _ _ and those two extra spots would have 4 choices each, so 4 x 4.  Would it be: (10! / 3! 3! 2! 2!) x 16 ?  Any help would be appreciated!

Say, we have 4 red balls, 4 blue balls, 4 green balls, 4 yellow balls. How many ways are there to form a sequence of 10 balls such that every color of ball occurs at least twice?  My thought: r = red b = blue g = green y = yellow * = undetermined  Every arrangments should in this form: rrbbggyy**  Case 1: two * are same  $\frac{\binom{4}{2}\binom{4}{2}\binom{4}{2}\binom{4}{2}\binom{4}{1}10!}{4!2!2!2!}$  Case 2: two * are different  $\frac{\binom{4}{2}\binom{4}{2}\binom{4}{2}\binom{4}{2}\binom{4}{2}10!}{3!3!2!2!}$  Result = Case 1 + Case 2  Any suggestions would be appreciated!


I am working in dual opretion systems on one pc ,win 7 and ubuntu 16.04 . After  disconnecting from ubuntu and boot to  win 7,  the display time show 2 hours delay .  please advise how to solve this problem .

Dual boot system Windows XP Pro and Ubuntu 12.04.  I have the bios set for the correct time and Ubuntu set for US Eastern time.  Ubuntu will boot up and the time will be off by -4 hours.  If I correct the time in Ubuntu then when I boot up in Windows XP the time will be off by + 4 hours.  This is a fresh install of 12.04. I did not have this problem before reinstalling Ubuntu.


Maybe it's a stupid question, so I will delete it if it will receive too many down votes but..  I was wondering about the Universe, and the fact that    We know it's expanding; We don't know if it has an edge, maybe yes maybe no;   But.. does the Universe spin? If we should describe the entire observable Universe as a "body", we should take into account its expansion but would it be also described as a rotating body or as a non-rotating one?

Suppose in the milliseconds after the big bang the cosmic egg had aquired some large angular momentum. As it expanded, keeping the momentum constant (not external forces) the rate of rotation would have slowed down, but it would never reach zero.  What implications would that have to measurments to distant supernova and CMB radiation? Do we have any experimental data that definitely rules out such as scenario? And to what confidence level?  Edit A  suggests that the universe might indeed be spinning as a whole. Anyone care to poke holes at it?  Edit 2 Even more  places limits on possible rotation.


my machine already have cross compiler toolchain in a folder. how do I tell machine to compile using this cross compiler rather than the native compiler?

We have a new application that requires glibc 2.4 (from gcc 4.1). The machine we have runs on has gcc 3.4.6.   We can not upgrade, and the application must be run on this machine.    We installed gcc 4.1, however, when it comes to compile time it is using all the includes, etc, from 3.4.6.    How do we get around this?  Any suggestions on using 4.1 for just this application?


Here's initialization I just found in somebody else's question.  my_data data[]={     { .name = "Peter" },     { .name = "James" },     { .name = "John" },     { .name = "Mike" } };   I never saw something like this before and can't find explanation how is .name possible to be correct. What I'm looking for is how step by step this process goes.  It looks like it gets:  1) data; 2) *data; 3) (*data).name; 4) (*data).name="Peter";   Or am I totally wrong?

I want to initialize a struct element, split in declaration and initialization. This is what I have:  typedef struct MY_TYPE {   bool flag;   short int value;   double stuff; } MY_TYPE;  void function(void) {   MY_TYPE a;   ...   a = { true, 15, 0.123 } }   Is this the way to declare and initialize a local variable of MY_TYPE in accordance with C programming language standards (C89, C90, C99, C11, etc.)? Or is there anything better or at least working?  Update I ended up having a static initialization element where I set every subelement according to my needs.


my baby is 2 month old. I want know when I should start "bedtime routine" ? and also when make him sleep in his room ? now he sleep next to me, is it correct to take him sleep on his bed or should I wait?

Many people choose to co-sleep with their children because of supposed psychological and sleep quality reasons. Are there any scientific studies or other concrete evidence to back them up?


How can I install phpmyadmin on Ubuntu 19.10?

I just recently upgraded from Ubuntu 19.04 (Disco Dingo) to Ubuntu 19.10 (Eoan Ermine). My phpMyAdmin was removed while upgrading. Now I can't install it again.  I tried using:  sudo apt-get install phpmyadmin php-gettext   but it shows something like this:  Package phpmyadmin is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source  E: Package 'phpmyadmin' has no installation candidate   So I searched from phpMyAdmin, apt search phpmyadmin, but I didn't find any.  How can I install phpMyAdmin on this version?


I've been getting these messages right after I boot telling me I don't have enough space in my boot partition anymore. Today I reached a point I can't install anything else because of this. So I started researching how to resize it.  I found I could resize it using gparted, but I can't install it because there's no space left in /boot.  Some people suggested that those who need to clear some space in /boot should remove old kernels, but I have two issues with that: I don't know how to access /boot in the terminal and I'm not completely sure what a kernel is, so I might just as well delete something important or my current kernel, which I know can damage my OS.  What should I do?

My /boot partition is nearly full and I get a warning every time I reboot my system. I already deleted old kernel packages (linux-headers...), actually I did that to install a newer kernel version that came with the automatic updates.  After installing that new version, the partition is nearly full again. So what else can I delete? Are there some other files associated to the old kernel images?  Here is a list of files that are on my /boot partition:  :~$ ls /boot/ abi-2.6.31-21-generic         lost+found abi-2.6.32-25-generic         memtest86+.bin abi-2.6.38-10-generic         memtest86+_multiboot.bin abi-2.6.38-11-generic         System.map-2.6.31-21-generic abi-2.6.38-12-generic         System.map-2.6.32-25-generic abi-2.6.38-8-generic          System.map-2.6.38-10-generic abi-3.0.0-12-generic          System.map-2.6.38-11-generic abi-3.0.0-13-generic          System.map-2.6.38-12-generic abi-3.0.0-14-generic          System.map-2.6.38-8-generic boot                          System.map-3.0.0-12-generic config-2.6.31-21-generic      System.map-3.0.0-13-generic config-2.6.32-25-generic      System.map-3.0.0-14-generic config-2.6.38-10-generic      vmcoreinfo-2.6.31-21-generic config-2.6.38-11-generic      vmcoreinfo-2.6.32-25-generic config-2.6.38-12-generic      vmcoreinfo-2.6.38-10-generic config-2.6.38-8-generic       vmcoreinfo-2.6.38-11-generic config-3.0.0-12-generic       vmcoreinfo-2.6.38-12-generic config-3.0.0-13-generic       vmcoreinfo-2.6.38-8-generic config-3.0.0-14-generic       vmcoreinfo-3.0.0-12-generic extlinux                      vmcoreinfo-3.0.0-13-generic grub                          vmcoreinfo-3.0.0-14-generic initrd.img-2.6.31-21-generic  vmlinuz-2.6.31-21-generic initrd.img-2.6.32-25-generic  vmlinuz-2.6.32-25-generic initrd.img-2.6.38-10-generic  vmlinuz-2.6.38-10-generic initrd.img-2.6.38-11-generic  vmlinuz-2.6.38-11-generic initrd.img-2.6.38-12-generic  vmlinuz-2.6.38-12-generic initrd.img-2.6.38-8-generic   vmlinuz-2.6.38-8-generic initrd.img-3.0.0-12-generic   vmlinuz-3.0.0-12-generic initrd.img-3.0.0-13-generic   vmlinuz-3.0.0-13-generic initrd.img-3.0.0-14-generic   vmlinuz-3.0.0-14-generic   Currently, I'm using the 3.0.0-14-generic kernel.


In this code, i want the spacing before and after of my section, subsection, and subsubsection headings to be exactly 1.5cm regardless of the font size or my line spacing. How can i do this? I know that this question has been asked before several times on this site but I want a package-free solution.    \documentclass[a4paper]{book} \usepackage{lipsum} \begin{document} \chapter{A Chapter} \lipsum[2] \section{Foo} \lipsum[2] \subsection{Bar} \lipsum[2] \subsubsection{Foo Bar} \lipsum[2] \end{document}   Edit  I know that the spacing before, say, section headings is controlled by the code below, but when I enter -1.5cm instead of -3.25ex, the vertical space before the heading doesn't become exactly 1.5cm on the output. Why?    \makeatletter \newcommand\section{\@startsection {section}{1}{\z@}%                                    {-3.5ex \@plus -1ex \@minus -.2ex}%                                    {2.3ex \@plus.2ex}%                                    {\normalfont\Large\bfseries}} \makeatother

I know this subject has been mentioned before, but I'm still having a problem in creating a space under a section title. I used the titlesec package and then tried using the command \titlespacing{\section}...  This is my code. Can anybody help?  \documentclass[10pt]{book} \usepackage[utf8]{inputenc} \usepackage{fullpage} \usepackage[compact]{titlesec} \usepackage{setspace} \usepackage{sectsty} \chapterfont{\huge} \sectionfont{\Huge} \begin{document} \chapter*{Kapitel 1} \section*{Einleitung} \begin{large} \subsection*{1.1 Motivation}


I was on like level 6 when the app crashed and made me log back in. I put all the same info but it took me back to level 1 and everything was lost. When I sign on and off it will only revert back to the new one. It made me make a new username and everything. Any ideas on how I can get my other progress back?

So I had 20+ Pokemon on my account and today when I tapped on the app, it brought me back to the original screen when you first start playing. My friend who signed up tested using my username when she first started and my username was unavailable, meaning the account still exists. I don't have the password for the account, but I do have the email. So I wanted to know if it was possible to log back into an account?


The answer to this is most likely no. But if someone with deep LaTeX or pdf-viewer knowledge know the answer to be a yes, then please do tell!  Imagine the following situation: a person is reading a thesis on a computer screen. The user clicks on an in-text citation (e.g. [52] ) and jumps to the references page.  It states: [52] M. K. Stenzler and R. R. Eckert. Interactive video. ACM SIGCHI Bulletin, 28(2):76–81, 1996.  This is amazing. There was no scrolling needed, and it would've been a while since this in-text citation was even in the preface! But how does the user go back? The user could scroll or have some menu in which the preface is clickable. But it would be more convenient if the user could go back to where she came from.   My question: is there a way for a user to jump back to where she came from?   One solution would be to generate a "jump back to" line in the reference list when the person is reading the electronic PDF version, but that is non-academic and a bit tedious to read (though an interesting question by itself!).   So I wonder: is it possible for the PDF to somehow remember where the user came from and give a link to jump back?  In our imagined scenario this would happen: the person sees a "jump back" text in the top right corner, clicks on it and jumped back to where she saw her in-text citation.  While that is my question, if there are other clever solutions I will upvote those answers as well, since my goal is to allow the user to go back where he or she came from.  Edit (why this is a non-duplicate): It is pointed out that this question is a lot like:  which is true. It is a lot like that, but I couldn't find it after searching on Google for quite a bit. So there needs to be more general keywords for Google and other search engines to pick it up. Furthermore this question is more broad. This is because I asked three questions: (1) is there a go back button? Or could it be generated? (2) how do you generate go back pages? And (3) are there other clever solutions to solve this problem? It is in essence a usability issue that we're trying to solve in a PDF/LaTeX context, which is for the user to go back easily, the design approach of a solution could be completely different than my first 2 leading questions.  For me personally, the answer is that I will include a pagebackref so that people on paper also are able to go back. And another is to explain in the preface that most PDF readers have a "go back" feature. In the discussion surrounding the answer, I realized using an explicit "go back" link is not needed.

I'm including \usepackage{hyperref} so that each instance of \ref (as well as each page number in the index and the table of contents) automatically links to that page.  When I'm viewing the document (in ) and I click a link, I jump to the linked page.  Is there any easy way to go "back" to where I was before I clicked the link?  (And is the answer any different when using Adobe Acrobat reader?)


I´m a new in Sharepoint and I have to do this, I need to send an email 7, 5, 3 day before a due date.  I´m using SPD 2013  Thank you for your help

I am working with SharePoint 2013 Designer Workflow. I am not sure how to Send Email notification if task is not completed before 7 days of a Due Date.


I'm wondering if I use the \DeclareMathOperator for the wrong things.  For example I have a cost function cost(x,y) which takes two arguments. I would declare it as \DeclareMathOperator*{\cost}{cost} and use it later with $\cost(x,y) = ...$.  If this is correct, why do I never see the function f(...) typeset in roman? If it's not correct when should the \DeclareMathOperator* be used instead?

As far as I understand, whatever can be done using DeclareMathOperator can also be achieved using newcommand, but not the other way around. If this is the case, what are the circumstances where DeclareMathOperator is the better choice? When should I take solely newcommand?  I found a question regarding , and I wonder what other aspects should be taken into consideration when it comes to choosing which method to use when defining math operators.


I want to boot multiple ISO images from an external drive what is the best way to do this?  The reason for this is Windows restoration discs. I want to create an .ISO file of each of the recovery DVD's (can be up to 12 discs) and then boot from the USB device to recovery the computer so I don't have to use the DVD's every time I want a recovery.  I'm guessing there will have to be some way to mount each .ISO file when the next disc is needed.

I am looking to create a USB flash drive that I can put multiple  ISO images on and select which boots from startup. The ideal candidate supports Linux and Windows-based ISO images, and is relatively simple. It also must have some reasonable process for adding and removing an ISO image from the drive/list.    Things that I'm not looking for in this specific question:    or other swiss-army knife live CDs. The point is to boot any one of multiple CDs, not to boot a (certainly useful) utility CD. Installing a single live CD to a USB drive. I'd like to have multiple ISO images, selectable at startup.   I don't have a specific purpose in mind, possibilties include a single drive with a  variant, Ubuntu desktop, UBCD4Win for DOS, the Offline NT Password Cracker, etc.  Flexible and easy to use are the name of the game!


I want following output while using IEEEtran class.                                          Title         Author 1                        Author 2              Author 3         Department 1                    Department 2          Department 3                                 Institution/university                                 mail1,mail2,mail3,mail4

I am using authblk package and I want to achieve following output using this package.


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?

Let x and y denote the values of two consecutive die roles(6 sided). U=min(x,y) V=max(x,y). Determine the conditional probability mass function for U given V=v.


I'm really stuck on proving this propositional logic equivalency. I've tried De Morgan's law, and double negation to see if I could get it, but no luck. Any help is greatly appreciated! P.S Please, tell me which laws you use to prove it.   $(p \land q) \lor (q \land r) \lor (r \land p) \equiv (p \lor q) \land (q \lor r) \land (r \lor p)$

$(p∨q) ∧ (p∨r) ∧ (q∨r) \iff (p∧q) ∨ (p∧r) ∨ (q∧r)$  Without using set theory, how can I prove this using logical equivalences? I've tried to approach this problem with De Morgan and I've also tried the property of distributivity but I keep reaching a dead end.   How should I approach this problem?  Thank  you.


I want to assign an item to perform a specific command that will place down a redstone block at some coordinates when I right click it. How would I do this?

Is there a way so that I make make it when I left click/right click with a certain item it applies an effect? I know that you can apply attributes to wearing armor and things but I want it so when you use the item it applies an effect on your player.  For example, let's say I want something so that when I right click with a certain item (let's say an iron ingot that was given to me) I'll then have a jump boost for 10 seconds. So kinda like a potion in a way.  Is this possible with command blocks/commands/any mods?


I am running Windows 8.1 Pro on a Samsung 830 SSD. I do not have a TPM module so I've made the necessary configuration changes to permit BitLocker encryption of my system drive without a TPM module.  Given my configuration, will encrypting my system volume negatively impact my SSD's lifespan or speed? Are there other consequences of encrypting an SSD I should be aware of?

I've put a brand new SSD into my work computer and my IT department wants me to use BitLocker. I  on standard harddrives, but I was wondering - what's the performance impact of BitLocker like on a Solid State Drive?   Will it noticeably impact the speed with which I open my archive files in Outlook or open projects in Visual Studio?


I have a simple question about Javascript Closures:  The following function is given:  function outside() {   var out = 0;     function inside() {     out +=1;     }   return inside; }   var ref = outside(); ref();   ref();   If I call the function 2 times, out is equal to 2.  Why is out not overwritten by the statement?  var out = 0;

How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help.


I have a process builder that is being invoked by another process builder, and for some reason I cant use any scheduled actions with the sub process. Why wouldn't my subprocess be able to use scheduled actions? Thanks!

How can I add time-dependant actions in my process flow?  I cannot see any function or button to add scheduled actions.


I have created a class Book that store 3 variables(string title, int pages, float price). I also have created 3 constructor but the null constructor keeps giving me errors. (58: error: request for member 'pages' in 'b1', which is of non-class type 'Book()') (61: error: request for member 'Info' in 'b1', which is of non-class type 'Book()')  #include <iostream> #include <string>  class Book{     public:      std::string title;     int pages;      private:      float price;      public:      Book(){          title = "";         pages = 0;         price = 0;     }      Book(std::string bookTitle){          title = bookTitle;         pages = 0;         price = 0;     }      Book(std::string bookTitle, float bookPrice){          title = bookTitle;         pages = 0;         price = bookPrice;     }      void Info()     {         std::cout << "Title: " << title << std::endl;         std::cout << "Pages: " << pages << std::endl;         std::cout << "Price: " << price << std::endl;     }      void Pricing(float bookPrice)     {         price = bookPrice;     }      };  int main() {     Book b1();     b1.pages = 100; //first error      Book b2("Mathimatics");     b2.pages = 200;      Book b3("Algebra", 50);     b3.pages = 300;      b1.Info(); //second error     b2.Info();     b3.Info();  }

Is there any good reason that an empty set of round brackets (parentheses) isn't valid for calling the default constructor in C++?  MyObject  object;  // ok - default ctor MyObject  object(blah); // ok  MyObject  object();  // error   I seem to type "()" automatically everytime. Is there a good reason this isn't allowed?


The special weapon of Arya in Game of Thrones season 8 was not so special, I think it was the same as an Unsullied's spear. So what was the point of that special weapon?  The weapon didn't do anything special in S8 E3. I want to know why the writers focused on it in previous episodes. I'm not looking for technical info about that weapon.

In season 8 episode 1, Arya asks Gendry to forge her a dragonglass weapon (which we can see drawn).  What is the purpose of this weapon?


A short story written probably before 1980 and after 1960 but not sure. An alien race sometimes abused sexually (using orifices not meant for this purpose) by humans, they see the fact that humans drink a kind of "wine" made by torturing one member of some delicate race (this is a third race in the story) in front of its mate or something and collecting its tears as an indication of how degenerate humans are. Then these enslaved aliens are rescued by a warship from their home world. The aliens from their home world are larger (perhaps due to not being abused) and their planet is beautiful. But as a banquet celebrating their rescue, they are offered this same "wine."  EDIT: This is We Who Stole the Dream.

May have been part of a sci-fi war collection. The narrator is an alien itself, I think, and is part of a rebellion to overthrow  human oppressors, but then is horrified that his fellow aliens have developed a taste for the same drink.


I don't want to use sudo apt-get 'softwareName' to install software on a Ubuntu machine. Instead I want to go to  search for the software then download and install it later like Windows.  So, how to download software from Ubuntu app directory?

I have apt-get 0.7.23.1 on host machine. I do not have root, thus not able to update it, or install other packages.  I want to download .deb packages with it, but neither  apt-get -d bash   (Invalid operation bash)  nor  apt-get -d install bash   (do not have root)  work.  On my home machine with a newer version of apt-get I can  apt-get download bash   and it does exactly what I want it to.  How can I perform the same on the host machine?


Let $A=(a_{ij}) \in \mathbb{R}^{n \times n}$ be a symmetric matrix. For all $i=1, \dots ,n$ we have $a_{ii} > \sum_{i \ne j} \vert{a_{ij}}\vert$. I now have to show that $A$ is positive definite. I tried to look at the general case $x^\top Ax$, using the estimate above. Unfortunately without any luck... In the end I got something like $x^\top Ax > \sum_{m=1}^n (x_m ^2 + x_m \min\{x_k : k \ne m\}) \sum_{m \ne k}a_{mk}$.  I am unfortunately not allowed to use Gershgorins Circle Theorem as we did not discuss it up to this date :)  Any ideas to prove the statement?  ~Cedric :)

Let $A$ be a symmetric $n\times n$ matrix.  I found :     $A$ is positive-definite if  all the diagonal entries are positive, and   each diagonal entry is greater than the sum of the absolute values of all other entries in the corresponding row/column.   I couldn't find a proof for this statement. I also couldn't find a reference in my linear algebra books.  I've a few questions.   How do we prove the above statement? Is the following slightly weaker statement true?       A symmetric matrix $A$ is positive-definite if all the diagonal entries are positive, each diagonal entry is greater than or equal to the sum of the absolute values of all other entries in the corresponding row/column, and there exists one diagonal entry which is strictly greater than the sum of the absolute values of all other entries in the corresponding row/column.


I am trying to understand the algorithm for calculating combination N Choose R. It basically relies on the fact that $(N)/1 * (N-1)/2 * (N-2)/3 * ... * (N-R+1)/R$ is always an integer for any $R$. It is obvious that the numerator is divisible by any number in the denominator, but I don't understand how the numerator is divisible by all numbers in the denominator. For two co-prime numbers, it makes sense, but what about numbers that aren't coprime to each other? For example, consider this: $(N)/1 * (N-1)/2 * (N-2)/3 * (N-3)/4 * (N-4)/5 * (N-5)/6$. What if 4 needs $N-3=12$ and 6 needs $N-3=12$. Individually, $N-3$ is divisble by 4 or 6, but $N-3$ is not divisible by 24.

From its definition a combination $\binom{n}{k}$, is the number of distinct subsets of size $k$ from a set of $n$ elements.  This is clearly an integer, however I was curious as to why the expression  $$\frac{n!}{k!(n-k)!}$$ always evaluates to an integer.  So far I figured:  $n!$, is clearly divisible by $k!$, and $(n-k)!$, individually, but I could not seem to make the jump to proof that that $n!$ is divisible by their product.


I do a 35km return commute into a big city. Almost daily, someone tries to run me over.   Just in the past month I've experienced the following:   I filter to the front of the traffic, wait at the front of the bike lane, and the car behind me who is not blocked at all, because i'm a meter over to the left into the bike lane, makes a sharp turn into my lane to deliberately drive into the back of my bicycle, while the lights are still red. I have to do an emergency takeoff and left turn through the red into a side street to get away. cycling along a major road in the bike lane at night with bright flashing lights at the front of my bike and red light at the rear. I ride past a side street where someone is waiting to turn right, and as I'm directly in front of his car, he slams on the gas and pulls out, narrowly avoiding cleaning me up. Going through a roundabout, in the middle of the lane, lights on, broad daylight. Following about 20m behind the car in front of me. Again, go past a side street, and the driver pulls out at full speed just as i'm going past him. Only narrowly avoid getting run over because I scream out some sort of profanity at a voice breaking volume and he backs off slightly.    How do you deal with attempts on your life by people who are more focussed on eating their macdonalds and throwing their cigarette butts out the window than the safety of other road users?

When riding through city traffic, what are the best ways to increase the chance you are seen, given a bit of space, and are not touched by any vehicles?


I want to know how I can prove that a number with 4033 digits (10101....0101 with 2016 zeros) is not prime.  Greetings Tom

So basically we have a number $10101...10101$ that contains $2016$ zeros and can be written as$ \sum _{ k=0 }^{ 2016 }{ 100^{ k } }$ . I want to prove that this number is not a prime without using anything besides a piece of paper and a pen. I'm stuck on this for quite a few days now.


It is raining.     It's a sunny day.    I hate it when it rains.     I'm prepared if it snows.     It can be mighty cold at night! ... etc.      My questions:   When did English speakers start using "it" when referring to weather conditions / activities?   Or has this always been the case?  Did people use to say "There is rain" and the language changed?

I wanted to leave the question title as is so as not to take away from my amusement :).  Anyway,     It's raining.   What is raining? Is it the sky? The clouds? The weather? The rain? What is "it"? Any historical insights on the statement?


I have some Object structs that look like this:  struct Object {    string type;    Color c;    float ambient, diffuse; };  struct Sphere: Object {    Point center;    float radius; };  struct Square: Object {    Point loc;    float len; };   And I have a vector that is filled with Sphere and Square structs:  vector<Object> objs; Sphere sp = //sphere stuff Square sq = //square stuff objs.push_back(sp); objs.push_back(sq);   I can access the values in the parent struct just fine, but I am having trouble figuring out how to access the values in the Sphere and Square structs. This is what I am doing right now:  cout << objs.at(i).type << endl; //This works cout << objs.at(i).center.x << endl; //Not working   Does anyone know how to do this?

Someone mentioned it in the IRC as the slicing problem.


start.on('click', function(){   setInterval(time, 1000);    object.animate({ marginTop: '500px' }, 3000, function () {     normaal.fadeIn(700);   }); });   function time() {   change.textContent = Number(change.textContent) + 50; }   How excatly can I stop (clear) this setInterval. I want it to automatically start after 3000 miliseconds once the even has been called.

I am using setInterval(fname, 10000); to call a function every 10 seconds in JavaScript. Is it possible to stop calling it on some event?   I want the user to be able to stop the repeated refresh of data.


I tried to see if this rare bug was brought up before, but I didn't find anything.  The following profiles:        ... have top posts like this:    A missing title, and the link goes to, for example:      ... which is 404 page not found, but the post is alive here:      All those posts were migrated as @Arulkumar noted in a comment here, so the issue seems to be with the migration.

I discovered a strange, blank link in 's Top Network Posts:        The above link and screenshot are of the user's Unix & Linux site profile, but this issue can be reproduced on any of the user's site profiles other than Meta Stack Exchange (as the blank post appears to be on this site, and posts from the same site are excluded).  The link seems to go to , which features a really negative question ID (close to the lowest value that can be represented by a 32-bit signed integer, specifically -(2^31) + 1005), and lacks the title in the URL that is present in all of the other links. It leads to a 404 error.  Going to the  seems to go to an actual answer on a question migrated to this site, which happens to have a score of 13 (as of the time this was asked).  Why is the question ID incorrect here? Based on the duplicates, it seems that this affects posts (both questions and answers) that were migrated from other sites: somehow, the question ID seems to be getting messed up.  Update: It looks like the above linked user has deleted their account on this site, so the issue cannot be reproduced on the profile I originally reported. It can, however, be reproduced on . The errant link in that profile is , and the errant question ID seems to also be close to the lowest possible 32-bit signed integer, -(2^31) + 3412.


i have some SD cards that them write protection buttons are lost. each time i connecting these cards to my PC and want to copy some files to that, windows shows write protection message. I'm seeking for a software fix that permanently fix write protection problem. is there any way to remove write protection from my SD cards?

I have a bunch of SD cards that do not have the little plastic switch for the read only setting. so Windows thinks it’s write protected or something. The card is not write protected by the software lock present on the SD card standard.  I’m using one with tape over the notch and it’s ugly. Also, the Thinkpad slot drags on the tape all the time so I’m afraid it will might loose in there eventually.  So, is there any way to tell Windows to ignore this lame write-protect feature?  I’m not interested on the SD card itself as it’s irrelevant for the issue at hand. Read this question as being about a 5.25” floppy disk drive instead of an SD card if you wish. I’m pretty sure the Windows settings are the same for both, really.  I’m  that there are 3 ways to secure an SD card. I’m talking about only the mechanical switch, which is the responsibility of the host to handle.