I have the following list of strings :  exclude = ['eee', 'iii']   I have a word to be tested :  word = 'Iîïe'   I want the following test to be true :  if any(x in word for x in exclude):     #I want to be here !   In order to be true, my condition needs to be case-insensitive and accent-insensitive... How?
How can I do case insensitive string comparison in Python?  I would like to encapsulate comparison of a regular strings to a repository string using in a very simple and Pythonic way. I also would like to have ability to look up values in a dict hashed by strings using regular python strings.
What ability should be used when resisting Intimidation? During our last play session (it was our second session, so everyone is first level) my fighter dwarf had a conflict with another player's human fighter. My dwarf became annoyed at the human's dismissive reaction to a roar outside the village that sounded like ogres (my dwarf has a bad history with ogres).   So, in order to emphasize the seriousness of this situation, my dwarf grabbed the human by shirtfront and pulled him closer (done with a successful roll). Still bent double, the human drew his sword and pointed it at my dwarf's belly (dwarf wearing chainmail). At this point the DM made the other player roll an Intimidation (Charisma) check, and me a Wisdom check to resist. I lost and my dwarf, chastened, let the human go.  That was pretty funny situation, but one thing is bothering me. By using a Wisdom check against Intimidation (Charisma), my dwarf (who has &minus;1 Wisdom modifier) was at a disadvantage (literally, not in the D&amp;D disadvantage mechanic sense) against the threats. Although he is a strong and capable warrior, he is not that wise.  But I have to wonder: is willpower really represented by Wisdom in 5e? I think that many not-so-wise creatures/characters can stand bravely against threats.  What ability/skill should be used in a contest to resist intimidation? I am getting several new computers for my office.  I want to install Microsoft Office and my proprietary software and all updates on a single PC and create a system image that will be copied to every other PC.  How do I deal with Windows/Office product keys to prevent licence violations?  Am I able to do this from the System Image tool in Windows 7?  Note:  The PCs will very likely not be joined to my domain at this point if that makes a difference. Prove $$\int _0^\infty f^2(x) dx \leq \frac{2}{3}\cdot  \max_{x \in \mathbb R^+} f(x) \cdot  \int _0^\infty f(x) dx$$ for $f(x) \geq 0$ and convex.   I know via Holder's we can get without the constant $\frac{2}{3}$ but that should also be true for $f$ not convex. I tried some approaches using convexity but didn't get the desired result.   A hint or reference would also help. Also, it would be interesting to know when equality holds. How can I control the name of generic WCF return types? I've got a WCF Web Service method whose prototype is:  [OperationContract] Response&lt;List&lt;Customer&gt;&gt; GetCustomers();   When I add the service reference to a client, Visual Studio (2005) creates a type called "ResponseOfArrayOfCustomerrleXg3IC" that is a wrapper for "Response&lt;List&lt;Customer>>".  Is there any way I can control the wrapper name?  ResponseOfArrayOfCustomerrleXg3IC doesn't sound very appealing... File names for JSP include directive to avoid compilation of them Let $A = \mathbb{Z}$, $B = [−1, \pi]$, $C = (2, 7)$. List all elements of $A \cap (B^c \cap C)$. After working it out on a number line, I got: $\{4, 5, 6\}$.  As it stands, the expression contains the integers that do not belong to the set $B$ that cross into $C$. This would result in $4, 5, 6$. Number $7$ would not be included because of the soft brackets surrounding $C = (2, 7)$. Is this correct? Difference between >> and >>> in verilog? We often get questions on bicycles.stackexchange about identifying a bicycles manufacturer, model, make, and year.  Often these questions are downvoted or closed -- usually with a comment attached to them that it's not necessary to know the exact model/make/year of a bicycle if you want to fix, repair, or ride your bike. Why should owners not care about the model/make/year of their bicycle? Especially when it comes to less expensive bikes (aka BSOs) and BMX bicycles? This is intended as a canonical question that we can point closed questions to. Also see      (generally not helpful for identifying a brand/model) Design for Facebook authentication in an iOS app that also accesses a secured web service Why is $a^n - b^n$ divisible by $a-b$? I did some mathematical induction problems on divisibility   $9^n$ $-$ $2^n$ is divisible by 7. $4^n$ $-$ $1$ is divisible by 3. $9^n$ $-$ $4^n$ is divisible by 5.   Can these be generalized as $a^n$ $-$ $b^n$$ = (a-b)N$, where N is an integer? But why is $a^n$ $-$ $b^n$$ = (a-b)N$ ?  I also see that $6^n$ $- 5n + 4$ is divisible by $5$ which is $6-5+4$ and $7^n$$+3n + 8$ is divisible by $9$ which is $7+3+8=18=9\cdot2$.  Are they just a coincidence or is there a theory behind?  Is it about modular arithmetic? Forcing linebreaks in \url What is the mysterious stranger doing in my vault? Are token creatures considerd as a creature spell? Partitions of $n$ into distinct odd and even parts proof Let $p_\text{odd}(n)$ denote the number of partitions of $n$ into an odd number of parts, and let $p_\text{even}(n)$ denote the number of partitions of $n$ into an even number of parts.  How do I prove that    $|p_\text{even}(n) - p_\text{odd}(n)|$ is equal to the partitions of $n$ into distinct odd parts. Show that the number of partitions of $n$ for which no part appears exactly once is equal to the number of partitions of n for which every part is divisible by 2 or 3. Show that the number of partitions of $n$ for which no part appears more than twice is equal to the number of partitions of $n$ for which no part is divisible by 3. What are some good tutorials on writing custom styles (classes) that clearly explain commands used and some of the features that TeX has to offer in the way of styles? I want to set a folder such that anything created within it (directories, files) inherit default permissions and group.    Lets call the group "media".  And also, the folders/files created within the directory should have g+rw automatically. How to specify font size less than 10pt (or more than 12pt)? Cannot inherit from multiple classes defining __slots__? How to loop through a HashMap in JSP? How to style text in hyperref \url?