How to check public bool of different script in C# - Unity
How to access a variable from another script in Unity c#
YA novel where clumsy boy gains wings I'm trying to remember the name of a novel I read as a pre-teen.  If I recall correctly, it would have come out in the 90s (though it may have been a reprint).  The novel is set in modern times.  I recalled this because I've been reading a lot of urban fantasy lately, and this may be the first 'urban fantasy' book I read - our world, but with a touch of magic.  There's a somewhat clumsy, out of shape teenaged (or almost teenaged) boy who doesn't have a father.  His father had been a stage magician who was constantly frustrated by his son's complete inability to preform stage magic, despite a prediction saying he would have a great or powerful magic.  His father had died before the book started, I don't recall how long before.  The boy does something nice for an old woman (I don't recall what) and she gifts him a magical potion.  A drop of it, rubbed on his shoulder blades, will make him grow wings.  The book follows him for the summer, as he spends his evenings flying.  He makes himself a toga-like shirt out of some old curtains and spends time flying around at night.  I recall one scene where he learns about two children out in the middle of the bay (perhaps the book is set in San Fran?  I don't recall) in a rowboat with one oar.  He saves them (by pulling them back to shore using a rope they had with them) and gets mentioned in the paper as an angel.  At the end of the book, the potion has run out.  There's only a tiny little bit left, and when he rubs it in, it creates only a single feather.  Around that point, the boy realizes that he's no longer getting winded going up several flights of stairs and he's gained a lot of self-confidence.  From what I remember of the copy I read, the cover featured a shirtless boy wearing jeans standing in front of a mirror, looking at the large white feathered wings that had grown from his back. How SELECT column does not list in GROUP BY clause The query:  select year,sum(mark),sum(maxmark)  from table1  group by parameterno   yields an error message:     Column 'table1.year' is invalid in the select list because it is not contained in either an aggregate function or the GROUP BY clause. How to identify multiple USB-serial adapters under Ubuntu 10.1 Can Dropbox be used with multiple accounts on one computer? Package Cache File corrupted From advice on  , I've opened a new question about the same issue, as it turned out my problem was not the one described in the question, information I did not know at the time. I'm running Ubuntu 16.04.  $ sudo apt-get update  Hit:1 http://archive.ubuntu.com/ubuntu xenial InRelease Get:2 http://archive.ubuntu.com/ubuntu xenial-updates InRelease [102 kB] Get:3 http://archive.ubuntu.com/ubuntu xenial-backports InRelease [102 kB] Get:4 http://archive.ubuntu.com/ubuntu xenial-security InRelease [102 kB] Get:5 http://archive.ubuntu.com/ubuntu xenial-updates/main amd64 DEP-11 Metadata [307 kB] Get:6 http://archive.ubuntu.com/ubuntu xenial-updates/main DEP-11 64x64 Icons [226 kB] Get:7 http://archive.ubuntu.com/ubuntu xenial-updates/universe amd64 DEP-11 Metadata [185 kB] Get:8 http://archive.ubuntu.com/ubuntu xenial-updates/universe DEP-11 64x64 Icons [268 kB] Get:9 http://archive.ubuntu.com/ubuntu xenial-updates/multiverse amd64 DEP-11 Metadata [5,888 B] Get:10 http://archive.ubuntu.com/ubuntu xenial-backports/main amd64 DEP-11 Metadata [3,324 B] Get:11 http://archive.ubuntu.com/ubuntu xenial-backports/universe amd64 DEP-11 Metadata [4,712 B] Get:12 http://archive.ubuntu.com/ubuntu xenial-security/main amd64 DEP-11 Metadata [62.7 kB] Get:13 http://archive.ubuntu.com/ubuntu xenial-security/main DEP-11 64x64 Icons [71.2 kB] Get:14 http://archive.ubuntu.com/ubuntu xenial-security/universe amd64 DEP-11 Metadata [51.3 kB] Get:15 http://archive.ubuntu.com/ubuntu xenial-security/universe DEP-11 64x64 Icons [85.1 kB] Fetched 1,578 kB in 1s (1,529 kB/s)                                     Reading package lists... Error! E: Read error - read (5: Input/output error) W: You may want to run apt-get update to correct these problems E: The package cache file is corrupted   If there's any more information you need, don't hesitate to ask in the comments.  Edit 1:  $ sudo df -h Filesystem      Size  Used Avail Use% Mounted on udev            5.9G     0  5.9G   0% /dev tmpfs           1.2G  9.4M  1.2G   1% /run /dev/sda1       135G  7.2G  121G   6% / tmpfs           5.9G   14M  5.9G   1% /dev/shm tmpfs           5.0M  4.0K  5.0M   1% /run/lock tmpfs           5.9G     0  5.9G   0% /sys/fs/cgroup tmpfs           1.2G   88K  1.2G   1% /run/user/1000 /dev/sdb1       932G  300G  633G  33% /media/adoria298/MDrive1   Edit 2 SMART Test results: If $a,b,c$ are positive , show that $$\dfrac{b^2+c^2}{b+c}+\dfrac{c^2+a^2}{c+a}+\dfrac{a^2+b^2}{a+b} \ge a+b+c$$  Trial: Here  I proceed in this way $$\dfrac{b^2+c^2}{b+c}+\dfrac{c^2+a^2}{c+a}+\dfrac{a^2+b^2}{a+b} \ge  \dfrac{2bc}{b+c}+\dfrac{2ca}{c+a}+\dfrac{2ab}{a+b}$$ then how I proceed. Please help. error C2143: syntax error : missing ';' before 'type' Class object affecting other class object when thread.sleep- Python In  (not feature request), :  ... if we find that people are abusing the system their accounts may get suspended. I would consider that kind of behavior abuse.  Well  sure qualifies. He has 11 Stack Exchange accounts and has in the last day spammed at least 8 of them to gain the Suffrage and sometimes Vox Populi badges. That's over 250 votes† in just a few hours! (And  -- while voting on other user's posts too.) I guarantee that he's not voting on those posts for/by their merits. Here's when he scammed the Suffrage badge per site (while also gaming the Vox Populi on some sites):                      - 2017-03-11 16:23:15Z                     - 2017-03-11 17:41:41Z                     - 2017-03-11 18:08:13Z                           - 2017-03-11 19:25:10Z                  - 2017-03-11 19:55:16Z                               - 2017-03-11 20:00:49Z               - 2017-03-11 20:03:13Z  - 2017-03-11 21:11:40Z  Note that he got the badge on three sites within an 8 minute span (but that might just be job run times). Please revoke badges gained through improper voting. And, maybe also warn/suspend such abusive voters.   † His account vote totals don't show all votes as some serial voting was reversed -- but none of the ill-gotten badges were. Nonabelian semidirect products of order $pq$? Python and regular expression with Unicode I need to delete some Unicode symbols from the string 'بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ'  I know they exist here for sure. I tried:  re.sub('([\u064B-\u0652\u06D4\u0670\u0674\u06D5-\u06ED]+)', '', 'بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ')   but it doesn't work. String stays the same. What am I doing wrong? Using maxTimeMS parameter with aggregation queries on Mongo 2.6 and Pymongo 2.7.1 Why is it disadvantageous in graduate admissions to have a higher degree? indicates that holders of a master’s degree are held to higher standards when it comes to graduate admissions. The stated requirements for some graduate programs () also outright exclude applicants with doctoral degrees. These seem to be saying that holding a higher degree prior to application is a disadvantage (a fatal one in the case of a PhD). This also applies to private universities: Stanford  (at least in computer science); .  I don't understand why:   If there are two applicants, Alice and Bob, who have achieved largely similar things, it seems logical that both should have a roughly equal chance of being admitted. However, based on JeffE's answer, if Alice has a Masters degree while Bob does not, it's Bob that gets admitted instead of Alice. JeffE's answer even indicates that if Alice has achieved slightly more than Bob, it's still Bob that gets admitted.  If graduate admissions is looking for students that are capable of succeeding in its program, then Alice should be more likely to succeed than Bob since she's already had some experience of graduate study. This should be even more the case if Alice already has a PhD – if she can do it once, she should be able to do it again.    JeffE's answer indicates that since Alice has had more opportunities than Bob, she should also be held to higher standard. However it should also be true that Alice has already achieved what Bob has yet to and in fact might not be able to achieve. Further, JeffE's answer seems to be saying that Alice should do the academic equivalent of financial engineering and pass her graduate-level courses &amp; thesis without getting a master’s degree even if she qualifies for it, which sounds silly.  As for applicants with PhD degrees, my first guess would be that this is because , and the university is acting in the applicant's best interests. However if this is the case, then this is effectively telling the applicant "I know what you want better than you do", which also sounds silly. UC Berkeley's requirements also seem to be saying that if someone with a CV worthy of a tenured position were to apply for a PhD student position, the university will say "no" even though it's clearly better in their best interests (in terms of research output) to say "yes".   Presumably I'm misunderstanding something because if this behavior were irrational, it would already have been changed. What am I missing?  EDIT: I wonder if things are different in programs where the student is involved in research directly without spending time on coursework? How to prove that there exist no functions $f,g:\Bbb{R}\to\Bbb{R}$ such that $f(g(x))=x^{2018}$ and $g(f(x))=x^{2019}$? I have tried a little bit to solve the problem which goes as follows:   My intuition says that there exist no $f:\Bbb R\to\Bbb R$ such that $$f(g(x))=x^{2018}\text{ and }g(f(x))=x^{2019}.$$  Note that $$f(g(f(x)))=f(x)^{2018}\implies f(x^{2019})=f(x)^{2018}$$  Similarly, $$g(x^{2018})=g(x)^{2019}$$ Putting $x=1$ in $f(x^{2019})=f(x)^{2018}$, we get $f(1)=f(1)^{2018}$ and thus $f(1)=0$ or $f(1)=1$.  Similarly, putting $x=1$ in $g(x^{2018})=g(x)^{2019}$ we get $g(1)=g(1)^{2019}$ and thus $g(1)=0,1,-1$.  Now, I can't proceed further. Can anybody solve it? Thanks for assistance in advance. Inclusion of Fields whose order is a prime power Blue was correct, I need to fix my understanding of this:     Finite fields have cardinality of a prime order because they have a prime subfield that has finite characteristic.    I do not completely understand why finite field of each characteristic is unique. Perhaps we look at a polynomial and express the finite field as a splitting field? And we use uniqueness of splitting fields?  Then, why is it that  $\mathbb F_{p^m} \subseteq \mathbb F_{p^n}$ if and only if $m$ divides $n$? I have a dual screen setup on my laptop (using 12.04 LTS) using a HDMI connected display. Everything works fine, but everytime I connect/disconnect the cable I have to go to Sound preferences and change the sound output device manually.  Is there any way to change the sound output device on connect/disconnection of cable, so when I connect my display the sound output is set to HDMI and when I disconnect it the sound goes back to laptop speakers? Problem:   Prove that a set of nine consecutive integers cannot be partitioned into two subsets with same product   My attempt:  This problem would be solved if it could be proven that 9 consecutive numbers cannot exist such that all the numbers are of the form $2^a  3^b  5^c  7^d$ where $a,b,c,d$ are integers.  A suitable hint would be appreciated, I don not want a complete solution.  Edit:  If there existed a prime factor greater than $7$ of any number present in the set, then its multiple cannot exist b/c $22-11&gt;9$  Edit 2: As mentioned by Erick, my reasoning is not valid for numbers $1-9$ and $2-9$, let this be an exception. $A \cup B$ and $A \cap B$ connected $\implies A$ and $B$ are connected Let $X$ be a topological space. Let $A$ and $B$ be two subsets of $X$ such that: $A$ and $B$ are closed, $A \cup B$ is connected, $A \cap B$ is connected     Prove that $A$ and $B$ are connected.   Thoughts:  Suppose that $A$ is disconnected. Since $A$ is closed, there are two non-empty, disjoint, closed sets $E$ and $F$ in $X$ such that $A = E \cup F$. Then I attempted many things but all were not really useful.  Please help. Thanks. Book identification: technologically-enhanced man (1970s/80s YA) change terminal title I want to make a shell alias that starts a certain program and also changes the title of the terminal to the name of the program.  How can I do that?  In case it matters, I am running the terminal on Ubuntu and connecting to a Debian server via ssh.