Print duplicate values and non duplicate values separately in java
How do I compare strings in Java?
I am wondering if we should use  or  for buttons and headings in websites and web/mobile apps? Title Case: Manage my Account Delete my Account  Sentence case: Manage my account Delete my account  In  I found the recommendation 'choose your style and be consistent'. This is it? Aren't there any other (additional) recommendations or sources. Like for specific use cases or apps where the one style would be preferred over the other? Edit: The question refers primarily to English, but differences in other languages are also good to know. Legendre's formula counts the number of positive integers less than or equal to a number $x$ which are not divisible by any of the first $a$ primes: $$\begin{align} &amp;\phi(x,a)=\lfloor x \rfloor-\sum_{p_i\le a}\left\lfloor \dfrac{ x }{(p_i)}\right\rfloor+\sum_{p_i&lt;p_j\le a}\left\lfloor\dfrac{ x}{(p_ip_j)}\right\rfloor-\sum_{p_i&lt;p_j&lt;p_k\le a}\left\lfloor \dfrac{x}{(p_ip_jp_k)}\right\rfloor+\dots \end{align}$$ then $\pi(x)=\phi\bigl(x,\pi (\sqrt{x})\bigr)+\pi (\sqrt{x})-1$ as given .  My question is, why does $\bigl\lfloor\phi(x,\lfloor\sqrt{x}\rfloor)+\sqrt{x}-1\bigr\rfloor$ also equal $\pi(x)?$ Finding largest file recursively I am trying to find the largest file in a directory recursively. If there is a subdirectory inside of that directory the function needs to go inside that directory and check to see if the largest file is there. Once the largest file is found the output is displayed with the relative path name and the name and size of the largest file.  EX:  dude@shell2 (~...assignment/solutions) % bash maxfile.sh ~/test class/asn dude.h.gch: 9481628   This is what I have:  #!/bin/sh clear  recursiveS() {     for d in *; do         if [ -d $d ]; then             (cd $d; echo $(pwd)/$line; du -a; recursiveS;)         fi     done } recursiveS   I have been stuck for a while now. I cannot implement this by pipelining a number of existing Unix tools. Any ideas would be nice! Minimize the sum of distances between two point and a circle Let's $A$,$B$ and $O$ be random point in a plane, such that they are not colinear. Let's $c$ be a circle centered on $O$, such that points $A$ and $B$ are outside of it. Find a point $X$ that lies on the circle $c$ and the sum $AX + BX$ is minimal.  First I tried to minimize the function:  $$f(x,y) = \sqrt{(A.x - x)^2 + (A.y - y)^2} + \sqrt{(B.x - x)^2 + (B.y - y)^2}$$ with  constraint $$g(x,y) = x^2 + y^2 - r^2 = 0$$  By moving $O$ to $(0,0)$ and do the same with $A$,$B$ so the relative distance will not change.  But these works when we know the coordinates of $A$,$B$ and the radius of the circle. Yet this isn't the right way because the problem is to construct that point.  Later I tried to approach using geometry.  The smallest distance from the point $A$ to the circle is the intersection of the circle $c$ and the ray $OA$, this is the same for $B$. Then we construct circles centered on $A$ and $B$ that are tangent to $c$. If the two circle intersect we'll get a common point for the both $A$ and $B$ and the distance will be minimal. Using computer I find the point X should be somewhere around the intercetion of the circle $c$ and the ray from $O$ to the new point.   Sometimes the optimal point differs just a bit and also this method fails when the two circles do not intersect each other Finding the contact point with SAT Natural Sounding Text to Speech? From the :   -exec command ;     There are unavoidable security problems     surrounding use of the -exec action; you should use the     -execdir option instead.  -execdir command {} +     Like -exec, but the specified command is run from the     subdirectory containing the matched file, which is not     normally the directory in which you started find.  This a much     more secure method for invoking commands, as it avoids race     conditions during resolution of the paths to the matched     files.    What does this mean? Why are there race conditions with running it from the starting directory? And how are these security risks? Why is "the set of all sets" a paradox, in Layman's terms? I've heard of some other paradoxes involving sets (i.e., &quot;the set of all sets that do not contain themselves&quot;) and I understand how paradoxes arise from them.  But this one I do not understand. Why is &quot;the set of all sets&quot; a paradox?  It seems like it would be fine, to me.  There is nothing paradoxical about a set containing itself. Is it something that arises from the &quot;rules of sets&quot; that are involved in more rigorous set theory? How can I completely remove NetworkManager? I'm pretty new to this and this is my first question here, any help would be greatly appreciated.  So basically what I want to achieve is a floor material as seen in this photo...    ...the reflections are very crisp but dim.  With a glossy shader I get the following results:    First picture: reflections are blurry  Second picture: roughness of the material looks right but reflection is bright red  Third picture: If tinted in any other color than white, it seems to produce the result I want. Reflection is sharp and gets tinted blue. What I need is the reflection to be tinted white.  Thanks for any help. I can't get grub menu to show up during boot In &quot;Introduction to Mathematical logic&quot; by Elliot Mendelson , page $59$ . I couldn't understand the basic preliminary notations for the rigorous definition of Satisfiability. For example , at a line they said, &quot;Moreover, instead of talking about the $n$-tuples of objects that satisfy a wf that has $n$ free variables, it is much more convenient from a technical standpoint to deal uniformly with denumerable sequences. What we have in mind is that a denumerable sequence $s = (s_1, s_2 , s_3 , ... )$ is to be thought of as satisfying a wf $\beta$ that has ${x_j}_1 , {x_j}_2 ,  ... , {x_j}_n$ as free variables (where $j_1 &lt; j_2 &lt; ... &lt; j_n$ ) if the $n$-tuple $\langle {s_j}_1 , {s_j}_2 ,  ... , {s_j}_n \rangle$ satisfies $\mathscr B$ in the usual sense.&quot; I didn't quite understand why they used ${s_j}_1$ and ${x_j}_1$ instead of $s_1$ and $x_1$ . Maybe there is a critical detail I am missing out? Also , Another passage for the rigorous definition: &quot;Let $M$ be an interpretation of a language $\mathscr L$ and let $D$ be the domain of $M$. Let $\sum$ be the set of all denumerable sequences of elements of $D$. For a wf $\mathscr B$ of $\mathscr L$ , we shall define what it means for a sequences $s= (s_1, s_2, ... )$ in $\mathscr L$ to satisfy $\mathscr B$ in $M$. As a preliminary step, for a given s in $\sum$ we shall define a functions $s^*$ that assigns to each term $t$ of $\mathscr L$ an element $s^{*}(t)$ in $D$.&quot; They did say that for each $s = (s_1, s_2, ... )$ , there is a defined function $s^*$ , but even after further reading the text afterwards , I still did not understand how exactly $s^*$ is defined from $s$ . Can someone tell me where the gap in my understanding here is? Can I run PC steam games on a Mac? I recently downloaded 'Blood Bowl' on Steam to my Mac, not realizing that it was not Mac-compatible. Is there any software or any way that will allow me to play it, as obviously I've already paid for it? Cheers. I'm fairly certain this has happened to all of us at some point: You go into a room to get something, but once you're there, you can't remember what you intended to get. It seems like a specific, common phenomenon like this must have a name, but I can't think of it. Does anyone know a name (either formal or slang) for this?  I don't want a general term like forgetfulness or absent-mindedness, which could apply to all sorts of forgetting, or a term for not being able to remember a certain word. I'm looking for a word or phrase that describes this one specific situation of forgetting what you need to get as soon as you go to get it. MySQL Access denied for user 'root'@'localhost' In my server, everytime I try to access MySQL I get the error:        Access denied for user 'root'@'localhost' (using password: NO)   when I try mysqladmin -u root -p password I get        Access denied for user 'root'@'localhost' (using password: YES)   How can I access MySQL in my Ubuntu server 12.04? How do I delete all Folders with a specific name (e.g. 128Kbps_Songs) without deleting its files  For example if I have directory "MP3_SONGS" with subdirectories "A", "B", "C" and each subdirectory has MANY directory Contains Film Name "FILM_NAME1", "FILM_NAME2", "FILM_NAME3" in it, In That Each Film NAme I have specific Folder NAme (128Kbps_Songs) in this "128Kbps_Songs" Folder I have That Film mp3 Songs Files  how can I remove the Folder "128Kbps_Songs", in Each Film_Name directory and Have to get these mp3 songs in that FILM_NAME..   ( Have to Delete 128Kbps_Songs Folder in all FILM_NAME without deleting the mp3 Songs in it, have to get the mp3 in FILM_NAME Directory..  MP3_SONGS (Parent Directory) ------ A , B, C  A (Sub Directory1) ------ FILM_NAME1 , FILM_NAME2 B (Sub Directory2) ------ FILM_NAME3 , FILM_NAME4 c (Sub Directory3) ------ FILM_NAME5 , FILM_NAME6  FILM_NAME1 (Directory) ---- 128Kbps_Songs (Directory) ------ FILM_NAME1 (MP3 Files) FILM_NAME2 (Directory) ---- 128Kbps_Songs (Directory) ------ FILM_NAME2 (MP3 Files)  FILM_NAME3 (Directory) ---- 128Kbps_Songs (Directory) ------ FILM_NAME3 (MP3 Files) FILM_NAME4 (Directory) ---- 128Kbps_Songs (Directory) ------ FILM_NAME4 (MP3 Files)  FILM_NAME5 (Directory) ---- 128Kbps_Songs (Directory) ------ FILM_NAME5 (MP3 Files) FILM_NAME6 (Directory) ---- 128Kbps_Songs (Directory) ------ FILM_NAME6 (MP3 Files)  Need Files in: FILM_NAME1 (Directory)  ------ FILM_NAME1 (MP3 Files) FILM_NAME2 (Directory)  ------ FILM_NAME2 (MP3 Files)  FILM_NAME3 (Directory)  ------ FILM_NAME3 (MP3 Files) FILM_NAME4 (Directory)  ------ FILM_NAME4 (MP3 Files)  FILM_NAME5 (Directory)  ------ FILM_NAME5 (MP3 Files) FILM_NAME6 (Directory)  ------ FILM_NAME6 (MP3 Files) No splitter widget in new separate window I am new to Blender and I am trying to find my way through its interface. I want to have several windows (I mean OS windows, not Blender windows). So I create a separate window by dragging splitter widget while holding Shift.  The problem is there are no splitter widgets in the newly created OS window. So I can't have multiple blender windows in it. The new window does not have a Layout type drop down menu either. So how do I add new Blender windows in a new OS window? (Sorry if I'm using the wrong terms, but hopefully its clear what I am trying to achieve). Origin/reason for the expression "on the bus" instead of "in the bus" Determine the exact date of creation of an Apple ID Is it possible to determine the exact date and time (if possible) of creation of an Apple ID?   Is there any official or unofficial way to establish this if you don't have the initial sign up information recorded? Repeatedly rolling a six sided die four times and summing the highest three results gives you a distribution with what mean and standard deviation? Repeatedly rolling a six sided die four times and summing the highest three results gives you a distribution with what mean and standard deviation?  I've only taken AP statistics, but I would like to learn how to do this.