Is this logo copyright infringment of Beats' logo?
What should happen if a logo I made is similar to another?
How to create two partitions? What is a 'multi-part identifier' and why can't it be bound? I continually get these errors when I try to update tables based on another table. I end up rewriting the query, change the order of joins, change some groupings and then it eventually works, but I just don't quite get it.  What is a 'multi-part identifier'? When is a 'multi-part identifier' not able to be bound? What is it being bound to anyway? In what cases will this error occur? What are the best ways to prevent it?    The specific error from SQL Server 2005 is:     The multi-part identifier "..." could not be bound.   Here is an example:  UPDATE  [test].[dbo].[CompanyDetail]  SET Mnemonic = [dbBWKMigration].[dbo].[Company].[MNEMONIC],                 [Company Code] = [dbBWKMigration].[dbo].[Company].[COMPANYCODE]  WHERE [Company Name] = **[dbBWKMigration].[dbo].[Company].[COMPANYNAME]**   The actual error:     Msg 4104, Level 16, State 1, Line 3 The multi-part identifier   "dbBWKMigration.dbo.Company.COMPANYNAME" could not be bound. Given $y_n=(1+\frac{1}{n})^{n+1}$ show that $\lbrace y_n \rbrace$ is a decreasing sequence Expiration Date on Milk What is the Hilbert curve's equation?! How to unlock gungeoneers I've seen on a wiki that there is a ghost gungeoneer and a robot gungeoneer but it didn't say how to unlock them, so how do I unlock more gungeoneers ? Real analysis - proof approach help Unable to install LanguageTool 2.5 extension for LibreOffice 4.2 on Ubuntu 14.04 I am not able to install LanguageTool extension for LibreOffice. Getting exception when I try to install it.   p.s. Somebody says that the solution is installing openoffice.org-java-common package but Ubuntu 14.04 does not have this package in its repository.  System details:  OS: Ubuntu 14.04 LTS  LibreOffice: 4.2 (4.2.3.3)  LanguageTool: 2.5  Java: Oracle JDK 1.8.0_05     Exception message: Dependency is not satisfiable: libtiff4 when trying to install Lightworks on Ubuntu 14.04 I was trying to install Lightworks 11.5.1 (amd64) on Ubuntu 14.04(amd64) but there's a notice: Dependency is not satisfiable: libtiff4. Is there anyway to solve this dependency issue?  Thanks in advance. ffmpeg settings for converting still images to video for archival I need to convert a set of still images (static cameras pointed at a road) to a video.  I have considered video codecs such as Theora, H.264, VP8, VP9, HEVC, Snow.   The video should have a minimum size with the maximum image quality. Now, from all available command-line arguments, I'm using framerate (fps), b:v (bitrate) and s (width*height). Also, for H.264 and HEVC there are -crf and -preset.  What other command-line arguments can be useful to achieve what I'm after? In ffmpeg dozens of command-line arguments and parsing each can take a long time. What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits. Index not created in pdf output, even though idx file is present I have a document that has \usepackage{makeidx} and \makeindex in the preamble and \printindex inside the document body. An .idx file is created when I compile, no errors are signalled, still there is no index listing in the PDF document that is produced. There used to be one until all my files were deleted except the .tex file, after that I could not get the index to appear in my output. How can one troubleshoot this thing? I have changed all the "%bm" with "%tm" wherever I could find it in the build profiles (Tools -> Options -> Clean), as Thorsten Donig suggested on this website (in an answer to another posting regarding problems with the index creation). It did not solve my problem. I am using the TeXnicCenter editor on Windows XP, with the MiKTeX 2.9 distribution. I have gcc 7.3.0 on Ubuntu 18.04. But I am working on a project where I need gcc less than version 6. When I tried to install gcc 5.4 using sudo apt install gcc-5.4, I got this error:  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package gcc-5.4 E: Couldn't find any package by glob 'gcc-5.4' E: Couldn't find any package by regex 'gcc-5.4'     What is the appropriate way to install gcc 5.4? Why do we use "./" (dot slash) to execute a file in Linux/UNIX? Why do we use ./filename to execute a file in linux?  Why not just enter it like other commands gcc, ls etc... Command and Conquer 3 exeption in exception handler I have command and conquer 3 from Origin, but when I try to start it, I get the 'exception in exception handler' error and the game exits.   I've tried the Origin launcher fix as well as -runver to make the game run a different version (although this just says that it can't find any version). I run Windows 10 (I know, experimental) but this game worked at one point, and then stopped working suddenly - there wasn't even an update in between.   I suspect that it's got to do with Origin, but any help would be appreciated. Can I run CAT5/6 cables parallel to electrical cables? How to make ssh log in as the right user? I use ssh on a variety of machines, mainly linux. Accounts on these machines vary in naming scheme: if my name is First Last, then I have accounts: first, flast, last_f, lastf, and sometimes I need to log in as root. For each machine I use, I would like the openssh client to know which account to use when I don't specify on the command line.  So the question is: How do I make ssh server Do The Right Thing when a username is not specified? The Fibonacci sequence is defined recursively by $F_1 = 1, F_2 = 1, \; \&amp; \; F_n = F_{n−1} + F_{n−2} \; \text{ for } n ≥ 3.$ Prove that $2 \mid F_n \iff 3 \mid n.$   Proof by Strong Induction : $\bbox[5px,border:1px solid green]{\color{green}{n = 1 }}$ $2 \mid F_1$ is false. Also, $3 \mid 1$ is false. The implication [False $\iff$ False] is vacuously true.  $\bbox[5px,border:1px solid green]{\color{green}{\text{Induction Hypothesis}}}$ Assume that $2 \mid F_i \iff 3 \mid n$ for every integer $i$ with $1 ≤ i ≤ k$.  $\bbox[5px,border:1px solid green]{\color{green}{k + 1 \text{th Case}}} \;$  To prove:  $\quad 2 \mid F_{k + 1} \iff 3 \mid k + 1.$   $\bbox[5px,border:1px solid green]{\color{green}{n = k + 1 = 2}} \;$ $2 \mid F_2$ is false. Also, $3 \mid 2$ is false. So [False $\iff$ False] is vacuously true.  Hence assume that $k + 1 ≥ 3.$ We now consider three cases:  $\bbox[5px,border:1px solid green]{\color{green}{\text{Case 1: } k + 1 = 3q}}$ Thus $3 \require{cancel}\cancel{\mid} k$ and $3 \require{cancel}\cancel{\mid} (k − 1)$. By the ind hyp, $3 \require{cancel}\cancel{\mid} k    \iff F_k$ odd &amp; $3 \require{cancel}\cancel{\mid} (k − 1) \iff F_{k - 1}$ odd. Since $F_{k+1} = F_k + F_{k−1}$, thus $F_{k+1}$ = odd + odd = even.  $\bbox[5px,border:1px solid green]{\color{green}{\text{Case 2: } k + 1 = 3q + 1}}$  Thus $3 | k$ and $3 \require{cancel}\cancel{\mid} (k − 1).$ By the ind hyp, $3 | k \iff F_k$ even &amp; $3 \require{cancel}\cancel{\mid} (k − 1) \iff F_{k - 1}$ odd. Thus $F_{k+1}$ odd.  $\bbox[5px,border:1px solid green]{\color{green}{{\text{Case 3: }} k + 1 = 3q + 2}}$ Thus $3 \require{cancel}\cancel{\mid} k$ and $3 | (k −1).$ By the ind hyp, $3 \require{cancel}\cancel{\mid} k \iff F_k$ odd and $3 \mid (k − 1) \iff F_{k - 1}$ even. Thus $F_{k+1}$ odd. $\blacksquare$  $\Large{1.}$ Does the proof clinch the $(\Leftarrow)$ of the $(k + 1)$th case?   $\Large{2.}$ Since the recursion contains $n, n - 1, n - 2$, thus the recursion "time lag" is $3$ here. So shouldn't $3$ base cases be checked?   $\Large{3.}$ Further to #2, shouldn't "assume $k + 1 \geq \cancel{3} 4$" instead?   $\Large{4.}$ Shouldn't the $n = k + 1 = 2$ case precede the induction hypothesis?  I referenced . Source: Exercise 6.35, P152 of Mathematical Proofs, 2nd ed. by Chartrand et al    Supplement to peterwhy's Answer:  $\Large{1.1.}$ I wrongly believed that all 3 Cases proved the $\Leftarrow$. I now see that Case 1 is $\Leftarrow$ via a Direct Proof. Cases 2 and 3 are $\Rightarrow$ via a Proof by Contraposition. Nonetheless, how would one foreknow/prevision to start from $3 \mid n$  for both directions of the proof? Fastest way to determine if an integer's square root is an integer I'm looking for the fastest way to determine if a long value is a perfect square (i.e. its square root is another integer):    I've done it the easy way, by using the built-in  function, but I'm wondering if there is a way to do it faster by restricting yourself to integer-only domain. Maintaining a lookup table is impractical (since there are about 231.5 integers whose square is less than 263).   Here is the very simple and straightforward way I'm doing it now:  public final static boolean isPerfectSquare(long n) {   if (n &lt; 0)     return false;    long tst = (long)(Math.sqrt(n) + 0.5);   return tst*tst == n; }   Note: I'm using this function in many  problems.  So no one else will ever have to maintain this code.  And this kind of micro-optimization could actually make a difference, since part of the challenge is to do every algorithm in less than a minute, and this function will need to be called millions of times in some problems.    I've tried the different solutions to the problem:   After exhaustive testing, I found that adding 0.5 to the result of Math.sqrt() is not necessary, at least not on my machine. The  was faster, but it gave incorrect results for n >= 410881.  However, as suggested by , we can use the FISR hack for n &lt; 410881. Newton's method was a good bit slower than Math.sqrt().  This is probably because Math.sqrt() uses something similar to Newton's Method, but implemented in the hardware so it's much faster than in Java.  Also, Newton's Method still required use of doubles. A modified Newton's method, which used a few tricks so that only integer math was involved, required some hacks to avoid overflow (I want this function to work with all positive 64-bit signed integers), and it was still slower than Math.sqrt(). Binary chop was even slower.  This makes sense because the binary chop will on average require 16 passes to find the square root of a 64-bit number. According to John's tests, using or statements is faster in C++ than using a switch, but in Java and C# there appears to be no difference between or and switch. I also tried making a lookup table (as a private static array of 64 boolean values).  Then instead of either switch or or statement, I would just say if(lookup[(int)(n&amp;0x3F)]) { test } else return false;.  To my surprise, this was (just slightly) slower. This is because . Who owns R2-D2 & C-3PO in the Prequel trilogy? Is there any concrete evidence that Anakin officially owned R2-D2 or C-3PO?  I found this episode of Star Wars: Clone Wars that shows it, but it's fairly vague...