This could be an interesting Question.  I Found and iPhone 5S, I handed it into the police. After 2 Months they returned the Phone, no one claimed it. I have a Sticker on the back of the phone with police details on it. So in our country, that is proof of ownership. I am now the new owner of this phone. BUT.....It is a brick, as the security has been enabled. I have a start up screen that looks like a brand new phone and I must enter an iCloud account and password. I do not have this information. I have contacted Apple Help USA, They say I need a court summons ??? WHAT!!! I contacted Apple technical Support, ( basically they said NO ) SO. the Question is.... Is there a way around this?  ( I am happy to send a photo with the police details on it. To prove ownership.) Thanks  Anthony
I bought a used iPhone 4.  The previous owner re-set the phone, but did not remove the device from their iCloud.  It is asking me for their iCloud information when I try to set-up the phone.  I don't have contact with the previous owner anymore.  Is there a way to remove the device from their iCloud so I can use a new one?
Detect the Internet connection is offline? How to detect the Internet connection is offline in JavaScript? There are no interfaces on which a capture can be done Union of uncountable cardinals I have to prove the following:  Let $\omega_1$ be the least uncountable cardinal and, for each $n \in \omega$ (here, $\omega$ is the set of natural numbers denoted as an ordinal/cardinal), $n\ge1$, let $\omega_{n+1}$ be the least cardinal that is greater than $\omega_n$. Show that $\bigcup_{n\in\omega}\omega_n$ is a cardinal.  I suppose the proof has something to do with transfinite induction/recursion, but I don't know exactly how I'm supposed to use it. Any thoughts? Symmetric encryption construction (meet-in-the-middle attack) This is a question I had from an exercise session.  First we do DES in CBC encryption mode using a key $K_1$ and $IV_1 = O^n$. Then we do DES in ECB decryption mode using $K_1$. And then DES in CBC decryption mode with a secret $IV_2$ and key $K_2$.  Is this construction safe against meet-in-the-middle attack?  Wouldn't the first two operations negate themselves because $C_1$ would decrypt into $P_1$? I have a multi-line equation that I want to have matching sized parentheses. The advice I read online was to use \left( equation \right. \\ left. rest-of-equation \right) . However, this syntax leaves first half of the equation unaware of what is in the second half. For example, if you include a square root term after the break, the second parenthesis will be larger than the opening parenthesis. When you are using the aligned environment to split a long equation this can look somewhat offputting.    Compare the top equation to the bottom one. The parentheses match in size for the bottom equation, but the left hand parentheses for the top one is  noticeably smaller.  Top Code:   \begin{aligned}[t]   \gamma_{\text{u}} + \frac{1}{108}   \left(57\gamma_{\text{er}} \right. &amp;+  38\gamma_{\text{se}}\\ &amp; {}\pm  \left.\sqrt{2601 \gamma_{\text{er}}^2 + 3648  \gamma_{\text{er}}\gamma_{\text{se}} + 1444 \gamma_{\text{se}}^2}  \right)   \end{aligned}   Bottom Code:  \begin{aligned}[t] \gamma_{\text{u}} + \frac{1}{16} \left(9\gamma_{\text{er}}  +  6\gamma_{\text{se}} \pm  \sqrt{49 \gamma_{\text{er}}^2 + 76 \gamma_{\text{er}}\gamma_{\text{se}} + 36 \gamma_{\text{se}}^2} \right) \end{aligned} What should I do if I want to be able to run a given program regardless of my current directory? Should I create a symbolic link to the program in the /bin folder? Elegant proofs that similar matrices have the same characteristic polynomial? Let $been(x,y)$ denote "person x has been to place y."   Express “Every person has been to 2 or more places” using quantifiers and $been(x, y)$.  This one is completely stumping me. I'm sure that I haven't come across this kind of concept before, and can't wrap my head around how I would approach it. I suspect the quantifiers should be $∀x$, $∀y$, and that it may involve negating the statement "every person has been to one or zero places," but that's as far as I can manage to go. Any help greatly appreciated. Does a sorcerer's metamagic work for non-sorcerer spells? Can a multiclass sorcerer/cleric use the Metamagic class ability with non-sorcerer spells? For example, using Twinned Spell when casting cure wounds to heal two creatures instead of just one? Counting buffer overlap in QGIS GCD in a PID persists in extension domains Let $R$ be subring of integral domain $S.$ Suppose $R$ is $\text{PID}.$ Let $a\in R$ be a greatest common divisor of $r_1,r_2$ in $R$. ($r_1,r_2 \in R$, not both zero). Could anyone advise me on how to prove $a$ is greatest common divisor of $r_1,r_2$ in $S?$   Hints will suffice, thank you. I have a sheet in which I first apply a filter to a certain column to show "Unique records only". Now I have a column which contains, for e.g., values like:  Applepie Applesauce Crabapple Banana Mango   What I need is the count of all visible cells containing the word "Apple". Note that this should exclude the hidden (filtered out) cells. Now I have found out a formula:  `=SUMPRODUCT(SUBTOTAL(3,OFFSET(Sheet1!A:A,ROW(Sheet1!A:A)-MIN(ROW(Sheet1!A:A)),,1))*(Sheet1!A:A="&lt;Text to search&gt;"))`   However the problem with this one is this formula searches for the entire text. NOT just a part of it. How do I modify this formula to return count of cells containing "Apple" i.e. for this example it should return 3 as the result. How to convert a list of string to a list of int Assume $T \in \mathbb{R}^{d\times d}$. Let $\rho(T)$ be the spectral radius of $T$ and $\rho \ge 0$. Prove that  $\rho(T) &lt; \rho$ if and only if there exists a $P \succ 0$ satisfying $T^TPT - \rho^2 P \prec 0$.  I can prove the Necessity: If $P = I$, for any $x \in \mathbb{R}^d$,   \begin{equation} x^T T^T P T x - \rho^2 x^T P x = \| Tx \|^2 - \rho^2 \| x\|^2 &lt; 0 \end{equation} so $T^T PT - \rho^2 P \prec 0$  I get stuck in proving the Sufficiency. Sending a JavaScript variable to a PHP function I am trying to send a value in JavaScript variable to Drupal. I am calling an external js file in hook_nodeapi(). I want to send a value from this external js file to Drupal, and want to use this value in Drupal in hook_block. For example  hook_nodeapi() {   // call(external.js) } external.js var sendData =10;  hook_block {   case view:   // need to access sendData value }   I tried this using cookies, but I think that is not the best way. How can this be done? What color are Nissa, Worldwaker's lands? Permanent xmodmap in Ubuntu 13.04 I cannot make xmodmap run on login in Ubuntu 13.04. I have searched around, including in askubuntu and all answers I found do not work.  I have a file named .Xmodmap in my home folder which contains the desired mappings. If I run it manually it works fine, so there is no error there. In order to make it run on startup, I have tried:     Using various .xinitrc containing one of the following commands:      xmodmap .Xmodmap xmodmap ~/.Xmodmap   /usr/bin/xmodmap /home/NAME/.Xmodmap if [ -s ~/.Xmodmap ]; then xmodmap ~/.Xmodmap fi  Using .Xresources instead of .xinitrc with the same variations. Setting it as a startup application.   None of the above works in Ubuntu 13.04 (64-bit). I also saw a few ideas about globally changing the keyboard mappings, but most of them were not applicable in Ubuntu 13.04 (i.e. the corresponding files did not exist where specified) and I prefer not to touch the global settings anyway. I use form to send POST request to a page and to login user with wp_signon() in order to authenticate user to my wordpress installation as described in WP documentation:  $creds = array(); $creds['user_login'] = $_POST["user-login"]; $creds['user_password'] = $_POST["user-password"]; $creds['remember'] = true;  $user = wp_signon( $creds, false );   After this little piece of code I'm checking if user was logged in:  if ( is_user_logged_in() ) { echo "SUCCESS"; } else { echo "FAIL!"; }   But I got FAIL! all the time. Then after sniffing around I found this little trick:  wp_set_current_user( $user ); if ( is_user_logged_in() ) { echo "SUCCESS"; } else { echo "FAIL!"; }   I've got SUCCESS on this one but when I leave this page I got FAIL again and again.  Can anyone explain me how to login user with wp_signon() without logging her out after page is changed or reloaded or whatever.    I've got desirable result when I go to /wp_admin and login with WP's default login form. I can navigate through every page of my WP site remaining logged-in all the time. But when I try to do this outside the default form I FAIL.  Guide me! PLEASE! Zip using Oracle Stored Procedure Is there a way to conveniently define a C-like structure in Python? I'm tired of writing stuff like:  class MyStruct():     def __init__(self, field1, field2, field3):         self.field1 = field1         self.field2 = field2         self.field3 = field3