Measurability of a 2 variable function
$f_x$ is Borel measurable and $f^y$ is continuous then $f$ is Borel measurable
ok, ive a class and i pass an object as property.  the object that i pass is a List&lt;X&gt;  in my class im trying to access the Object index by reflection BUT I CAN'T!!!   Example:  this class works i just wrote down the part i want to show you and i need help.  class MyClass {     private object _recordSet;     public object RecordSet     {         get { return _recordSet; }         set { _recordSet = value; }     }      public string Draw()     {         system.reflection.Assembly asem = system.reflection.Assembly.getAssembly(_dataSource.GetType());          object instance;          instance = asem.CreateInstance(_dataSource.GetType().UnderlyingSystemType.FullName);          //to access de Count of my List         int recordcount = int.Parse(_dataSource.GetType().GetProperty("Count").GetValue(_dataSource,null));          //i need to do a          for(int cont = 0; cont &lt; recordCount; cont++)         {             _dataSource[cont].Name; // &lt;-- THIS PART IS NOT WORKING!!! because i cant access the Index Directly.... WHAT TO DO!! ???         }     } } Limits of trig functions Fix for Hibernate error "Use of the same entity name twice" How you fix the following Hibernate error:  What does "Use of the same entity name twice". parsing a date string from FTPClient.getModificationTime() How to make a jquery click event fire only on first click I'm usually running many different StackExchange sites in Firefox using tabs (using ReloadEvery to update every 5 minutes).  Right now to check for activity, I have to manually click on the tab to see if the envelope is lighted.  How about making the icon on the tab i.e. the title text change in some way, denoting that you have activity on the page?  We already add a message count for the chat tabs, so this shouldn't be very complicated.  Possible Example: Proof that $\suṃ̣_{k=1}^{n}k {n \choose k}$ for $n \in \mathbb N$ is equal to $n2^{n-1}$.  As a hint I got that $k {n \choose k} = n {n-1\choose k-1} $.  I tried solving this by induction but, in the inductive step I'm not arriving to the correct result. Is my mobile AMD card being used? I have a new Sony E Series Vaio with an intel i5 and an AMD 7xxx mobile card. Despite making sure sure my app (game) is set to High Performance in switchable gfx and choosing high performance power plan I'm not entirely convinced the gfx card is being used over the CPU's HD4000 chipset. Is there anyway I can prove for sure the AMD card is being used?  thanks for reading  (OS is Win8 64bit) HDMI over cat extender video Word caption style -- different style for label and number? This should be a common problem for anyone involved in technical writing.  When you insert an image (or table etc.) caption in Word, you get  dialog. You enter your caption,  "A happy bicycle" (in yellow).  This might be fine for a happy bicycle, but I want to have captions that have one style for the "enumeration" (label and number) and one style for the description (caption text, as called by Word), as such:    I have tried searching for this but I haven't found anything yet... How to modify a text file? Assuming file2 already exists, the command   &gt; file1 &lt; file2 cat   appears to be copying the content of file2 to file1.  But I cannot understand this structure.  I understand that "Nothing" is being directed to file1 (creating or erasing its content). Then the content of file2 is being directed to file1.  Why is cat after file2? How does it know to cat file2 if the operands are not in the correct order? When will there be a Windows Phone app? Sum of digits of repunits I am working on the following problem asked in an examination: "What is the maximum number of cylindrical pencils of 0.5 cm diameter that can be stood in a square shaped stand of 5cm × 5cm inner cross section? 1. 99    2. 121   3. 100    4. 105." A simple calculation yielded me the answer 100.  But the answer in the key is 105. I don't how such an answer is possible. Any hint please.....Thanks in advance! A finite $p$-group cannot be simple unless it has order $p$ I am to trying to prove this theorem: A finite $p$-group cannot be simple unless it has order $p$.  I have this:   Let $G = P$ and $|G|=p$; then there exists $N$, a normal subgroup of $G$ by Lagrange's theorem, such that $|N| \mid |G|$ so, $|N|= |e| = 1$ or $|N| =  p$  If $|N|=p$ so $N=G$.  But I don't know how I can prove the part in the case of $|N|=|e| = 1$  Is my start correct? I have multiple datasets that I am attempting to use principal component analysis (PCA) on in order to infer the underlying structure of the data.  I'm attempting to predict growth increment of conifers (the response which apparently needed to be cube root transformed for my original linear models).  My predictor variables include: continuous (some log-transformed like size-related variables, some compositional, and some traditionally scaled); binary; ordinal; and nominal (of which I'm pretty sure I can order with respect to site productivity).  I'm mostly attempting to make inferences because some of my previous models from linear regression have not produced significant terms corresponding to categories like health or climate and I feel that they should have.  I've read in Joliffe (2002) that I might want to leave my compositional data uncentered.  Forgive my naiveté, but I'm wondering if I should also do this for my binary data.  It also seems that I might not want to scale these since they're already on a 0 - 1 scale but I'm not sure.  After only using my continuous predictors (including compositional variables), it appears that a size principal component makes up the largest portion of the variability and Joliffe also mentions that one might want to attempt a "double-centering" of the log-transformed data if this is the case.  I don't know if this is even possible since the log-transformed data only makes up a small portion of my datasets.  Finally, I should ask if having such a combination of data types will complicate analysis so much that it will make inferences unreliable.  I am currently using R for this analysis.  Thank you. When can I make opportunity attacks? What provokes an opportunity attack?  In 3.X moving out of a threatened square, standing up from prone, casting a spell (unless cast defensively), or making a ranged attack provoked, while in 4e moving out of a threatened square or making a ranged/area attack provoked. Teams of users rails app I have read questions about this, and people say that it is just to include the natbib package and the plainnat style. For some reason my references will not sort alphabetically. Any help on this would be much appreciated! I am really new to LaTeX ...  My commands:  \documentclass[a4paper,norsk]{article} \usepackage{amstext} \usepackage{makeidx} \usepackage{graphicx} \usepackage[comma,authoryear]{natbib} \usepackage[norsk]{babel} \usepackage[hmargin=3cm,vmargin=3.5cm]{geometry} \pagestyle{plain}  \begin{document}  \begin{thebibliography}{56}  \end{thebibliography}  \printindex  \bibliographystyle{plainnat}  \end{document}