As we know, we define $$\sqrt{-1}=i$$ But I always wondered, what about $\sqrt{i}$? As far as i can see, it is not an integer power of $i$. Every odd root has a solution in an integer power of $i$, but I can't find one for my question. Is there something I am missing here?
If $i=\sqrt{-1}$, is $\large\sqrt{i}$ imaginary?     Is it used or considered often in mathematics? How is it notated?
I have this below code where i am trying to first search an account name and on hit button it displays the result set.  On the button click i am also loading an child component which is displaying the id of the record.  I need the child component should get displayed once i click on the record.  How can i achieve this -   Parent Component -   &lt;aura:component controller="SimpleAccountController"&gt;     &lt;aura:attribute name="account" type="account[]"/&gt;     &lt;ui:outputText aura:id="outName" value="" class="text"/&gt;     &lt;ui:inputText aura:id="name" label="Enter Name:" placeholder="Your Name" /&gt;     &lt;ui:button aura:id="button" buttonTitle="Click to see what you put into the field" class="button" label="Click me" press="{!c.getInput}"/&gt;     &lt;aura:iteration var="acc" items="{!v.account}"&gt;             &lt;a onclick="{!c.accountselected}" data-recId="{!acc.Id}"&gt;         &lt;p&gt;{!acc.Name} : {!acc.Type} : {!acc.Industry} : {!acc.Rating}&lt;/p&gt;             &lt;/a&gt;         &lt;c:HelloWorkdChildCmp selectedaccount="{!acc.Id}" /&gt;     &lt;/aura:iteration&gt; &lt;/aura:component&gt;   COntroller -   ({     getInput : function(cmp, evt) {         var myName = cmp.find("name").get("v.value");         var myText = cmp.find("outName");         var greet = "Hi, " + myName;         myText.set("v.value", greet);         var action = cmp.get("c.seaAcc");         action.setParams({ "s" : myName });         action.setCallback(this, function(response) {             var state = response.getState();             if (state === "SUCCESS") {                 cmp.set("v.account", response.getReturnValue());                 //alert("From server: " + response.getReturnValue());             }         });         $A.enqueueAction(action);     },      accountselected : function(cmp, evt) {        console.log(evt.currentTarget.getAttribute("data-recId")) ;     }  })   Child component -   &lt;aura:component &gt;     &lt;aura:attribute name="selectedaccount" type="String"/&gt;     &lt;div&gt;Id: {!v.selectedaccount}&lt;/div&gt; &lt;/aura:component&gt; How can I filter items with a certain enchantement? I am trying to build a custom Adventure Island. At this moment I am trying to limit the allowed items on this island. I'm trying to do this by filtering on a certain enchantment which is not item-specific.  For example.   When you want to filter an wooden sword with a custom name, you use this command:  /testfor @p[r=5] {Inventory:[{tag:{display:{Name:"Custom Sword"}}}]} &lt;   When you want to filter a wooden sword with a custom name and specific enchantement, you can use:  /testfor @p[r=5] {Inventory:[{tag:{display:{Name:"Custom Sword"},ench:[{id:16,lvl:1}]}}]} &lt;   But how can I filter on items with a specific enchantment on ANY item? I tried:  /testfor @p[r=5] {Inventory:[{tag:{ench:[{id:16,lvl:1}]}}]} &lt;   But this ain't work. Does anyone know how to solve this issue? My specific question is with the ASUS M3N78-VM motherboard that my home server uses. I currently have 4x2GB installed for a total of 8GB but I was hoping to upgrade to say 16GB (4x4GB). The official specifications of that motherboard says it only supports up to 8GB but it was released back when only 2GB sticks were available. What, if any, would prevent it from working with 4GB sticks now that 4GB sticks are available?  My general question is with motherboards in general... what would prevent a motherboard from working with bigger sticks if its all just the same type (DDR2 for example and same speeds) of memory? Overriding the java equals() method - not working? I ran into an interesting (and very frustrating) issue with the equals() method today which caused what I thought to be a well tested class to crash and cause a bug that took me a very long time to track down.   Just for completeness, I wasn't using an IDE or debugger - just good old fashioned text editor and System.out's. Time was very limited and it was a school project.  Anyhow -   I was developing a basic shopping cart which could contain an ArrayList of Book objects. In order to implement the addBook(), removeBook(), and hasBook() methods of the Cart, I wanted to check if the Book already existed in the Cart. So off I go -  public boolean equals(Book b) {     ... // More code here - null checks     if (b.getID() == this.getID()) return true;     else return false; }   All works fine in testing. I create 6 objects and fill them with data. Do many adds, removes, has() operations on the Cart and everything works fine. I read that you can either have equals(TYPE var) or equals(Object o) { (CAST) var } but assumed that since it was working, it didn't matter too much.  Then I ran into a problem - I needed to create a Book object with only the ID in it from within the Book class. No other data would be entered into it. Basically the following:  public boolean hasBook(int i) {     Book b = new Book(i);     return hasBook(b); }  public boolean hasBook(Book b) {     // .. more code here     return this.books.contains(b); }   All of a sudden, the equals(Book b) method no longer works. This took a VERY long time to track down without a good debugger and assuming the Cart class was properly tested and correct. After swaapping the equals() method to the following:  public boolean equals(Object o) {     Book b = (Book) o;     ... // The rest goes here    }   Everything began to work again. Is there a reason the method decided not to take the Book parameter even though it clearly  was  a Book object? The only difference seemed to be it was instantiated from within the same class, and only filled with one data member. I'm very very confused. Please, shed some light? What does the word "SARGable" really mean? How do you pass a function as a parameter in C? Determine the number of functions $f: \{1,2,3....,1999\}\to \{2000,2001,2002,2003\}$satisfying the condition that $f(1)+f(2)+...f(1999)$ is odd. Problems:Determine the number of functions $$f: \{1,2,3....,1999\}\to \{2000,2001,2002,2003\}$$ satisfying the condition that $f(1)+f(2)+...f(1999)$ is odd.   My Attempt: Each integer in domain has $4$ choices and therefore the total number of functions is $f$ is $4^{1999}.$ Since there are an equal number of functions that yield odd or even result, we can directly write that the number of functions satisfying the above condition to be $2*4^{1998}.$ I am unsure about this last claim and would like to prove it (if it is true.)Also is the answer to this problem correct?  Edit $1$: I tried to proceed further in the following manner:   For a given mapping $f$ let the number of integers assigned to $2000,2001,2002$ amd $2003$ be $p,q,r$ and $s$ respectively, where $p,q,r,s\in \mathbb{Z}^+$. Therefore the sum in question can be written as $f(1)+f(2)+...+f(1999)=2000p+2001q+2002r+2003s.$ Clearly the sum will be odd iff $q+s$  is odd. Also note that $p+q+r+s=1999\Rightarrow p+r$ is even. On the other hand if we let $q+s$ as even then $p+r$ must be even. Now the number of values of $p,q,r$ and $s$ for which the above two lemmas hold is the same and therefore if we let $f$ to be the function which maps elements form $\{1,2,3,...,1999\}$ to $\{2000,2001,2002,2003\}$ such that $q+s$ is even and $g$ to be the function  hich maps elements form $\{1,2,3,...,1999\}$ to $\{2000,2001,2002,2003\}$ such that $p+q$ is even we will get a bijection.(Maybe!) I have two raster images, Boolean classified (1 or 2).  They overlap in given areas.   I need a raster that is only the overlapping sections.  Using Arcinfo 10.  Answer can only use raster methods, no converting to polygons, points, etc... I’m a newbie in Python. I’m learning regexes, but I need help here.  Here comes the HTML source:  &lt;a href="http://www.ptop.se" target="_blank"&gt;http://www.ptop.se&lt;/a&gt;   I’m trying to code a tool that only prints out http://ptop.se. Can you help me please? Enumerate within TikZ node How can I create light trails without a blurry subject? I would like to achieve this effect using my Nikon P510:      Are there any suggestions or tips that would help me do that? Strange problem with BibTeX sorting How do I get Power Armor training in Fallout New Vegas? I've found some power armor, but I can't use it yet without training. I assumed that the Brotherhood of Steel would train me, if they like me enough.  I've completed the Brotherhood of Steel quest series for the overseer (the original one, I did not overthrow him), but I did not get any Power Armor training. What do I have to do to be able to wear Power Armor? What is the difference between these two Breusch-Pagan Tests? Using R on some data and trying to see whether or not my data is heteroscedastic, I've found two implementations of the Breusch-Pagan test,  (package lmtest) and  (package car). However, these produce different results. What is the difference between the two? When should you choose to use one or the other?  &gt; model &lt;- lm(y ~ x) &gt; bp &lt;- bptest(model) &gt; bp studentized Breusch-Pagan test  data:  model  BP = 3.3596, df = 1, p-value = 0.06681  &gt; ncvTest(model) Non-constant Variance Score Test  Variance formula: ~ fitted.values  Chisquare = 3.858704    Df = 1     p = 0.04948855    These example shows that according to the tests, my data is in one case heteroscedastic and in the other case homoscedastic. I did find  so bptest might be studentized and ncvTest might not be, however, what does this mean then? Can I use a one time pad key twice with random plaintext? In C, are arrays pointers or used as pointers? Value too great for base (error token is "09") Whether and how to thank a girlfriend or boyfriend in the acknowledgements of thesis? How is it received by the academia if someone thanks to his/her girlfriend/boyfriend in the acknowledgements of the thesis?  I have seen writers including his/her fiancee in the acknowledgements, however I don't know if including an informal relationship in the thesis will be received well.  If it is acceptable, how should I refer to my girlfriend? I don't want to do this through trial and error, and the best way I have found so far was to start dividing from 1.     $n! = \text {a really big number}$   Ex. $n! = 9999999$   Is there a way to approximate n or solve for n through a formula of some sort?  Update (Here is my attempt):  Stirling's Approximation: $$n! \approx \sqrt{2 \pi n} \left( \dfrac{n}{e} \right ) ^ n$$  So taking the log:     $(2\cdot \pi\cdot n)^{1/2} \cdot n^n \cdot e^{-n}$       $(2\cdot \pi)^{1/2} \cdot n^{1/2} \cdot n^n \cdot e^{-n}$       $.5\log (2\pi) + .5\log n + n\log n \cdot -n \log e$       $.5\log (2\pi) + \log n(.5+n) - n$   Now to solve for n:     $.5\log (2\pi) + \log n(.5+n) - n = r$       $\log n(.5+n) - n = r - .5 \log (2\pi)$   Now I am a little caught up here. When I am at my desk and my laptop is in its docking station I want to ensure that it uses its wired connection and not my wireless network. I am hoping/guessing that the preference in connection is based on the order of the listed connections in the Network and Sharing Center. I could just switch the wireless off but I'd prefer to not have to go through the trouble.