After my laptop's screen broke down, I sent the laptop back to have the screen replaced. Unfortunately, it seems that they replaced it with a lower resolution screen.  I have the faint hope that the screen's resolution is actually higher that what Ubuntu is able to display (although it seems unlikely).  Is there a way to know for sure the physical (or "theoretical") resolution of the screen?  Edit: I tried xrandr as suggested in the comments, here is the output:  Screen 0: minimum 320 x 200, current 1366 x 768, maximum 32767 x 32767 LVDS1 connected primary 1366x768+0+0 (normal left inverted right x axis y axis) 344mm x 194mm    1366x768       60.0*+    1360x768       59.8     60.0      1024x768       60.0      800x600        60.3     56.2      640x480        59.9   VGA1 disconnected (normal left inverted right x axis y axis) HDMI1 disconnected (normal left inverted right x axis y axis) DP1 disconnected (normal left inverted right x axis y axis) VIRTUAL1 disconnected (normal left inverted right x axis y axis)   Does this mean there's definitely no way the screen could be actually higher res than 1366 x 768? (I was expecting 1600*900)  Edit: Not sure why my question was downvoted. Anyway, since it seems there is no easy way to know for sure the native resolution of the screen, I fetched a screwdriver, took the screen apart to get its reference, and looked it up. It was a 1366x768 indeed, as I feared.


Does Stack Overflow have automated tests? If yes, what kind of (unit, integration, etc)? How are they organized and used?


Kindly help me with this error. All the applications on the software centre are not loading and package manger has error too.


I was in the castle mission, and while travelling to the castle,something went off and the game got stuck for a second. Then everything turned green like in the image below.  Why did this happen? How can I fix it?


Set of rational number in (0,1) can not be expressed as intersection of countable collection of open sets

Set S=Q$\cap$(0,1) I wanted to show that this can not be expressed as intersection of countable collection of open sets. I know Any closed set can be shown as intersection of countable collection of open set .I had hint show this by Cantor intersection property which says that infinite intersection of  nested sequence of nonempty compact set is nonempty . I could not able to link this hint with problem till now .Any help will be appreciated    Without using Baire Category Theorem Is it possible to solve this problem? As this problem occur in exercise where there in no mention of that theorem in text.


How do you enable promiscuous mode in VMware Workstation?

Say I have some virtual machines in a private network inside VMware Workstation, and they're all running Windows 7. I want to enable promiscuous mode on one of these machine's virtual adapter but there's no instructions out there!  There's clear and easy instructions on how to do it on VMware ESXi:   But no instructions on how to do it on VMware Workstation are anywhere to be found.


Commutator subgroup is the minimal normal subgroup such that quotient group is abelian

I was recently asked this in Abstract Algebra class on group theory:     Let G be a group and G' its commutator subgroup (i.e. its minimal subgroup containing all commutators $ [x,y] = xyx^{-1}y^{-1} $ where $ x,y \in G $ ). Where are asked to show G' is the minimal normal subgroup such that the quotient group $  G/G' $ is Abelian (if $ H \unlhd G $ and G/H is Abelian then we must have $ G' < H $)   To be honest I have tried but could not seem to be able to solve this. I have shown G' is normal and quotient group $ G/G' $ is abelian, but I cannot prove G' is minimal normal subgroup with this property. I really would appreciate the help on this. Thanks all


Wish for Instant Summons spell gives a sapphire?

Wish:  The basic use of this spell is to duplicate any other spell of 8th level or lower. You don’t need to meet any requirements in that spell, including costly components.  Instant Summons:  Components: V, S, M (a sapphire worth 1,000 gp) The spell leaves an invisible mark on its surface and invisibly inscribes the name of the item on the sapphire you use as the material component. Each time you cast this spell, you must use a different sapphire.  Wish bypasses material components, but Instant Summons relies on the material component within the spell itself. This brooks the following question: Does the Wish spell create a 1000 gp sapphire when used to cast Instant Summons?


Combinatorial Proofs with Summation on One Side

How do I go about approaching the following problem? $$\sum_{k=1}^n k^2 C(n,k) = n(n+1)2^{n-2}$$ I don't know how to interpret the summation of something combinatorially, especially with a k^2 term. Any help or tips would be greatly appreciated!


Error with sudo : /etc/sudoers is world writable , no valid sudoers sources found

sudo: /etc/sudoers is world writable sudo: no valid sudoers sources found, quitting sudo: unable to initialize policy plugin   I was installing a font by using this command  sudo gnome-font-viewer /home/user-15/Downloads/aclonica/Aclonica.ttf     I used this before and it worked fine but now it is not working, I'm not able to install any font.


how should `id` and `/etc/group` be read?

This is a follow-up question to  although the first question isn't really necessary to understand this one.    The command id seems pretty clear...  test@test ~ $ id test uid=1000(test) gid=1000(test) groups=1000(test),4(adm),24(cdrom),27(sudo),30(dip),46(plugdev),113(lpadmin),129(sambashare)   it shows the UID and GID of test (resp. its UPG) and then additionally lists all groups of which the user test is a member.    But then how should /etc/group be read?  test@test ~ $ less /etc/group | grep test adm:x:4:syslog,test cdrom:x:24:test sudo:x:27:test dip:x:30:test plugdev:x:46:test lpadmin:x:113:test test:x:1000: sambashare:x:129:test   The group-name at the beginning is pretty clear and also that the number is the GID; and after that the names of the group-members are listed. But why isn't the second last line test:x:1000:test instead of  test:x:1000: to indicate, that the user test is member of the group test?  bonus question: what is the x in the second column for?


Continuous map of differentiable manifolds is differentiable if differentiable functions pull back to differentiable functions

This is Exercise 3.1.A. in      Suppose that $\pi: X\rightarrow Y$ is a continuous map of differentiable manifolds. Show that $\pi$ is differentiable if differentialble functions pull back to differentiable functions, i.e., if pullback by $\pi$ gives mpa $\mathcal{O}_Y\rightarrow \pi_*\mathcal{O}_X$.   Let $f: V\subseteq Y\rightarrow \mathbb{R}$ be a differentiable function on an open subset of $Y$. Let $(U,\phi)$ be a chart of $X$, $(V,\psi)$ be a chart of $Y$. Then $f\circ\pi(\phi^{-1})$ is differentiable and $f\circ\psi^{-1}$ is differentiable. We need to show that $\psi\circ\pi\circ\phi^{-1}$ is differentiable. I don't know how to prove this.   Can we say that since $(U,\psi\circ\pi)$ constructs a chart of $X$, by the compatibility, $\psi\circ\pi\circ\phi^{-1}$ is differentiable? This seems true but this does not use the fact that $f$ is differentiable.  Sorry I have no background of Differentiable Manifolds. Any help would be appreciated.


What is the importance of the Collatz conjecture?

I have been fascinated by the  since I first heard about it in high school.     Take any natural number $n$. If $n$ is even, divide it by $2$ to get $n / 2$, if $n$ is odd multiply it by $3$ and add $1$ to obtain $3n + 1$. Repeat the process indefinitely. The conjecture is that no matter what number you start with, you will always eventually reach $1$. [...]      Paul Erdős said about the Collatz conjecture: "Mathematics is not yet ready for such problems." He offered $500 USD for its solution.   How important do you consider the answer to this question to be? Why?  Would you speculate on what might have possessed Paul Erdős to make such an offer?  EDIT: Is there any reason to think that a proof of the Collatz Conjecture would be complex (like the FLT) rather than simple (like PRIMES is in P)?  And can this characterization of FLT vs. PRIMES is in P be made more specific than a bit-length comparison?


In our institute the professor dispatches papers to certain employees(research fellows/assistants who are graduates or have a PhD degree) for peer reviewing. The professor takes responsibility for the reviews, still I wonder if this is the way the review process is meant to be.


What is the difference between these IDs/classes?

What is the difference between these?   #hello-world p  p #hello-world  p#hello-world  If you could give me an example of each that would be the best. Thanks


Using footmisc package in tcolorbox environment

I am trying to create a footnote symbol * in a tcolorbox environment and the result is not the symbol nor at the bottom of the page instead within the box!  \usepackage[most]{tcolorbox} \usepackage[symbol]{footmisc}  \begin{document} \begin{tcolorbox}[colback=yellow!20!white,colframe=green!40!gray] \color{green!40!gray}{\large {\bf Definitions}}\color{black} \ \ \ {\bf  Strategy  for Sketching Graphs}\footnote[1]{This strategy is refined further, for  rational  functions, in Section 2.3.}  \begin{enumerate} \item[{\bf a)}] \item[{\bf b)}] \item[{\bf c)}] \item[{\bf d)}] \item[{\bf e)}] \item[{\bf f)}] \end{enumerate}  \end{tcolorbox} \end{document}   This outputs:    First of all tcolorbox is not reading the correct symbol for '1' in the footmisc package nor is the footnote at the bottom of the page. Please advise!


Block some subdomains using robots.txt -Angular website with IIS

We have a testing environment with the surprising sub-domain name tests and I would like to block it to search engines. How can I let Google scan my site https://example.com and block https://tests.example.com, but allow https://app.example.com. I already read other answers but they were not relevant to me because I don't use Apache and also this is an Angular website so adding a file in a subdomain won't help. Thank you!


I am practicing java programing this is my code,I want to merge 2 string and sort then,  public class MergeString {     public static void main(String[] args) {         String str1 = "adfs";         String str2 = "jiewk";         String med =mergeString(str1, str2);         System.out.println(med);         System.out.println(med.charAt(2));     }  public static String mergeString(String str1,String str2){     String merged = str1 +str2;     char[]merge = merged.toCharArray();     for (int i =0;i<merge.length;i++){         for (int j=i+1;j<merge.length-1;j++){             if (merge[i]>merge[j]){                 char temp = merge[i];                 merge[i]=merge[j];                 merge[j]=temp;              }         }     }     merged = merge.toString();     return merged; }   }  could you tell me why my output is ASCII like: [C@6b71769e thanks a lot!


Multiple subsection columns in Beamer (warsaw)

I've got quite a few subsections in one section and they stretch the right half of the header. Hoping to split them up into 2+ columns.  Minimal example:   Some research indicates that this will involve \setbeamertemplate{headline} () and probably modifying \insertsubsectionnavigation, but I don't know enough LaTeX to do this. I'd appreciate a hand!  Code:  \documentclass{beamer} \mode<presentation> { \usetheme{Warsaw} \usecolortheme{default} }  \title{Sample title} \author{Sample author}  \begin{document}  \section{A} \subsection{i} \begin{frame} \end{frame} \subsection{ii} \begin{frame} \end{frame} \subsection{iii} \begin{frame} \end{frame} \subsection{iv} \begin{frame} \end{frame} \subsection{v} \begin{frame} \end{frame} \subsection{vi} \begin{frame} \end{frame} \subsection{vii} \begin{frame} \end{frame} \subsection{viii} \begin{frame} \end{frame}  \end{document}


Unit Circle and Imaginary Axis geometry problem

Suppose $x$ and $y$ are points on the unit circle such that the line through $x$ and $y$ intersects the real axis. Show that if $z$ is the point where this line intersects the real axis, then  $z = \dfrac{x+y}{xy+1}$.   How should I go about attempting this problem? I am currently struggling to find a starting point (and going through with the entire proof).  Any help is appreciated!


Can I add to my groups in the current (shell) process?

If I add myself to a group, it applies only to newly launched processes. Actually it's more restricted than that; it seems to apply only to new logins. I'm not sure what the exact mechanism is, but that's not my question (though I'm curious about that too).  My question is this: Is it possible to update my group membership in the current shell process?  I suspect the answer is no.  An example (this is not a direct copy-and-paste):  $ groups ; groups kst kst oldgroup1 oldgroup2 kst : kst oldgroup1 oldgroup2 $ sudo adduser kst newgroup [sudo] password for kst: Adding user `kst' to group `newgroup' ... Adding user kst to group newgroup Done. $ groups ; groups kst kst oldgroup1 oldgroup2 kst : kst oldgroup1 oldgroup2 newgroup $   After the adduser, my account is a member of newgroup, but that membership is not reflected in the current shell process.  The obvious solution is to log out and log in again, but that's inconvenient.


I have a list of 40 names, a list of 40 picture boxes, I want to show these names randomly and uniquely in picture boxes.  I tried but my effort is worthless. Any help would be appriciated.          Random r = new Random();          List<int> list = Enumerable.Range(1, box.Count).ToList();         List<int> rndList = new List<int>();         Random rnd = new Random();         int no = 0;         for (int i = 0; i < box.Count; i++)         {             no = rnd.Next(0, list.Count);             rndList.Insert(i, no);             list.Remove(no);         }          for (int i = 0; i < box.Count; i++)         {             System.Reflection.Assembly sysrefass = System.Reflection.Assembly.GetExecutingAssembly();             var rm = new System.Resources.ResourceManager(sysrefass.GetName().Name + ".Properties.Resources", ((System.Reflection.Assembly)sysrefass));             box[i].Image = (Image)rm.GetObject(rndList[i].ToString());          }


What is this noisy shadow overlay that stays with the camera?

I created a scene in which the camera goes towards a cylinder with a rock texture on the inside. But from whatever angle I play it, there is this weird noise, but unlike regular noise, it stays the exact same and follows the camera.  It is like there is a picture on the camera that has an Overlay like blending mode and just shows between the camera and the texture. Does anybody have an Idea where this texture may be coming from? Here is .


Deleted comments are persisting in the global inbox

I realise that there is other questions out there about the  (First open one I found is ), but this is marked .  I often get the below issue where it will notify me about comments on my  (in this case what appears to be the user re-writing after deleting their comment) that no longer exist.  Also, occasionally, I see comment snippets with text that doesn't match what is on the page when I view it.  Let me know if I should be trying to edit that one to remove the tag indicating that it has been fixed, and add the above as another answer.


How do I properly use RegExp in JavaScript and PHP?

How do I properly use RegExp?  var text = "here come dat boi o shit waddup"; var exmaple = /[a-zA-Z0-9 ]/; // allowes a-zA-Z0-9 and whitespaces but nothing else right? example.test(test); // would return true right?  text = "%coconut$§="; example.test(text); // would return false right?  //I know this is very basic - I started learnig all this about week ago   Are JS RegExp's the same as PHP RegExp's? How do I define banned characters instead of defining allowed characters? How do I make it so that the var text has to contain 3 (or more) numbers/letters? How do I include / or ",'$ etc. in my pattern?


I'm running Ubuntu 16.04 with CPU: i7-6700.  Even with one of the cores sitting on 100% utilisation cpufreq-info reports.  ... analyzing CPU 7:   driver: intel_pstate   CPUs which run at the same hardware frequency: 7   CPUs which need to have their frequency coordinated by software: 7   maximum transition latency: 0.97 ms.   hardware limits: 800 MHz - 3.50 GHz   available cpufreq governors: performance, powersave   current policy: frequency should be within 800 MHz and 3.50 GHz.                   The governor "performance" may decide which speed to use                   within this range.   current CPU frequency is 800 MHz.   Each CPU shows 800 MHz.  How do I get my CPU frequency to increase under load?


I wanted to create a directory structure with certain specified files. The files are just empty text files. Do I start by making a directory of the main directory and then trying to create a subdirectory inside the main directory with the empty text files in the subdirectory? Can I create an empty file with the command touch «path»/«file    ? Would I start making main directory with the touch command just listed? Lookingfor help on how to create a main directory with subdirectories in a structure. Thank you


How to solve: "! LaTeX Error: Command \Square already defined."

I'm using LyX (2.2.3), I need to use bbding:      And here is the code:  % Preview source code  %% LyX 2.2.3 created this file.  For more info, see http://www.lyx.org/. %% Do not edit unless you really know what you are doing. \documentclass[english,hebrew]{article} \usepackage[T1]{fontenc} \usepackage[cp1255]{inputenc} \usepackage{fancyhdr} \pagestyle{fancy} \setlength{\parindent}{0bp} \usepackage{wasysym}  \makeatletter %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Textclass specific LaTeX commands. \usepackage{theorem} \theorembodyfont{\upshape} \newtheorem{theorem}{\R{משפט}}[section] \AtBeginDocument{\make@lr\thetheorem}  % The following chunk fixes export with XeTeX. % It is needed because polyglossia is used by default % and \make@lr is only defined by babel. \@ifundefined{make@lr} {\def\make@lr#1{\begingroup     \toks@=\expandafter{#1}%     \edef\x{\endgroup   \def\noexpand#1{\noexpand\@number{\the\toks@}}}%   \x}}{\relax}  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% User specified LaTeX commands. \let\Square\relax \usepackage{bbding}  \makeatother  \usepackage{babel} \begin{document} \begin{center} \L{$\leadsto$} \par\end{center} \end{document}   When I remove the bbding there are no errors, but I need it...


Probability with same number of heads and tails

I have this question that I don't know where to begin, any help will be greatly appreciated.  Consider the following random experiment. Toss a coin until the same number of heads and tails have been observed. Take as random variable, X, the observed number of heads (or tails). Determine the first few values in the probability distribution and calculate  $\sum^{5}_{n=1} nP (X = n)$  I'm not sure exactly where to start, if someone could point me in the right direction that would be great! thanks


Add a button for adding code highlighting for a specific language

Currently, the following code:  <!-- language: lang-php -->      <?php="test"?>  <!-- language: lang-xml -->      <bug cat="md" name="syntax">   Generates the following markdown:  <?php="test"?>   <bug cat="md" name="syntax">   Remembering the exact syntax to use when I actually have to use this isn't easy though. Is there an elegant way to add a button to the WYSIWYG editor, maybe with a dropdown for language choice?


Problem: Find all ordered pairs of positive integers $(a,b)$ such that $\frac 1a + \frac1b = \frac 3{2018}$.   My beginning solution: Using basic algebra and factorization, we can see that the equation reduces to $$2 \cdot 1009 \cdot (a+b) = 3 \cdot a \cdot b$$  From this, we can get several key pieces of information:  i) At least one of $a,b$ must be divisible by $2$,  ii) At least one of $a,b$ must be divisible by $1009$, and   iii) $a+b$ must be divisible by $3$.   However, I don't know how to effectively utilize this information. The solutions that I have found so far have been $(1009,2018)$ and $(2018,1009)$, and I think that these are the only ones, but how do I prove this result?  Any help would be greatly appreciated, but I ask that you give HINTS ONLY.   Thank you in advance.


Showing that asymptotic normality implies consistency.

In a statistics book i'm reading, it is postulated that asymptotic normality of an estimator implies consistency. That is $$ \hat{\theta}_n \stackrel{as}{\sim} \mathcal{N}(\theta_0, \frac{1}{n}\sigma(\theta_0)) \Rightarrow P_{\theta_0}(|\hat{\theta}_n - \theta_0|>\epsilon ) \to 0 $$ when $n\to\infty$, for all $\theta_0 \in \Theta$ and $\epsilon>0$.  I am trying to prove this, but i can't seem to get a breakthrough.   If anyone could shed some light on how this is proven, i would be very grateful.


I'm searching for a word with a meaning similar to Racism or Sexism but within the context of religion. Is there a word for this meaning?


I encountered a very strange problem. I wrote an enumerate after a long table, the enumerate text will be printed outside the bottom of a page, and some item text can not be shown. I simplified a latex code, only used a picture and a longtable.  I want to know why this happened, although I know how to avoid it this time, but I can't avoid every situation I will encounter later if I don't know the reason.  \documentclass[12pt]{article} \usepackage{graphicx} \usepackage{longtable}  \begin{document} \begin{figure}   \centering   \includegraphics[scale=1]{example-image}   \caption{aaa} \end{figure}  \begin{longtable}{ll} \hline   a & b\\   a & b\\   a & b\\   a & b\\   a & b\\   a & b\\   a & b\\   a & b\\   a & b\\ \hline \end{longtable}  a\\a\\a\\a\\a\\a\\a\\a\\ enumerate1 \begin{enumerate}   \item a   \item b   \item c   \item d   \item e   \item f   \item g   \item h \end{enumerate}  enumerate2 \begin{enumerate}   \item i   \item j   \item k   \item l   \item m   \item n \end{enumerate}  enumerate3 \begin{enumerate}   \item a   \item b   \item c   \item d   \item e   \item f   \item g   \item h \end{enumerate}  \end{document}   Look at the error picture as follows, enumerate1 is under the page number, beyond the bottom of the page; and enumerate2 can not be shown. The result of the typeset is wrong.


Can an infinite set A be larger than an infinite set B but still have the same cardinality?

Definition. Two sets have the same cardinality iff they can be put into one-to-one correspondence; or,     $$A \simeq B \iff |A| = |B| $$    This definition applies to infinite as well as to finite sets. It follows from the last three definitions that set $A$ has a larger cardinality than set $B$ iff both    a proper subset of $A$ and the whole of $B$ can be put into one-to-one correspondence the whole of $A$ cannot be put into one-to-one correspondence with any proper subset of $B$.   From: A Crash Course in the Mathematics Of Infinite Sets Peter Suber, Philosophy Department, Earlham College  The last part specifically refers to proper subsets of $B$.  That excludes at least one subset of $B$, namely $B$.  So, is it possible that the whole of A cannot be put into one-to-one correspondence with any proper subset of $B$ but may with $B$ itself? Why did he not say "any subset of $B$"?


I am still newbie to ubuntu.  I have a partition (ext4) with all my Documents and Photos, etc. This partition doesn't have any mount point. I want to use Document folder from this partition as my Document folder in Home directory.  I see few possibilities, somehow to mount this partition on booting (and not when I click on it in Folder Manager) and create symbol link from my /home/Documents to /media/partition/Documents or just mount all partition as /home/Document.  It seems like the first solution is cleaner, however the problem is I don't really understand how to mount partition on booting to constant media folder.   What's is the right way to do so?


What non-integer number has the smallest factorial?

Quick google search for factorial of non-integers led me to . I tried that in my calculator and it worked as expected for non-integers. Perhaps implements gamma function internally.  Now, for all positive numbers:  x < y => x! < y!    But not for numbers between 0 and 1. 0! = 1!. I played around to find this:  0!      1 0.1!    0.951 0.4!    0.887 0.425!  0.886 0.45!   0.885 0.5!    0.886 0.55!   0.888 0.6!    0.893 0.9!    0.96 1!      1   What is the floor for the gamma function (or the unrestricted by integers factorial function)? The floor is around 0.45 from the table. I'm curious to know what is the floor value and the number for which gamma is minimum.  Any significance or implications of these numbers would be interesting too.


Finding the metric tensor from the Einstein field equation?

I have have set my self a challenge to learn all the maths behind the Einstein field equation (EFE), and from reading it seems that the Metric tensor is the thing we are trying to find (from the 10 equations that forms the EFE). but since nearly all the terms in it are functions of this metric tensor, this seems very hard. What type of maths do we use to do this? (I have copied and pasted the EFE just for reference):  $$R_{\mu \nu}-\frac{1}{2}g_{\mu \nu}R+g_{\mu\nu}\Lambda=\frac{8 \pi G}{c^4}T_{\mu \nu}$$  Edit: Thanks for your comments. Just as I have no one else to ask, is this the equation that we try to solve:  $$\left(\frac{\partial}{\partial x^{\lambda}}\Gamma^{\lambda}_{\mu \nu}- \frac{\partial}{\partial x^{\nu}}\Gamma^{\lambda}_{\lambda \mu}+\Gamma^{\lambda}_{\lambda \rho}\Gamma^{\rho}_{\nu \mu}-\Gamma^{\lambda}_{\nu \rho}\Gamma^{\rho}_{\lambda \mu}\right)-\frac{1}{2}g_{\mu \nu}g^{ab}\left(\Gamma^c_{\enspace ab,c}-\Gamma^c_{\enspace ac,b}+\Gamma^d_{\enspace ab}\Gamma^c_{\enspace cd}-\Gamma^d_{\enspace ac}\Gamma^c_{\enspace bd} \right)+g_{\mu \nu}\Lambda=\frac{8 \pi G}{c^4}T_{\mu \nu}$$  with the $R_{μν}$ and $R$ terms expanded and where $g_{μν}$ and $T_{μν}$ are the μν th components from the related tensors? (a yes or no answer will be fine, thanks).


Can I install Ubuntu on this laptop? Where can I get drivers?


In logic, why do both "and" and "or" exist?  "and" is just a change in the argument of "or", and vice versa.  a ∨ b = ¬(¬a ∧ ¬b)   a ∧ b = ¬(¬a ∨ ¬b)  So why do we have both of them? Do they both exist simply for convenience in defining other more complicated logical structures?  I suppose another way of asking it is, why do we not have no "or's" or no "and's"? (I think)


Which passports to use travelling between two countries of citizenship?

My kids are dual Danish and US citizens. My husband and I are permanent US residents, our kids  being born here.   When we travel back and forth between Denmark and the US, we have been solely using the kids US passports.   Obviously, for entry into the US (and check in at the airport) they need to use their US passport, as they have no visa.   On arriving in Denmark, they have a automatic 90 day travel visa, so just showing the US passport have been enough.   There are a couple of other questions around this I explored on the site: ,  and more, and all of them state that you have to use the passport of the country you enter if you hold that passport, and that in some cases you are required to.   However, we have not been doing this for kids, as I heard anecdotally that it can cause trouble when entering the US. A friend of mine with dual US/other citizen ship used his other passport when entering that country, and at some point he was asked on US re-entry where he had been, and why he had no stamps in his passport. He was told by the US immigration officer that you have to use the same passport for your entire travel.   Is this correct? Or should I use my kids Danish passports for entering Denmark?


Search 2d Array with an increasing circle around position

I'm sure somewhere has this question been solved, but after 2 hours of search without finding the solution, I'm desperatly searching for your help.  There is position in an 2d-Array given and I want to search for the same value around this position. Now I dont want to use a double for-loop. I want to search around the position with an increasing circle. Example:  position is 0,0:    search at 0,0; search at -5, 0; search at -5, -5; search at  0, -5; search at  5, -5; search at  5, 0; search at  5, 5; ....     When the circle is completed i want to increase the search radius from -5, 0; to -10, 5;  Main goal therefor ist not to search in a position, which has already been searched. I tried to implement it with for-loops or booleans but neither worked. Do you have an idea? I need to make it in C++, but any ideas are apreciated!  Thanks for your help and have a good day!


I'm creating a top-down RPG and I have the movement system set up for the player character - it is alike to Pokemon in the movement sense in that it looks smooth but it is aligned to a grid. Since I have the player sorted I was trying to figure out how to use this movement principle for the Enemy AI's Pathfinding but I haven't figured out how to do it; I was wondering if anyone has a possible solution to this.


How to evaluate improper integral of odd function?

I recently was solving $\int_{0}^{\infty }\frac{x}{x^3+1}dx$. I wrote x as z to do contour integration and did the indentation for the pole at real axis but I don't know what to do with this odd function? How should I go further, write the z in terms of $\theta$ by euler formula? This is not homework question,I started learning complex analysis recently so I want to know the concepts used for such questions.


I face the following issues in reference list. When I type, say, "Ann. Inst. H. Poincar\'{e} Anal. Non Lin\'{e}aire " in  WinEdt in biliography, the output is "Ann.---Inst.---H.---Poincar\'{e}---Anal.---Non Lin\'{e}aire", (a dash indicates a space) with extra space between words. This always happens, for example, when a reference that I am citing is at least three lines!


Passing a string from one activity to another android studio

I want to pass a string from one activity to another, then use the string in a conditional statement. the code below does this but the if statement in the 2nd activity does not execute the code? any ideas why as the BoxTicked string contains the string "true"              String BoxTicked = "true";      Intent i = new Intent(getApplicationContext(), secondActivity.class);      i.putExtra("BoxTicked", BoxTicked);      startActivity(i);   (2nd Activity)      Intent i = getIntent();     String s = i.getStringExtra("BoxTicked");      if(s == "true") {        // Do something     }


I'm having problems installing the spotify client on Ubuntu 14.04. I've installed the latest updates, but it didn't change anything.   First I ran:  deb http://repository.spotify.com stable non-free   Then I did:  sudo apt-key adv --keyserver hkp://keyserver.ubuntu.com:80 --recv-keys 94558F59   After that I did:  sudo apt-get update   And then I did:  sudo apt-get install spotify-client   But it says   cannot find package spotify-client...


Is it time to tighten up the question quality filter?

As everyone here well knows, we get a lot of questions on Stack Overflow. And, as some of us here probably already know, there is  for new users:     Also, there are certain quality filters applied to questions to try to ensure a clear title, a reasonable explanation of the question and correct use of English and actual sentences. When the tests fail, the post is rejected.   It's not just apocryphal. , and . I think that's a good thing. I'm not sure of the accuracy of Jeff's one-time ballpark estimate that the worst 10% of questions get left behind, but I think .  Why, then, do questions like  still manage to get through?      It looks like a joke, like it might even be computer generated the way random keywords are just thrown in there. Except that we have  that can  questions that blow this one away in terms of quality. Given a few attempts, monkeys at a keyboard could bang out something better than this. No, something this bad can only be the handiwork of a real person, and a special type of person at that: one who just doesn't care and can't be bothered. Do we really want this type of person, or their questions, on Stack Overflow? I know I don't.  So, let's strengthen the algorithm used to detect and filter out poor-quality questions. It is my claim that this one should never have gotten through.  Let's start by enforcing a simple minimum length requirement. You need more than 16 words to ask a question. If you don't, your question doesn't belong on Stack Overflow. It is impossible to state your problem, disclose your language/technology/environment, and briefly describe what you have already tried to solve the problem in any fewer than 30–50 words.  If you disagree, find some counter-examples of high quality questions that the site is better off for having that are so short they would have been automatically rejected. And make sure they're from new users, because obviously we could loosen the restrictions once someone hits 1k, 2k, or 5k reputation.  NB: I am strictly proposing that we do this on Stack Overflow. I realize that some of the other SE sites might not agree with the heavy-handedness of this approach. There might even be useful questions that can be asked on those sites that contain less than 30–50 words. I don't think that applies to SO.  If their community moderators decide that they want the big guns our quality filters turned on, they can ask for them. Otherwise, the traffic is generally low enough there that these questions can be improved or disposed of. That strategy isn't working for SO. It's like drinking from a fire hose there. Even though most of these poor quality questions do eventually get purged, the overhead on our users is too great.  What do we stand to lose? And should we care?


How to start Ubuntu installer in a graphical safe mode?

I am trying to install Ubuntu 11.10 on a Dell OPTIPLEX 3010 IvyBridge and when I start the setup, the screen goes awry with a lot of colored patterns.  Is there a way to start the installer in text mode or a graphical safe-mode?  On Ubuntu 11.04, it works well.


Is the influence of gravity greater than light?

As the influence of gravity is infinite throughout the universe.is the influence of its force on a body very far away faster than the speed of light.suppose a star dies...is the influence of its gravity on us proportional to the light the we are seeing or is its diminished gravity influencing us faster than the light that is reaching us


How do plant cell divide without centrioles?

Most plants do not have centrioles, so what organelle enables them to multiply?


How to hide column in JasperReports at runtime?

I am creating one jasper report by connecting it with database. In which I have to hide table column depending upon the data I get after executing the query. How to do that?


Smallest n>0 such that $2001^n-1\:%$ is divisible by $\:2^{2002}$, can you give me some hints as to what theorem/algorithm to use to approach this problem?


Single a single material across several objects with individual control

Is it possible to share a single material across several objects but have control over some aspect of the material (e.g. factor on a fade node) on individual objects. Each object can be associated with an individual FCurve. I am currently building N identical materials for N objects, but its getting old. Thanks.


Is my statement fully secure enough (PDO) to prevent against malicious activity

is this all i need to protect myself from sql injections etc?      $statement = $db->prepare( "INSERT INTO blogs (blogtitle, blogdesc, coverimage, userID, frontpage, tags)  VALUES (:buildtitle, :builddesc, :buildcover, :userid, :frontpage, :addtags)" );  if ($statement->execute(array( ':buildtitle' => $_POST['addbuildtitle'],  ':builddesc' => $_POST['addbuilddesc'],  ':buildcover' => $_POST['addbuildcover'],  ':userid' => $_POST['adduserid'],  ':frontpage' => $frontpage,      ':addtags' => $_POST['addtags'])));   Anything else i should add or any other type of malicious activity i should be aware of?


I have a code with sections, subsections, enumerations in two-columns style:  \RequirePackage{fix-cm} \documentclass[fontsize=8.5pt,DIV=calc]{scrbook} \usepackage[T1]{fontenc} \usepackage[ngerman]{babel} \usepackage[utf8]{inputenc} \usepackage{helvet}  \usepackage{geometry} \geometry{a4paper,left=15mm,right=15mm, top=26mm, bottom=17mm}   \renewcommand{\familydefault}{\sfdefault} \usepackage{multicol}  \usepackage{xcolor}  \usepackage{mdframed}    \usepackage{paralist}      \setlength\parindent{0pt} \setlength\columnsep{5mm}  \renewcommand\familydefault{\sfdefault} \renewcommand{\labelitemi}{\textcolor{black!60}{\raisebox{0.5mm}{\rule{1.8mm}{1.8mm}}}} \newcommand{\zitiert}[1]{\flqq{#1}\frqq}  \usepackage{enumitem} \setitemize{leftmargin=*}  %FOR GREY RECTANGLE \addtokomafont{section}{\large} \makeatletter \renewcommand\sectionlinesformat[4]{%   \ifstr{#1}{section}     {\setlength\fboxsep{1.75mm}%       \colorbox{black!15}{\raisebox{0pt}[\height][0pt]{%         \parbox[b]{\dimexpr\linewidth-2\fboxsep\relax}{%           \raggedsection\@hangfrom{\hskip#2#3}{#4}%     }}}}     {\@hangfrom{\hskip#2#3}{#4}}% } \renewcommand\sectionformat{%   \makebox[10mm][r]{\thesection\autodot\hspace{5mm}} } \makeatother  \usepackage{lipsum}  \begin{document} \begin{multicols}{2} Some random text.... \subsection{One}  \section{Two}  \subsection{Three}  \lipsum[1] \subsection{Four}  \lipsum[1] \subsection{Five}  \lipsum[1] \subsection{Six}  \lipsum[1] With an enumeration: \begin{compactenum}[a)] \item \lipsum[1] \item \lipsum[1]  \end{compactenum} \ \\ \lipsum[1] \end{multicols} \end{document}   Unfortunately, the rows of the two columns are not on the same "level" (as you can see in the picture below - marked with the red line).   Is there a way (general) way to solve this problem?


How do I calculate if a spell hits and how much damage it does?

I'm not entirely sure I understand what the PHB is telling me about spell attacks.  Say I'm a wizard who's casting Fire Bolt (I could also be a Cleric casting Inflict Wounds or what-have-you), the spell itself doesn't say anything about making an attack roll or the enemy making a saving throw.    So do I make an attack roll and then add in my INT mod + proficiency bonus?  Or does the target have to make a saving throw against a DC of 8+ my INT mod + proficiency bonus?  And, assuming I hit, do I add my INT mod + proficiency bonus to the damage?


How to optimize images to improve pagespeeds / webpage loading times?

This is almost a StackOverflow question, however it's completely related to Photoshop and other tools. With every Pagespeed test I do for all my website I get the comment "Optimize images by lossless compressing image X" which often increases my page rank a lot.  I already save EVERY image with 'save for web' with Photoshop, but I was wondering how I could "Optimize images by compressing lossless" even more. As far as I know I'm already doing everything I can.   How can I optimise images to improve my webpage loading speeds?


How can I add an entry for Ubuntu to the Windows 7 boot menu?

I have the following setup:  first partition is windows 7 partition second partition - ubuntu 12.04 partition  while installing ubuntu I installed grub2 bootloader to ubuntu partition  mbr contains windows bootloader  I have tried using EasyBCD to add entry to windows boot menu, with no luck - this entry just boots into grub4dos command prompt  how to add Ubuntu to windows boot menu?  please do not suggest installing grub2 to mbr or wubi..    Update:  I followed the instructions to install EasyBCD and add an entry to Windows boot menu to boot Ubuntu step by step. When I reboot both the NeoGrub Bootloader and the Ubuntu menu items take me to the screen below.


Generalized set of Pauli elements for a basis for the linear transformations on the vector space

I have been doing some practice problems from "Gentle introduction to Quantum Computing". I am a little bit lost with this one:  The generalized Pauli group $\mathcal G_n$ is defined by all elements of $\mathcal G_n$ being of the form $\mu A_1\otimes A_2 \otimes \ldots\otimes A_n$ where $A_j\in\left\lbrace I, X, Y, Z\right\rbrace$ and $\mu\in\left\lbrace 1, i, -1, -i\right\rbrace$.     Show that generalized set of Pauli elements for a basis for the linear transformations on the vector space associated with an n-qubit system.   Is there any formal proof for this problem? And how do I approach it?


What's the difference between poweroff and halt?

To turn off my system, I can use one of these three commands:  sudo halt   Or:  sudo poweroff   Or:  sudo shutdown -h now   What are the differences between these commands, or are they all just aliases of each other?


Is it possible to hear music discs on Minecraft Bedrock/Pocket Edition?

I have some music discs, but every time I put it in a jukebox I can't hear it. It says it's playing, my friend (on PS4) says he can hear it, but I don't. All other audio is fine, I can hear the game audio fine, even if I have a world that's only me: it still doesn't produce jukebox sounds. It visually shows that it's playing (the notes come out of the jukebox) but there is no music. I play on Pocket Edition. Can someone help me resolve this issue?


Correct attribution is not possible on some websites

When posting user content from the Stack Exchange Network onto some other websites, it is not possible to be in compliance with the attribution requirements set forth in the Terms of Service.  Examples include:     embedded URL's in non-HTML documents, such as source code   websites that do not allow hyperlinks   websites that `nofollow` all hyperlinks   websites that do not allow URL's in non-obfuscated form   Currently user content from the Stack Exchange Network cannot be used on such websites. Is this intentional, or is this a mistake in the Terms of Service? If the latter, does it need to be changed?


How can I insert symbols on iPad or iPhone?

How can I insert symbols like copyright or degree symbols?


Finding the x values of a quadratic that has many different variables

I am currently struggling to figure out how to solve this problem as I study for an algebra exam. The math problem is: The two solutions of the quadratic equation $3x^2 - x + k = 0$ are $\frac{p}{4}$ and $p + 1$. Determine the values of $k$ and $p$. I am not sure how I am supposed to approach the problem, as I have tried every method I could think of. Would be great if anyone can help!


Creating a roughness ASCII file from a raster dataset

I'm trying to create a roughness file (derived from topography) in the ASCII format for a European raster dataset. This dataset is from the EEA. I've already made an ASCII grid file of the raster data as a whole (euroascii.asc) using the command: gdal_translate -of AAIGrid ~/elevation3x3/elevation3x3.tif euroascii.asc The roughness file has to be continuous (AKA 0.1, 0.2, 0.3, and so on), and has to account for every value that is already in the euroascii.asc file. There is a command that is meant to do just this (I think), but I've tried it in the QGIS Python Console and it doesn't work. This is what I've done in the QGIS Python Console, taken direct from the manual: import processing # this gets no errors or anything out And also: from qgis import processing for alg in QgsApplication.processingRegistry().algorithms():         print(alg.id(), "->", alg.displayName()  To test whether this has any effect, I tried the code from  processing.runalg('gdalogr:roughness', EEAdata, 1, compute_edges=F, roughnessFile) Which gets the error: AttributeError: module 'qgis.processing' has no attribute 'runalg' I'm only using QGIS Hannover, with no access to ArcGIS or any other commercial software. I'm also running this on Ubuntu 18.04.


Error while installing Shutter on Ubuntu 12.04!

I tried to install shutter with the following command, but I am receiving an error:  $ sudo apt-get install shutter Shutter:  Depends: gnome-web-photo but it is not installable Depends: libgnome2-perl but it is not installable Depends: libgnome2-vfs-perl but it is not installable Depends: libgnome2-wnck-perl but it is not installable Depends: libgoo-canvas-perl but it is not installable Depends: libgtk2-imageview-perl but it is not installable Depends: libgtk2-trayicon-perl but it is not installable Depends: libgtk2-unique-perl but it is not installable Depends: libnet-dbus-perl but it is not installable Depends: libproc-processtable-perl but it is not installable Depends: libwww-mechanize-perl but it is not installable Depends: libx11-protocol-perl but it is not installable Depends: libxml-simple-perl but it is not installable Depends: perlmagick but it is not installable Depends: libpath-class-perl but it is not installable Depends: libjson-perl but it is not installable Depends: libjson-xs-perl but it is not installable Depends: libnet-dropbox-api-perl but it is not installable Depends: libfile-which-perl but it is not installable Depends: libproc-simple-perl but it is not installable Depends: libsort-naturally-perl but it is not installable E: Unable to correct problems, you have held broken packages.   How can I fix this?


Sorting Hashmap based on value Not sorting properly giving some unexpected output?

This is my demo.jsp page,  <%         String key = request.getParameter("key");                    String[] keyArray = key.split(",");                    HashMap<String, String> map = new HashMap<String, String>();         for (int i = 0; i < keyArray.length; i++) {             map.put(+i + "", keyArray[i]);                        }         CommonFunction cf = new CommonFunction();         cf.sortByValues(map);         Set set2 = map.entrySet();         Iterator iterator2 = set2.iterator();         while (iterator2.hasNext()) {             Map.Entry me2 = (Map.Entry) iterator2.next();                          out.println(me2.getValue());         } %>   Here keyArray contains "similar,rahul,hashmap,linkedlist,demo,ab"; for this i need to sort according to length or according to string starts with character. and common functions is   public class CommonFunction {  public HashMap sortByValues(HashMap map) {     List list = new LinkedList(map.entrySet());     // Defined Custom Comparator here     Collections.sort(list, new Comparator() {         @Override         public int compare(Object o1, Object o2) {             return ((Comparable) ((Map.Entry) (o1)).getValue()).compareTo(((Map.Entry) (o2)).getValue());         }     });      HashMap sortedHashMap = new LinkedHashMap();     for (Iterator it = list.iterator(); it.hasNext();) {         Map.Entry entry = (Map.Entry) it.next();         sortedHashMap.put(entry.getKey(), entry.getValue());     }     return sortedHashMap; } }   this code working(sorting) fine when i gave eg:b,c,a,d showing output a b c d but when i gave String as "similar,rahul,hashmap,linkedlist,demo,ab" showing output aslinkedlist hashmap rahul similar ab demo` ,so can anybody help me where to change the code.


How to show popup after user connect to my WiFi hotspot?

So we know we can use create New WiFi network option under wifi menu in Linux desktop to broadcast the WiFi out with custom name&passowrd like the picture below  But is it possible to throw a popup to user when the connection established (first time)? Like what free wifi do, popup a page which require you enter login credential or click ad before you got internet access.  If yes, how?


I want to code a personal modloader for minecraft (create files , download files, sort files, etc) and the first window which is created is a JOptionPane which asks for a Version (i do not code in java really long, i don´t use spinner, just a "msg dialog" asking for a version). The code is:  public JOptionPane version = new JOptionPane(); public String modversion;  public Version() {     showVersion(); }  public static void main(String[] args) {  }  public void showVersion() {     //input = version     String vers = version.showInputDialog("Welche Version soll modifiziert werden?");      if (vers.equals(null)) {             return;     } else {          if(vers.equals("1.5.2") || vers.equals("1.6.2") || vers.equals("1.6.4") || vers.equals("1.7.2") || vers.equals("1.7.10") || vers.equals("1.8") || vers.equals("1.8.9") || vers.equals("1.9") || vers.equals("1.10.2") || vers.equals("1.11.2"))         {            //mod version is saved as String (title for the config list)              modversion = vers;             return;         } else  {            // with incompatible input the method will be repeated             JOptionPane.showMessageDialog(null, "Diese Version wird leider nicht supportet");             showVersion();         }     } }   If you just press "Ok", the input would equal "null":  if (vers.equals(null)) {             return;     }   but it don´t quit the method, it says NullPointerException. Why doesn´t it just quit the method?


What is role-playing, and where do I start?

I have been told that roleplaying is great fun. I've looked and looked and it all seems so complicated. Could anyone tell me a good place to start, and what sort of things you end up doing in roleplaying?


Prove for arbitrary tournament $T$ that $\sum_{x \in V(T)} \operatorname{outdeg}(x)^2 = \sum_{x \in V(T)} \operatorname{indeg}(x)^2$

I had several ideas of proving that My main idea was to prove we gonna have same numbers that we just gonna summarize in different order. (Which, in fact, wasn’t correct) Firstly I was trying to prove that there don’t exist a tournament that has two vertexes with equal $\operatorname{indeg}$. In fact, I found easy counterexample. Secondly I was trying to prove that there always exist “asymmetrical” vertex. What I mean is: let first vertex have $\operatorname{outdeg}$ that equals $a$, then (by my assumption) there exists vertex that has $\operatorname{indeg}$ that equals $a$. Found counterexample pretty easy either. So, I got stuck... All help will be much appreciated!


What's the difference between using application/csv vs text/csv?

What's the difference between using application/csv vs text/csv as the HTTP Accept Header?


What Happened to The Latex Symbols In the Libreoffice-Texmaths Equation Editor?

I recently purged Libreoffice because it was buggy.  I then reinstalled the latest version from apt and now it's missing the symbols above the equation editor.  Here is the current Texmaths equation editor:   There used to be shortcuts for latex including frac{}{} and various set theory operations, as well as the binomial distribution on the top of the window.  What happened to them and how do I get them back? I just figured that they were in some package and installed all packages useing sudo apt install libreoffice*, but this didn't help after I refreshed the program.  EDIT 0: I'm using Kubuntu 19.04  sarah@LesserArk:~$ sudo apt-cache policy libreoffice-texmaths libreoffice-writer texlive libreoffice-texmaths:   Installed: 0.43-2   Candidate: 0.43-2   Version table:  *** 0.43-2 500         500 http://us.archive.ubuntu.com/ubuntu disco/universe amd64 Packages         500 http://us.archive.ubuntu.com/ubuntu disco/universe i386 Packages         100 /var/lib/dpkg/status libreoffice-writer:   Installed: 1:6.2.2-0ubuntu2   Candidate: 1:6.2.2-0ubuntu2   Version table:  *** 1:6.2.2-0ubuntu2 500         500 http://us.archive.ubuntu.com/ubuntu disco/main amd64 Packages         100 /var/lib/dpkg/status texlive:   Installed: 2018.20190227-1   Candidate: 2018.20190227-1   Version table:  *** 2018.20190227-1 500         500 http://us.archive.ubuntu.com/ubuntu disco/universe amd64 Packages         500 http://us.archive.ubuntu.com/ubuntu disco/universe i386 Packages         100 /var/lib/dpkg/status


Correct me if I am wrong:  If I remember correctly, a command in terminal is linked to a specific executable(or maybe a script is also allowed?) in filesystem/disk.  For example, python runs python2.7 and python3 runs python3.   Now the problem is that I install 2 packages with same terminal command.  pip install packageA pip3 install packageA   They both has the command packageACommand run. So I want to check the current packageACommand command infomation to see which python/what environments it's using.  And generally, I am wondering how can I view a command's (meta) information? Like checking what it acutally does/linked behind the scene?


I am running xCode projects on mac in my office ,but i want to work at home too, i surfed a lot But only heard one way to run mac on windows is by using VM , is there any other hack or way to run properly on windows .  if it is can only happen through VM does ios SDK works properly on VM.


My roommates and I were looking at dutch redband treasure chest candies . One pack contains 14 chests with candy as treasure inside. On the face of every chest is 1/12th of a treasure map displayed. in other words, when you have 12 distinct pieces of the map, you have completed the "puzzle". We were wondering, what is the probability that you receive a full map in one pack? We assume that:  the supplier does fill the packs randomly and the supplier has an infinite supply of every map piece  So as a more general problem: We have a 12 sided dice, which is thrown 14 times. What is the probability that we get each face of the dice at least once.


How do I write folder-agnostic shell script on Mac as I can do in Windows?

I would like to write a set of shell scripts which would execute smoothly on Mac disregarding where they are called from.  I am currently struggling about how to implement this.  On windows, I could write three batch scripts  A.bat in folder A B.bat in folder Subfolder, which is subfolder of A and which path is A/Subfolder C.bat in folder Subfolder, which is subfolder of A and which path is A/Subfolder  In A.bat I could write  call Subfolder/B.bat   in B.Bat I could write  call C.bat   and both scripts A and B would execute successfully.  On Mac, however, I have to prepend ./ to every script so that it is recognized as script.  So when I write in a.sh code:  Subfolder/b.sh   and then in b.sh code  ./c.sh   when I execute ./b.sh from terminal it is executed successfully.  However, when I execute ./a.sh from a parent folder in terminal, it fails with error   ./a.sh Subfolder/b.sh: line 1: ./c.sh: No such file or directory    Is this possible on Mac to write a code in b.sh which would execute disregarding if it is called from the current folder or from the parent folder?


Let $f:A \to B$ and $g:B\to A$ be arbitrary functions.

Hi I have been stuck on the following problem for quite some time now I don't find the trick to solve it. Any help would be much appreciated.      Let $f:A\to B$ and $g:B\to A$ be arbitrary functions. Show that there are subsets $A_1,A_2\subseteq A$ and $B_1,B_2\subseteq B$ such that $A_1\cup A_2=A$, $A_1\cap A_2=\varnothing$, $B_1\cup B_2=B$, $B_1\cap B_2=\varnothing$, and $$f(A_1)=B_1,\qquad g(B_2)=A_2\;.$$ Use this to give an alternative proof of the Cantor-Schröder-Bernstein theorem.


Create Illustrator document without defined document/canvas size?

Does anyone know if it's possible to create a new document in illustrator that is boundless? And once you have entered all the content you define the size before exporting?


I have these type of strings: IN PATIENT ADVANCE DEPOSIT                         DEPOSIT AFTER DISCHARGE - SAME FINANCIAL YEAR      DEPOSIT AFTER DISCHARGE - PREVIOUS FINANCIAL YEAR  CASH RECEIVED AGAINST CREDIT MEMO                  DONOR INVESTIGATION-SIHF/CM FUND         [1]          AMEDA BREAST PUMP A/C ADVANCE                      FOR OPD PROCEDURES/PACKAGE A/C ADVANCE             FREEZER A/C ADVANCE                                IMPREST A/C ADVANCE                                O.T. BOOKING A/C ADVANCE                           AMEDA BREAST PUMP A/C REFUND                       FOR OPD PROCEDURES A/C REFUND  .........upto 7000 strings.  I want to append in list output ["DEPOSIT AFTER DISCHARGE - SAME FINANCIAL YEAR","DEPOSIT AFTER DISCHARGE - PREVIOUS FINANCIAL YEAR CASH RECEIVED","AGAINST CREDIT MEMO".......]  please tell me how can i do this in python


Android: Nesting for loop in Switch statement to get sum of ArrayList

I'm trying to get the numerical sum of an ArrayList called proStarsArray when the okDone button is activated, and send that data as a string to my next activity to be printed via a TextView. I receive no warnings when the for loop is added to the okDone button's case in the code, but when I test the app, it crashes as soon as the the okDone button is activated.   I've tried creating an if statement, and formatting the for loop without brackets around the "do this" section of the statement, to no avail. It still crashes as soon as I try to start the next activity. I'm not seeing the likely, ridiculously simple solution to this problem of mine. Please help me dudes.  Here is the code from the activity in question.  package com.progolferrating.progolferrating;  import android.app.Activity; import android.content.Intent; import android.os.Bundle; import android.view.View; import android.widget.Button; import android.widget.RatingBar; import android.widget.TextView; import java.util.ArrayList; import java.util.List;  public class ProsGolfer extends Activity implements View.OnClickListener {      RatingBar ratingBar1;     TextView tvproResult;     Button enterMore;     Button okDone;     Double sum;      float[] proHolder = new float[1];     List <Double> proStarsArray = new ArrayList<>();      //Some methods have been omitted for this display      @Override     public void onClick(View v) {         switch (v.getId()) {             case R.id.enterMore:                 proStarsArray.add(Double.valueOf(proHolder[0]));                 tvproResult2.setText(String.valueOf(proStarsArray));                 break;   The code in question below              case R.id.okDone:                  for (Double temp : proStarsArray) {                      sum += temp;                  }                  Intent intent = new Intent(ProsCons.this,FinalStars.class);                  intent.putExtra("sumProArray", sum.toString());                  startActivity(intent);                  break;         }     } }   Here is the Exception log  09-11 21:10:12.517  24921-24921/com.verdictdecision.verdictdecision E/AndroidRuntime﹕ FATAL EXCEPTION: main Process: com.verdictdecision.verdictdecision, PID: 24921 java.lang.NullPointerException     at com.progolferrating.progolferrating.ProsGolfer.onClick(ProsGolfer.java:86)     at android.view.View.performClick(View.java:4480)     at android.view.View$PerformClick.run(View.java:18673)     at android.os.Handler.handleCallback(Handler.java:733)     at android.os.Handler.dispatchMessage(Handler.java:95)     at android.os.Looper.loop(Looper.java:157)     at android.app.ActivityThread.main(ActivityThread.java:5872)     at java.lang.reflect.Method.invokeNative(Native Method)     at java.lang.reflect.Method.invoke(Method.java:515)     at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:1069)     at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:885)     at dalvik.system.NativeStart.main(Native Method)


I got used to being able to submit forms using the Ctrl+Enter key combination. Could it be made that Ctrl+Enter submits the form after typing in an answer (and question, if title and tags are set)?


I have two MacBook Pros (one for work; one personal) that I want to connect to one monitor, one keyboard, and one mouse, and be able to switch between the two easily. Typically I'd opt to purchase a KVM switch, but it's been a while since I've needed that type of setup. My questions are:   Are KVM switches even needed anymore for MacBook Pros? Is there some sort of magic Wi-Fi / Bluetooth / Airplay device that can perform the same function? If KVM switches (or something similar) are still used, what's a good make / model that works well with Macbooks? Is a hardware solution even needed anymore? Is there software that can perform the same functions? (For example: Logitech Flow )   Thank you!


Why is it true that $\lim_{n\to\infty} \left(\int_a^b \left|f(x)\right|^ndx\right)^{1/n} = \text{sup}\{\left|f(x)\right| : x \in [a,b]\}$?

Can someone explain the intuition behind this/ what the proof might look for this?  If $f$ is a continuous, real-valued function on $[a,b]$, then \begin{equation} \lim_{n\to\infty} \left(\int_a^b \left|f(x)\right|^ndx\right)^{1/n} = \text{sup}\{\left|f(x)\right| : x \in [a,b]\} \end{equation}  It seems like it's a way of averaging $\left|f(x)\right|$, similar to how the Lyapunov number is an average of all the slopes of an orbit in a dynamical system.


If $P$ is a fifth degree polynomial such that $P(k)=\frac{k}{k+1}$ for $k=0, 1, 2, 3, 4$ and $5$, then find $P(6)$.

So I let $P(x)=ax^5+bx^4+cx^3+dx^2+ex+f$, and obviously $f=0$. Then, $2^5a+2^4b+2^3c+2^2d+2e={1\over 2}$ $3^5a+3^4b+3^3c+3^2d+3e={2\over 3}$ $4^5a+4^4b+4^3c+4^2d+4e={3\over 4}$ $5^5a+5^4b+5^3c+5^2d+5e={4\over 5}$ and we are looking for $6^5a+6^4b+6^3c+6^2d+6e=$ Then I got stuck... Could anyone at least give me some hints or methods to continue?


How do I set system-wide proxy servers in Xubuntu, Lubuntu or Ubuntu Studio?

I cannot find the proxy settings anywhere. Do I have to set it through terminal, through gconftools or is there some GUI present for it?


I am writing a piece of software that requires the use of a class in another file. When I run the program and put in a value, I get the error Exception in thread "main" java.lang.NullPointerException class. Here is my code:      package chap8lab.salesperson;  import javax.swing.JOptionPane;  public class Chap8LabSalesPerson {  public static void main(String[] args) {     final int LIMIT = 10;     Salesperson[] peep = new Salesperson[LIMIT];     int i = 0, a = 0;     String q = "q", strInput = "";       JOptionPane.showMessageDialog(null,         "This program collects salesperson data.");         while (!strInput.equals(q))         {         strInput = JOptionPane.showInputDialog(null,                 "Enter sales person ID (\"q\" to quit)");         if (!strInput.equals(q) && !strInput.matches("[a-z][A-Z]"))         peep[i].setEmpID(Integer.parseInt(strInput));         if (!strInput.equals(q))         strInput = JOptionPane.showInputDialog(null,                 "Enter sales amount (\"q\" to quit)");         if (!strInput.equals(q) && !strInput.matches("[a-z][A-Z]"))           peep[i].setSalesAmt(Double.parseDouble(strInput));         i++;         if (strInput.equals(q))             i--;         }         while (a < i)         {             JOptionPane.showMessageDialog(null,                      "Employee ID: " + peep[a].getEmpID()                     + " Sales Ammount: " + peep[a].getSalesAmt() + "\n");          a++;         }         JOptionPane.showMessageDialog(null,                      "Thank you for using this program.\nHave a nice day!");     }  }   Here is my class file Salesperson.java:       package chap8lab.salesperson;  public class Salesperson { private int empID; private double salesAmt;  public Salesperson() {     empID = 9999;     salesAmt = 0; }  public void setEmpID(int newEmpID) {     empID = newEmpID; }     public int getEmpID() {     return empID; }        public void setSalesAmt(double newSalesAmt) {     salesAmt = newSalesAmt; }   public double getSalesAmt() {     return salesAmt; }  }   Any help is greatly appreciated.


What's the relation between virtual photons and electromagnetic potentials?

Given that:  1) virtual photons mediate the electric and magnetic force fields  2) the magnetic field is the curl of the magnetic vector potential  3) the electric field is the negative gradient of the electric scalar potential  How do we understand the vector and scalar potentials in terms of virtual photons?   Specifically, I mean curl-free magnetic vector and gradient-free electric scalar potential fields, where no electromagnetic waves or physical forces are present.   For instance, what's actually happening outside of the solenoid in the Aharonov-Bohm experiment that alters the phase of the passing electron? Are virtual particles involved there? This question has really stumped me because I only have an undergrad level of understanding in physics. Thanks for any help.


It it possible to turn computer off and keep it off

OK, I'd like to implement some kind of 'child protection' for someone who acts like a child, to turn the computer off at night. I can easily put a shutdown command at 11pm in cron, but it's then easy to turn it back on.  I don't think it's possible to keep it off until the morning. Is it ? Any suggestion ? Put a shutdown command in the autostart that activates only at certain hours ?


I've got following sentence in a visa application form:     You are not required to provide a medical certificate or    Chest X-ray Certificate if you will be in New Zealand for less than six months.   I fully understand the meaning. But the sentence does not match the , and this confuses me.  So, the questions are:   Is this a legitimate use? Are there any grammatical rules in place?


How can I search for all accounts that are suspended on a specific site?

How do I search for all accounts that are currently suspended on a specific SE site?  What I have in mind is something in analogy to typing closed:1 into the on site search text field, which results in a list of all closed questions.  Does something like this exist to find all accounts that are currently suspended on a site?  I tried user:supended=1 on a site where I know at least one user who is currently suspended, but obtained a null result that is obviously not true ...


Reclassifying raster data that falls within polygon using ArcGIS Desktop?

Thansk I'm using ArcGIS 10.   My task is to map forest cover with the image classification tool. The problem is some of the patches of forest are dark and are been classified as cloud shadows in the image classification. I need to convert raster values that represent cloud shadows into the raster value for forests. But only only want to do this for an area that falls within in a polygon.   Is there way to reclassify a raster but only the cells that fall within a polygon?


Transit Visa for Nepalese citizen in Toronto Pearson International

I am travelling to United States and on my return will be transitting through Toronto Pearson International and transit hours is 3 hours 41 min. Do I need a visa in Toronto Airport? I am a Nepalese Citizen and I hold U.S visitor visa for 5 years.


Is sequence $x_n=\sum_{i=1}^n \sin(i)$ a Cauchy Sequance?


Prove by induction $2^n > 2n+1$ for all $n \geq 3$

Base case   $n=3$ - true  Inductive Step  Assume that for every $k \geq 3$, $2^k>2k+1$ show that $P(k+1)$ holds, that is show that $2^{k+1} > 2k+3$  $2^{k+1} = 2^k*2 > (I.H) (2k+1)*2 > (k+2)*2 = 2k+4 > 2k+3$  Did I do this right? I am asking because I am not sure about $(2k+1)*2 > (k+2)*2$ step


I would like to know where I could find an installer for MiKTeX embedding all existing LaTeX packages (if it exists). I am going to install LaTeX on a computer which will not ever be connected to Internet, and which won't allow amovible media (USB key/CD-ROM/...) as soon as everything is set up. So basically, I have to do a "one-shot" installation. I still do not know my needs in term of LaTeX packages, so I am wondering if a version of MiKTeX embedding all existing LaTeX packages existed.   I would like to install it on a Windows computer.


Rest api - Query Multiple Sharepoint lists for a listitem with a given property value

I have 3 sharepoint lists with the same columns. I need to fetch the list items with a particular property value, eg. CustomName property with value 'Test' from all the 3 lists. Instead of looping through each list I would like to retrieve all the list items with a single call.  The Rest api to fetch an item from a given list is below  http://server/_vti_bin/listdata.svc/TestList?$Filter=Title eq 'Test1'   But this means I have to make 3 calls, once for each list. Is there an API that I could use to query across all or multiple lists?  There is already a post explaining how to do this using the search API in sharepoint 2013. We are looking for a solution in Sharepoint 2010.


How to measure the mass of the electron?

I've done a little bit of research and it seems Millikan was able to measure the ratio between the charge of the electron and its mass. But how can one measure one of the two constants to get the value of  the other?


Having a hard time understanding package-manager repositories?

I'm currently starting to play around in the Terminal (MacOS), and learning to get the most out of it. I knew Homebrew was a very populair alternative package-manager on MacOS, so I decided to look into it.   I get the software installed, and everything is fine, and I can use it. But there is generally two things that I have a hard time figuring out.   Generally I can't wrap my head around where package-managers get their packages from? As an example if I were to download firefox on via APT or HB, where do their get the packages from?  apt-get install firefox brew cask install firefox   When I go to Mozillas webpage and download Firefox I know they simply have the file on one of their servers, but is that also the case with the above? And in which case, is it the original developers server or maybe github as it seems to be with HB?  Also, when I download a file from the website, I generally know that Mozilla is a company with a good rep, and their files are safe. But how can I make sure the files I get via APT or HB is safe as well?  PS. I understand that it has something to do with the SHA keys that will have to match.


Order of figure and figure* - figure* either goes to next page or order reversed

I have a two-column document.  Figure 1 I would like in-line with the text followed by a figure* on the bottom of that same page.  When I put the two figures in order and bunch them as close as possible (below each other), the figure* gets pushed to the bottom of the NEXT page.  But if I move the figure* higher in the document I get the right placement but the wrong ordering of the captions.  Any ideas to fix?  \documentclass{vgtc}     \usepackage{float}  Figure \ref{fig:1} displays .....     \begin{figure}[H]    \centering   \includegraphics[width=0.6\columnwidth]{Figure1.eps}   \caption{\label{fig:1} View.} \end{figure}  \begin{figure*}[bh]    \centering   \includegraphics[width=\textwidth]{Figure2.eps}   \caption{\label{fig:2} Use case.} \end{figure*}


Does commutativity imply associativity? I'm asking this because I was trying to think of structures that are commutative but non-associative but couldn't come up with any. Are there any such examples?  NOTE: I wasn't sure how to tag this so feel free to retag it.


I've seen that the <kbd> element is used in a lot of questions and is used to reference a tag. But I've also seen questions that use [tag:tagname] for the same purpose. They look a little bit different (sometag vs ), but they seem to be used for the same purpose.  When should I use each of these?


Will the static variable declared in a recursive function be destroyed once the first return executes? For example:    int func(int x) {     static int n;     // recursive call }


My DEM raster coordinates are in WGS84: 45.4763884,-121.5736061 and vertical units are in feet I believe. I want to do a slope analysis.  Do I need to add scale factor?  I have been seeing different answers all over and am confused.


I know how to split a window (dragging the window splitter widget in the top right or bottom left of a window), but how do I   undo it?


Why nano is not updated along latest release with global

I am using Ubuntu 20.04 LTS the nano I have is v4.8 The global version is 4.9.3 Why it is not updated


(Java Minecraft 1.14.3) Can a bossbar show different values to different players?

I would like to use a bossbar, with value set with execute store result bossbar, to hold the 'mana' value for each player in my datapack (which is held in a scoreboard so it can be manipulated in the background by various functions).  However, I can't find an option for which player's value to set, and can only find a setting for which players the bossbar is visible for. Are bossbar values global or would I need to make one bossbar per player that I want to display a mana amount for?  If bossbar values are global, what alternatives are there for making some type of bar type display? I don't want to use scoreboard numbers because they are ugly. I'm open to particles, resource packs, anything but mods really.


Find a unit vector and the rate of change

Could anyone help me answer this question? Or point me in the right direction?  Find a unit vector in the direction in which f increases most rapidly at P and find the rate of change of f at p in that direction.  $$f(x,y) = \sqrt{\frac{xy}{x+y}}; \qquad P(1,1)$$


If Back to the Future uses different timelines, why did Marty begin to fade?

I think it's well established that for the basic premise in the Back to the Future Trilogy to work, we have a system of alternate timelines.  If this is the case though, then why would Marty in Back to the Future (the original) begin to fade?  Logically, there would simply be no Marty in the alternate timeline created when Marty travels back to 1955 for the first time; why should this affect the original Marty from the original timeline?


How are quantum gates realised, in terms of the dynamic?

When expressing computations in terms of a quantum circuit, one makes use of gates, that is, (typically) unitary evolutions.  In some sense, these are rather mysterious objects, in that they perform "magic" discrete operations on the states. They are essentially black boxes, whose inner workings are not often dealt with while studying quantum algorithms. However, that is not how quantum mechanics works: states evolve in a continuous fashion following Schrödinger's equation.  In other words, when talking about quantum gates and operations, one neglects the dynamic (that is, the Hamiltonian) realising said evolution, which is how the gates are actually implemented in experimental architectures.  One method is to decompose the gate in terms of elementary (in a given experimental architecture) ones. Is this the only way? What about such "elementary" gates? How are the dynamics implementing those typically found?


If statement for a string from a JTextField

So, I have a small application and I made an "extra" JTextField for the user to input Yes or No if he wants extra data.  I use this method:   process(file.getText(), Integer.parseInt(aText.getText()),                     Integer.parseInt(bText.getText()), cText.getText(),                     dText.getText()); //dText is the one I have problems with   In   public void process(String name, int a, int b, String obs, String extra) { ... }   I wrote this  if(extra== "yes"){             writer.write("Success!");         }   but it is not working.  If I was to write just  writer.write(extra);   it would have worked, by that it means that it can read the text I input but still I can't use the If-statement. Am I doing something wrong or that is not possible at all?  here is my full code :   Sorry for my bad english.


What's the relationship between initial eigenvalues and sums of squared loadings in factor analysis?

On the one hand I read in a comment  that:     You can't speak of "eigenvalues" after rotation, even orthogonal   rotation. Perhaps you mean sum of squared loadings for a principal   component, after rotation. When rotation is oblique, this sum of   squares tells nothing about the amount of variance explained, because   components aren't orthogonal anymore. So, you shouldn't report any   percentage of variance explained.   On the other hand, I sometimes read in books people saying things like:     The eigenvalues associated with each factor represent the variance   explained by that particular factor; SPSS also displays the eigenvalue   in terms of the percentage of variance explained (so factor 1 explains   31.696% of total variance). The first few factors explain relatively large amounts of variance (especially factor 1), whereas subsequent   factors explain only small amounts of variance. SPSS then extracts all   factors with eigenvalues greater than 1, which leaves us with four   factors. The eigenvalues associated with these factors are again   displayed (and the percentage of variance explained) in the columns   labelled Extraction Sums of Squared Loadings.   That text is from Field (2013) Discovering statistics using IBM SPSS, and this diagram accompanies it.    I'm wondering     Who is correct about whether it's possible to speak of eigenvalues after rotation? Would it matter if it was an oblique or orthogonal rotation?   Why are the "initial eigenvalues" different from the "extraction sums of squared loadings"? Which is a better measure of total variation explained by the factors (or principal components or whatever method is used)? Should I say that the first four factors explain 50.317% of variation, or 40.477%?


What's the best way to get info about currently unmounted drives?

First, the situation:  I've got a Linux computer with two eSATA drive bays that accept removable SSD drives.  I'm trying to write a little GUI application that makes it easier for the user to mount/unmount/format/backup/etc the drives that he puts into these bays.  It all mostly works.  One small problem, however, is that I don't know how to find out any information about what's on the inserted drive(s) until after the drives have been successfully mounted.    So, for example, if the user inserts a drive that I can't mount (e.g. because it is unformatted, or formatted with an unexpected filesystem), all my app can say about it is "Drive failed to mount".  This isn't very satisfactory, because if the drive is unformatted, the user will probably want to format it... but if the drive contains data from an unrecognized filesystem, the user will probably NOT want to format it.... or at least, I want to be able to warn him that by doing so he'll be erasing potentially valuable data.  So my question is:  is there any method for querying some basic information (especially filesystem-type) from a drive that doesn't require that the drive already be mounted?  Or do I just have to try to mount it with various known filesystems until one of the mount attempts succeeds, and give a vague "be careful" message if none of them do?  In case it matters, the paths I use to mount the drives in the drive bays are:  /dev/disk/by-path/pci-0000:00:1f.2-scsi-2:0:0:0 /dev/disk/by-path/pci-0000:00:1f.2-scsi-1:0:0:0


I saw some  using the following way to output content of a file as the stdin of another command(in this case, it is sha256sum): echo "$(<sha256_file01) file01" | sha256sum --check  The intention is to output the content of file sha256_file01, together with another argument 'file01', and pipe to command sha256sum. My questions are:  Is this the ideal/efficient/correct way of using 'echo $(<filename)' ? any concern using $(<filename) this way ? Will it be better if we use  echo "$(cat sha256_file01) file01" |sha256sum --check   instead ?  Any specific scenario where using 'echo $(<somefile)' is necessary ?  This question is only to learn more on how to use bash in more efficient way, thanks for any sharing!


How can I pull slideshow filenames from the database using jQuery?

I've have a jQuery plugin I'm using in my Drupal 7 site to make a fullpage background slider. I load it from a javascript file. How can I get the image names from Drupal's database instead of having to manually edit the list of images in the javascript file?  Here's the .js I load in my theme:  (function($) {   Drupal.behaviors.BackgroundSlider = {     attach: function(context, settings){       $.backstretch([             "/sites/default/files/styles/background_transition/public/ba5933c356c60f895785da952f8ad3e4_0.jpeg?itok=PjRiZj-V"           , "/sites/default/files/styles/background_transition/public/8bad4c95b3776bed84222abe4c5288ba.jpeg?itok=cKq-2Dgj"           , "/sites/default/files/styles/background_transition/public/78cefce14e9d9a613b0bc1950da662c6.jpeg?itok=4pAyvgsM"           , "/sites/default/files/styles/background_transition/public/00336b1506db0487ea33af734abd3b16.jpeg?itok=QcS5dV2K"       ], {duration: 3000, fade: 750});     }   }; })(jQuery);


Crack in paint seems to be slowly getting longer

I have a crack in the paint that seems to be getting larger over the years.  It doesn't seem to be damp.  Could this be something serious or just shoddy installer work?


how do you determine the amount of RAM that will actually be used When referring to how a OS sees RAM

When choosing what RAM to install on a computer and what OS to run how do you determine the amount of RAM that will actually be used and not just recognized?  for example here is my machine:   How did the (3.15 usable) get calculated?


Can the output a list command contain permissions listed. For example, when executing find / -name filename 2> /dev/null and I get results, is it possible to have my results include the file permissions? Thanks in advance!


Please remove 'may already have an answer' from question

was voted to be a possible duplicate of .   Could the resulting notice please be removed? It is irrelevant and prevents people from actually reading the question since it looks like a real dupe.


How do I find the program that I installed?

I installed Google Earth last night and cannot this morning find it. Silly question but why is there not an icon for the program as that method seems nice and simple?


Is it really impossible to surprise someone with a full-round action?

Is it true that not even the person/creature/thing doing the initial action that starts a combat is able to use a full-round action?  According to all sources I can find, the initial attack already is part of the surprise round, so you're only entitled to a move action or standard action; but that leads to an (in my opinion) absurd scenario, so I just wanted to be sure whether there is something I'm missing:  Let's say sorcerer A is hiding in the bushes, 1HP left, waiting to finish sorcerer B (1HP left) off with magic missiles before B does the same to A. Then he suddenly spots sorcerer B - but sadly, he's some feet out of range. Now sorcerer A wants to use metamagic to double his magic missiles range and fire that on sorcerer B ... but now his magic missile takes a full-round action to cast, so sorcerer A cannot surprise sorcerer B with it anymore.  Is this interpretation right RAW-wise or am I missing something?


There exists $N\in \Bbb{N} $ such that $N>2$ and for all $n>N$,$\phi(N)<\phi(n)$ / $\{\frac {\phi(n)}n:n\in\Bbb{N}\}$ has finitely many limit points.

Let $\phi(n) $ be the cardinality of the set $\{a|1\le a \le n, (a, n) =1\}$ where $(a, n)$ denotes the $gcd$ of $a$ and $n$. Which of the following is not true? , (a) There exists infinitely many $n$ such that $\phi(n) >\phi(n+1)$. (b) There exist infinitely many $n$ such that $\phi(n) <\phi(n+1)$ (c) There exists $N\in \Bbb{N} $ such that $N>2$ and for all $n>N$, $\phi(N) <\phi(n) $ (d) The set $\{\frac {\phi(n)} n : n\in \Bbb{N} \} $ has finitely many limit points. $\bf{Try:} $ If we choose $n$ to be the primes $\ge 5$ then option (a) is correct. Also if we choose $n$ such that  $n+1$ are primes $\ge 5$ then option (b) is correct. I'm unable to prove or disprove the other two options. Please help. Thanks in advance.


Is it Possible to Delete Songs from iCloud without iTunes Match?

Edit in response to this question being a duplicate. This is not a duplicate as I am asking how to delete any song from any artist off of cloud storage, not just U2's Songs of Innocence. The link given that provides the supposed answer will only delete the U2 album, Songs of Innocence from the cloud storage. Yes, Songs of Innocence prompted me to try and delete songs from the cloud storage, but I have additional songs I want deleted. I have already detailed in my question how that link does not help me, nor solve this question, as it only works for the one U2 album.  I recently used iPad to listen to some music only to find out I had U2's Songs of Innocence album. I wasn't too bothered until one of their songs started playing. I decided I would like to delete their album from both the iPad and the iCloud. Also there were a few other songs I had purchased prior that I wanted to delete from both my iPad and the iCloud. Here is the list of things I tired to accomplish this feat.  1. I went online to see how to delete the album and was redirected here:  itunes.com/soi-remove  But, there are other songs in on my iCloud that I have purchased and I would like to delete. Which leads to number two.  2. I searched the web and found this:    Ultimately, the accepted answer in that thread was to do this:  Go to Settings > iTunes & App Stone and shut off Music under the SHOW ALL category. and Go to Settings > Music and shut off Show All Music.  That will hide the songs from your iPad (or other apple device) but it will not actually delete the songs from the iCloud. If I turn those settings back on, I will see those songs again.  3. I found this:    It details how to delete songs from the iCloud, but it requires iTunes Match and iTunes Match costs $24.99 a year. I'm not about to spend money to delete songs from iCloud that I purchased.  4. I tried 3rd party software.  I searched around the internet some more and ended up downloading the app Document 5 on my iPad, but that app was unable to even see the song files on iCloud (although the app can view and delete other types of files stored on iCloud).  5. I tried deleting the songs through my iCloud account.  I tried signing into iCloud.com from my computer and yet again, there is no way to view songs on your iCloud through your iCloud.com account. I can view other files, like documents and photos, and I can delete them, but I can't view or delete song files.  6. I searched apple.stackexchange.com and www.reddit.com/r/apple.  Basically, this leads to the same answers. I need iTunes Match and that costs money.    I want to not only delete the U2 album, but also other songs on my iCloud. Yes, I will most likely use the link to delete the U2 album, but am I really expected to pay money or use a special service when I want to delete other songs from iCloud?   I would like to be able to have control over the music I purchase and there are some songs that I would like to delete for good and not just hide them from view, knowing that I can just re-download them off the cloud at a later date. However, it seems Apple has made it so I cannot view or modify my song files on iCloud without either purchasing an iTunes Match subscription or using the U2 album removal link (which will only work for that album). So, I ask:  Is there any way to delete songs from iCloud without an iTunes Match subscription?


Deduce that there is a prime gap of length $\geq n$ for all $n \in \mathbb{N}$   Show that if $2^n - 1$ is prime, then $n$ is prime.   Show that if $n$ is prime, then $2^n - 1$ is not divisible by $7$ for any $n > 3$.       I'm not really sure how to do the first bit. For the second one, I'm not sure if this is correct but I have this: If $n$ is not prime, then $n = a b, a, b > 1$. Also $2^n - 1 = (2 - 1)(1 + 2 + 2^2 + .... + 2^{n-1})$. So if we substitute for $n = ab$, we get $(2^a)^b - 1 = (2^a - 1)(1 + 2^a + (2^a)^2 + .... + (2^a)^{b - 1})$ which is now composite and so if $n = ab$, then $2^n - 1$. This means that $2^n - 1$ is prime if $n$ is prime. For the last one, we have a hint "Follow the example in lectures to show that $2^n - 1$ is not divisible by $3$", but I missed this lecture and haven't had a chance to get the note, so can someone help me with the divisible by $3$ bit and then I can try the divisible by $7$ bit myself.   Thank you  EDIT: I found a simpler proof for the second bit online:     Supposed $n$ is composite, it can be then written in the form $n = ab, a, b > 1 \implies (2^a)^b - 1$ is prime with $b>1$ and $2^a>2$, contradicting statement $1$.   What is statement $1$? Maybe then I can understand why it contradicts it.


I just noticed today that if I click on "add comment" my cursor doesn't automatically jump to the newly opened comment box - I have to make a second click before I start typing. I think this just started happening today.


Does the Voice of the Chain Master invocation allow me to see through my familiar's senses without using an action?

After reading  and  about this topic, it's still unclear to me if the Voice of the Chain Master invocation lifts the requirement of spending an action to perceive through the familiar's senses.  The relevant part of the  spell says:     While your familiar is within 100 feet of you, you can communicate with it telepathically. Additionally, as an action, you can see through your familiar's eyes and hear what it hears until the start of your next turn, gaining the benefits of any special senses that the familiar has. During this time, you are deaf and blind with regard to your own senses.   The warlock's Voice of the Chain Master  says, in part:     You can communicate telepathically with your familiar and perceive through your familiar’s senses as long as you are on the same plane of existence.   They invoke  which, to me, doesn't clarify anything at all:     Voice of the Chain Master enhances the find familiar spell, which otherwise works as written for the warlock.   To me, "enhances the find familiar spell" could either mean solely that it increases the range at which you can perceive through the familiar's senses (or communicate telepathically), or that it both enhances the range and also removes the need to use your action to perceive through its senses. But again, this depends on how you read it.  Does Voice of the Chain Master remove the action usage requirement from find familiar? How are you arriving at that answer?


Is there a correlation between total neurons and intelligence?

Thanks for looking. First off, I am not a biologist, just a curious layman, so I apologize in advance if this isn't a "good" question.  Please don't downvote me into oblivion. I read today that the human brain has about 100 billion neurons and that got me wondering: is that number pretty standard for everyone or does someone like say, Einstein, have many more neurons than this daft poster. Question Is there a correlation between total neuron count and intelligence, or does intelligence depend more on the way neurons are used--or some other factor like previous experience--rather than their total count? Can this question be answered? There are two very valid points-of-view posted as answers below, but it sounds like we simply don't have a solid answer to this question at this point in time, so I hesitate to select a "correct" answer.


Compute $\sum\limits_{n=0}^{\infty}\frac{1}{(2n+1) . 4^n} $

$\displaystyle\sum_{n=0}^{\infty}\frac{1}{(2n+1) . 4^n} $  Can anyone tell me how to approach? It must be convergent as $\displaystyle\sum_{n=0}^{\infty}\frac{1}{4^n}$ is convergent. and answer will be less than 4/3. but how to approach I can not see?


I just installed Ubuntu 18.04 on my testbed laptop. Total fresh install (chose the 'minimal' option). The first two things I did were install R 3.5 and R Studio 1.1.453. If I open up a fresh install of R and just let it sit idle for 30 minutes or so I eventually get the error "Error: Unable to establish connection with R session".  At this point in time I can't do anything in R Studio and I have to xkill it and reload everything to continue programming. An internet search reveals that this issue has been popping up repeatedly since people have been installing R/R Studio on Ubuntu machines that use GNOME. Am not sure if GNOME is the root cause but it's interesting.  Anybody solved this? Or maybe you run R 3.5 fine on Ubuntu 18.04 without issue. Please let me know. I can only run for 30 minutes or so before this issue brings my system down. And my system is a fresh install of Bionic Beaver with just R on it. Weird.  ------ and for those wondering ------  installation for R was via  sudo add-apt-repository "deb https://cloud.r-project.org/bin/linux/ubuntu bionic-cran35/" sudo apt-key adv --keyserver keyserver.ubuntu.com --recv-keys E084DAB9 sudo apt-get update sudo apt-get install r-base r-base-dev   and R Studio was installed via this link through the Ubuntu software center   and it is speculated that the preview release of R Studio may fix this (TBD)


I have bought a new samsung s4.  I try to change the OS settings to be in hebrew.  I remembered how to do it from another s4 my sister has.  Went to settings --> Languages and input ---> but there was no "hebrew" to choose.  Then I have tried "more locale 2" but it should solve some other issue, no?  anyhow either i did it wrong or it didn't help as well.


How to blur HDRI image in cycles. What nodes i have to setup in the world tab to make it blur and control the blur effect.


Should 'drive by' downvoting be more effectively caught?

I have an answer that I'm certain is technically correct. However, it continues to be downvoted. The answer has already been noted in comments on other answers to be better. It goes more in-depth than the others, yet it continues to be downvoted.  The already upvoted answers were nowhere close initially, and I had already commented on them to say why it is wrong...  Isn't there a limit for that? Shouldn't something be catching this?


What word describes someone who would never criticize his or her country, city, community or group that he or she belongs to?

There are people who would never have any criticism of country/city/community or group to which they belong to.   For example: Most people living in a certain city have to use public transport which is extremely overcrowded for daily commute. But they would describe it as adventure. They don't like it when someone criticizes the state of public transport just because they belong to that city and won't hear any criticism of it.   Is there a single word that could describe such people?   The word I am looking for could not be "Patriotism". "Patriotism" is limited to country. It does not apply to city or group or a community. And being patriotic doesn't necessarily mean that one has to be so irrational as to praise everything about it.


Determine if the following series converges or diverges: $\sum _{n=1}^{\infty }\ln\left(\frac{n}{n+1}\right)$

I'm having trouble understanding if the following series converges or diverges:  $$ \sum _{n=1}^{\infty }\ln\left(\frac{n}{n+1}\right) $$  I've noticed that $\lim _{x\to \infty \:}\ln \left(\frac{x}{x+1}\right) = 0$ and therefore I can't deduce that it diverges, but other than that I'm really not sure what is the right way to go here. Any help is appreciated


How to close a chain when the pin was broken

I was changing the chain on a bike with a Shimano gear shifter and when I was trying to push the pin in it broke off after only getting the front section in.   How can I recover and attach the chain?


I have heard a lot about LaTeX, but never used it myself.  It is mainly used for typesetting professional research papers. But I am not writing research papers.  Is LaTeX for me? If yes, why should I be shifting from OpenOffice to LaTeX? What does LaTeX offer to the normal user who uses word processing software to make all kind of report documents?


How many times I need to draw k items from a list of n items to get a probability P that each item is selected at least once?

I have seen a few related questions but not exactly what I am looking for (in particular  and ) I think. I may be missing something since I am only a beginner at these counting problems. I am trying to calculate the amount of times (experiments) I need to perform were I choose $k$ items from a list of $n$ items so that I have a probability $P$ that each of the n items was selected at least once. I attacked the problem by starting small and saying I have 5 items and each experiment consists of drawing two of them (without replacement). After the first experiments I reasoned that I have 100% probability that there are 3 items not selected yet. I proceeded to calculate the probability that after the second experiment I have three, two, or one items not selected. And so on with the third experiment and more. Unfortunately, I am having trouble generalizing this approach to $n$ and $k$ and to a number of experiments $m$. I suspect there is a good chance that this is a duplicate. If so can someone please point me in the right direction?


Creating a table from CSV file with strings?

I want to create a table from a CSV file in LaTex. I am able to do it with numbers  but creating table for strings such as abbrevions does not work. What is the problem?  MVE  This example fires error "Package PGF Math Error: Could not parse input '...' as a floating point number, sorry." \documentclass{standalone} \usepackage{pgfplotstable,filecontents} \pgfplotsset{compat=1.9}% supress warning  \begin{filecontents*}{test.csv} Abbreviation, Description ACG, Azeri Chirag Guneshli bcm, Billion cubic meters BTC, Baku Tbilisi Ceyhan CIA, Central Intelligence Agency Btu, British thermal unit CAC, Central Asia Center EU, European Union LNG, Liquified Natural Gas NATO, North Atlantic Treaty Organization OMV, Österreichische Mineralölverwaltung \end{filecontents*}  \begin{document} \pgfplotstabletypeset[col sep=comma, columns={Abbreviation,Description}]{test.csv} \end{document}


There are a few questions on here about why Gravity is not a force, but I'm having trouble grasping why exactly.  It sounds to me that Gravity is not a force because it is simply a by-product of mass on spacetime.  How does this differ from the strong nuclear force?  Are the other forces not an effect of the presence of a particle?  I apologize if this is an overly simple question, I'm not well-versed in physics.


I get the following error when trying to ls *.txt | wc -l a directory that contains many files:  -bash: /bin/ls: Argument list too long   Does the threshold of this "Argument list" dependent on distro or computer's spec?  Usually, I'd pipe the result of such big result to some other commands (wc -l for example), so I'm not concerned with limits of the terminal.