Making a list of lists with no refrences in python
Nested List Indices
Number of ways to stack poker chips if two stacks that can be obtained from each other by reflection are considered to be equivalent? How to check if a row exists in MySQL? (i.e. check if an email exists in MySQL) I know you can create a rounded-corner rectangle; but, how do you create a triangle with rounded corners in Photoshop?  I am actually interested in making it from scratch, not basing it on a custom shape that is available in Photoshop. Thanks. Is there any hint of of the first Wizarding War being an international event? "along the river" vs "alongside the river"? In a question on "along" vs "alongside", I have seen this question and the correct answer on the web site makes me confused.      The question is: I enjoyed my walk _________________ the river.  a) along b) alongside  I selected "...along the river" as the correct answer, but on the web site it is shown as wrong and the correct answer is "alongside".  How can that be? I still do not agree, because I have studied the difference between the two. "along" is just the right preposition for thin and long places like road, path, street, beach etc".   So, why would the correct answer be "alongside" which simply means "next to"? Do you not think "along" seems to be better fitting?  Regards,  Note: I would be more than gratefull, if somebody show it to me in a video, like "a walk along the river" and "a walk alongside the river". Maybe I can understand the how "a walk along the river" and "a walk alongside the river" would take place. How can you depend on test code from another module in Maven?    Example, I have 2 modules:   Base Main   I would like a test case in Main to extend a base test class in Base.  Is this possible?  Update: Found an , which involves creating a test jar. What's the difference between Normalization and Standardization? Is every sufficiently large positive integer of the form $ab + ac + bc + 1$? Is every sufficiently large positive integer $A$ of the form $ab + ac + bc + 1$   where $a,b,c$ are some positive integers larger than some given positive integer $d$ ?  How large is sufficiently large , in other words how do we know our number $A$ is sufficiently large ( as a function of $d$ ) ?    Update :  I read the following about positive integers that are not of the form $ ab + ac + bc $:    And I quote about that sequence above : " Note that for n in this sequence, n+1 is either a prime, twice a prime, the square of a prime, 8 or 16 "  This is why I considered the weird +1 in $ab + ac + bc + 1$  So composites larger than 16 not a prime , twice a prime or the square of a prime are of the form $ab + ac + bc + 1$.  And I wonder why !  I guess that relates strongly to the Original posted problem. Maybe I should have mentioned that before , sorry.  Will Jagy's answer gave the same OEIS link which I already knew. This also explains some of the comments.  Im no expert in genus theory or Galois theory but I assume this has a simple answer. Why do the Jedi say "May the Force be with you"? New three-tiered badge idea: Explainer →Refiner → Illuminator The difference between a poor or meh question and a stellar question can often simply be someone understanding it and providing it a great answer. I can't begin to count the number of times I've justified re-opening a question as a moderator by saying:     Look at the answer it got, though. This isn't something we want deleted, this is something we want fixed, because it's obviously valuable. Someone with domain knowledge can easily edit that question based on the answer it received.   This doesn't only apply to borderline-poor or poor questions – sometimes a good edit means the difference between 100 and 10,000 people finding something through typing things into Google. Good titles are hard.   We think we've come up with a way to provide incentive for good, opportunistic edits to happen more often, ideally without questions needing to go through closure or collecting a centimeter of dust before they do. What if we simply rewarded folks that answered and edited questions with a special, relatively difficult to earn badge?  Let's say that you answer something, and:   You edit the question 12 hours before or after answering it. This allows you to edit now, answer later &mdash; or answer now and edit later, when you have the time. Your edit isn't rolled back, or outright rejected if it was a suggested edit The question is not closed for any reason, even simply being a duplicate Your answer has a score of 1 or higher   &hellip; then you've done something that we probably want to recognize. You understood something, you provided the knowledge that you have, and then you provided an edit to make sure that more people in need of this knowledge can find it, while raising the overall quality of the site.  Here's the proposed tiers for the badge (within the above stated criteria):   Explainer (Bronze): Answered &amp; edited 10  questions Refiner (Silver): Answered &amp; edited 50 questions Illuminator (Gold): Answered &amp; edited 500 questions   We think this is going to be pretty hard to game. You can't go leaving streaks of terse snark all over the place on questions you know are going to be closed anyway, and junk edits aren't going to fly.  We're talking about rewarding folks that take a tiny bit more time out of their day just to write a more descriptive title so that folks can find the awesome answer that they wrote. Just doing that alone can make a big difference. Sure, it's a tad hard to get at the gold level, but it's supposed to be. If you routinely edit questions that you answer and have done so for some time, you'd probably get it the day we roll it out.  While this is technically something that we came up with on the quality initiative ( | ) &mdash; this badge could be earned on all of our sites.  What do you think? What did we miss? What could be better about the idea? Prove that $\lim_{x \to +\infty} \frac{f(x)}{x} = L$ if $\lim_{x \to +\infty} [f(x+1) - f(x)] = L \space$ Let $f:[0, +\infty) \rightarrow \mathbb{R} $ be a bounded function in each bounded interval. If $$\lim_{x \to +\infty} [f(x+1) - f(x)] = L$$ then $$\lim_{x \to +\infty} \frac{f(x)}{x} = L$$   I tried using the definition on the first limit; then, I attempted to use that inequality to apply the triangular inequality to arrive at the definition that gives me the second limit. It is supposed to be simple, but I'm not feeling safe as in how I should write it. How can I find all files I can not write to?  Would be good if it takes standard permissions and acls into account.  Is there an "easy" way or do I have to parse the permissions myself? how many instances for a class exists at runtime in java The usual explanation for warm fluids rising past cooler ones is that the warmer fluid has a lower density.  I'm trying to understand what this looks like at a molecular scale.  The density seems to be a large-scale phenomenon, and I don't understand how it can affect whether a particular molecule rises or falls.  Consider a cylinder of fluid that is being heated at the bottom.  The molecules at the bottom have a higher average energy.  How does this result in the tendency of the warmer molecules at the bottom to move upwards past the cooler ones? I am using a local (company) network which provides some servers which are also available from the outside (through one public static IP and port forwarding). And there are some domains which are pointing to the public IP.  What I want is my domains pointing to the local IPs when being inside the local network. I know I will need a local (internal) DNS server which changes the domains to the IPs. I am able to setup the DHCP server to deliver the DNS to the local clients (so this won't be any problem).  What kind of DNS server software can I use to:   repeat all domains like a DNS would do that but for only my domains use the local values I've been messing around with Unity and broke something, how do I "start over"? How to install Flash player on Ubuntu? Even though I have the latest Adobe Flash player 11.2 for Linux in Firefox -   - a particular online flash game still requests that I update to the latest flash player.  I've tried this online game on my laptop (Windows 8 with Flash Player 11.8) and it has no problems.  Is there a way to trick Ubuntu or this game into thinking Flash Player 11.8 is "installed"? How to disable auto-complete braces in TEXStudio? I want to disable auto-complete for braces in TeXstudio. In its simplest form, when I type {  I do not want it to automatically add a }.  When it does this, many times I end up deleting the brace, which is a hassle.  Also, when I hit Ctrl+I to get into italics mode I don't want it to auto-complete the ending brace either.  I have gone to Options -&gt; Configure TeXstudio... -&gt; Completion -&gt; Show Advanced Options and disabled everything.  But it still auto-completes them.  In case it matters the version I have is TeXstudio 2.8.4. Using R, I have fitted a linear model for a single response variable from a mix of continuous and discrete predictors. This is uber-basic, but I'm having trouble grasping how a coefficient for a discrete factor works.   Concept: Obviously, the coefficient of the continuous variable 'x' is applied in the form y = coefx(varx) + intercept but how does that work for a factor z if the factor is non-numeric? y = coefx(varx) + coefz(factorz???) + intercept   Specific: I have fitted a model in R as lm(log(c) ~ log(d) + h + a + f + h:a) where h and f are discrete, non-numeric factors. The coefficients are:  Coefficients:               Estimate  (Intercept)  -0.679695  log(d)        1.791294  h1            0.870735   h2           -0.447570   h3            0.542033    a             0.037362   f1           -0.588362   f2            0.816825  f3            0.534440 h1:a         -0.085658 h2:a         -0.034970  h3:a         -0.040637   How do I use these to create the predictive equation:  log(c) =  1.791294(log(d)) + 0.037362(a) + h??? + f???? + h:a???? + -0.679695   Or am I doing it wrong?   I THINK that that concept is if the subject falls in category h1 and f2, the equation becomes:   log(c) =  1.791294(log(d)) + 0.037362(a) +  0.870735  + 0.816825  + h:a???? + -0.679695   But I'm really not clear on how the h:a interactive term gets parsed. Thanks for going easy on me. Switch statement fallthrough in C#? Switch statement fallthrough is one of my personal major reasons for loving switch vs. if/else if constructs. An example is in order here:  static string NumberToWords(int number) {     string[] numbers = new string[]          { "", "one", "two", "three", "four", "five",            "six", "seven", "eight", "nine" };     string[] tens = new string[]          { "", "", "twenty", "thirty", "forty", "fifty",            "sixty", "seventy", "eighty", "ninety" };     string[] teens = new string[]         { "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen",           "sixteen", "seventeen", "eighteen", "nineteen" };      string ans = "";     switch (number.ToString().Length)     {         case 3:             ans += string.Format("{0} hundred and ", numbers[number / 100]);         case 2:             int t = (number / 10) % 10;             if (t == 1)             {                 ans += teens[number % 10];                 break;             }             else if (t &gt; 1)                 ans += string.Format("{0}-", tens[t]);         case 1:             int o = number % 10;             ans += numbers[o];              break;         default:             throw new ArgumentException("number");     }     return ans; }   The smart people are cringing because the string[]s should be declared outside the function: well, they are, this is just an example.  The compiler fails with the following error:   Control cannot fall through from one case label ('case 3:') to another Control cannot fall through from one case label ('case 2:') to another   Why? And is there any way to get this sort of behaviour without having three ifs?