In trial the game was in ENGLISH but by some reason after i have purchased, the game comes "language locked". Why they do this? I've played RPG's in English since my childhood, work with native speakers, played DA:O in English and ... Can`t play the game in English? Why the trial is in English and there are no information about "language lock" on store?  I`ve tried 5 different tutorials to put the game in English, even change the registry HKEY_LOCAL_MACHINE\SOFTWARE\Wow6432Node\BioWare\Dragon Age Inquisition  Locale to en_EN and GDFBinary to GDFBinary_en_EN.dll and nothing works. The translation s***s. The abilities description makes no sense and the use of therms that nobody uses in my home country such as "melindroso" is ridiculous. Looks like a google translation translation of a google translation translation. I wanna play in ENGLISH. I've tried to get a refund since the game is unplayable with this piece of **** translation but the refund """failed""". Thanks for punishing someone who purchased a original copy while people who don't follow the rules and prejudices the game industry can play in any language that they want.  Note that :  1 - The trial was in English 2 - According to ORIGIN store of my region ENGLISH IS A SUPPORTED LANGUAGE    3 - I did not see any advised about language lock 4 - I have tried to enter in contact with origin support. According to the site the waiting time is 5 minutes but in reality... 30 minutes and nobody appears.  EDIT > Is different(not duplicate) because the other questions works for the 2014 game. After the recent updates, the solution isn't working. So i need a solution to 2017 version of the game.    EDIT 2 HOW I managed to put DA:I to English  Since the other solutions works only with older versions, i decided to download old version files then use the another method. Finally works. The unique small problem is that i will be forced to play the tutorial again because
In the answer to , I was advised:      Yes you have to download the language pack. And you also have to go here: C:\Program Files (x86)\Origin Games\Dragon Age Inquisition\Data\Win32        In the folder loctext leave only the files en.sb and en.toc present, put the others in a folder named temp.   In the folder locfacefx make a copy of en.sb_DiP_STAGED and en.toc_DiP_STAGED, rename them to en.sb and en.toc. place the other language files into a temp folder   When I started the game the language was changed also into the interface. Take notes on what you have done and keep the original files in case something doesn't work, but for the moment that seem to work."   I have no en.sb_DiP_STAGED and en.toc_DiP_STAGED files in my Origin version of the game.
I am aware there are many questions similar to this on MSE but I am having trouble following any of the solutions given.   I have the function given by   $f(x) = \dfrac{xy}{x^2+y^2}\;$ for $(x,y)\neq (0,0)$ and $f(0,0)=0$  I have calculated the partial derivatives and found:   $$\frac{\partial f}{\partial x} = \frac{y(-x^2+y^2)}{(x^2+y^2)^2}, \quad \frac{\partial f}{\partial y} = \frac{x(-y^2+x^2)}{(y^2+x^2)^2}$$  Now I need to show the partial derivatives exist for $(x,y) = (0,0)$.  I am also asked to show it is not continuous at $(x,y)=(0,0)$, based on other answers I've seen it seems like this follows from solving the first part but I fail to see how that follows through as well.   I could just copy the solutions with my function in place as I have seen a lot of answers using the definition of the derivative, but realistically I do want to understand what the thinking behind this is.   Any help would be appreciated. I am new to the amsart document class. For some reasons \author (etc..) is not showing after I use \maketitle. This is my tex:  \documentclass[12pt,reqno,a4paper]{amsart}  \usepackage{amsmath} \usepackage{amssymb} \usepackage{amsfonts} \usepackage{mathrsfs}  \usepackage{amsthm}  \usepackage{latexsym}  \usepackage{pictexwd} \usepackage{pdftricks} \usepackage{natbib} \usepackage{setspace} \usepackage{color} \usepackage[affil-it]{authblk}  \begin{document}  \title{Temptation, Asymmetric information and Committment}  \author{Mark}  \affil{University of Leicester}  \date{February 2014}  \maketitle  \begin{abstract} To be written \end{abstract}  \section{introduction}  ...  \end{document}   and this is the output:   can anybody help me out? What does "+6 to hit, Hit: 13 (2d8 + 4)" mean in a creature's stat block? My friends and I are very new to D&amp;D, played like 3 times. In a monster's stats next to weapon damage it says stuff like "+11 to hit" and "Hit: 5 (1d8+1)". For the premade characters it just says things like "+4, 2d6 + 2 slashing", though. Why are there two "hit" numbers for monsters? Which do I use for the d20 roll to hit against a target's AC?  I mean for example like in the Ogre entry in the "" article on monsters. Sharing a Bluetooth Keyboard and Mouse sequentially between two Macs I work out of my house where I have two computers: a mid-2010 Macbook Pro (for my day job) and a mid-2010 iMac (personal). During the workday, my iMac acts as a second display for my Macbook Pro via Mini Displayport.  Currently, I use a USB keyboard and mouse for my work computer and a Bluetooth keyboard and Magic Mouse + Magic Trackpad for use with my personal computer. I'd like to get rid of the wired keyboard and mouse and just use the Bluetooth stuff for both machines (but never simultaneously).   Is it possible to easily share the single set of input devices without having to repeatedly break and reestablish the pairing of the input device to the correct computer? I'm not opposed to buying some type of additional hardware to accomplish this, provided it's not prohibitively costly or cumbersome to use or configure.  It's not clear to me how I would tell the MacBook Pro to leave the devices alone so the iMac can have them for the evening. I want to avoid de-pairing and re-pairing the devices each time I want to shift them back or forth.  Basically is there software or hardware that works as a Bluetooth KVM switch? How do I decompile a .NET EXE into readable C# source code? I wrote a C# application for a client a couple of years ago, but I no longer have the source code.  All I have is the EXE that I deployed on the client's PC.  Is there a way I can generate C# source code from the EXE? $k$ times's draw from $n$ numbers with replacement, each number at least appear once Sample $k$ times with order from $n$ distinct numbers with replacement where $k\ge n$. Here "with order" means the sample is treated like a sequence rather than a set, so results like "1,3,3" and "3,1,3" are different.  The question is what is the probability that every number is sampled at least once? My answer is $1-\frac{{\sum\limits_{i = 1}^n {C_n^i\times i! \times {{(n - i)}^k}} }}{{{n^k}}}$ where $C_n^i$ denotes $n$ chooses $i$.  ${C_n^i\times i! \times {{(n - i)}^k}}$ means first choose $i$ ($i=1,2,...,n-1$) of numbers not to appear in the sample, and then we sample from the remaining $n-i$ numbers for $k$ times.   My question is, is there more elegant solution where the numerator can be directly computed? i.e. can we directly calculate the number of possible sample sequences in which every number has at least one occurrence? Thank you!    PS: my attempt was $C_k^n\times n!\times n^{n-k}$, meaning that we first choose $n$ positions in the sequence of length $k$ to place $n$ numbers, and then permute the $n$ numbers. This is to ensure every number to appear once. The remaining $n-k$ are sampled from the $n$ numbers without restriction.   However, I later found this seems not correct, and it counts the same sequence multiple times.  PS2: as pointed out in the comments, my first answer "1- ..." is not correct either. Is this a plant or a fungus? It was soft and covered in flies. My guess is fungi.  Location: South Florida. If M is a non-orientable closed connected 3 manifold prove H1(M) is an infinite group. Updating a field programmatically, hook_node_update lcm versus phi in RSA In textbook RSA, the Euler $\varphi$ function $$\varphi(pq) = (p-1)(q-1)$$ is used to define the private exponent $d$. On the other hand, real-world cryptographic specifications require the Carmichael lcm function $$\lambda(pq) = \operatorname{lcm}(p-1,q-1)$$ to define $d´$. It is clear that the $d´$ divides $d$, and therefore using $d´$ may be more efficient than using $d$. My question is: Are there any further reasons, e.g. regarding security, why one should not use $d$? Why is plain-hash-then-encrypt not a secure MAC? Showing a set is closed under inverses Let $G$ be a finite group, say a group with $n$ elements, and let $\emptyset \neq S \subseteq G$. Suppose $e \in S$, and that $S$ is closed with respect to multiplication. Prove that $S$ is a subgroup of $G$.    Let $G = \{a_1, \ldots, a_n\}.$ Let $a_i \in G.$ Then any number of $a_ia_1, a_ia_2, \ldots, a_ia_n \in S,$ since $S$ is closed under multiplication. One of those $a_ia_j$ is $e$ since $e \in S.$ Then either $a_i$ or $a_j$ is $a^{-1}.$ Would this argument work? Help with proof that $\mathbb Z[i]/\langle 1 - i \rangle$ is a field. I have been having a lot of trouble teaching myself rings, so much so that even "simple" proofs are really difficult for me. I think I am finally starting to get it, but just to be sure could some one please check this proof that $\mathbb Z[i]/\langle 1 - i \rangle$ is a field. Thank you.  Proof: Notice that $$\langle 1 - i \rangle\\  \Rightarrow 1 = i\\  \Rightarrow 2 = 0.$$ Thus all elements of the form $a+ bi + \langle 1 - i \rangle$ can be rewritten as $a+ b + \langle 1 - i \rangle$. But since $2=0$ this implies that the elements that are left can be written as $1 + \langle 1 - i \rangle$ or $0 + \langle 1 - i \rangle$. Thus  $$ \mathbb Z[i]/ \langle 1 - i \rangle = \{ 0+ \langle 1 - i \rangle , 1 + \langle 1 - i \rangle\}. $$  This is obviously a commutative ring with unity and no zero-divisors, thus it is a finite integral domain, and hence is a field. $\square$ AutoHotkey Equivalent for OS X? Is there an equivalent product/method for AutoHotkey. For those that don't know, its a product that allows you to program your mouse movements and keyboard. This allows me to "macro" certain functions on programs instead of having to do it manually. In the old days they used to call them keyboard stuffers. But that is only half of the solution as I need a "mouse movement" stuffer as well.  Is there such a beast? If $\mathrm{Tr}(A)=0$ then $T=R^{-1}AR$ has all entries on its main diagonal equal to $0$ Prove that if $A$ is a square matrix and $\mathrm{Tr}(A)=0$, then there exists an invertible matrix $R$ such that the matrix $T=R^{-1}AR$ has all entries on its main diagonal equal to $0$.   It seems like the formula $A=S\Lambda S^{-1}$, but maybe it does not help.  Thanks so much. How do I make Chromium use Flash from Google Chrome? Now, that Adobe has stopped issuing new releases for Linux desktops, the only option for users is to use Google Chrome, for those who want to use the latest Flash updates. I use Chromium. Is there any way to get Chromium use the Flash from Google Chrome? The reason I as this question is that I have noticed both these browsers run in the background, so technically, the browsers' plugins are available to use. What is the 'molecular' origin of the viscosity? The molecular origin of elasticity is almost clear for me: at the very bottom the 'elasticity' comes from the attraction and repulsion between atoms when they are reasonably far from each other or very close (like Lennard-Jones potential). Is there a similar description for the viscosity as well? Where does it come from? Using thematic layer for segmentation in eCognition? I have a thematic layer, i want to perform segmentation and classification only within the thematic layer,not in a whole image. how can i do it? I tried to segment the image after viewing the thematic layer in view setting and the thematic layer usage was enabled, but it was segmenting the whole image. In my book, it proves that an infinite subset of a coutnable set is countable. But not all the details are filled in, and I've tried to fill in all the details below. Could someone tell me if what I wrote below is valid?  Let $S$ be an infinite subset of a countable set $T$. Since $T$ is countable, there exists a bijection $f: \mathbb{N} \rightarrow T$. And $S \subseteq T = \{ f(n) \ | \ n \in \mathbb{N} \}$. Let $n_{1}$ be the smallest positive integer such that $f(n_{1}) \in S$. And continue where $n_{k}$ is the smallest positive integer greater than $n_{k-1}$ such that $f(n_{k}) \in S$. And because $S$ is infinite, we continue forever. Now consider the function $\beta : \mathbb{N} \rightarrow S$ which sends $k \rightarrow f(n_{k})$.   So in order for $S$ to be countable, $\beta$ would have to be a bijection. $\beta$ is injective since if $f(n_{k}) = f(n_{j})$, then $n_{k} = n_{j}$ because $f$ is injective. We also can conclude $k = j$ because the various $n_{i}$ chosen were strictly increasing.   Edit: $\beta$ also needs to be surjective. So for every $r \in S$ there exists a $q \in \mathbb{N}$ such that $\beta(q) = f(n_{q}) = r$. We know that $f^{-1}(r) \in \{n_{1}, n_{2}, ..., n_{k} ... \}$, so we can let $f^{-1}(r) = n_{d}$. Thus $\beta(d) = f(n_{d}) = r$. How do I profile memory usage in Python? I've recently become interested in algorithms and have begun exploring them by writing a naive implementation and then optimizing it in various ways.  I'm already familiar with the standard Python module for profiling runtime (for most things I've found the timeit magic function in IPython to be sufficient), but I'm also interested in memory usage so I can explore those tradeoffs as well (e.g. the cost of caching a table of previously computed values versus recomputing them as needed). Is there a module that will profile the memory usage of a given function for me?