Could the Horcruxes be destroyed with Avada Kedavra?

In The Deathly Hallows Hermione says this about destroying Horcruxes:     “It doesn’t have to be a basilisk fang,” said Hermione patiently.   “It has to be something so destructive that the Horcrux can’t repair   itself. Basilisk venom only has one antidote, and it’s incredibly   rare—"      "That’s a problem we’re going to have to solve though, because ripping, smashing, or  crushing a Horcrux won’t do the trick. You’ve got to put it beyond magical repair.”   Mad-Eye Moody from The Goblet of Fire tells us this about Avada Kedavra,     ...there's no countercurse. There's no blocking it.   but also that,      Avada Kedavra's a curse that needs a powerful bit of magic behind it - you could   all get your wands out now and point them at me and say the words, and I doubt   I'd get so much as a nosebleed.    Harry is also seen once attempting to use Crucio on Bellatrix Lestrange in The Order of the Phoenix out of anger at the death of Sirius, but he fails. She tells him,     "You need to mean [Unforgivable Curses], Potter! You need to really want to cause pain - to enjoy it - righteous anger won't hurt me for long - I'll show you how it is done, shall I? I'll give you a lesson -"   Even if Harry and company are not powerful enough to perform the curse themselves, they know several powerful wizards (Kingsley, Lupin, et al.) who could likely perform the curse.  Lastly we know that Voldemort himself destroyed the last bit of his soul that was inside Harry with Avada Kedavra.  Could the Horcruxes be destroyed with Avada Kedavra as well?


I'm writing because I wasn't able to find a solution nor in Google nor here. My question is similar to , but that hasn't a solution yet. Is similar to  too, but it uses beamer and I'm not.  My question is: how can I change the color of the author (only the author) item in my bibliography, which is formatted as follows:  \usepackage[backend=bibtex,style=authoryear,natbib=true,dashed=false,language=italian]{biblatex}  This works fine, but in the Bibliography at the end of the document, I would have the author colored. I mean, only the author, nothing more in the document, which should remain the same.  I tried by adding \textcolor to the item in the bibliography file:  @article{addicott2006networks,  title={Networks, organizational learning and knowledge management: NHS cancer networks},  author={\textcolor{red}{Addicott, Rachael} and McGivern, Gerry and Ferlie, Ewan},  journal={Public Money and Management},  volume={26},  number={2},  pages={87--94},  year={2006},  publisher={Taylor & Francis},  langid={italian},  }   The result was perfect for the bibliography, but it modifies also the color of the reference in the text, as in the following images:      Does anyone know how to just color the author in the bibliography and leave unaltered in the text?  (I know I'm not providing any MWE, honestly I don't think is necessary in this case. But if needed I will post it.)  Thank you for your time, R.  UPDATE: sorry guys, here the MWE for what I'm trying to figure out:  \documentclass[12pt]{article} \usepackage{color} \usepackage[backend=bibtex,style=authoryear,natbib=true,dashed=false,language=italian]{biblatex}  \addbibresource{biblio.bib}  \begin{document}  Reference I don't want to be coloured \citep{addicott2006networks}  \printbibliography[title={Bibliografia}]  \end{document}   @article{addicott2006networks,  title={Networks, organizational learning and knowledge management: NHS cancer networks},  author={\textcolor{red}{Addicott, Rachael} and McGivern, Gerry and Ferlie, Ewan},  journal={Public Money and Management},  volume={26},  number={2},  pages={87--94},  year={2006},  publisher={Taylor \& Francis},  langid={italian},  }


I'm typesetting a document with lengthy itemize lists and in most cases LaTeX leaves lots of empty space before the environment in order to get it entirely on one page.  How can I encourage LaTeX to put page breaks within lists?  Update: I found that it works just fine when used not within \cventry command.  Is there anyway to fix \cventry definition in order to avoid non-breaking behavior?  From moderncvstylebanking.sty:  \renewcommand*{\cventry}[7][.25em]{   \begin{tabular*}{\textwidth}{l@{\extracolsep{\fill}}r}%       {\bfseries #4} & {\bfseries #5} \\%       {\itshape #3\ifthenelse{\equal{#6}{}}{}{, #6}} & {\itshape #2}\\%   \end{tabular*}%   \ifx&#7&%     \else{\\\vbox{\small#7}}\fi%   \par\addvspace{#1}}   Examples: Originally I've used \cventry in the following way:  \cventry{March 2009--April 2011}{Software Developer}{Company}{City}{}{     \begin{itemize}         \item Item 1;         % Lots of items here         \item Item n.     \end{itemize} }   Probably I'm just misusing \cventry because using the following makes it just fine:  \cventry{March 2009--April 2011}{Software Developer}{Company}{City}{}{} \begin{itemize}     \item Item 1;     % Lots of items here     \item Item n. \end{itemize}


When does the Death Saving Throw happen with respect to sources of automatic ongoing damage?

If a character is knocked unconscious with 0HP with a source of automatically dealt damage, for example, into a fire, and takes damage from it each turn, does the automatic Death Saving Throw failure from taking damage at 0hp happen before or after the player's regular Death Saving Throw roll?  If the unconscious PC takes the auto-fail first then they effectively only get 1 Death Saving Throw to survive, because they'd autofail and roll a failure the first turn, then autofail again and die the next turn.   If they get to roll first, then they only effectively get two death saving throws before they die.


How to keep the bottom of my bread from getting burned?

I have been experimenting with making whole grain sourdough bread at home. My current recipe is for a loaf that is about 4 cups of flour total, not counting sourdough starter, evenly split between bread flour, whole wheat, and dark rye. After preparation and rising, I cook in a dutch oven, with the dough shaped like a long cylinder stretching from one side of the dutch oven to the other, so that it rises into a loaf shape. Cook time is 30 mins with the lid on, then 5 mins uncovered; at 500 F in a conventional oven. After cook time, I immediately take the loaf out of the dutch oven and let it cool on the counter.   This creates a pretty satisfactory loaf of bread; simple to make, tasty enough,  cooked all the way through with a nice crust on the outside. My only issue is that it "burns" on the bottom where the loaf is in contact with the dutch oven. The loaf is slightly blackened on bottom, though that is mostly a cosmetic issue, there is no burnt toast flavor. However, the bottom 1/4 inch of the loaf is very tough and hard to cut when slicing.   I've tried varying cook times and haven't be able to solve this burning problem. What are some tactics that might allow my loaf to cook the same way on the crust and insides, but not burn the bottom as much?


Night pictures lights superimposed to a second location?

I have a DSLR and when I take photos at night or in low light I have noticed bright spots will be seen a second time somewhere else in the picture.  Almost like a reflection within the picture itself.  I first noticed it when taking pictures of the moon.  How do I stop this?


Method or algorithm for choosing a color that "goes well" with other colors

This may be more of a computer science question than a UX question, but it's a question of what pleases the human eye. Take Bootstrap buttons, for example. The version 3 button colors "go well together". The version 4 buttons also "go well" together, but are starker than the version 3 buttons.  If I were to want to find a new color that "goes well" with a group of existing colors, is there some way of mathematically interpolating or algorithmically determining a color that "goes with" the reference group of colors?  To use the Bootstrap example, I want a way to find which shade of, say, pink, will "go with" the version 3 button colors, without eyeballing it until I find something that looks pleasing. For the version 4 buttons, the same method should produce a (starker) pink that nicely matches the (starker) version 4 colors.  Is this possible, or must we eyeball it?  EDIT: I've marked this question as a duplicate, although it's not exactly the same.


Is Poly1305 an information-theoretically secure MAC?

I have heard some people say that the Poly1305 authenticator is a "nuclear" MAC i.e. it is information-theoretically secure. After reading  I see it is based on the Wegman-Carter MAC which is supposedly the natural authentication pairing with the one-time pad cipher.  Is it true though that Poly1305 is really an information-theoretically secure MAC? Here is an excerpt from the paper:     1 Introduction      This paper introduces and analyzes Poly1305-AES, a state-of-the-art secret-key   message-authentication code suitable for a wide variety of applications.      Poly1305-AES computes a 16-byte authenticator Poly1305r(m, AESk(n)) of   a variable-length message m, using a 16-byte AES key k, a 16-byte additional   key r, and a 16-byte nonce n. Section 2 of this paper presents the complete definition of Poly1305-AES.      Poly1305-AES has several useful features:         Guaranteed security if AES is secure. The security gap is small, even   for long-term keys; the only way for an attacker to break Poly1305-AES is   to break AES. Assume, for example, that messages are packets up to 1024   bytes; that the attacker sees 264 messages authenticated under a Poly1305-AES   key; that the attacker attempts a whopping 275 forgeries; and that the   attacker cannot break AES with a probability above δ. Then, with probability   at least 0.999999−δ, all of the 275 forgeries are rejected.   Cipher replaceability. If anything does go wrong with AES, users can   switch from Poly1305-AES to Poly1305-AnotherFunction, with an identical   security guarantee. All the effort invested in the non-AES part of Poly1305-AES   can be reused; the non-AES part of Poly1305-AES cannot be broken.      So it appears Poly1305 is only secure if AES is secure. So in theory if I do not like AES I can swap it out for something else like ChaCha20 (as many have done e.g. SSH and TLS 1.3). However then the authentication is still only as secure as ChaCha20 which in itself is not information-theoretically secure. So then, what if I need an authentication tag that will remain secure for a long period of time (100+ years) and even resist cryptanalysis indefinitely?  I understand the point of the Poly1305 is to re-use the keys for many messages as long as the nonce changes each time. However, assume a hypothetical system which has many one-time pads generated by a HWRNG and they are pre-shared between two parties via a physical exchange. The key material for each message is divided up as follows:   92 byte key for encrypting the 92 byte message using XOR $\oplus$ 16 byte Poly1305 encryption key $k$ (formerly the AES key) 16 byte Poly1305 additional key $r$ 16 byte Poly1305 nonce $n$   So in this scenario the $k$, $r$ and $n$ are unique and truly random per message sent. So per one-time pad encrypted and authenticated message it uses up 140 bytes of true random data. Now given that this construction creates the Poly1305 tag:  Poly1305$_r$($m$, AES$_k$($n$))  Can the AES$_k$($n$) portion be simply replaced with $k$ $\oplus$ $n$? In other words, encrypt the nonce with a one-time pad. Will this remain theoretically secure indefinitely?


Comparator implementation for sorting the collection

Recently I'm trying to get more familiar with the Comparator interface in Java. I have an exercise which is about to sort the ArrayList of strings from the shortest to longest. I used a Comparator of Strings. When searching the net, I found the following solution proposal:      public static Comparator<String> lengthComparator = new Comparator<String>() {     @Override     public int compare(String a, String b) {         if (a.length() == b.length()) {             return a.compareTo(b);         } else {             return (a.length() > b.length() ? 1 : -1);         }     }  };   Then I used it in my code to sort the set:   Collections.sort(set, lengthComparator);   And it worked. What I'd like to ask is the specific way of defining the lengthComparator object here. We create a new object:   new Comparator<String>()   with the default constructor. But then there is a further code with overwritten method in "{}" brackets. Is it a normal way of creating objects? I've never met it before and I'd like to learn more about it. Could you please advise me some referal materials where I can find more informations about it?


Is "Do you got Insurance?" technically correct?

I've been hearing a lot of complaints about this in relation to the Thanks Obamacare campaign in Colorado, but trying to look for information on "Do you got xxx" I don't find too much to actually show that it's right or wrong, no matter how it looks.


Proof of $a^{\phi (n) +1} \equiv a \pmod{\! n} $ Carmichael generalization of Fermat-Euler's theorem.

I want to know a proof of an alternative form of Fermat-Euler's theorem   $$a^{\phi (n) +1} \equiv a \pmod n$$   when $a$ and $n$ are not relatively prime.   I searched some number theory books and a cryptography book and internet, but there were only proofs of the original theorem  $a^{\phi (n)} \equiv 1 \pmod n$ or in case n=pq which is used for RSA. So I would be very thankful if someone show me a proof or book I should read.


How to make visual studio compile exports for C DLL the way MinGW does

I have compiled a C DLL with MinGW and it made exports for everything I need without me specifying __declspec(dllexport).  Visual Studio 2013 (in "compile as C" mode) produced a DLL without any exports. Is there a VS C++ project setting I am missing that can do this kind of magic.


i have the following partitions  dev/sda1 - 500 mb unallocated - 181 gb  /dev/sda4 - extended 23 gb  /dev/sda5 - ext4 - / 15 gb /dev/sda6 - linux-swap 7.6 gb  /dev/sda4 - ntfs - 261 gb  unallocated - 2.02 mb   I want to merge use 50 gb from the 181 gb and merge it with /dev/sda5 as my root parition is only 15 gb   Please advise how to achieve this


How can I make a macOS Mojave bootable USB installer in Windows 10?

I have downloaded and saved macOS Mojave installation file from the Mac App Store into my external hard drive. Unfortunately, macOS has crashed on my Mac and now I need to install it again. I have used a software named TransMac to make a installation USB in windows following the steps in the link below:    But the provided USB drive after all these steps doesn't show up in my MacBook pro. Considering that I have saved Install macOS Mojave.app on my external hard drive, and I don't have access to any other Mac computers, How can I fix this issue and build a USB for installing Mojave?


$z_0$ non-removable singularity of $f\Rightarrow z_0$ essential singularity of $\exp(f)$

Let $z_0$ be a non-removable isolated singularity of $f$. Show that $z_0$ is then an essential singularity of $\exp(f)$.      Hello, unfortunately I do not know how to proof that. To my opinion one has to consider two cases:   $z_0$ is a pole of order $k$ of $f$. $z_0$ is an essential singularity of $f$.


How to select elements in the intersection of two lists in Python

As a quick example:  list1 = ['a', 'b', 'c'] list2 = ['a', 'stack', 'overflow'] for i in list1 and list2:     print i   this prints all the elements in list2. Why is this? How can I just print the elements that are in both lists?


Proving $\int_{0}^1\frac{x-1}{\log x}dx=\log 2$ and $\int_{0}^1\frac{\log x}{x-1}dx=\frac{\pi^2}{6}$

I would like to know how to prove the following two definite integrals.  A: $$\int_{0}^1\frac{x-1}{\log x}dx=\log 2$$  B:$$\int_{0}^1\frac{\log x}{x-1}dx=\frac{\pi^2}{6}$$  I found these two by using wolfram-alpha, but I can't prove them. I suspect that the following relations might be used.  $$\log 2=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+\cdots=\sum_{n=1}^\infty\frac{(-1)^{n-1}}{n}$$and$$\frac{\pi^2}{6}=\frac{1}{1^2}+\frac{1}{2^2}+\frac{1}{3^2}+\frac{1}{4^2}+\cdots=\sum_{n=1}^\infty\frac{1}{n^2}$$  I need your help.


Does the way a JS function is defined affect it's "performance"?

Is there ANY difference in the following two ways of defining a functions?  METHOD 1)  var printName = function(name){     return("Hi! My name is ",name) }   VS  METHOD 2)  function printName(name){     return("Hi! My name is ",name) }   and I mean ANY, I'm new at JS and want to lay down my understanding of functions and Objects before I advance as I feel these 2 features are the 2 I'll use the most.


Netbeans: Java Application with NullPointerExceptions when running outside of Netbeans

I am relatively new to Java programming, I have been using C# for the past 10 years as my main language.  I do work on a Java application every now and then to just add localization to it.  This is where I stumbled upon this NullPointerException.    When I build the java app in Netbeans and run it from there, everything works perfectly fine.  When I deploy it to our local server, I am getting the nullpointer.  This leads me to believe that something is not being deployed with the application when it is built.    Looking into the error log, I am not seeing anything that is helpful in finding the line number the null value is coming from.  Here is a view of the log:  Dec 22, 2017 7:18:34 AM removedcompanyname.appname.b.i a SEVERE: java.lang.NullPointerException     at removedcompanyname.appname.f.a(Unknown Source)     at removedcompanyname.appname.f.a(Unknown Source)     at removedcompanyname.appname.b.n(Unknown Source)     at removedcompanyname.appname.b.<init>(Unknown Source)     at removedcompanyname.appname.b.<init>(Unknown Source)     at removedcompanyname.appname.Main$2.run(Unknown Source)     at java.awt.event.InvocationEvent.dispatch(Unknown Source)     at java.awt.EventQueue.dispatchEventImpl(Unknown Source)     at java.awt.EventQueue.access$400(Unknown Source)     at java.awt.EventQueue$3.run(Unknown Source)     at java.awt.EventQueue$3.run(Unknown Source)     at java.security.AccessController.doPrivileged(Native Method)     at java.security.ProtectionDomain$1.doIntersectionPrivilege(Unknown Source)     at java.awt.EventQueue.dispatchEvent(Unknown Source)     at java.awt.EventDispatchThread.pumpOneEventForFilters(Unknown Source)     at java.awt.EventDispatchThread.pumpEventsForFilter(Unknown Source)     at java.awt.EventDispatchThread.pumpEventsForHierarchy(Unknown Source)     at java.awt.EventDispatchThread.pumpEvents(Unknown Source)     at java.awt.EventDispatchThread.pumpEvents(Unknown Source)     at java.awt.EventDispatchThread.run(Unknown Source)   I have been searching for what to do to see the line numbers, but I have not found anything that has been helped.  Any ideas what I can do to find the null value?    Thanks.


cd does not take variable as argument in bash script

I'm trying to make a bash script that will give me a command that will take a number n as argument and change the directory to the nth directory listed by running ls in the working directory. Here's what I have: #! /bin/bash -        arg=$(ls --group-directories-first | awk -v first=$1 'NR == first' | tr -d '[[:space:]]') cd $arg  It does not work. Nothing happens at all when I run it. The first line does seem to be capturing the directory name in the way that I want. If I change the script to #! /bin/bash -        arg=$(ls --group-directories-first | awk -v first=$1 'NR == first' | tr -d '[[:space:]]') echo $arg  and run it in a directory in which the first directory is bin, the script outputs 'bin' when I give it the argument 1: [user@manjaro ~]$ ls bin/         Desktop/     Documents/   Downloads/   [user@manjaro ~]$ cdn 1 bin  So why does cd not take 'bin' and change to bin when I use the original version? And how should I change it? One final note. When I try to do something similar outside a script it works fine: [user@manjaro ~]$ foo=bin [user@manjaro ~]$ cd $foo [user@manjaro bin]$ pwd /home/user/bin  Again, why?


How to prove that compact subspaces of the Sorgenfrey line are countable?

How to prove that every compact subspace of the  is countable?


After splitting array of strings conditions of the array elements are always false

@DavidMarciel the code is now supposed to store the received value in the corresponding variable after checking that some condition is true, but when the program doesn't  enter the body of if-condition even though the condition is true. I put an example in this code for the "male" variable being true, and placed a print statement inside the body of the if to show it. Below is my code.  public class j { static String sss = "male,O+,45,saudi,brain_diseases"; static String male = ""; static String blood = ""; static String age = ""; static String nat = ""; static String dis = ""; static void func() {     String[] pieces = sss.split(",");     male = pieces[0];     blood = pieces[1];     age = pieces[2];     nat = pieces[3];     dis = pieces[4];      System.out.println(male);     System.out.println(blood);     System.out.println(age);     System.out.println(nat);     System.out.println(dis);     // if(male=="male"){ System.out.println("hello male"); } }  public static void main(String[] args) {      func();         }}


Finding a license key on a non-booting pc

Long story short my computer wont boot and since I don't feel like having it repaired I'm just going to do a clean install from an install USB. I having a laptop know the implications of having to reinstall important drivers. My question is how does one get a license key from a non booting computer? I cant boot into my windows installation and can only boot into the install USB, The product key isn't in a folder because it's a laptop, The product key isn't on a sticker on the bottom of my pc, I checked... twice, and the box and any documentation that came with my computer is sitting inside my attic where it will sit LOST FOR A VERY LONG TIME. Is there a file where the product key is installed? Can my computers creator help me? I can't have a non genuine windows installation.  Thanks for your help, -r


How to attach handler to static and dynamic element at the same time?

I have function that should be triggered on click and there is two different elements that can do that. One element is static created on page load, and the second element is dynamic. I'm wondering if there is a way to combine this in single statement with JQuery. Here is example:    $('.show_new').on('click',showElement); function showElement() {   $('#test').append("<input type='button' id='dynamic' class='save_form' value='Save'>") }  $('.save_form').on('click',testFun); $(document).on('click','.save_form',testFun); function testFun(e) {   alert(e.target.id); }   <input type="button" class="show_new" value="Show"> <input type="button" class="save_form" id="static" value="Save">

     As you can see in example above the only way for this to work is to have to lines one for static and one for dynamic element event. If anyone knows better way of doing this please let me know. Thanks!


If the empty set is a subset of every set, why isn't $\{\emptyset,\{a\}\}=\{\{a\}\}$?

If the empty set is a subset of every set, why it isn't written with the elements of a set? like so $\{1,2,3,\emptyset\}$   Or why isn't $\{\emptyset,\{a\}\}=\{\{a\}\}$? I know one has two elements and the other has 1 but since the empty set is a subset of both, then why it isn't being mentioned explicitly in the definition of the set?


After a problem on my MacBook Pro (15' 2016), Apple replaced the motherboard with Sierra installed and I can't upgrade back to BigSur. In the App Store, no system upgrade is suggested. If I click on "macOS Big Sur" link from apps.apple.com, the App Store opens with this message:  Can't connect to the App Store  The computer is connected to the internet and the time is correctly set. How can I fix this issue ? Is there any command line to download macOS Big Sur ?


"I’ve made my mind up" or "I've made up my mind"

I'm a little confused about which is correct:     I’ve made my mind up.   or     I’ve made up my mind.


Show that $F(B)=B$and $F(C)=C$ if $F: \mathcal{P}A \to \mathcal{P}A$ and that $F$ has the monotonicity property

Assume that $F: \mathcal{P}A \to \mathcal{P}A$ and that $F$ has the monotonicity property: $$X \subseteq Y \subseteq A \implies F(X) \subseteq F(Y)$$ Define $$B = \bigcap \{ X \subseteq A | F(X) \subseteq X \} \; \mathtt{and} \; C = \bigcup \{ X \subseteq A | X \subseteq F(X) \}$$ Show that $F(B)=B$ and $F(C)=C$.      So far I can get: 1. $F(A) \subseteq A \;\&  \; \varnothing \subseteq F(\varnothing)$ 2. given any $X_1 \subseteq F(X_1)$ and $F(X_2) \subseteq X_2$ $(X_1 ,X_2 \subseteq A)$     I have  $B \subseteq X_2 ,F(B) \subseteq F(X_2) \subseteq X_2$ and  $X_1 \subseteq C, X_1 \subseteq F(X_1) \subseteq F(C)$    But: I cannot find a way to show the relation between $F(B)$ and $B$.What should I do?


How to access a linux server with private IP from outside network?

I need to access a linux servers with private ip form any network.  Usually I use VPN to access those servers. But want to access without VPN.  Can you guys please tell the settings need to be done on server and on putty?  Thank you.


How to confirm bandwidth upgrade in Internet

I am planning to upgrade my internet bandwidth from 150 Mbps to 350 Mbps in my office network. How do I confirm that this upgrade has been completed by service provider and I am getting 350 Mbps?


Listing equivalence relations class for $x\sim y \Leftrightarrow x^2=y^2$

Can someone help me on the right track for my proof for the statement below. I started and got stuck but I need help. Please guide me to answer what this statement requires and how to word it out correctly.     For all $x,y\in\mathbb R$ define that $x\equiv y$ if $x^{2}=y^{2}.$ Then $\equiv$ is an equivalence relation on $\mathbb R$, there are infinitely many equivalence classes, one of them consists of one element and the rest consist of two elements.   True.  Let $p=x,y,z\in\mathbb{R}$. For $x\equiv y$ if $x^{2}\equiv y^{2}$ on $\mathbb{R}.$ To be an equivalence relation on $\mathbb{R}$ we need to show that: $$\text{i).}\ \forall x\in\mathbb{R}; x\equiv x\ \text{such that}\ x^{2}=x^{2}$$ $$\text{ii).}\ \forall x,y\in\mathbb{R}\ \text{if}\ x\equiv y\ \text{then}\ y\equiv x\ \text{such that}\ x^{2}=y^{2}\ \text{but}\ y^{2}=x^{2}$$ $$\text{iii).}\ \forall x,y,z\in\mathbb{R}\ \text{if}\ x\equiv y\ \text{and}\ y\equiv z, \text{then}\ x\equiv z\ \text{such that}\ x^{2}=y^{2}\ \text{and}\ y^{2}=z^{2}\Rightarrow x^{2}=z^{2}$$  Therefore the equivalence class of $[0,0]=\{p=(x,y,z\in\mathbb{R}|p\equiv(0,0)\}=\{(0,0)\}$ then $p\equiv(0,0)\Leftrightarrow x^{2}=y^{2}$ which is equal to $0^{2}=0^{2}=0$ if and only if $x=y=0.$  Comment: I am stuck here I dont know where to continue on. Please help..thank you


A real-valued function $f$ defined in $(a,b)$ is said to be convex if $$f(\lambda x+(1-\lambda)y)\leqslant \lambda f(x)+(1-\lambda)f(y)$$ whenever $a<x<b, \quad a<y<b,\quad 0<\lambda<1$.  Prove that every convex function is continuous.  I also proved that if $f$ is convex in $(a,b)$ and $a<s<t<u<b$ then $$\dfrac{f(t)-f(s)}{t-s}\leqslant\dfrac{f(u)-f(s)}{u-s}\leqslant\dfrac{f(u)-f(t)}{u-t}.$$ But how to use this inequality in proving of continuity?  Please can anyone show not hard proof of continuity without using derivatives.


This program cannot run but I don't know why:  Abstract class  public class Mahasiswa implements Comparable {      private String nama;     private int nim;      public Mahasiswa(String nama, int nim) {     }     public String getNama() {         return nama;     }     public int getNim() {         return nim;     }     public void setNama() {         this.nama=nama;     }     public void setNim() {         this.nim=nim;     }      @Override     public int compareTo(Object o) {         Mahasiswa key = (Mahasiswa) o;         if (this.nama.compareTo(key.getNama()) == 0) {             return -1;         }else if (this.nama.compareTo(key.getNama()) > 0) {             return 1;         }else{             return 0;     }     } }   Method class:          public static Mahasiswa[] BubbleSort(Object[] object) {         Mahasiswa[] data =(Mahasiswa[]) object;         for (int i = 1; i < data.length; i++) {             for (int j = 0; j < data.length - i; j++) {                 if (((Comparable)data[j]).compareTo(data[j+1]) ==1 ) {                     Mahasiswa c = data[j];                     data[j] = data[j + 1];                     data[j + 1] = c;                 }             }         }         return data;     }   Main class      public class Main {      /**      * @param args the command line arguments      */     public static void main(String[] args) {         Mahasiswa[] data = {new Mahasiswa("Karel", 175314105),         new Mahasiswa("Fandur", 175314006),         new Mahasiswa("Yeski", 1753141104),         new Mahasiswa("Tiosu", 175314001),         new Mahasiswa("Jono", 175314090)};          Larik.BubbleSort(data);          for (int i = 0; i < data.length; i++) {             System.out.println(data[i].getNama()+" "+data[i].getNim());         }     } }   Output     Exception in thread "main" java.lang.NullPointerException   at SortingObject.Mahasiswa.compareTo(Mahasiswa.java:33)   at SortingObject.Larik.BubbleSort(Larik.java:16)   at SortingObject.Main.main(Main.java:24)   C:\Users\Yeski's Legion\AppData\Local\NetBeans\Cache\8.2\executor-   snippets\run.xml:53: Java returned: 1   BUILD FAILED (total time: 0 seconds)


I have heard that printf is better than echo. I can recall only one instance from my experience where I had to use printf because echo didn't work for feeding some text into some program on RHEL 5.8 but printf did.  But apparently, there are other differences, and I would like to inquire what they are as well as if there are specific cases when to use one vs the other.


Is MD5 safe for remember me cookie **IF** I'm using bcrypt to hash their IP and storing in database

When user logs in with remember me checked, I create a random token using md5 for the cookie.   md5(uniqid(rand(), true));   I append users IP address to their unique user_id and hash that using bcript. (I DO NOT ADD THIS TO THE COOKIE) I store the bcript hash and random token that uses md5 along with their user id into a table. The row will have an auto increment value. The cookie contains the md5 and the auto increment value appended to it.  When the user visits the website, I take the auto increment value of the cookie to look up the md5 hash. If there is a match I hash the users IP address along with the user_id (that was stored in the table) and see if it matches the hash value stored in the same row. If it does they are logged in and I create another md5 hash for their cookie.   I know md5 isn't secure on its own, but I wondered if the extra steps I take with the brcript and IP address makes it safe, or anyone can see some massive security holes in this.   edit: I'll just add that when using Bcript for the ip and user_id, I'm using the php function password_hash that also creates a salt.


A few years ago I downloaded Civilization but for the life of me I couldn't understand how to play it. And I had played and mastered games like Cezar and Starcraft before.  Anyway I can learn and get some background about the game before and/or while playing it?


How do I tell Finder to always show my Library folder on Mavericks?

I thought there was a checkbox to suppress the hiding of my user Library folder on Mavericks, but I can't seem to find it. I appreciate hiding Library by default, but  have missed it being easily accessible.  How can I get the library folder to be visible in Finder, the Finder go menus / file save dialogs without needing to hold down shift?


Reliable way for a Bash script to get the full path to itself

I have a Bash script that needs to know its full path. I'm trying to find a broadly-compatible way of doing that without ending up with relative or funky-looking paths. I only need to support Bash, not sh, csh, etc.  What I've found so far:   The accepted answer to  addresses getting the path of the script via dirname $0, which is fine, but that may return a relative path (like .), which is a problem if you want to change directories in the script and have the path still point to the script's directory. Still, dirname will be part of the puzzle. The accepted answer to  (OS X specific, but the answer works regardless) gives a function that will test to see if $0 looks relative and if so will pre-pend $PWD to it. But the result can still have relative bits in it (although overall it's absolute) — for instance, if the script is t in the directory /usr/bin and you're in /usr and you type bin/../bin/t to run it (yes, that's convoluted), you end up with /usr/bin/../bin as the script's directory path. Which works, but... The readlink solution , which looks like this:  # Absolute path to this script. /home/user/bin/foo.sh SCRIPT=$(readlink -f $0) # Absolute path this script is in. /home/user/bin SCRIPTPATH=`dirname $SCRIPT`   But readlink isn't POSIX and apparently the solution relies on GNU's readlink where BSD's won't work for some reason (I don't have access to a BSD-like system to check).   So, various ways of doing it, but they all have their caveats.  What would be a better way? Where "better" means:   Gives me the absolute path. Takes out funky bits even when invoked in a convoluted way (see comment on #2 above). (E.g., at least moderately canonicalizes the path.) Relies only on Bash-isms or things that are almost certain to be on most popular flavors of *nix systems (GNU/Linux, BSD and BSD-like systems like OS X, etc.). Avoids calling external programs if possible (e.g., prefers Bash built-ins). (Updated, thanks for the heads up, ) It doesn't have to resolve symlinks (in fact, I'd kind of prefer it left them alone, but that's not a requirement).


How do I calculate the required force to launch an object?

I want to use a rigidbody AddForce() method on an object to launch it over from the enemy to the player, like throwing a ball at a target. The problem is, I'm not sure how much force is required to use in the AddForce() method and it is taking too long to figure it out, and adding to that, the force would be different if I was farther away. I found this helpful guide but it is not in 3D: . Could someone explain step by step in an easy to understand manner how to calculate the force required to get an object launched perfectly onto a target? (I'm not very good at math, haha...) Here's some images from that thread that will help illustrate the desired result:


No year is shown in the lists of All Actions

I can't see this being asked before, although maybe I haven't searched enough.  If I go to my profile, click on All Actions and then the Comments tab, there is a long list (and multiple pages) of my past comments shown.         However, no year information is shown, only the month - even for comments posted over a year ago.         This is confusing, as it makes one wonder if the date (month/day) refers to this year. The presentation is the same, whether the same month and day of the comment is from this year or last year, or three years ago.  I was trying to locate an old comment, but was continually losing track of what year I was currently looking at, and had to click on random comments in the list to see to which year, that particular part of the comment list, pertained.  It would be nice to have the year added, or maybe "n years ago" (although this is not as good as having the actual year displayed.  This issue affects the Comments, Suggestions, Reviews, Revisions, Badges - in fact all of the tabs under All Actions.  It does not affect Reputation tab, maybe that sort of display could be used?


I'm traveling to Toronto and my flight there has a 3 hour layover in Zurich. My return flight has a 7 hour layover, also in Zurich.    Do I need a transit visa?


Why maximum likelihood estimation is different in a logistic regression classifier?

why don't we use the simple linear regression method such as mean square for parameter fitting in logistic regression?


Changing page layout from portrait to landscape using ArcPy with ArcMap?

I need my script to access the Page Orientation property of the current MXD, and switch it from portrait to landscape (or back).   I've looked through the ArcGIS 10 arcpy and arcpy.mapping documentation, and haven't had any luck.   Does anyone know how to do this?


How to handle players doing something others have specialized moves for in Powered by Apocalypse games?

The Apocalypse World and the derived games usually state that if the player can describe that he's doing something, he does that.   Unless there is a move for that. If there is a move, and the move is localized in one playbook, the logic gets fuzzy.  But if, for example, the character tries to bend bars or lift gates in Dungeon World? Can he do that? There is a move for that in the Fighter's playbook, but what if the character in question is a Barbarian? What if that Barbarian has a bigger Str score than the party's Fighter? Will that depend on whether there is a Fighter in the party?  How to handle characters attempting to do something others have specialized moves for?


What kind of problems does return 1 cause

int main() {     return 1; }     int main() {     return 14; }     int main() {  }     Above codes compiled successfully on Microsoft Visual Studio 2013 and no problems occurred.  So what kind of problems the above codes may cause?


Still vulnerable to Heartbleed after updating and reboot

I'm on Ubuntu 12.04, I have updated openssl with the latest update :  $ openssl version -a OpenSSL 1.0.1 14 Mar 2012 built on: Mon Apr  7 20:33:29 UTC 2014   And also updated libssl   $ sudo apt-get install libssl1.0.0 Reading package lists... Done Building dependency tree        Reading state information... Done libssl1.0.0 is already the newest version.   Then I rebooted the server but still show vulnerability using . Any ideas? Thanks.


Discrepancy in sizeof result when used to evaluate a string in function other than main

When I am trying to pass an array and evaluate the size of that array using sizeof, it is giving wrong answer whereas it is producing correct result when done in main function:   #include<stdio.h>  #include<string.h>  #include<stdlib.h>   void fun(char c[])  {     printf("in fun, string = %s ,size of c = %d , sizeof c[0]= %d, strlen = %d\n",c,sizeof(c),sizeof(c[0]),strlen(c));  }   int main()  {      char c[]="(a(bc)d(e)f)";      printf("in main, via sizeof -> %d, via strlen -> %d\n",sizeof(c)/sizeof(c[0]),strlen(c));      fun(c);      return 0;  }   The output is:     in main, via sizeof -> 13, via strlen -> 12      in fun, string = (a(bc)d(e)f) ,size of c = 8 , sizeof c[0]= 1, strlen = 12   Compiler is :   gcc (GCC) 4.8.5 20150623 (Red Hat 4.8.5-28)


The reason was justification provided regarding purpose and conditions of your trip are not considered reliable   I submitted all documents properly with a French citizen’s sponsor letter.  I am going to my brother’s wedding in Saint Vallier, France.  Again my brother and mother-in-law going to get sponsor letter from the French council for me.  Can I apply for a French visa again?


Create a plane that always fits the camera viewport

I'll try to keep it clear: I want to use a background in Blender and for that I use a plane that I want always to fit the camera viewport.  I wanted to do it cleanly, so I put a plane at the same location and orientation as the camera and now I want to move the plane along the camera axis and change it's scale to always fit the viewport (what you can see in the camera view).  I used cos and sin with the FOV of the camera to move the plane but I didn't have anything correct (not so good at math...) and I don't get how I can have the plane to always fit the viewport (fill it entirely).


I can never tell whether this color means the chicken needs another 30 seconds or a minute to finish or if it's properly cooked. I don't want to over-fry the chicken so that it doesn't end up dry. Is the color in the following image properly cooked or not?


How to have a script run from a keypress?

I'm trying to get keymaps working in my script, but it's not working.  I want grid size of the current view3D to double if I press Ctrl-LeftArrow and halve if I press Ctrl-RightArrow.  Right now I'm just trying to print debug messages in response to keypresses. Below is my code, but my operator is not being called no matter what key map items I add.  Am I doing this correctly? import bpy   class GridRescale(bpy.types.Operator):     """Change grid scale"""     bl_idname = "kitfox.grid_rescale"     bl_label = "Grid Rescale"     bl_options = {'REGISTER'}      def invoke(self, context, event):         print("evt type %s" % (event.type))      def execute(self, context):         scale = bpy.context.space_data.overlay.grid_scale          print("execute")         self.report({'INFO'}, "Grid scale %f" % (scale))          return {'FINISHED'}   # store keymaps here to access after registration addon_keymaps = []   def register():     bpy.utils.register_class(GridRescale)      # handle the keymap     wm = bpy.context.window_manager     km = wm.keyconfigs.addon.keymaps.new(name='Object Mode', space_type='EMPTY') #    kmi = km.keymap_items.new(GridRescale.bl_idname, 'NUMPAD_0', 'PRESS', ctrl=False, shift=False)     kmi = km.keymap_items.new(GridRescale.bl_idname, 'LEFT_ARROW', 'PRESS', ctrl=True, shift=False)     addon_keymaps.append(km)  #    kmi = km.keymap_items.new(GridRescale.bl_idname, 'NUMPAD_0', 'PRESS', ctrl=False, shift=False)     kmi = km.keymap_items.new(GridRescale.bl_idname, 'RIGHT_ARROW', 'PRESS', ctrl=True, shift=False)     addon_keymaps.append(km)       def unregister():     bpy.utils.unregister_class(GridRescale)      # handle the keymap     wm = bpy.context.window_manager     for km in addon_keymaps:         wm.keyconfigs.addon.keymaps.remove(km)     # clear the list     del addon_keymaps[:]   if __name__ == "__main__":     register() ```


Im having some trouble formatting my HTML code to UTF-8. I have HTML and PHP on the same page. I used notepad++ but alredy formated in general settings to save file in UTF-8 withot BOM. But still i get characters like "?".  Ive checked my headers and seems that it is UTF-8:   This is between my header tags:  <meta http-equiv="content-type" content="text/html; charset=utf-8">   Hope some of you could help me with this. If there is need for the HTML file just shout out.   I have been using Notepad++ as editor and some parts i have edited online on hosting editor(one.com) but that shouldt be a problem as the file is saved as UTF-8 and told to browser with meta tag that it should also read as UTF-8.  Thanks for the help :) - Asim


If $f:G \rightarrow G$ is a group homomorphism and $f(ab) = f(b)f(a)$ does this show that $f$ is NOT a homomorphism?

Suppose $G$ is a group and $f : G \to G$ is the function $f(x) = x^{-1}$. Prove that if $f$ is a homomorphism, then $G$ is abelian.  Proceeding by contrapositive suppose $G$ is not abelian then for every $a,b$ in $G$, $$f(ab) = {(ab)^-}^1 = {b^-}^1{a^-}^1 = f(b)f(a);$$ thus $f$ is not a homomorphism since the homomorphism property $f(ab) = f(a)f(b)$ fails. My question is different from the possible duplicate provided because I want to know if showing that $$f(ab) = {(ab)^-}^1 = {b^-}^1{a^-}^1 = f(b)f(a);$$ is a correct method to show that a function is NOT a homomorphism


I have a lot more experience with the Windows Firewall with advanced functionality than I do with IPTables. With the WFAF, I was able to lock down a program so that it could only connect over specific ports via specific protocols to specific IP addresses (as opposed to basically just saying "outgoing connections on port 80 are fine.") I'm not sure how I can duplicate that with IP tables. Can anyone provide some quick and dirty tips? Like, let's say I wanted firefox to only be able to use ports 80 and 443, what would I do?


NOTE 1: L'Hospitals and Taylor expansions are not allowed.  NOTE 2: I really appreciate if someone would correct my attempt, however any other easier method only involving single variable calculus (excluding the concepts in NOTE 1) are welcome.  PROBLEM: Compute $$\lim_{n\rightarrow\infty}\left(\frac{n+1}{n}\right)^{n^2}\cdot\frac{1}{e^n}.$$  I'll just manipulate without writing out the limit, for now. I have   \begin{array}{lcl} \left(\frac{n+1}{n}\right)^{n^2}\cdot\frac{1}{e^n} & = & \left( 1+\frac{1}{n}\right)^{n^2}\cdot e^{-n} \\ & = & \exp\left( n^2\ln\left(1+\frac{1}{n}\right)-n\right) \\ & = & \exp((n\ln(1+\frac{1}{n})-1)n) \\ \end{array}  And proceeding:  \begin{array}{lcl} \exp((n\ln(1+\frac{1}{n})-1)n) & = & e^{((n\ln(1+\frac{1}{n})-1)n} \\ & = & (e^{((n\ln(1+\frac{1}{n})-1)})^n \\ & = & \left(\frac{(e^{((n\ln(1+\frac{1}{n})-1)}-1+1)}{(n\ln(1+\frac{1}{n})-1}\cdot{((n\ln(1+\frac{1}{n})-1})\right)^n\\ \end{array}  It gets quite ugly very quickly as you can see. I'm trying to rewrite it so I can apply standard limits like $$\lim_{x\rightarrow\infty}\frac{e^x-1}{x}=\infty \quad \text{and} \quad \lim_{x\rightarrow\infty}\frac{\ln{(1+x)}}{x}=0.$$


What is the real pronunciation of “postman”?

I can see that , where you can’t hear the vowel in the ‑man syllable.  But sometimes it is pronounced /pəʊs(t)mæn/  — with a noticeable /æ/ vowel like in the word man — as heard in the  from more than fifty years ago.   Why is postman sometimes pronounced differently in different times, places, or situations?   What is the real pronunciation of the word?


Strange border on the tag info page on localized Stack Overflow sites

enSO ():        This block:
   On localized sites ():        But on localized sites this div has additional classes which cause this issue:
         Could you fix it?


Complete view of where the PATH variable is set in bash

I've read in a couple of places that the PATH is set in /etc/profile or the .profile file that's in the home dir.  Are these the only places that the path is set in? I want a better understanding of it.  In the /etc/profile file, as the following comment says "system-wide .profile file for the Bourne shell". Does that mean that profile files are the main configuration files for bash?  In that file I don't see the PATH var being set at all. In the .profile file in the home directory there's this line:  PATH="$HOME/bin:$PATH"   That's resetting PATH by the looks because it's concatenating the already set $PATH string with $HOME/bin: right? But if etc/profile and ~/.profile are the only files setting PATH where is $PATH coming from in that line of code if it's not defined in /etc/profile?  Can someone experienced please give a broad and detailed explanation of the PATH variable? Thanks!


right syntax to use near '?PNG ' Error while inserting image to mysql database

I have a thumbnail image which I get from google drive API using code $service = new Google_Service_Drive($client); // Please use your "$client". $fileId = '1YVTIGaAvnzH5vF_B1t8-bKsW2Q8ymZBy'; // This is the file ID from your sample URL.  $res = $service->files->get($fileId, ["fields" => "name,thumbnailLink"]); $thumbnailLink = str_replace('=s220', '=s1000', $res->getThumbnailLink()); $name = $res->getName(); // file_put_contents($name . '.png', file_get_contents($thumbnailLink)); $image=file_get_contents($thumbnailLink);  I want to insert this image into MySQL database I have a table in which the image field is of type blob $sqlinsert="INSERT INTO $table (`Preview`) VALUES ($image) WHERE `Title`=$name"; $result=mysqli_query($conn,$sqlinsert);  I inserted the image into the database but it is giving error  You have an error in your SQL syntax; check the manual that corresponds to your MariaDB server version for the right syntax to use near '?PNG  ' at line 1  any idea how to solve it


ssh connect to a machine under public IP

I tried to reach my machine through public ip  $ ssh me@23.100.101.9 me@23.100.101.9: Permission denied (publickey).   the authorized_keys  gaowei@alpha:~:  me@host:~/.ssh: $ cat .ssh/authorized_keys ecdsa-sha2-nistp521 AAAAE2VjZHNhLXNoYTItbmlzdHA1MjEAAAAIbmlzdHA1MjEAAACFBAHuttEBp2wI31Ip4R9dLImfw+B1IiRApWM7RSb2ko2Z51O5kXEvLMhlr3pwszZ9yUZkfv3yqHpweqNjDbKUyDMmxABcbfBVz+JfTS+o3Dta6qenAIykepiuZu3LHZUpjx/A7HVkVnI9wnc2GN6iWkZYQvJa6sMC9dxE5rjFFu5K7E9ztw== me@host.local   Why it not working?  The updated authorized keys  Connet to local from it's public ip address.  $ cat .ssh/authorized_keys ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAABAQDBj3chjFnpxtHfeSUJVFv6fIN4CPZmIlBzuhMOOJNpovQqBc5JAhrz9uRiQIMHPD2vW+QJYiK08+6pCHthQSFrSLokLXTJfqEvb+frNEc6HvPPglGY3//97lbxR+CQYTjB/XgvnrP8sWKRt4VLfCwtCE6TqdVMx1y9SUmf7FghbHWhUioezdJaFJmfR+WVtELrUSwsc5eXcF+RS74eXEys2/v7LJF2JNYZxu0+Et7EwgxliA/5bOo6jTKBSZttBZPlsn2N7/GXnDilfAy06Iuc8MzMFCrAajQx8Nd4DG5Y33YyNVfU7eat9btUqNhpKGC+b5FGY4mkIPA2tammnjkx ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQDag9dZ+w2EK0hmuTZANVDGv+a77QUyyumT1dtFEWelwkRIBY9pUWYU7UturcVbZSULOJfPdqGsfCz0CNazQDP2Rg2n5tfC2r5xIIdIR5OWIwwMaiFvoSpbOnL1gFQ1ZbWoHiTlFyA0NqcbOE/NWTfgVuYV8MN7+ZGTuaYZKIUoAnHrPvz0kkZ47BLMHgTipk3FZSalns9qWvYl6UyzjtK9PCxXKd5HpDRk6dqR1mpqQndzAxUK3xouvLN/Bnmn5g0jKXLbBq/2a7Cb9KGKU5NdFg8YvhkOKU+Gb/fvw/Zl11/1ze2PW+m/nFQxdfUQDK0jO/Rgzpx6pz/3/9pHg9SnFi/rYmruH2E78N4D1JTF65C1Pmm2yoV+Gc55m/1aSfUgTKdEnc92XiZLUbGczxxjlTwhZVYV9HzRVZ1kQ57JGPdt5sOfQ7I3FttVs+tHOhu5HxcVxNxNXOPaJpVO0VfGIxdKDM6YOcvV5Ae7AgE1SKIHMSAW5Wmp3KGOHzCQSVpkq8nBD501zWQ8sZnf5h2lqTxry6RMr816PMkyhFRhKFiPYopWvmwbYAjoAu/13gh6BGLtakPmc00EfbSoPwBSOP+SxomMziHg7uY3huXe8I5QtYeGg8x2Jq0emk99M6LvQjjffP4wOOhqIEFu9qdSn6CgscdsH9oR48ZrQ6nJJw==****@live.com ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAACAQC89mzJl0ZyMqDLg12gzZpkmBwS2zcbI5FoJx1j0LaJHKaqAQ76HSLqfa8oCUnV6mbZhm7E3EgW5leRLpQwo7WdzvegQP6sLmzg+nmVodM1o5GVKZ0zt2/flGP68phDoQlvk4WleK6Ojg/HJ+J+0zH9aPHwlZUB3sJgPDz5eqgqeIQrq/RQF7HbLKsSgnWes9CxtIRs2Nsn/c6R8dl/+OQO0vzvh70TV7gfsvVCoCWZ1jNbh+MhLRR3MNSWUdmJ6E1GJ8L0kod4MzkE+9lB3/Ns7uVtiyRAsQWl7C+o5OGdpmWCvMIZbJjzSu5HjgoQQJiEq/qkbcJEUMG5hz40xm81MTFbJwIHdr9lm1x4i2B6zc9hQv61qXrNDrCIUkvugnkl83DRduj2egba1yjeQ+vG7mlEN02eplpbUpLtLw0X1pYgzXquNzI2voIEnDveYnYxvO1RtH2qURgfz+2gxp1OCv3FU0z/bCQWYy68IIKoxf6PpjTRu1ErXEDgkonW2hbsPh7Kl4Z0fit6y2IWRR9PeYWeqRC5FdKvZExsrnEEXCoSreDZwQWYsimMitU7bxltyg6mz4hJjrPo1Jf/1+caR4rbL0S6Ig2Wk6asu1qdwh42/21cSN8mxo+nUpe3sXE+o9AfH/GmloGA0pLwZLtxMoyN66wkQkv48YKkO8ToIw== ****@gmail.com ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAABAQDBj3chjFnpxtHfeSUJVFv6fIN4CPZmIlBzuhMOOJNpovQqBc5JAhrz9uRiQIMHPD2vW+QJYiK08+6pCHthQSFrSLokLXTJfqEvb+frNEc6HvPPglGY3//97lbxR+CQYTjB/XgvnrP8sWKRt4VLfCwtCE6TqdVMx1y9SUmf7FghbHWhUioezdJaFJmfR+WVtELrUSwsc5eXcF+RS74eXEys2/v7LJF2JNYZxu0+Et7EwgxliA/5bOo6jTKBSZttBZPlsn2N7/GXnDilfAy06Iuc8MzMFCrAajQx8Nd4DG5Y33YyNVfU7eat9btUqNhpKGC+b5FGY4mkIPA2tammnjkx


I do not understand how to perform this exercise:     If $f$ is a continuous function such that:$$\int_0^xf(t)\ dt=(x-1)e^{2x}+\int_0^xe^{-t}f(t) \ dt$$ For all $x$, what function $f$ results?


How can I make my table automatically resize? It is too wide and getting cut off the right of the page

**preamble**     \documentclass[12pt]{amsart}     \usepackage{geometry}      \usepackage[utf8]{inputenc}      \usepackage{booktabs}      \usepackage{tabularx}      \usepackage{graphicx}      \graphicspath{ {./documents/} }      \usepackage{array}      \usepackage{tabularx}          \geometry{a4paper}     \begin{document}     **table**     \begin{table}[] \begin{tabular}{@{}ll@{}} \toprule Organisation                      & Role                                                                                \\ \midrule Courts                            & \begin{tabular}[c]{@{}l@{}}Judges and lawyers were Nazi members and enforced an improvised "Nazi law"\\ \\ Special courts set up to prosecute political crimes\end{tabular}                                                                                \\ Gestapo                           & \begin{tabular}[c]{@{}l@{}}Secret state police set up by Göring in 1933. Himmler gained control after 1933, and by 1936, an established part of the SS\\ \\ Enforce political conformity, but relied on denunciations by the German population. In Würzburg, 54\% of race-related charges were initiated by private citizens.\end{tabular}    \\ SS (Schutzstaffel - Defense Unit) & \begin{tabular}[c]{@{}l@{}}Private army and security system set up by Hitler's personal guards in 1925, led by Himmler after 1929. \\ \\ Key role in Kristallnacht -\textgreater replaced the SA as main military unit\\ \\ Enforce racial policy and run concentration camps\\ \\ Sub units: 1) Death's Head Units 2) Waffen SS\end{tabular} \\ SD (Sicherheitsdienst)            & \begin{tabular}[c]{@{}l@{}}Set up in 1932 by Himmler\\ \\ Internal security force of SS. Main role was intelligence eg. reports of SD, popularity of party, situation of Church\end{tabular}                                                                                \\ Concentration Camps               & \begin{tabular}[c]{@{}l@{}}First used to detain political opponents (communists and socialists), later anybody who spoke out against the regime\\ \\ Forced labour from prisoners. Camps were then built near stone quarries and brick making factories\end{tabular}                                                                          \\ \bottomrule \end{tabular} \end{table} \end{document}  When I compile, it cuts off the page. I've tried looking at other stack exchange solutions but they didn't work for me (or at least my solo troubleshooting). Will tabularx automatically create new sentences when they are long?


Is deleting the yosemite install partition safe?

I got Yosemite via the Apple Beta Program. I installed Yosemite on a separate partition which I had created for the purpose specifically. Now I want to reclaim my 50 GB by deleting the partition. I have already set my startup disk to my original Mavericks partition.   So, if I launch Disk utility in Mavericks and delete the Yosemite partition, will my Mac still boot?   PS: I am not looking to uninstall just yet, but I'm running low on space and might need to get some space back soon enough (before Yosemite gets stable and I get the upgrade).


hello . how to get rid of this grey plane that hides my interior. in 3d view it doesnt appear but when i rendered it shows. I try to make some changes in render then camera setup.  please can anybody tell what to do.


Why performance test shows me that lists are much faster than arrays with my code?

LIST FOR      00:00:00.0000980 LIST FOREACH  00:00:00.0000007 ARRAY FOR     00:00:00.0028450 ARRAY FOREACH 00:00:00.0051233  I have always made performance heavy things with arrays, but it seems lists are much faster. using System; using System.Diagnostics; using System.Collections.Generic;  public class Program {     public static void Main()     {         var cron = NCrontab.Advanced.CrontabSchedule.Parse("0 0 1 1 * 2016",             NCrontab.Advanced.Enumerations.CronStringFormat.WithYears);         var date = new System.DateTime(year: 2016, month: 1, day: 1,             hour: 0, minute: 0, second: 0);                  int[] testArray = new int[1000000];         List<int> testList = new List<int>(1000000);                  var stopWatch = new Stopwatch();         stopWatch.Start();         for (int i = 0; i < testList.Count;i++)         {             var s = 1;         }         stopWatch.Stop();         Console.WriteLine("LIST FOR      " + stopWatch.Elapsed);                  stopWatch = new Stopwatch();         stopWatch.Start();         foreach (int i in testList)         {             var d = 1;         }         stopWatch.Stop();         Console.WriteLine("LIST FOREACH  " + stopWatch.Elapsed);                          stopWatch = new Stopwatch();         stopWatch.Start();         for (int i = 0; i < testArray.Length;i++)         {             var f = 1;         }         stopWatch.Stop();         Console.WriteLine("ARRAY FOR     " + stopWatch.Elapsed);                  stopWatch = new Stopwatch();         stopWatch.Start();         foreach (int i in testArray)         {             var h = 1;         }         stopWatch.Stop();         Console.WriteLine("ARRAY FOREACH " + stopWatch.Elapsed);     } }    List internally implements T[], just that its flexible and internally keeps expanding when Capacity is over. Since for the all the important operations, it internally does the array operations, just that it provides the convenience for the dynamic expansion.  I don't understand it, but I need to know for heavy and frequent operations. Basically I'm trying to determine what's better to have high FPS.


Comment notification shows up under responses, but not top bar inbox

Looking under , I see:    Looking under my inbox on the top bar, I see:    (I believe only I, and perhaps mods, can see either of these screens - sorry about that)  Note the two I circled are different comments, neither showing up in the other display.  The one I encircled in my inbox is actually  (since it's a deleted post, 10k+ users only unfortunately), which may explain why it doesn't show up in my responses tab (I don't really care about that, and frankly this behaviour makes sense).  My question is - why does 's notification show up in my responses tab, but not my inbox?  Is it perhaps related to the deleted comment?


How to type a notation as same as the below pictue

I want to type a notation as same as the below pictue   How must I do?  Please help me!


Is the boundary of a boundary a subset of the boundary?

The definition of a boundary of a set $S$ in a topological space $X$ is $\text{comp}\{\text{Int}(S) \cup \text{Ext}(S)\}$ (complement of the interior union exterior).  The definition for interior is the set of all interior points.  The definition for interior point of $S$ is if there exists an open neighborhood $N$ of that point such that $N \subset S$.  The definition of neighborhood of a point $x$ is a subset of the topological space $X$ that contains an open set such that $x$ is in that open set.  The definition for exterior of $S$ is $\text{Int}(\text{Comp}(S))$.  So $\text{Bdry}(\text{Bdry}(S)) = \text{comp}\{\text{Int}(\text{comp}\{\text{Int}(S) \cup \text{Ext}(S)\}) \cup \text{Ext}(\text{comp}\{\text{Int}(S) \cup \text{Ext}(S)\})\}$ which I can't make heads or tails of. Is there an easier approach to checking of the boundary of the boundary is a subset of the boundary using these definitions?


How to see $A=\{ (x,y) \in \mathbb{R}^2 : x \in \mathbb{N}, y \in \mathbb{R} \}$ has empty interior?  It's intuitive from the visualization of this set, since it's a set of parallel lines and lines are closed sets. But what's a formal argument for empty interioriness?


Is there a way to delete all items in my Stack Exchange inbox? There doesn't to be a 'clear inbox' button.


I wish to ping three local devices, every 5 min, without stopping, from a Raspberry Pi running Raspbian OS. When my Pi powers on, I want that to automatically start.     I saw an  about it, but not sure where to start.


This question is about object instantiations in C++. There are several ways to instantiate objects both on heap and on stack I am curious to know the subtle differences.   using namespace std;  class Raisin { private:     int x; public:     Raisin():x(3){}     Raisin(int input):x(input){}     void printValue()     {        cout<< "hey my Deliciousness is: " << x <<endl;     } };   Basically Raisin is a simple class that I am using for this demonstration:  int main() {  Raisin * a= new Raisin; a->printValue();  Raisin * b= new Raisin{}; b->printValue();  Raisin * c= new Raisin(); c->printValue();  Raisin x; x.printValue();  Raisin y{}; y.printValue();  Raisin z(); z.printValue();  //error: request for member 'printValue' in 'z',  //which is of non-class type 'Raisin()'   Raisin alpha(12); alpha.printValue();  Raisin omega{12}; omega.printValue();  return 0; }   I would like to know why Raisin * c can be instantiated with empty parenthesis, but  but Raisin z cannot be. (Actually Raisin z() is legal but incorrect)  Also I understand there is a subtle difference between Raisin (2) and Raisin{2}. I would appreciate if someone can shed light on the idiosyncrasies.


how to proof that φ:P(N)→2N φ(A)=f where f(n)=1 if and only if n∈A is bijective?

so i have given the folowing info: In general, if $A$ is a set, for $S \in \mathcal P(A)$ define $\chi(S) : A \to \{0,1\}$ by $$\chi(S)(a) = \begin{cases} 1 & \textrm{if } a \in S, \\ 0 & \textrm{if } a \notin S. \end{cases}$$ Then $\chi : \mathcal P(A) \to 2^A$ is bijective. But I was wondering how I can prove this. I know you suppose to show that the function χ(S)(a) is both injective as surjective. But I'm pretty new with the definition Characteristic function so I don't know how to start. I know my definitions: injective: a function $f:X \rightarrow Y$ is injective when: $\forall x_1,x_2 \in X: x_1 \ne x_2 \Rightarrow f(x_1) \ne f(x_2)$ $\forall x_1,x_2 \in X: f(x_1) = f(x_2) \Rightarrow x_1 = x_2 $ surjective: a function $f:X \rightarrow Y$ is surjective when: $\forall y \in Y : \exists x \in X: f(x)=y$ but how can I apply it in my case? Thank you in advance


Windows 7: Disable Lock Workstation After 10 Minutes Using Group Policy

On my Windows 7 PC the system becomes locked after 10 minutes of inactivity. Usually I would find this setting next to the screen-saver configuration. The setting is grayed out, however.  I think this is because of corporate group policy. As I am an administrator on this computer I should be able to reconfigure the group policy setting using gpedit.msc.  What is the group policy setting that I need to change to prevent automatic locking of my workstation?  Edit: I don't have configured a screen-saver. I also want to continue to be able to lock the workstation manually.


Applying styling to KML (from a shp) using ogr2ogr?

Is it possible to generate a styled KML using ogr2ogr (ie pen width and colour?) I cannot seem to find anything in the ogr2ogr documentation.  My code so far is;  ogr2ogr.exe -f "KML" prow-kml.kml "C:\prow.shp"    Unfortunately this just gives me a default colour line when viewing in Google Earth.


Show that the matrix $I+A$ is invertible when $A$ is nilpotent

If  $A$ is a nilpotent matrix, then how to show that the matrix $I+A$ is invertible.


What is the difference between != null and !== null?

Sorry for what I'm sure had have been asked in the past, but it's very hard to search for a question like this. "!=" and "!==" are not exactly search friendly. If anyone knows a duplicate question you can point me to it.  What is the difference between doing myVar != null and myVar !== null? I know that != is not equal and !== is not equal value or not equal type, but when comparing to null is there ever a case where they would return different results? Is one better to use than the other?


Can't get to per-site metas from the iOS app

I'd like to be able to easily browse the per-site metas of some sites. Unfortunately, there isn't an easy way to do this from the iOS app.  I tried searching for 'meta' in the other site chooser gizmo, but only mSO showed up. I've also tried tapping random likely-looking images and text. No luck.  Eventually, I found that I can do this by scrolling through my inbox and finding a notification from the meta I want to visit. I tap on it, then hit the back button. I can then see the meta's question list.   Can we please make this easier?


Is there a good way to debug inside of a LINQ statement in C# in VS 2012 or beyond, to check the iteration of a lambda function in a where?

For example say I am using a WHERE clause and I would like to see the iteration happen without changing it to an iterated loop.  In Visual Studio 2012 or higher for checking lambda function iterations.


Converting from DateTime to Epoch - and back

I found the question about converting epoch time to normal time, but I'm having two problems:   When I run DateTime.newInstance(1391529600 * 1000) I am getting the wrong answer I want to convert normal time to epoch time   1: I have been typing the following into Execute Anonymous:  system.debug(DateTime.newInstance(1391529600 * 1000));   By my calculations (and some websites I found) that should give me 4 Feb, 2014, 16:00:00 GMT.  Apex gives me      1969-12-31 12:56:36   Clearly, this is incorrect (and it's even before 1/1/1970). Can anyone replicate my situation?  2: I also want to change the current datetime (GMT) to epoch time, returning the number of seconds or milliseconds since 1/1/1970. I could break things into parts, but that seems an awful lot of script statements to do something that should be fairly easy, I'd hope.  Thanks for the help!


Prepared food in containers that I forgot to put in the refrigerator

I forgot to put prepared food I received in the refrigerator. It sat out over night at room temperature. The food were in containers. I put them in the refrigerator in am. Is it safe to eat?


CEO in Stack Overflow Podcast - Is there a transcribed version available?

In the most recent Stack Overflow Podcast, announced in this , it is claimed that the CEO talks about the future of our company and community.  The title of the blogpost is:     Podcast: A chat with our CEO about the future of our company and community   I don't mind listening to a podcast, when I have the time. Currently I don't and would like to be able to quickly glance through what is being discussed and read parts I find interesting/relevant when I have a few minutes to spare.  Is there anywhere this podcast is transcribed? I know in the past there were discussions about transcribing tools doing a decent job. It doesn't have to be an official SO transcription.


Why doesn't Java include support for unsigned integers?    It seems to me to be an odd omission, given that they allow one to write code that is less likely to produce overflows on unexpectedly large input.    Furthermore, using unsigned integers can be a form of self-documentation, since they indicate that the value which the unsigned int was intended to hold is never supposed to be negative.    Lastly, in some cases, unsigned integers can be more efficient for certain operations, such as division.    What's the downside to including these?


The new GNU Octave 4.0.1 was released March 23, 2016.  I would like to find some standard way to install it in El Capitan (mine OS X 10.11.3) because it has significantly better support in some functions than Matlab, discussed in the thread .  I do brew search octave and get  homebrew/science/octave    Caskroom/cask/octave       Caskroom/cask/xoctave       where one of the first two should be a correct one. The project's homepage  for OS X is down  about installing Octave on OS X systems.  There is also ruby's way of installing Octave described in the thread  but for Yosemite.  I would like to find some standard way of getting Octave for OS X.   I do successfully brew update and brew upgrade before the commands. My Homebrew is 0.9.5 (git revision 80d1; last commit 2016-03-24).  . I run brew info octave but I get  Error: No available formula with the name "octave"     How can you install Octave in some standard way for El Capitan?


How do I wrap a string in a file in Python?

How do I create a file-like object (same duck type as File) with the contents of a string?


Stack Exchange app not working on iOS 9 public beta?

I installed the brand-new iOS 9 public beta today, and when I open the Stack Exchange app (1.3.1), it displays the blue gradient loading screen, flashes a shot of a blank feed for a half-second, and then blacks out and exiles me to the home screen.  (For what it's worth, I'm on an iPhone 6, so there's no old hardware to blame the problem on. The app was working perfectly on iOS 8.4.)  UPDATE: Now most of the app is working fine. The one thing that isn't working is the left sidebar. The buttons related to my profile work fine, but whenever I try to use the sidebar to go to a different Stack Exchange site, it blacks out.  The About and All Sites screens also load, but when I select a site from All Sites, that also crashes the app.


Proving that $R_2$ with the standard topology is normal?

I'm having a hard time proving that $R_2$ with the standard topology is normal. I started off by trying to show that for any two disjoint closed sets, A and B, we could find balls (so since we're in $R_2$ open sets) around them, U and V, but I don't know how to guarantee that these two balls are disjoint from each other. Any hints would be appreciated!


queries with db_select don't respect integers

When I check "SHOW PROCESSLIST" in phpMyAdmin I can see lots of queries where argument-integers are being inserted as strings (with single quotation marks).  I'm wondering if this is due to the way phpmyadmin reports the queries (if it puts every argument between quotation marks) of if it is db_select that puts every argument between quotation marks.  An example of my code where integers are being used as arguments:  $select->join('taxonomy_index', 't_'.$key, 't_'.$key.'.nid = n.nid AND t_'.$key.'.tid = :tid_' . $key, array(':tid_'.$key => (int)$tid)); $select->condition('t_'.$key.'.tid', (int)$tid);   As you can see I explicitly write (int)$tid but in my query log I can see the following:  ... WHERE (t_0.tid = '10') ...   The big question is: How can I be sure that integers are being treated as integers in my queries? I don't want MySQL having to transform strings to integers.


Proof that $n\Bbb Z \leq \Bbb Z$ and are the only subgroups of $\Bbb Z$

My challenge is      Prove that if $n = 0,1,2,\ldots$ and $n\Bbb Z = \lbrace nk: k \in \Bbb Z \rbrace$, show that $n\Bbb Z$ is a subgroup of $\Bbb Z$ and are the only subgroups.   I handled the first point by saying that  i) Identity is 0, and $0\in n\Bbb Z$ and $0 \in \Bbb Z$  ii) For any $a,b \in n\Bbb Z$ $a+b = na_2 + nb_2 = n(a_2+b_2) \in n \Bbb Z$  iii) For any $na \in n\Bbb Z$, its inverse $n(-a) \in n\Bbb Z$.  For the second point, I said that all of the subgroups should be infinite, because for any finite group the largest element $a+a \notin H$, where $H$ is the potential subgroup, which is a contradiction. So $H$ must be of infinite order. For any $a \in H, -a$ should also be in $H$. The difference between any $a,b \in H$ should also be in $H$, i.e. $(a-b) \in H$. This leaves only the whole group or any group of the form $n\Bbb Z$.  Is my proof complete?


GSC Structured Data error for "Missing: homeLocation"

Although we didn't do any changes, this new error appeared in the GSC Structured Data section:    I don't really get what it means. There are many fields for Schema.org, is homeLocation suddenly a required field? Does that make any sense?


This seems like it would be common question and I searched for it, but came up dry.  Whenever I get an email or message on Outlook, Skype, etc. OSX puts a red number over the icon with the number of messages received. How can I set this number for my own app?


Is it bad-practice to have a high citation to content ratio in academic writing?

I'm writing a high school history textbook. While writing my book, I'm finding its becoming very heavily laden with sources. If I used Turabian's footnote style, they tend to fill half the page. Perhaps 1 source per 2 lines of text. My reasons for this are:  The history involved three different groups of people, but typically only one point-of-view has been presented in most general sources, so I'm having to check more sources from these other points of view (which has revealed to me that a lot of sources are missing important details). There is heavy bias in much scholarship, because the scholars are writing about their own ancestors, or have much local pride, they ignore facts that contradict their developed image of their ancestor as a "hero". Indigenous groups with no written language were part of the history, so the facts can be difficult to pull out, and requires cross-checking and confirming information across multiple sources while filtering out the biases mentioned above. Sometimes a great source ignores the basic details, like the date of the event, so I have to include cite general sources for the date alongside the more thorough detailed source with better analysis of the event.  Is too many sources frowned upon? Most secondary textbooks I see are strangely quite absent of sources. Is there some way this is bad practice?


How can I check the integrity of a video file (avi, mpeg, mp4...)?

This title could be somewhat misleading, so let me explain ...  I'm downloading a video file ... mpeg, avi - being one of the popular formats. Now, if I am downloading it, and the download breaks in the middle of the uhm ... download, then, for example, Windows Media Player will give out some error and refuse to play it (although the file is, let's say, 98% complete). But, players like KMPlayer, or MediaPlayer Classic will play it up until that point (as the matter of fact, they can play it while it is being downloaded as well).  So, I'm interested, ... without using any means of download (download managers and alike) to secure the file is completely downloaded, how can one verify whether the video file is downloaded whole, and that it is complete ?


Why don't Moon collide with Earth but revolves due to gravity?

As we know gravitational force is a central force so due to gravitational effect they must collide with each other but why they revolve?


Apex Class - Tests are passing, but Salesforce shows 0% coverage

My tests are all passing, so I know that my test code is calling my main class's methods. Salesforce is telling me I have 0% coverage though, so I'm not really sure what's going on.  (I'm very inexperienced with Apex, this is my first trying to write tests or use the Batch interface).  This is my class:  global class CandidateValidatorBatch implements Database.Batchable<sObject> {  global Database.Querylocator start(Database.BatchableContext BC) {     return Database.getQueryLocator('SELECT Contact.CV_TR__c, Contact.ts2__Text_Resume__c, Contact.ts2__Resume_Last_Updated__c FROM Contact WHERE Contact.Account.Name = \'Candidates\''); }  global void execute(Database.BatchableContext BC, List<sObject> scope) {     List<Contact> candidates = new List<Contact>();     List<Contact> updated_candidates = new List<Contact>();     for(sObject objScope: scope){         Contact candidate = (Contact)objScope;         if (String.isBlank(candidate.ts2__Text_Resume__c)){           candidate.CV_TR__c = false;           candidate.ts2__Resume_Last_Updated__c = null;         } else{           candidate.CV_TR__c = true;         }         updated_candidates.add(candidate);     }     Database.SaveResult[] srList = Database.update(updated_candidates, true);      for (Database.SaveResult sr : srList) {         if (sr.isSuccess()) {             System.debug('Successfully updated contact. Contact ID: ' + sr.getId());                    } else {             for(Database.Error err : sr.getErrors()) {                 System.debug('The following error has occured.');                 System.debug(err.getStatusCode() + ': ' + err.getMessage());                 System.debug('Contact fields that affected this error: ' + err.getFields());             }         }     }  }  global void finish(Database.BatchableContext BC){  }   }  And this is my test class:  @isTest  private class CandidateValidatorTest {    @isTest static void test() {        Contact cand1 = new Contact();       cand1.CV_TR__c = false;       cand1.ts2__Text_Resume__c = 'content';       cand1.LastName = 'test1';       Datetime c1time = Datetime.newInstance(2014, 1, 31, 7, 8, 16);       cand1.ts2__Resume_Last_Updated__c = c1time;       insert cand1;        Contact cand2 = new Contact();       cand2.CV_TR__c = false;       cand2.ts2__Text_Resume__c = '';       cand2.LastName = 'test2';       Datetime c2time = Datetime.newInstance(2014, 2, 31, 7, 8, 16);       cand2.ts2__Resume_Last_Updated__c = c2time;       insert cand2;        CandidateValidatorBatch theBatch = new CandidateValidatorBatch();       theBatch.start( (Database.BatchableContext) null );       theBatch.execute( (Database.BatchableContext) null, new List<sObject>{ cand1, cand2 });       theBatch.finish( (Database.BatchableContext) null );         System.assertEquals(true, cand1.CV_TR__c);       System.assertEquals('content', cand1.ts2__Text_Resume__c);       System.assertEquals(c1time, cand1.ts2__Resume_Last_Updated__c);       System.assertEquals(false, cand2.CV_TR__c);       System.assertEquals('', cand2.ts2__Text_Resume__c);       System.assertEquals(null, cand2.ts2__Resume_Last_Updated__c);     } }


What is the flaw in this induction proof?

Explain the flaw in the following induction argument which shows all of Lucas’ toys are the same colour.  Proof: We will show by induction that: for every integer $n\ge1$, in any group of $n$ of Lucas’ toys, all the toys in this group are the same colour.  Basis: If Lucas had only one toy, then clearly all these toys are one colour, so the result holds for $n=1$.  Induction Hypothesis: Suppose for a fixed but arbitrary integer $k \ge 1$, in any group of $k$ of Lucas’ toys, all the toys in this group are the same colour.  Induction Step: Let $n = k + 1$. Take any fixed but arbitrary group of $k + 1$ of Lucas’ toys. Pick out an arbitrary toy (Toy A) from this group. Then all the remaining $k$ toys in the group are the same colour, by the induction hypothesis. Adding this toy back into the group and removing another toy (Toy B), we get a group of $k$ toys which contain Toy A. By the induction hypothesis, these $k$ toys are all the same colour. Thus all the toys in the group must be the same colour. Since the group chosen was arbitrary, in any group of $k + 1$ of Lucas’ toys, all the toys in this group are the same colour.  Conclusion: By the PMI, for all integers $n \ge 1$ any group of $n$ of Lucas’ toys are all the same colour. Therefore, since Lucas has a finite number of toys, all of Lucas’ toys are the same colour.


Let $x_1,x_2,\ldots,x_n > 0$ such that $\dfrac{1}{1+x_1}+\dfrac{1}{1+x_2}+\cdots+\dfrac{1}{1+x_n} = 1$. Prove that $x_1x_2\cdots x_n \geq (n-1)^n$.   It seems like we should be able to use AM-GM here since the expression we want to prove has $x_1x_2\cdots x_n$ in it. But I don't know how to deal with this $\dfrac{1}{1+x_1}+\dfrac{1}{1+x_2}+\cdots+\dfrac{1}{1+x_n} = 1$ expression.  Edit: the solution in the link you provided was not very clear. I am wondering if someone can provide a more clear solution.


Logistic regression model does not converge

I've got some data about airline flights (in a data frame called flights) and I would like to see if the flight time has any effect on the probability of a significantly delayed arrival (meaning 10 or more minutes). I figured I'd use logistic regression, with the flight time as the predictor and whether or not each flight was significantly delayed (a bunch of Bernoullis) as the response. I used the following code...  flights$BigDelay <- flights$ArrDelay >= 10 delay.model <- glm(BigDelay ~ ArrDelay, data=flights, family=binomial(link="logit")) summary(delay.model)   ...but got the following output.  > flights$BigDelay <- flights$ArrDelay >= 10 > delay.model <- glm(BigDelay ~ ArrDelay, data=flights, family=binomial(link="logit")) Warning messages: 1: In glm.fit(x = X, y = Y, weights = weights, start = start, etastart = etastart,  :   algorithm did not converge 2: In glm.fit(x = X, y = Y, weights = weights, start = start, etastart = etastart,  :   fitted probabilities numerically 0 or 1 occurred > summary(delay.model)  Call: glm(formula = BigDelay ~ ArrDelay, family = binomial(link = "logit"),     data = flights)  Deviance Residuals:        Min          1Q      Median          3Q         Max -3.843e-04  -2.107e-08  -2.107e-08   2.107e-08   3.814e-04  Coefficients:             Estimate Std. Error z value Pr(>|z|) (Intercept)  -312.14     170.26  -1.833   0.0668 . ArrDelay       32.86      17.92   1.833   0.0668 . --- Signif. codes:  0 â***â 0.001 â**â 0.01 â*â 0.05 â.â 0.1 â â 1  (Dispersion parameter for binomial family taken to be 1)      Null deviance: 2.8375e+06  on 2291292  degrees of freedom Residual deviance: 9.1675e-03  on 2291291  degrees of freedom AIC: 4.0092  Number of Fisher Scoring iterations: 25   What does it mean that the algorithm did not converge? I thought it be because the BigDelay values were TRUE and FALSE instead of 0 and 1, but I got the same error after I converted everything. Any ideas?


How to programmatically check if getopts is installed? If not, install it

Running Ubuntu 16.04 I want to install (programmatically) getopts if it is not installed.   After this  I am doing something like this:  GETOPTS=getopts  if [$GETOPTS==""]     then    echo "Installing getopts"    sudo apt-get install -y libperl4-corelibs-perl fi   But it is not working.  Any Idea how to do this?


Send program's serial output to pseudo-terminal used by serial sniffer such as jpnevulator

I am running an application that communicates through a real serial port e.g. /dev/ttyS0 to a remote device.  I can configure this application to use /dev/ttyS0, /dev/ttyS1, etc., by passing the numeric suffix to the program, not the fully-qualified name. I would like to sniff the traffic going through this serial port using something like jpnevulator.  This jpnevulator opens a pseudo-terminal to which the application to be monitored is supposed to connect.   Is there any way to re-assign the name of the ports, for example /dev/ttyS1 to an actual pseudo-terminal such as /dev/pty/23, so that the application transparently connects to /dev/pty/23 via /dev/ttyS1?  Would a file link ln achieve this?


How to find the least possible capturing group in OR list regex

I want to capture the words after me_start: pattern with the following with regular expression me_start: ([\s\S]{1,})(?:end_1|end_2|end3) and till any of the described words in this OR list will be found. But it works in other way and capture the longest possible group.  Example:  me_start: cat end_1 dog end_2 in this sentence I want to capture cat word, but it catches cat end_1 dog words.  How to make it in the way I need


Need to install Internet Explorer but getting sha1sum mismatch

I'm getting this error when we select IE versions:  sha1sum mismatch! Rename /home/ascra/.cache/winetricks/ie7/winetest.cat and try again.


$3$ does not divide $|G| \implies \forall \ g \in G, g=h^3$ , for some $h$ in $G$

If $G$ be a finite group such that $3$ does not divide the order of  $G$.   Then show that every element of $G$ can be expressed as $h^3$ , for some $h \in G$.   Thought:  I have just figured out that if $g$ has order $3$ then $g= h^3$ is not possible. But nothing else.


When answering , I wrote up this , which works fine from my machine. However, on SE data, it always picks the same winner. Is it possible that SE Data fixes rand() to a specific number?  If so, why is that?


Difference between a Structure and a Union

Is there any good example to give the difference between a struct and a union? Basically I know that struct uses all the memory of its member and union uses the largest members memory space. Is there any other OS level difference?


Non-static method cannot be referenced from a static context error

i have class named sagum which has a method name paint  public void paint(Graphics g) {      int[] apw1 = null;     int n1 = 0;     for (int j = 1; j <= n1; j++) {         g.drawRect(50, 50, (apw1[j] * 20), 30);         String[] p = null;         g.drawString("p" + p[j - 1], (55 + (apw1[j - 1] * 20)), 70);         g.drawString("" + apw1[j - 1], 50 + (apw1[j - 1] * 20), 100);     }     g.drawString("" + apw1[n1], 50 + (apw1[n1] * 20), 100);  }   im trying to call it   n1=count+1;  paint(g);   and im getting an error  non-static method paint(Graphics) cannot be referenced from a static context   im simply trying to call it after a method is executed to do an a graphical app of my method (scheduling algorithm).   please help


Why did Gandalf get Narya, of all the Istari?

Why did Cirdan choose Gandalf to wear Narya, of all the Istari?  The reasoning for why he gave the ring at all doesn't seem to uniquely qualify Gandalf as the best recipient, unless Cirdan was being prophetic?     "Take this ring, master," he said, "for your labours will be heavy; but it will support you in the weariness that you have taken upon yourself. For this is the Ring of Fire, and with it you may rekindle hearts in a world that grows chill." - Círdan the Shipwright   But that was originally the mission and the presumed fate of ALL of the Istari, not just Gandalf's.


Forward dns request to another dns server

How can I forward configure my local dnsmasq so requests with hostnames ending with .docker are forwarded to another nameserver, while other requests are still handled locally ?  I have looked for an /etc/dnsmasq.conf file on my system but could not find it (only a dnsmasq.d directory).  EDIT : apparently, dnsmasq is run by network manager, like this :   /usr/sbin/dnsmasq --no-resolv --keep-in-foreground --no-hosts --bind-interfaces --pid-file=/run/sendsigs.omit.d/network-manager.dnsmasq.pid --listen-address=127.0.1.1 --conf-file=/var/run/NetworkManager/dnsmasq.conf --cache-size=0 --proxy-dnssec --enable-dbus=org.freedesktop.NetworkManager.dnsmasq --conf-dir=/etc/NetworkManager/dnsmasq.d


I want to prove the following implication  $$[0,1]~\text{disconnected}\implies(0,1)~\text{disconnected}.$$  My try: Suppose $[0,1]=U\cup V$ with $U,V$ open, disjoint and nonempty.  Using the subspace topology of $\mathbb{R}$ we also have $U=U'\cap[0,1]$ and $V=V'\cap[0,1]$ where $U',V'$ are open in $\mathbb{R}$.  We have $(0,1)=(0,1)\cap[0,1]=(U'\cap(0,1))\cup(V'\cap(0,1))$. This is a union of open sets since $(0,1)$ is an open interval.  How can I prove that this is also a union of disjoint sets?  Will this $U\cap V=(U'\cap[0,1])\cap(V\cap[0,1])=U'\cap V'\cap[0,1]=\emptyset$ be sufficient for showing the disjoint-requirement?  Also, I do not know how to start for showing that $(0,1)$ is union of nonempty sets.   I would appreciate any help.


I'm looking for specific examples of all combinations of pure, mixed, separable and entangled states, but I would prefer if they all have some physical significance.  For pure states, the separable ones are the vector states, they are pretty basic and for entangled pure states I thought of the Bell states.  However, I'm having trouble finding examples of mixed states, both separable and entangled, which are simple enough, but aren't completely arbitrarily constructed.  Does anyone have any ideas? Thanks!


How to use "so here it goes?".  I have written this sentence.     I have made up a short story. Here it goes.   When I was in ...   I am confused about what is the correct way to write it.  When should I use "here it goes" and "so here it goes"?  Which one of these is correct way to write and speak?     I have made up a short story. Here it goes.   I have made up a short story. So here it goes.   I have made up a short story, here it goes.   I have made up a short story, so here it goes.   I have made up a short story, here it goes:   I have made up a short story, so here it goes:


Why can curved spacetime be locally a Minkowskian spacetime?

The gravity field is determined by the metric $\eta_{\mu \nu}$ we impose on a flat (Minkowskian) spacetime, for which the metric has diagonal elements only: $(1,-1,-1,-1)$. Solving the Einstein equation gives you the space- and time components of the metric if a stress-energy tensor $T_{\mu \nu}$ is present. Time variations in the metric represent gravitational waves. So we can say that the gravity field is a metric field defined on a flat (Minkowskian) spacetime and from this we can calculate what the real (non-Minkowskian) spacetime looks like (if a stress-energy tensor is present). How can we say that locally this curved spacetime is Minkowskian if a Minkowskian metric is only there in Minkowskian spacetime? Isn't it Minkowskian everywhere if it's locally so? Of course, by looking close enough, you can say the curved spacetime looks flat (like a function can be approximated by a linear function for small values of its argument). If curved spacetime looks flat locally, then why will mass move in curved paths?


Without using the proof by induction establish the formula for the simple arithmetic series

How to establish the formula for this without induction?  $$1 + 2 + 3 + · · · + n =\sum_{j=1}^n j=\frac{n(n + 1)}{2}$$


Is there a way to limit the number of words per post through the the_content() function or something similar?


I really want to make sushi (and sashimi). However, I'm concerned about the health risks of eating raw fish.  I made a research and I found this:     EU   regulations forbid the use of fresh raw fish. It must be frozen at   temperatures below −20 °C (−4 °F) in all parts of the product for no   less than 24 hours.[66] As such, a number of fishing boats, suppliers   and end users "super-freeze" fish for sushi to temperatures as low as   −60 °C.[67] As well as parasite destruction, super-freezing also   prevents oxidation of the blood in tuna flesh, thus preventing the   discoloration that happens at temperatures above −20 °C.[68]   Source: .  So I wonder if it's safe if I freeze the raw fish in my refrigerator's freezer for a day or two? Any advice on making safe sushi?


Are there accepted spectral lines, or wavelength of light emitted, for the various neural and ionized atoms? If yes, where can I find them?

I am working with the redshift phenomena and analyzing the spectral lines of various emissions by galaxies. However, when I came to analyze the change in wavelength I was confused on what to compare to in terms of rest emitted wavelength. I found various values for the same ionized atom that varied tremendously. I am wondering if there were accepted values for the wavelength emitted by the atoms?


ReentrentLock on this object or super object

While delving deep in Java concurrency I found an example of Reenterant locking mechanism in Java Concurrency in practice   public class Widget {      public synchronized void doSomething() { ... } } public class LoggingWidget extends Widget {    public synchronized void doSomething() {        System.out.println(toString() + ": calling doSomething");        super.doSomething(); // which object is locked this or super    } }   while calling method LoggingWidget.doSomething() LoggingWidget object's lock is acquired by thread . This method also call super.doSomething() in method its body. Which object is locked while calling super.doSomething() , Widget or LoggingWidget?


I'll try to demonstrate my issue with a simple example.  Suppose I compile the following file (I used LuaLaTeX, TeX Live 2015)  \documentclass{standalone} \usepackage{tikz,pgfplots}  \begin{document} \begin{tikzpicture}   \begin{axis}[       xlabel=$x$,       ylabel=$y$     ]     \addplot[line width=0.8pt]{x};   \end{axis} \end{tikzpicture} \end{document}   If I examine the produced pdf file with a vector graphic program (e.g. Adobe Illustrator), I note that the line width of the graph is 0.797pt instead of the requested 0.8pt.  Although I know that the error is negligible for all practical purposes, it would be interesting to know its cause.


What are sources where I can learn how to use GeoServer?  I know of these two sites:    - which in fact is not working (at least at the moment)  - not only (tutorials) for GeoServer   But I am interested in more complex information, and not to read only documentation.


I've looked through all similar issues reported but none of them solves my problem. I always install drush with composer and installing 6.4.0 is working just fine, but when I install dev-master then I get the error  Unable to load autoload.php. Drush now requires Composer in order to install its dependencies and autoload classes. Please see README.md   Composer is at the latest version.  When I go to ~/.composer I never get a ./vendor/ directory as suggested by answers to other questions.  My environment is Ubuntu 14.04 and I'm using PHP 5.5 - any idea what else could be wrong?


Can we have the ability to make question synonyms?

Many questions on stack overflow are duplicates. These are often closed, but what would be nicer is if the question could be declared a synonym of another (by users of sufficiently high rep, or by votes).   Why do this? Well one reason duplicates come up is that there's lots of different ways of phrasing the same basic question. This means that when I type in the title for my question and it suggests related ones, it may completely miss the identical question due to it being worded completely differently. Having the ability to link different questions could go some way to alleviating this problem, and linking the good answers to the previous incarnation of the question to the newly asked question, instead of having "answers" consisting of stuff like:     Dupe:    P.S. This may well have been asked before, but I've checked all the suggested Related Questions and it doesn't look like it!


Computing the product of p/(p - 2) over the odd primes

I'd like to calculate, or find a reasonable estimate for, the Mertens-like product  $$\prod_{2<p\le n}\frac{p}{p-2}=\left(\prod_{2<p\le n}1-\frac{2}{p}\right)^{-1}$$  Also, how does this behave asymptotically?    Hmm... trying to think this one out, I get  $$\left(\prod_{2<p\le n}1-\frac{2}{p}\right)^{-1}=\exp\log\left(\left(\prod_{2<p\le n}1-\frac{2}{p}\right)^{-1}\right)=\exp-\log\left(\prod_{2<p\le n}1-\frac{2}{p}\right)$$ which is $$\exp-\sum_{2<p\le n}\log\left(1-\frac{2}{p}\right)=\exp\sum_{2<p\le n}\left(\frac{2}{p}+\frac12\left(\frac{2}{p}\right)^2+\frac13\left(\frac{2}{p}\right)^3+\cdots\right)$$ which, with P(s) the prime zeta function and f(s)=P(s)-2^s, is less than $$\exp\left(\frac42f(2)+\frac83f(3)+\cdots+\sum_{2<p\le n}\frac{2}{p}\right)$$ which might not be a bad approximation for n large.  But I can't immediately find a series for P(s) with $s\to+\infty$ and I'm not sure if there's a better way.  Help?


SQL Server - Validate Column In Every Insert

I am writing a .net core 2.2 C#, code-first, api with a SQL Server backend. It was just requested to make the api a multi-tenant api. So, I added TenantId (INT NOT NULL) to all DB tables, QueryFilters, etc... Everything is working as expected.  I want to ensure I did not and no one in the future will forget to add the TenantId on all inserts. TenantId will always be a value greater than zero. Is there a way in SQL Server to ensure that every insert on every table has a TenantId value that is greater than zero?


I am trying to install opendkim. For that, I used rpm to install epel, then did yum install opendkim. However, I get the following dependency errors:  Error: Package: opendkim-2.9.0-2.el6.x86_64 (epel)            Requires: libcrypto.so.10(OPENSSL_1.0.1)(64bit)  Error: Package: libopendkim-2.9.0-2.el6.x86_64 (epel)            Requires: libcrypto.so.10(libcrypto.so.10)(64bit)  Error: Package: opendkim-2.9.0-2.el6.x86_64 (epel)            Requires: libssl.so.10(libssl.so.10)(64bit)  Error: Package: opendkim-2.9.0-2.el6.x86_64 (epel)            Requires: libcrypto.so.10(libcrypto.so.10)(64bit)  As far as I can tell, this is because I'm running openssl 1.0.0, and it's looking for 1.0.1. I feel like I should update openssl, but I'm not sure how, and I'm a little nervous to do that. Can anyone tell me if this is in fact what I need to do? This may be a duplicate question but I don't understand the answer:


Put a timer on a function inside while loop

There's lots of questions about it but I don't quite get it yet. I have to upload some code into a server to run 24/7, and this code will be basically something like this:    while True:     variable1 = function1()     variable2 = function2()     variable3 = function3()   So let's say I want to do variable2 = function2() once every hour or so, for performance (I don't understand much about it, but I think it'll do good to put a timer on it)    I can't use time.sleep() on it because the code has to keep going I mentioned the server thing because I don't know if answers using a system timer works with it, I'm still learning how to do it. Forgot to say I'm using Python 2.7


I want to put some small boxes around certain words in a paragraph. The boxes will never contain more than one word.  The \ovalbox command described in the fancybox documentation is close to what I need. However, I found some problems:   The rounded corners do not line up with the sides perfectly. Text to the left and right in the paragraph are pushed away. The spacing between lines in the paragraph is increased vertically.   I would like to create boxes which:   Adjust horizontally to fit the width of the text inside. Have rounded or beveled corners. Can be filled with a solid color. Will not cause any text inside or around the box to move. Will not impact the vertical spacing of lines.


Use mathematical induction to prove that any integer $n\ge2$ is either a prime or a product of primes.

Use  strong mathematical induction to prove that any integer $n\ge2$ is either a prime or a product of primes.    I know the steps of weak mathematical induction... Basis step: $p(n)$ for $n=1$ or any arbitrary $n_0$ ... show that it is true Inductive hypothesis: $p(n)$ for $n=k$ ... Assume that it is true for $n=k$ Inductive step: $P(n)$ for $n=k+1$ ... Show that this is true for $n=k+1$


understanding time: Is time simply the rate change?

Is time simply the rate of change?  If this is the case and time was created during the big bang would it be the case that the closer you get to the start of the big bang the "slower" things change until you essentially approach a static, unchanging entity at the beginning of creation?  Also, to put this definition in relation to  that "observers in motion relative to one another will measure different elapsed times for the same event." : Wouldn't it be the case that saying the difference in elapsed time is the same as saying the difference in the rate of change.  With this definition there is no point in describing the "flow" of time or the "direction" of time because time doesn't move forward but rather things simply change according to the laws of physics.   Edit: Adding clarification based on @neil's comments:  The beginning of the big bang would be very busy, but if time was then created if you go back to the very beginning it seems there is no time and there is only a static environment.  So it seems to me that saying time has a direction makes no sense.  There is no direction in which time flows.  There is no time; unless time is defined as change.  So we have our three dimensional objects: and then we have those objects interact.  The interaction is what we experience as time.  Is this correct or is time more complicated than this?


Calculating $\sqrt[3]{\sqrt 5 +2}-\sqrt[3]{\sqrt 5 -2}$

We want only the real 3rd root. By calculation, $[\sqrt[3]{\sqrt 5 +2}-\sqrt[3]{\sqrt 5 -2}]^3= 4-3[\sqrt[3]{\sqrt 5 +2}-\sqrt[3]{\sqrt 5 -2}]$  Therefore, the answer is a root of  $t^3=4-3t$ , which obviously has the real solution $t =1$.   But I want another way of showing $\sqrt[3]{\sqrt 5 +2}-\sqrt[3]{\sqrt 5 -2} =1$, maybe by using simple algebraic formulas.