Suppose you a have triangle ABC of sides 15, 13 and 4. Three parabolae are drawn such that each parabola is tangent to two side of the triangle such that the third side is a chord of the parabola, which means the two tangents touch the parabola at the vertices of the triangle. Find the area common to the 3 parabolae. I am a high school student and my maths teacher just asked this question in class. He then told us to not waste our time on it as it is way beyond our level but this keeps bugging me. I have only studied coordinate geometry(algebraic) so I have very little experience in pure geometry of parabola. I tried to find some symmetry in the question like 5,12,13 and 9,12,15 are pythagorean triplets. I know of a formula which describes the locus of a point from which tangents subtend a particular angle to the parabola which I tried applying as I know all of the angels of the triangle but it was very tedious. I thought maybe the chords are focal chords but I realised tangents at ends of focal chord subtend right angles, so that's also not possible. In the end none of attempts yielded anything fruitful. So how to solve this problem? Is there an elegant solution without any messy algebraic calculations? Bonus points for book suggestions having these type of tough problems within the high school curriculum.

Triangle $ABC$, $AB=4$, $BC=15$, $AC=13$. Two sides are tangents to the respective Parabolas. We have to find the area shaded. My approach-  I tried finding the area of the quadratures(Archimedes) formed but it doesn't help as- I have to find the area between the 2 intersecting Parabolas also which I can't find.


I've been looking for years - only things I have are, the protagonist is a man, he's friends with a young man who can shape shift - at one point the man talks to a jaguar like creature thinking it's the young man, while he's actually off to the side telling the man not to stop talking, or the cat will tear his throat out.  There's a weird prison, the warden is a large, Jabba the Hutt like creature to my memory and he loves a female prisoner sentenced with immortality. He lets her out once every.... Blank years to walk on the beach.  I'm not sure if this is some obscure b-movie or awful sci-fi channel series or maybe a mini-series? But any help would be appreciated.

I remember watching something on TV that seemed like it was the first episode of a TV series.  It might have just been a pilot of something that got cancelled, or I guess it's also possible it was a miniseries or made-for-TV movie.  I believe this was in the mid-90s, but definitely at some point in the 90s, when I saw it.  I'm guessing that's also when it was made, because the production quality seemed decent to me at the time--nothing special, just didn't seem dated.  Anyway, there was a young doctor just arriving fresh for his first post, in some backwater or frontier planet or region--I remember some sort of contrast between his training and equipment and their (wooden?) housing.  I think he was resentful about the post.  It also turned out to be quite dangerous.  The locals suffer periodic attacks from riders on horseback who emerge from some sort of rift--like a tear in space/time sort of portal.  So there's some sort of sci-fi frontier medicine vibe going on.  Finally, I also remember there was some surgery and/or combat scenes with a bit of blood.  I was young and it was too much blood for me at the time, so I changed the channel and never managed to find this again...  Any ideas what this was?


My dad's laptop apparently has a password for Windows 10 but he doesn't need to enter it on start up - the password screen flashes by briefly with it already filled in. However, while trying to change the display settings recently, the desktop goes off for a moment, then comes back to the login screen, waiting for the password, which has long been forgotten, since it's never used. We can get past it by shutting down from the login screen and starting up again. How can we remove this password if we don't know it?

I got a brand new Windows 7 machine, installed the operating system, created one account and forgot its password. What can I do?  There is no external CD, the operating system is loaded from somewhere inside the machine.  I already tried to remember passwords and tried all candidates with all possible combinations of caps lock, num lock etc.


Consider $ab$ and $cd$ which are two words. We merge these two into 6 possibilities: $abcd, acbd, acdb, cabd, cadb, cdab$  So in general, a merge of words/sequences $x, y ∈ Σ∗$ , is a word of length $|x| + |y|$ with both $x$ and $y$ as disjoint subsequences in it.  For two languages $L1$ and $L2$ their merge is defined as the set of all possible merges of two words $x ∈ L1, y ∈ L2$.  So basically, a merge is a modified shuffle and should be of length that of the sum of the length of two languages, and should also be in order (see $ab$ and $cd$ example, as $b$ could not come before $a$).  I was thinking of just connecting the states of all $L1$ and $L2$ but this seems wrong as if you connect them all like a fully connected graph, one can jump and go back which is not acceptable.   What's a basic idea on the construction I could do to prove this?

For languages A and B, let the shufﬂe of A and B be the language $ \{w| w = a_1b_1···a_kb_k,$ where $a_1···a_k ∈ A$ and $b_1···b_k ∈ B,$ each$ a_i,b_i ∈ Σ^∗\}$. Show that the class of regular languages is closed under shufﬂe.  Approach: If A and B are regular, then there exists an NFA R and T that recognizes them. I was thinking I could run R and T in parallel, so I would start running R by processing $a_1$ and then by using non-determinism, I would jump to the NFA T to process $b_1$. In this process I make sure that both NFAs aren't executed the original way because that would result in accepted strings that are not in the language, so I try to disconnect the edges in each NFA to jump to the other NFA and then disconnect again the edges of this NFA to come back to the previos NFA.. Is this process clear?  Here is the proof, but some lines are a bit unclear to me.  I can't understand d)i. I don't understand how the transition function works. How does it detect whether we are at DFA A OR B?


I have read in many places that some virtual particles can "travel faster than light (1)" and thereby "go backwards in time (2)".   My question is about the connection between these two. I have always perceived this connection as follows:     If a thing can go faster than light, it leaves the image of now   behind so can witness the past. Like a thing has traveled from a star   to the Earth in 1 year, while the star is 2 light-years away.   Therefore this thing can see its past.      However, this thing is not in its original location anymore. And if it   tries to go there, even with infinite speed, can only land into the   future of its star. So it cannot interfere the history.   Is this what is meant by backward time travel when going faster than light?

Let's say I have two planets that are one hundred thousand lightyears away from each other. I and my immortal friend on the other planet want to communicate, with a strong laser and a tachyon communication device.  I record a message on the tachyon communication device and release the message at exactly the same time as I activate the laser, both of which are directed to the other planet which is one hundred thousand lightyears away. Say it is the year 0 for both of us at the time I did this.  If tachyons existed, then the message would arrive to my friend before the photons in the laser. It would arrive, say, a thousand years earlier. From my vantage point, that message will arrive to her at year 99,999; the same would be true for my friend's vantage point. However, she will only see the laser at year 100,000.  So since she got the message at year 99,999, she immediately sends me a reply back going through the same procedure as I did. She records a message and releases it at the same time as the laser. The tachyons will arrive 1,000 years earlier than the laser, so for me, I will receive the message at year 199,998. I will receive the laser, however, at year 199,999.  It seems to me that communication this way does not violate causality. I will still have received the message after I had sent it.   If tachyons truly violated causality, though, I realize it should arrive at year -1 for her, and so she can reply to me at year -2, which would mess me up by year 0 as I will ask her how she knew I was planning on sending her a message before I sent it. I could send her a different message, which she would end up receiving at year -1, and will end up confusing her as she would have received one message asking her out, and the other asking her how did she know I was asking her out. She then decides I am crazy and sends me a message at year -2 that she does not want to date me, and so she will have both turned me down and entertained me before I have even asked her out.  On the other hand, let's go back to year 0 and add a third device to our list: an Alcubierre drive. After I send out the message and the laser, I get impatient and do not feel like waiting 99,999 years, so I get on my Alcubierre drive spaceship and arrive on her planet at the same year 0. My friend is not in her office, so I leave a note to her also immortal secretary saying I dropped by and that she should expect a message for her in year 99,999.  I then get back on my Alcubierre drive and land back on my planet, still on year 0. Meanwhile, the tachyons and photons I sent out are still racing to arrive to her. By year 99,999, she receives the message just as I Alcubierre drive back to her, and I pick her up for dinner.  But the point of my question is, it seems to me that just going faster than light, if that alone was what you had, would not violate causality. It must be something else. I understand time dilation and that things with mass cannot travel at the speed of light, but using the Alcubierre drive, hypothetically speaking, I was still able to outpace the photons while also having mass. It still did not produce causality problems. Alcubierre drives are also valid solutions to GR.  It seems circular to me to say that what makes traveling faster than light violate causality is because it violates causality (if faster than light communication was divorced from causality problems, then the causality problem would cause itself -- thereby violating causality and, hence, we would scrap it and conclude that there is no causality problem after all).  What is it that I am missing? If someone could help me out, that would be excellent. I've been itching to ask my friend out for a few millenia now. :)


The Heine–Borel theorem perfectly characterizes the compact subsets of the real line $\mathbb{R}$ (with the usual metric/order topology):     Heine–Borel Theorem. A subset $A \subseteq \mathbb R$ is compact if and only if it is closed and bounded.   What characterisations are there for the compact subsets of the Sorgenfrey line, $\mathbb{S}$?  Since the topology on $\mathbb S$ is finer than the topology on $\mathbb R$, every compact subset of $\mathbb{S}$ is also a comapct subset of $\mathbb{R}$, and so they must be closed (as subsets of $\mathbb{R}$) and bounded. But more is needed: $[0,1]$ is not compact, since it has an infinite disjoint open cover:  $$ [0,\tfrac 12) ,  [\tfrac 12, \tfrac 34 ) ,  [ \tfrac 34 , \tfrac 78 ) ,  \ldots ,  [ \tfrac{2^n-1}{2^n}, \tfrac{2^{n+1}-1}{2^{n-1}}),  \ldots ,  [1 , 2 ).$$

1) Stuck with this problem, can you please help? Show that if $X$ is connected and for a connected subspace $A$ of $X$ we have $X \setminus A = U \cup V$ where $U,V$ are open in $X \setminus A$ and disjoint, then the sets $A \cup U$ and $A \cup V$ are connected.  2) The following result appears in Encyclopaedia of mathematics by Hazewinkel page $375$:  Any compact subset of the Sorgenfrey line is countable.  I tried to prove this without any luck. Why is this true?


i have installed wordpress in a sub-folder but whenever i click on a page link in sub-folder then it redirects to a page that is in root folder. the root folder also have a wordpress site.   what i want to stop redirect to root folder and access the page in sub-folder.  Note whenever i hover on the menu(page) link it show the real page URL but when i click then it redirects me to root folder that has a same page.  i know that there is some issue in the .htaccess file but unable to find exact solution as i have searched   and  and a lot more  but found nothing. i am totaly stuck with this issue.

I have a WordPress installation with an .htaccess file that looks like this:  # BEGIN WordPress <IfModule mod_rewrite.c> RewriteEngine On RewriteBase / RewriteCond %{REQUEST_FILENAME} !-f RewriteCond %{REQUEST_FILENAME} !-d RewriteRule . /index.php [L] </IfModule> # END WordPress   I tried installing a fresh copy of WordPress into a subdirectory for a separate blog and am getting 404 errors within the root WordPress when I try to view it. I'm assuming this is because of the .htaccess file.   How do I change it so that I can view the subfolder?


I have a page where i have some text that I take from the database. While that page is open and someone else changes the text in the database, I wan't to make it so that my page is immediatly refreshed when the data changes.  I have googled around and found some stuff about using comet, but I don't understand anything about it.  Is there a more simple way to solve my problem? and if not, does anyone know a simple tutorial for comet?

I can find lots of information on how Long Polling works (For example, , and ), but no simple examples of how to implement this in code.  All I can find is , which relies on the Dojo JS framework, and a fairly complex server system..  Basically, how would I use Apache to serve the requests, and how would I write a simple script (say, in PHP) which would "long-poll" the server for new messages?  The example doesn't have to be scaleable, secure or complete, it just needs to work!


I am looking for a way to update list listOfuser with dict User without over writing any last index.  [{'name': 'john', 'fimily': 'johny', 'studentId': '2120', 'age': 23},   {'name': 'mick', 'fimily': 'micky', 'studentId': '2121', 'age': 24}]   Result which I currently have:  [{'name': 'mick', 'fimily': 'micky', 'studentId': '2121', 'age': 24}, {'name': 'mick', 'fimily': 'micky', 'studentId': '2121', 'age': 24}]   Code snippet used to produce the said result:   UserInfo = {}  listOfUser = []  UserInfo['name'] = "john"  UserInfo['fimily'] = 'johny'  UserInfo['studentId'] = '2120'  UserInfo['age'] = 23  listOfUser.append(UserInfo)  print(listOfUser)  UserInfo['name'] = "mick"  UserInfo['fimily'] = 'micky'  UserInfo['studentId'] = '2121'  UserInfo['age'] = 24  listOfUser.append(UserInfo)  print(listOfUser)   is there any way ?

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


Suppose I tell you that you can't understand what this means "fdhfshdgfjdsghskdrhgyc". You could reply "Yes, I can" or "No, I can". For the first phrase, it means that you are able to understand what that series of letters means and you are affirming your knowledge. The second phrase means that you are rejecting the idea that you can't understand it and are insisting that you can. These responses pretty much mean the same thing, correct?

I faced a problem to answer a negative question, for example, when someone asks you:      Don't you have any money?   It's a yes/no question but how should one answer the question without ambiguity?  When you answer "yes", does it mean "yes, I don't have any money"? or the other way "Yes, I do have money"? the questioner may think you are agreeing to the negative, that yes, you do not have any money.  I know it's better to answer with "on the contrary" but is it possible to answer yes or no?


Good evening; I've been having a problem with the Disk percentage seen in Task Manager, which jumps to 90-100% constantly for no reason. I've already tried to vanilla solutions: disabling Superfetch and Windows Search, clearing the temp folder and virtual memory, changing settings on Chrome and ran an anti-virus. The HDD health checks also say my HDD is healthy. Any idea on what would it be?

After startup for 5 minutes my system is very slow. The Task Manager shows that the disk usage is at 100%. (Later this number is around 2-4 %, but sometimes for 1-2 minutes go up again at 100%.)  I searched a lot on Google. For example I read , and also other pages. I opened two topic on Microsoft answer.  and one in Hungarian.  But I didn't found the solution yet. So I would like to ask Community's help. :)  Here the steps I already done:   I disabled everything at startups (including services) and the issue is the same.  I disabled Prefetch and Superfetch, the Baground Intellingent Transmission, Windows Search and Windows Defender but the issue is still persists. I made a health check on HDD, I made defrag and file system error check, but there are no errors. Also I tried to reinstall the HDD's driver. I made a full hardware check up, with no errors. The Windows and all the drivers are up-to-date. I tried a clean start. The issue is the same. I deleted Dropbox and all antivirus. I turned of the MSI mode.      I using also Linux, where this error is not occurs. Good to know, that Windows had 4 partitions, but I deleted 2 of them for the Linux. I don't know what partitions was these but both was only 10 - 20 MB.  I using a Dell Inspiron 15R SE 7520 with Windows 10 Home.  Personally I think it can be the Intel Rapid Store Technology "driver", because the problem started around when I installed it. (However I'm not sure.) And my hardware not supported yet by Intel, so I have no the newest driver. However I deleted Intel's software and driver and the issue is the same.    Thank you in advance for your assistance!


Is there any relation between the rank and the number of zero eigenvalues?

Let $T : V\to V$ be a linear transformation such that $\dim\operatorname{Range}(T)=k\leq n$, where $n=\dim V$. Show that $T$ can have at most $k+1$ distinct eigenvalues.   I can realize that the rank  will correspond to the number of non-zero eigenvalues (counted up to multiplicity) and the nullity will correspond to the 0 eigenvalue (counted up to multiplicity), but I cannot design an analytical proof of this.  Thanks for any help .


I was reviewing suggested edits and found lot of minor edits from . Every time, the user was just removing a few words (like "Thank you" at the end of the message). But the edits were approved by other people! I find it too minor and it looks like the user is only trying to get reputation and not trying to improve anything on Stackoverflow.  Do I misunderstand what a "too minor" suggested edit is?  Additional remark: it also looks like this user got suddenly a lot of upvotes which looks suspicious to me. Does the system automatically handle this?  The approved suggested edits:

I edit a lot of posts every day. I often run across posts with 'Hi' and 'Thanks' on the top and the bottom of the post respectively. I also run across things like:     --User   Should these items be removed during the editing of the post by an editor?


I have read Galois theory by Joseph Rotman and it's very well written. Now I want to read field theory and galois theory more formally. A guy recommended me the book 'Field extensions and Galois theory' by Julio R. Bastida. Is it a book to start with? I can't find it online. Any more suggestions will be appreciated and please tell me if there's any free online source for this book.

I studied basic field theory from J.A. Gallian in U.G. and Fraleigh. and a year ago I self studied it from Galois Theory by David A. Cox, and I got pretty good at it. But in last year I was mainly studying groups and non-commutative ring theory, so now I feel like I have lost my sharpness in Field theory and now I want to reread whole Galois field theory. But doing Cox again will feel boring so I was thinking to switch to a  new book. After googling a lot I have shortlisted these small and interesting book-  1) Fields and Galois theory by Howie 2) Galois Theory by Rotman 3) Field and Galois theory by Morandi 4) Galois Theory by Escofier  Which one of these texts is most interesting and insighting? Which one should I buy first, e copies of all of them looked great, but which one I should purchase and read first.  If there are any other suggestions, you are welcome!


Is there a name in English for the process of turning ingredients of a dish into liquid through boiling them long enough?  Usually this happens as cook's errors, but at times it's the desired effect (e.g. you may create an excellent, smooth, creamy sauce by simmering the ingredients for a long time).  Judging by what Google Images show, it seems that "" usually means burnt or nearing burnt fried/grilled food, which is definitely not the same thing.

It seems my L hit a dead end, that's not learner's level English...\  Is there a name in English for the process of turning ingredients of a dish into liquid through boiling them long enough?  Usually this happens as a cook's error, but at times it's the desired effect, e.g. you may create an excellent, smooth, creamy sauce by simmering the ingredients for a very long time.  Judging by what Google Images show, it seems that "overcooking" usually means burnt or nearing burnt fried/grilled food, which is definitely not the same thing. Someone suggested "overboiling" but my grasp of English doesn't allow me to decide whether that's correct or not.


I've recently come across a Stack Exchange user whose name could be considered offensive. () [Content warning: Offensive/vulgar language] I've looked around and found no way of reporting the profile. Is there a system in place to flag and resolve issues regarding usernames which could be considered offensive?

I think the community does a great job policing questions/answers, etc. and the community has some good tools available to do this.  Between flagging questions with some reasons behind it and editing posts, closing them, and deleting them, the only thing that seems to be missing to me is the ability to flag a user.  Reasons to flag a user as abusive:   Duplicate User Abusive Behavior Offensive user name or profile User profile consists of spam Others?


My pc will not render in any mode using the GPU after upgrading from 2.8 to 2.9 My GPU drivers are up to date and worked until I upgraded. My GPU is a AMD Radeon R9 390. It has been running smoothly with blender until recently. My driver version for the GPU is 20.45.27.02-210118a-363193E-RadeonSoftwareAdrenalin2020 Here is a screen shot with the current version of Blender

I don't know why but now, when i go in material preview or rendered (in solid mode it works fine), my object is entirely gray, or invisible idk, because it has the same color of the background. I've been working for days on this project without having this issue, it suddenly showed up. I tried opening other old projects and suddenly they all do the same so i guess it is some blender program setting that applies for all the projects, but idk how it happened cuz i didn't change anything :/, anyone got any tips?


Very likely I am missing some fundamentals here, or my python coding is not up to scratch.  When I use the standard formula to calculate the mean for a beta distribution ~ $B(\alpha,\beta)$  $$ \mu = \alpha / (\alpha + \beta)$$  Using an $\alpha$ = 0.67 and a $\beta$ = 0.29, I get a $$\mu = 0.69792$$  However, say I use scipy.stats.beta to view the cdf at $\mu$:    I would expect the resultant value to be 0.5   import scipy.stats as stats alpha = 0.67 beta = 0.29 stats.beta(alpha, beta).cdf(0.69792)  out[1]: 0.3873254007616228   My logic being if I input $\mu$ for a standard normal distribution's cdf I get the below, 0.5 as expected.  stats.norm().cdf(0)  out[1]: 0.5   What am I missing here ?

My reasoning is as follows: the p.d.f. is divided by the mean (expected value) into two parts, for which the areas under the p.d.f. curve are equal, hence the probabilities that random variable takes a value less then or equal to the mean are 0.5, which means that that value is also the median (by definition of median).  But textbooks say that the mean and median are equal only if the p.d.f. is symmetrical. Where is my mistake?


i'm trying to format USB drive (some noname 32GB) to EXT4. It always hangs on step writing superblocks ... and always stops writing numbers after it reach to 125/256. I'm use command mkfs.ext4 /dev/sdd1 . Command eventualy finishes, but drive is unmountable.  Do you think it is hardware broken or is there a way to fix it? I would like to use it with openELEC on rapberryPi.  I tried gparted live and gparted in ubuntu with same result. I'm going to try some USB drive check on windows, because it works as NTFS.  I have also tried gparted on different computers.  EDIT: i have now tried another flash drive (8GB kingston) and it worked without issue.  Is there some proven way to test flash drives?  EDIT: ok, so i tried some test i found ...  guess that's it.

In Windows there is a straightforward "Format" option in a flash drive's right-click pop-up menu. Where's that in Ubuntu?


Working as a Marketing Cloud marketeer in a franchisee setup with 170 child business units I'd like for the franchisee marketeers for every child business unit to be able to always exclude certain domains from being sent to, even though the emails might already exist in their data extensions.  I could possibly do it from the parent level, but to let the franchisees in every business unit know that they own and handle their own data I'd like to teach them how to do this.  So, ie. I'd like to suggest a solution to the franchisee marketeers to automatically exclude emails ending with:    '6url.com', 'aport2000.ru', 'ass.pp.ua', 'axoskate.com', 'backstreet-boys.com', 'bodhi.lawlita.com'.   One way to do this is to have the franchisee marketeers filter the individual child business unit master data extensions for emails ending as described above, and then always exclude this filtered data extension, but this would require the franchisee marketeers to always remember to add the exclusion data extension.  Can anyone suggest a more flexible approach on the child business unit level?  Thank you

I have created a domain exclusion DE with single field "Domain" and entered values for the field as "gmail.com".   Now how do I add this data extension to email under "User Initiated Email". I already tried selecting DE in Excluded DE but it didn't work. I already tried using domain value as "@gmail.com" but still it didn't work.   Can you please help me how to utilize this DE?


I'm storing several projects under the same SVN repository. I've followed the manual and did this: I svnadmin dump c:\repository | svndumpfilter include <my project> > myproject.dump.  My problem is, svndumpfilter chokes with the error "Invalid copy source path", because we moved that particular project from branches back to another folder a while ago.  Has anyone dealt with this particular problem successfully?  I am currently thinking of dumping the main repository in chunks, skipping the revisions that may cause errors. I will then load each chunk into the new repository, each chunk under a folder, and merge them using Eclipse. Does this sound sane to you? Do you see any problems with it?

I am trying to migrate a part of an SVN repository using svnadmin dump.  The provided svndumpfilter tool doesn't manage copy/move/rename dependencies from directories not included in the export.  Is there a tool which can manage these dependencies?


Say a cyclic group of order $9$ is denoted by $G = \langle g \rangle$. I have a claim that  $\langle g^k \rangle = G $ whenever $k$ is a unit in $\mathbb{Z}_9$. I'm struggling to understand why this is true. Is this specific to order 9? In general, for a group of order $n$, do we require that $k$'s multiplicative inverse in $\mathbb{Z}_n$ be $n$ itself? Otherwise the generating group will be of order less than $n$, and thus cannot be equal to the group.

How many generators does a cyclic group of order $n$ have? I know that a cyclic group can be generated by just one element while using the operation of the group.  I am having trouble coming up with the generators of a group of order $n$.  Any help would be great!  Thanks!


I have a problem when i compile my perl program : it mention :      Can't locate Bench.pm in @INC (@INC contains: /etc/perl /usr/local/lib/perl/5.10.1 /usr/local/share/perl/5.10.1 /usr/lib/perl5 /usr/share/perl5 /usr/lib/perl/5.10 /usr/share/perl/5.10 /usr/local/lib/site_perl .) at test.pl line 4.   BEGIN failed--compilation aborted at test.pl line 4.   Any idea please? Thanks

I get this error:  Can't locate Foo.pm in @INC  Is there an easier way to install it than downloading, untarring, making, etc?


My friend has this plan where he implies that it's impossible to lose, as long as the odds of winning are 50/50 on each bet. His idea is that basically you keep doubling your bet until you win and then start over again.  So for example, you bet 1 dollar and you lose, your net profit is now -1 dollar. Now you double your bet to 2 dollars and you lose again so your net profit is -3 dollars. Now you double your bet to 4 dollars and you win. This means you gain 4 dollars and now your net profit is 1 dollar. So you've made a profit. Now you start again. The reasoning here being that it is highly unlikely for you to lose a 50/50 toss x number of times in a row.  My counter-argument here is that basically if you go in with 50 dollars with the aim of doubling up to 100 dollars, you have the same odds of winning if you do one bet of 50 dollars or the technique outlined above. I cannot wrap my head around explaining this issue in a clear manner though, so maybe you wonderful folk at Mathematics can help!  Oh and I've pointed out that he uses gamblers fallacy in very obscure way, as he insists you need to go back to betting 1 dollar once you've won. This appears to be an obscure case of gamblers fallacy to me as it implies there is some hidden force which are changing the odds on each individual coin toss.

Not sure if this is a question for math.se or stats.se, but here we go:  Our MUD (Multi-User-Dungeon, a sort of textbased world of warcraft) has a casino where players can play a simple roulette.  My friend has devised this algorithm, which he himself calls genius:   Bet 1 gold If you win, bet 1 gold again If you lose, bet double what you bet before. Continue doubling until you win.   He claimed you will always win exactly 1 gold using this system, since even if you lose say 8 times, you lost 1+2+4+8+16+32+64+128 gold, but then won 256 gold, which still makes you win 1 gold.  He programmed this algorithm in his favorite MUD client, let it run for the night. When he woke up the morning, he was broke.   Why did he lose? What is the fault in his reasoning?


Which is correct in the following?  I am invited to meet the president. I am invited to meet with the president.

What is the difference between "meet" and "meet with"?  For example, which of these should I say?        I met my boss yesterday    I met with my boss yesterday   I'm meeting my friends tonight    I'm meeting with my friends tonight


I am trying to install Ubuntu 16.04 LTS on a Dell XPS 13 (9350). The laptop came with Windows 10 pre-installed. I am installing from a pendrive but I think the issue would be the same if I used e.g. a USB DVD drive.   Dude, where's my hard drive?  I am blocked because the installation program cannot find 8.6Gb of free space on my hard drive despite the fact that there are hundreds of Gb free according to Windows. Digging a bit into the problem, it seems that Ubuntu cannot see my hard disk at all.    This is the output of GParted:    I am not sure what that drive mounted at /cdrom is, but it seems the only device that exists in the system that is not a RAM disk or a loop device:   Content of /proc/partitions:   ubuntu@ubuntu:~$ cat /proc/partitions   major minor  #blocks  name     1        0      65536 ram0     1        1      65536 ram1     1        2      65536 ram2     1        3      65536 ram3     1        4      65536 ram4     1        5      65536 ram5     1        6      65536 ram6     1        7      65536 ram7     1        8      65536 ram8     1        9      65536 ram9     1       10      65536 ram10     1       11      65536 ram11     1       12      65536 ram12     1       13      65536 ram13     1       14      65536 ram14     1       15      65536 ram15     7        0     130048 loop0     7        1    1104188 loop1     8        0    1970239 sda     8        1    1953439 sda1   Summary of fdisk -l:   ubuntu@ubuntu:~$ sudo fdisk -l |grep Disk Disk /dev/ram0: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram1: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram2: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram3: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram4: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram5: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram6: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram7: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram8: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram9: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram10: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram11: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram12: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram13: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram14: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/ram15: 64 MiB, 67108864 bytes, 131072 sectors Disk /dev/loop0: 127 MiB, 133169152 bytes, 260096 sectors Disk /dev/loop1: 1.1 GiB, 1130688512 bytes, 2208376 sectors Disk /dev/sda: 1.9 GiB, 2017525248 bytes, 3940479 sectors Disklabel type: dos Disk identifier: 0x00000000   Result of fdisk of the only non-loop non-RAM device (not sure this is relevant):   ubuntu@ubuntu:~$ sudo fdisk -l |grep -A 50 sda Disk /dev/sda: 1.9 GiB, 2017525248 bytes, 3940479 sectors Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disklabel type: dos Disk identifier: 0x00000000  Device     Boot Start     End Sectors  Size Id Type /dev/sda1  *      129 3907007 3906879  1.9G  c W95 FAT32 (LBA)   I am blocked at this point. Any help will be much appreciated.   Additional information (following comments):   Running dmesg |grep -i sata shows (among others) eight lines that suggest some kind of error:   ata1: SATA link down (SStatus FFFFFFFF SControl FFFFFFFF) ata2: SATA link down (SStatus FFFFFFFF SControl FFFFFFFF) ata3: SATA link down (SStatus FFFFFFFF SControl FFFFFFFF) ata4: SATA link down (SStatus 0 SControl 0) ata5: SATA link down (SStatus 0 SControl 0) ata6: SATA link down (SStatus 0 SControl 0) ata7: SATA link down (SStatus 0 SControl 0) ata8: SATA link down (SStatus 0 SControl 0)  I have "Restarted" windows instead of only "Shutdown" it to avoid problems with "fast startup", following some recommendations I have read of other users having problems installing Linux on Windows 10 laptops.ago   Regarding SATA, the BIOS says: "SATA Operation: RAID ON". The other two options available are "Disabled" and "AHCI".    I have followed the instructions of these two pages from Dell: , .

I am trying to install Ubuntu 14.04 / 15.10 on my Dell XPS 13 9350 (November 2015).  I created a bootable USB disk which boots fine but the installer and the file manager do not detect the hard drive.  What is the problem? How can I solve it?


I am running an intel built machine but the 13.10 download file has AMD on it. Will this cause me any issues when trying to install 13.10 on the machine?  Is there an Intel specific download?  Thank you.

I was told that computers with more than 2 gig's memory need a 64 bit operating system to utilize all RAM.  Is the 64bit Ubuntu download really JUST for AMD processors? I am asking because the disk image I downloaded says AMD64.  So will my new Intel 2.3Ghz Core i3 Dual Core processor work with 64 bit Ubuntu?  It runs the 64bit version of Windows without any qualm.


I've inherited a document library with some documents stored in folders within folders within folders etc  I've tried creating a library view with "Show all items without folders"  but I get the following error  This view cannot be displayed because it exceeds the list view threshold (5000 items) enforced by the administrator.    I need to move some of the documents to a new library. There is no metadata that would help show only the documents I need other than "Created By". I tried adding this as a filter to the view but I still get the same error  Any suggestions?

Microsoft technet states that document libraries have a file limit of 30 million items:    In practice, numerous features seem to break once there are more than 5000 items in a Document library - not just in the initial directory listing - but as a recursive total. For example, you may be able to list folders, but setting permissions or deleting files is met with errors.  Are there any configuration options or optimizations that can be used to relax these limits?  A workaround would be to split folders into separate document libraries, but in our case, with over 5 million files, this would result in a minimum of 1000, 5000 file document libraries and likely many more. At that point we're likely shifting the problem into the library view.    A major showstopper is the effect this has on Sharing - a user trying to share a folder with more than 5000 aggregate items simply fails. I'm investigating the effect (if any) the resource throttling suggestion below has on this.


I'm doing some stuff to share a hair style for Jinryuu's DBC/NC mods, but I need pictures of it. I haven't been able to find the screenshots folder, or even the .minecraft folder! I am using Windows 10.

I have Windows 10. I can't seem to find any of my screenshots.   I've looked over on YouTube and Safari but I can't find any tutorials on how to open screenshots on Windows 10.


What’s the difference between these sentences:   I thought you might be interested in looking at this event. I thought you may be interested in looking at this event.

"May I go to the bathroom?" and "I asked if I might go to the bathroom."   The modal auxiliary 'may/might' is used to ask permission.     "He may not have understood your question." and "He might not have understood your question."   The same modal auxiliary is used for uncertainty.  Why?


To even suggest the great Einstein is incorrect on anything he has written is inconceivably absurd. Being fully aware of this I do indeed dare to not only suggest he is wrong but I cannot believe nobody has questioned his cosmic speed limit to this very day. I do not need any mathematical equations to prove this point. Common sense will suffice.     If in fact the cosmic speed limit $c$ is achieved only by light at the estimated 186,000 miles per hour then it must be true that this speed limit is surpassed when light is engulfed by a super massive black hole because of the simple fact that the light cannot escape this giants gravitational pull. Wouldn't this mean that the light must be travelling faster than what it was before meeting this cosmic anomaly?

Wikipedia has this page on  using planets. In some cases this effect was used to accelerate the spacecraft to a higher velocity. This diagram shows this in a very oversimplified manner.   That got me thinking that if light is affected by gravity, and if it slingshots around the black hole/massive object, can't it gain a higher speed than $c$? What limitations are stopping it from doing this?  Forgive me if the answer to this question is pretty straight-forward or staring-you-in-the-face kind. I haven't fully understood the mechanics of the gravitational slingshot fully yet, but I couldn't wait to ask this. Note: If it is possible (I highly doubt that!), could you provide an explanation using Newtonian mechanics, I'm not very familiar with general relativity because I'm in high school.


When I reload the page, I call ajax to get the data and display it on the screen.

    Is there any issue with my script or I am displaying it in a wrong way?

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


We are to add some Ajax functions on a view page. Say, click a delete or insert button and an Action will be called to perform a CRUD job behind the scene and then refresh the items list after that operation.  In many existing examples, the javascript code is embeded in the view page within the <script> tag. Since there are usually many functions that one view may need. Say, when insert a record, there will be function to collect the form data, validate the data (this part can be very long), and call the action by $.ajax(). For this reason, we are thinking about place all those javascript into a separate .js file.  So, what is the professional practice in this? Should we place the .js files under the same folder with its Views? Or should be place all of them into the Script folder and reference from there?   Should we create seperate .js files for each individual view or combine all the .js files for different views into a large file?  Also, we love how we can group C# code using #region so as to collapse. Is there anything similar in JavaScript? It just grows lengthy too easily.  Thank you for any helpful advice.

What is the best place (which folder, etc) to put view-specific javascript files in an ASP.NET MVC application?    To keep my project organized, I'd really love to be able to put them side-by-side with the view's .aspx files, but I haven't found a good way to reference them when doing that without exposing the ~/Views/Action/ folder structure.  Is it really a bad thing to let details of that folder structure leak?  The alternative is to put them in the ~/Scripts or ~/Content folders, but is a minor irritation because now I have to worry about filename clashes.  It's an irritation I can get over, though, if it is "the right thing."


My code  var=34 find $1 -type f | while read line; do         file_status=`file  "$line"`         file_name=`echo $line | sed s/".*\/"//g`         line_length=${#file_name}         if [ $line_length -gt $n ]; then                 echo "hi there"                 var=$((var+1))         fi done echo $var   I can see the message hi there for multiple times, but my variable will be 34 after i'm done with the while loop.

With ksh I'm using read as a convenient way to separate values: $ echo 1 2 3 4 5 | read a b dump $ echo $b $a  2 1 $  But it fails in Bash: $ echo 1 2 3 4 5 | read a b dump $ echo $b $a     $  I didn't find a reason in the man page why it fails, any idea?


I was just wondering how I would get the skin packs and different mods for Xbox 360.

I play Minecraft on my Xbox360. I want to add mods on my Xbox360 but how do I do that? I would like to play the Pixelmon mod on my Xbox360 because I like Pokemon, but I don't know how.


I've been looking at this code for a while but I can't figure out what's wrong with it. The second 2 elements are slightly below the first element and I have no idea why. Here's the HTML:    #overlayedbox{   font-family: OpenSans, arial, "sans-serif";   background: rgba(50,50,50,0.6);   border-radius: 25px;   padding: 20px;   width: 200;   height: 15px;   text-align: center;   verticle-align: middle;   margin-left: auto;   margin-right: auto; }    #arrow-left {   width: 0;    height: 0;    border-top: 10px solid transparent;   border-bottom: 10px solid transparent;     border-right: 10px solid white;  }  #arrow-right{   width: 0;   height: 0;   border-top: 10px solid transparent;   border-bottom: 10px solid transparent;   border-left: 10px solid white;   float: right; }

   1.0.0

      This is supposed to form an ovular shape with an arrow facing left on the left side, and an arrow facing right on the right side with text in the middle. When I run it, the elements align fine horizontally, but after the first arrow, they drop down a little.

I have a div with two images and an h1. All of them need to be vertically aligned within the div, next to each other. One of the images needs to be absolute positioned within the div. What is the CSS needed for this to work on all common browsers?

testing...


My brief requires me to create a method that 'accepts an amount and description. If no description is given, it should default to an empty string. The method should append an object to the ledger list in the form of {"amount": amount, "description": description}.' I have therefore created this function:  def deposit(self,amount,description):    if description == "":      newdict = {"amount":amount,"description":""}      self.ledger.append(newdict)    else:      newdict = {"amount":amount,"description":description}      self.ledger.append(newdict)  However, the test clothing.deposit(25.55) clearly only uses one argument, the amount, and expects me to leave a blank description, but as is it returns the error TypeError: deposit() missing 1 required positional argument: 'description'. But if a description is required I also have to be ready to use it,  How do I setup my method so it can use the extra argument, description, but if it isn't given it can safely ignore it.

What are the lesser-known but useful features of the Python programming language?  Try to limit answers to Python core. One feature per answer. Give an example and short description of the feature, not just a link to documentation. Label the feature using a title as the first line.  Quick links to answers:


Besides the official pygame port to android which requires python 2.7.1 which I like 3.4.1 better. Also besides Kivy, what is a way to put pygame or another python module on android?

We are working on an  version and this platform has a nice Python API..  However, there is nothing official about Python on Android, but since  exists, is there a way to let the snake and the robot work together??


I want to convert a string to datetime.  The string is:  date_created = "2016-10-22T16:27:54+0000"   And I am trying to convert that with:  datetime.strptime(date_created, '%y-%m-%dT%H:%M:%S+0000')   but the format does not match.  So, what is the correct format to use?

I need to parse  strings like "2008-09-03T20:56:35.450686Z" into Python's datetime type.  I have found  in the Python standard library, but it is not very convenient.  What is the best way to do this?


Below is an example table definition:   CREATE TABLE IF NOT EXISTS `mytable` (       `id` MEDIUMINT(5) NOT NULL AUTO_INCREMENT,       `title` varchar(255) DEFAULT NULL DEFAULT '',       `content` text NOT NULL DEFAULT '',       `date_added` datetime NOT NULL DEFAULT '0000-00-00 00:00',       `date_modified` datetime NOT NULL DEFAULT '0000-00-00 00:00',       `published` tinyint(1) NOT NULL DEFAULT '0',       PRIMARY KEY (`id`)     ) ENGINE=InnoDB AUTO_INCREMENT=1 DEFAULT CHARSET=latin1;   For example: as per   MEDIUMINT has 3 Bytes storage and can contains value from -8388608 to 8388607.    Then why should write Mediumint(5), tinyint(1), int(11) etc... in table definition?  What is the impact of defining size of datatype in table definition? Is there any affect of defining size on memory acquisition? If we don't define size of datatype, it automatically define the size. So, isn't it better to not define the size?   My question is not limited to Mediumint and int datatype. It is for all numeric datatypes which MySQL support.Please provide your suggestions as per the concern I raised.

When we use an argument length with numerical data types, as far as I know this specifies the display width. I tried the following:    mysql> create table boolean_test (var1 boolean, var2 tinyint);     Query OK, 0 rows affected (0.10 sec)     mysql> show create table boolean_test;    +--------------+-------------------------    | Table        | Create Table +--------------+-------------------------   | boolean_test | CREATE TABLE `boolean_test` (     `var1` tinyint(1) DEFAULT NULL,     `var2` tinyint(4) DEFAULT NULL   ) ENGINE=InnoDB DEFAULT CHARSET=latin1 |    +--------------+---------------------------   1 row in set (0.00 sec)     First of all tinyint is a 1 byte value. So what is the meaning of tinyint(4)? There can not be 4 digits.    mysql> insert into boolean_test values(101,112);   Query OK, 1 row affected (0.03 sec)     mysql> select * from boolean_test;   +------+------+   | var1 | var2 |   +------+------+   |   10 |  112 |   |  101 |  112 |   +------+------+   2 rows in set (0.00 sec)     I see that in tinyint I stored a 10 and 101 and I could get back these values despite that it is defined as tinyint(1). Shouldn't I see a 1 for var1? I.e. just 1 display digits?


I tried to log into Meta using StackExchange ID and it says :     Suspicious Request      Sorry your request could not be completed because it looked   suspicious. [...]   But it still logged me in. Wondering if there is a bug in there.

I am getting this error repeatedly when I try to login to the  site for the first time using a Google id.  Sorry, your request could not be completed because it looked suspicious. If you meant to perform an action on Physics, please return to the previous page and try again.  I am using few other Stack Exchange and Stack Overflow sites,


Flat earthers argue that gravity isn't real because as Einstein said, that if you were in a box in space then you couldn't tell the difference between it suddenly starting to accelerate upwards at a constant speed and gravity being switched on. Is there any experiment that you could do, that would help you differentiate between the two? Something like two falling objects being pulled towards each other?

The common explanation/trope for the equivalence principle always has something to do with you being inside an elevator or spaceship, and your supposed inability to differentiate, say, gravity from a rocket, or free-fall from being motionless in empty space. For example, Wikipedia  "being at rest on the surface of the Earth is equivalent to being inside a spaceship (far from any sources of gravity) that is being accelerated by its engines." Many other sources say similar things, often making broad, sweeping generalizations like "there is no measurement you can make to distinguish the two scenarios."  Isn't that just plainly wrong? Gravitational fields aren't homogeneous. Here on the Earth, a clock on the floor runs more slowly than a clock on the table, and we have clocks precise enough to measure such small differences due to the gravitational gradient. But doesn't a clock in an accelerating spaceship run at the same rate no matter where in the ship you put it?  I searched the top 50 or so questions about the equivalence principle and found  that talks about tidal effects in gravitational fields, but the explanation is very confusing. As far as I can tell, it seems to be saying the "attraction" between the particles that arises as a result of slightly different gravity vectors is somehow equivalent to the actual mutual gravitational attraction the particles should have absent the external gravitation field. I don't see how that could possibly be the case.  Also in that answer is a link to  of tidal forces and the equivalence principle, which seems to be saying the opposite: that tidal forces are, in fact, a distinguishing characteristic between gravitational acceleration and rocket acceleration, and that the equivalence principle only exactly applies to small enough points in space over a small enough duration, where tidal effects are negligible.  I know what seems most correct to me, but as I'm not an expert in this field, would an actual expert please shed some light on these varying views of the equivalence principle?


How to set application in port mode only? I does not wanna when phone landscape is on my application should still work in port mode dose not change to land mode.

How can I disable landscape mode for some of the views in my Android app?


Hi I have a content containing one date field, it is an empty date field. I mean there is no current date value. when author clicks on that date field and he assigns one date that may be any date on future. What date he will give in future, on that date in future I have  to trigger a mail to him.

In my content I have one date field which is entered by the author, who fills that as future estimate date like  tomorrow or after 1 month. Depending on that estimated date, on that day mail should trigger.  Example: my date field is "weaning date" which the author will fill at as after one month on that day should trigger a mail.


When i run the code i got no output and program crash Anyone know how to correctly print out the char pointer ? #include <stdio.h> char *toUpperCase(char *str) {     int i = 0;     while(str[i] != '\0')     {         str[i] = str[i] - 32;         i++;     }     return str; }  int main() {      printf("%s", toUpperCase("hello"));      return 0; }

The following code receives seg fault on line 2:  char *str = "string"; str[0] = 'z';  // could be also written as *str = 'z' printf("%s\n", str);   While this works perfectly well:  char str[] = "string"; str[0] = 'z'; printf("%s\n", str);   Tested with MSVC and GCC.


I'm looking for a noun to describe someone who's against something. For example:  He's one of those people who oppose the idea of...  I know you can simply say "He's against the idea of", but I was wondering if there was any noun that I could use in this particular scenario. I thought about simply using the word opponent but isn't it more suitable in perhaps a competitive game context?

I'm looking for a word with a positive undertone to describe a teenager who does her own thing and doesn't cave in to peer pressure.  Any suggestions?  Thanks.  Question edited 1/30/16.  Someone marked this question as a duplicate, but I think the other question is quite different from the one already posted.  The other question is asking about a single word to describe someone who doesn't follow the crowd for the single purpose of being contrary.  A contrary state of mind has nothing to do with what I'm looking for.  I'm writing a recommendation for a teenager who is polite, independent, confident, and doesn't follow the crowd...  NOT out of a sense of being different for the sake of being different, and not because she's ornery and contrary, but because she's her own person, and not swayed by what the other teens are doing.  Can we re-open this discussion?


This is a follow-up to   As , I've calculated the number of Stack Overflow users per capita.  I'm making this a separate post since there were already so many charts and tables on the other one.  But, lest anyone accuse me of rep-whoring, I'm making this post CW.  I have once again provided the full data in a Google Docs spreadsheet, and it is also available in Excel format.  Edit (2010.01.06): My previous post had incorrect per-capita data for the states in the US. I think I pasted the population data into my spreadsheet sorted by state name, when I had sorted the data by number of users. The result was that states had the incorrect populations. I have updated the chart and the Google spreadsheet to reflect the accurate numbers. And I apologize to all the Wasingtonians (state and DC) and Delewarians I offended. :)    Overview in charts  Worldwide    Europe    United States    Users per capita by country (top 20)   Country         Users per 1,000,000 residents --------------------------------------------- Bermuda         15.3846 Isle of Man     12.5000 New Zealand     11.0939 Norway           9.5049 Iceland          9.3971 Sweden           8.9092 United Kingdom   8.7289 Australia        8.6148 Ireland          7.4003 Malta            7.2529 Canada           7.1874 Denmark          7.0659 Israel           6.7025 United States    5.8728 Netherlands      5.7398 Finland          5.0493 Switzerland      4.5185 Slovenia         4.3967 Belgium          3.8123 Estonia          3.7302   Users per capita by state/province  United States (top 20)   St/Prov                   Users per 1,000,000 residents ------------------------------------------------------------- DC  District of Columbia  27.0347 DE  Delaware              19.4710 WA  Washington            16.3378 VT  Vermont                9.6576 MA  Massachusetts          8.1564 CO  Colorado               8.0981 OR  Oregon                 7.9154 UT  Utah                   6.5779 NY  New York               6.0543 CA  California             5.6860 MN  Minnesota              5.5551 ME  Maine                  5.3173 ID  Idaho                  5.2500 VA  Virginia               5.1486 PA  Pennsylvania           5.1413 NE  Nebraska               5.0464 AR  Arkansas               4.9030 WI  Wisconsin              4.7975 RI  Rhode Island           4.7583 MD  Maryland               4.4377   Canada   St/Prov                   Users per 1,000,000 residents ------------------------------------------------------- YT  Yukon                 29.9025 PE  Prince Edward Island  21.3672 BC  British Columbia       9.5023 AB  Alberta                6.0565 ON  Ontario                5.7751 NB  New Brunswick          4.0090 SK  Saskatchewan           3.9070 NS  Nova Scotia            3.1931 QC  Quebec                 2.9553 MB  Manitoba               0.8238   United Kingdom   St/Prov           Users per 1,000,000 residents ----------------------------------------------- Scotland          6.1914 England           5.3065 Wales             1.9969 Northern Ireland  1.1268   Australia   St/Prov                            Users per 1,000,000 residents ---------------------------------------------------------------- WA   Western Australia             7.1232 VIC  Victoria                      6.5319 NSW  New South Wales               6.0966 QLD  Queensland                    5.4996 SA   South Australia               4.4178 ACT  Australian Capital Territory  2.9420   Stack Overflow data retrieved from StatOverflow sandbox on 2009-10-05 (September 2009 data dump) for users with rep >= 1000.  Population data retrieved from Wikipedia on 2009-10-13.  Just for TXI

I wanted to know more about . Is there any way I could get more data for this? Are there any more maps or charts to further identify where users are coming from across the world? How could I go about generating my own maps or charts?  Note: The original statistics and images provided with this question in 2009 are available in the .


How can I delete an item from an array, and then resize the array to the smaller size? Likewise, how can I increase the capacity if I need to add another item?

Given an array of n Objects, let's say it is an array of strings, and it has the following values:  foo[0] = "a"; foo[1] = "cc"; foo[2] = "a"; foo[3] = "dd";   What do I have to do to delete/remove all the strings/objects equal to "a" in the array?


First,  if I issue sysctl net.ipv6.conf.all.disable_ipv6=1 from the command line after the system has started, I get the result I want -- IPv6 is indeed disabled.  Now for the problem of making this behavior persistent after a reboot.  It is easy to find suggestions for how to do this, usually they revolve around putting net.ipv6.conf.all.disable_ipv6=1 in a file in the /etc/sysctl.d/ directory or in the config file for sysctl itself, namely /etc/sysctl.conf. Other approaches mentioned include adding  GRUB_CMDLINE_LINUX="ipv6.disable=1"   To /etc/default/grub  This is mentioned e.g. here:    I've tried all of these, they don't work. ifconfig clearly shows that IPv6 is enabled for the interface. Again, if I just do a manual sysctl after booting, it disables it as expected.  sysctl -p does nothing for me, only writing the command verbatim as above works.  I've also tried putting the sysctl command in /etc/rc.local, which I know runs correctly from observing other commands I can put there. However, despite executing, it doesn't seem to take effect.  I've also tried other commands instead of just all.disable_ipv6, such as default.disable_ipv6 and enp0s3.disable_ipv6 (I've verified that enp0s3 is indeed my Ethernet interface).  This seems a bit similar to  to me, but I have no idea why this happens. I'm confident that all I had to do on a different system was simply to put this in a file in /etc/sysctl.d/.  One way to disable this which I already know of, beyond what I've tried, would be to recompile the kernel manually without IPv6 support. However, this is simply too much of a kludge, it is not reliable, and it is too much work to do and maintain.

How does one disable IPv6 completely (for all interfaces, resp. for the whole machine?  Keep in mind, I don't want any kind of GUI solution.    OS in question:   Linux Mint 18.x Cinnamon 64-bit GNU/Linux Debian 9.x Cinnamon 64-bit


I have this exerciose:     Let $\Omega$ be a normed space. Prove that $\Omega$ is seperable if   $\Omega^*$ is.   It is in the chapter with the Hahn-Banach theorem, so I think I should use that theorem.  My attempt:  We know that there is a countable set $K \subset \Omega^*$, such that for any $x^* \in \Omega^*$ there is a sequence of bounded lienar functionals in K, such that they converge to $x^*$ in the operator-norm.  So I need to associate the set $K\in \Omega^*$ with some set in $\Omega$, and show that this set is dense in $\Omega$.  The only thing I can think of is to start the other way around. For any $x \in \Omega$, we have the space $\{ax| a \in \mathbb{C}\}$, this is a subspace of $\Omega$, and it has a natural bounded linear functional $P_x(ax)=a$. by the Hahn-Banach theorem, this functional can be extended to a functional on the entire set $\Omega$, so we can assume that $P_x \in \Omega^*$.  Now we have a sequence in $\Omega^*$: $k_n\rightarrow P_x$, where $k_n \in K$, and the convergence is in the operator norm.  The problem now is to associate a proper element in $\Omega$ to each $k_n$, and show that this sequence converges to $x$.  Could this approach work, if so, how do I finish it? If not, could you please help me some other way?

Can someone tell me if I got the following right:  Assume $X$ to be a normed vector space over $\mathbb{R}$. Prove that if the dual space $X^\ast$ is separable then $X$ is separable as well.  I'm supposed to use the following hint: First show that for each $x_n^\ast$ we may choose a unit vector $x_n \in X$ such that $x_n^\ast (x_n) \geq \frac{\| x_n^\ast \|}{2}$. Then show that $\overline{Y} = \overline{span_\mathbb{Q} \{ x_n\}} = X$.  My answer:  (i) (by contradiction)  Assume for all $x_n \in X$ with $\| x_n \|_X = 1$ that   $$x_n^\ast (x_n) < \frac{\| x_n^\ast \|}{2} \iff 2 x_n^\ast (x_n) < \sup_{x_n; \| x_n \|_X = 1 } \{ | x_n^\ast(x_n) | \}$$  Claim: Then $\exists r \in \mathbb{R}: x_n^\ast(x_n) < r < \sup_{\dots}\{\dots \}$:  (i) $x_n^\ast (x_n) \neq 0$: because $\| x_n \| = 1$ and $x_n^\ast$ linear  (ii) if $x_n^\ast (x_n) < 0$ then  $2 x_n^\ast (x_n) < x_n^\ast (x_n) < x_n^\ast(- x_n) < 2 x_n^\ast(-x_n) < \sup_{\dots} \{ \dots \}$  (iii) $x_n^\ast(x_n) > 0$ then $\forall x_n: x_n^\ast (x_n) < 2 x_n^\ast (x_n) < \sup$  $\implies $ the $\sup$ is not the l.u.b., contradiction, so the claim $x_n^\ast (x_n) \geq \frac{\| x_n^\ast \|}{2}$ is true.  (ii) Using:   $ x \in \overline{Y} \iff \lnot \exists $ bounded linear functional $f^\ast$ such that $f^\ast (y ) = 0 \forall y \in Y$ and $f^\ast (x) \neq 0$  Let $f^\ast \in X^\ast$. Then $\{ x_n^\ast \}$ dense in $X^\ast \implies$   $$ \forall \varepsilon > 0 \exists x_n^\ast : \| x_n^\ast - f^\ast \| = \sup_{x \in X: \| x \| \leq 1} \{ |x_n^\ast (x) - f^\ast(x)| \} < \varepsilon$$  But for $x_n \in Y \subset X (\| x_n \| = 1)$ we know  $$| x_n^\ast (x_n)| \geq x_n^\ast (x_n) \geq \frac{\| x_n \|}{2} > 0$$   so if $f^\ast (y) = 0 \forall y \in Y$ then  $$ 0 < \frac{\| x_n \|}{2} \leq |x_n^\ast (x_n)| = |x_n^\ast (x_n) - f^\ast(x_n)|$$  $$ \implies \exists \varepsilon: \sup |x_n^\ast (x_n) - f^\ast(x_n)| > \varepsilon$$  $$ \implies \lnot \exists f^\ast \in X^\ast : \forall y \in Y: f^\ast (y) = 0$$  $$ x \in \overline{Y}$$  Thanks for your help.


I am just having a debate with one of my friend regarding the use of the word "Alphabet". when I use the word "last alphabet" instead of "last letter of Alphabet" she told me that I used the wrong word and I have to correct my self. can anyone explain to me the difference and if I am correct or not?

I came across this sentence,  "Modi understands only one alphabet, and that is the capital I"  in the Indian writer Dr. Shashi Tharoor's recently published book "The Paradoxical Prime Minister". When I looked the word 'alphabet' up in dictionaries, I get the definition as 'a set of letters or symbols in a fixed order used to represent the basic set of speech sounds of a language, especially the set of letters from A to Z'. () Why was 'alphabet' used here?


I recently got into an investment discussion with a coworker about what the best way forward would be if a "trade war" does break out between the US and China.  He is older and has a considerable amount of money locked up in his 401k that he is worried about.  He doesn't like the funds that are offered him through our employer 401k plan and was really wanting to find some kind of commodities fund like precious metals.  He is not optimistic about bond funds because of rising interest rates devaluing the existing bonds that these funds hold.  We have a "Stable Market Value" fund but are unsure if that is a good option.  I got to thinking about it and proposed if it might be a good idea to take a 401k loan that he could then invest in precious metals outside of his retirement account.  The interest he would pay on this loan is a payment to himself that likely would result in a higher return than what any of the available funds would do in a bear market.  He seemed unconvinced that it was a good idea because if he switches jobs then he would have to pay back the loan in full immediately but I pointed out to him that any investment fund is relatively liquid so he could cash out quickly if he needed to pay it back at a moments notice.  I am having trouble seeing issues with this approach.  Is this type of behavior explicitly disallowed with 401k retirement account loans?  Why would this be a bad idea?

I know the standard answer and understand that I will be losing out on that compound interest, but I am young and only need to borrow a few thousand. here are some more details:   Need to borrow $6500 to pay off a car and two student loans ($300/month in payments combined) I am 22 and work full time, making about $70K annually I contribute 8% of my income with a 4% company match I increase that by 2% every year The loan would be over 48 months ($140/month) I live very frugally and have almost no discretionary spending that can be cut (don't eat out all the time, no gym membership/ Netflix/ Apple music etc.) I'm cash-poor: 90% of my salary is going to mortgage, groceries, students loans, car payment, newborn baby medical expenses, and commute. These are not my only debts, just the ones I am seeking to pay off in the short term. I work two jobs, one full and one part time. I started a business, and my wife has two jobs. Working more is not a good answer to the original question.   It seems to me that I would be reducing middle to high interest debt while also saving myself $150 per month.   Loans:     Student loan 1: $1200 @ 5%   Student loan 2: $1100 @ 4.25%   Car Loan: $4000 @ 6%


I am quite curious how we should write the likelihood function for -1, 1 in binomial case? The reason I am asking is because , one of famous papers on gradient boosting. Just on the first page, he says the loss function for negative log-likelihood can be written as $log(1 + exp(-2yF))$. As far as I remember if you follow the derivation of loss of the logistic regression with label 1 and -1, you end up with $log(1 + exp(-yF))$. How can I get a coefficient 2? I google a lot and never see this kind of form. Does anyone have any ideas?

I am trying to implement logistic regression where the label space is {-1,+1} instead of the usual {0,1}. I know that I can model this as a 0-1 problem but nevertheless I wanted to see if I can derive this from first principles (using MLE).   The min log likelihood expression I get is:  $ \  l(\theta) = \Sigma_{i=1}^{m}\ \log(1+exp(-y^{i}\Theta^{T}x^{i})) $ where $\{\dots \ (x^{i},y^{i}) \dots \} $ are the $m$ training examples (x is a $n$-dimensional vector).  So now I try to find the gradient for this and I get:  $ \frac{\partial l(\theta)}{\partial \theta_j} = \frac{\mu.y.x_j}{1+\mu} $ where $j=1\dots n$ are the indices corresponding to features and $\mu = exp(y\Theta^{T}x)$  However, when I try to solve this with Matlab's  I do not get any updates on my initial weight vector. My Matlab code for this is:   temp1 = exp((-y).*(X*w)); temp2 = temp1.*((1+temp1).^(-1)).*y; grad  = (X'*temp2);   Can somebody point what I am doing wrong here?


Suppose $M$ is a closed $k-$manifold in $\mathbb R^n$ without boundary, can we always find a smooth function $f:\mathbb R^n\to\mathbb R^{n-k}$ such that $M$ is the level set where $f=0$?

It's a well-known theorem (Corollary 8.10 in Lee Smooth) that given a smooth map of manifolds  $\phi:M\rightarrow N$ and a regular value $p\in N$ of $\phi$, the level set $\phi^{-1}(p)\subset M$ is a closed embedded submanifold. Is the converse true? That is, given an embedded submanifold $S\subset M$, is there necessarily a manifold $N$, smooth map $\phi:M\rightarrow N$, and regular value $p\in N$ of $\phi$ such that $S=\phi^{-1}(p)$?   Prop. 8.12 in Lee Smooth shows that this is true locally; specifically,     Let $S$ be a subset of a smooth $n$-manifold $M$. Then $S$ is an embedded $k$-submanifold of $M$ if and only if every point $p\in S$ has a neighborhood $U\subset M$ such that $U\cap S$ is a level set of a submersion $\phi:U\rightarrow\mathbb{R}^{n-k}$.   (and any level set of a submersion is of course the level set of a regular value). I feel like this is the kind of question where, if there is a counterexample, it probably is very simple, but I wasn't able to come up with one.


I am wondering if this problem has been studied, and in particular if there is an algorithm for it.  Consider a universe $\mathcal U$ and a set $A \subseteq U$, and a family of sets $\mathcal F \subset 2^{\mathcal U}$. We know that $$\mathcal U = \bigcup_{F \in \mathcal F} F.$$  I want to find a minimal set $\mathcal E \subseteq \mathcal F$ such that $$A = \triangle_{E \in \mathcal E} E$$ where $\triangle_{E \in \mathcal E} E$ means the symmetric difference of all the sets in $\mathcal E$.  The set family $\mathcal F$ is not closed under symmetric difference, but we know that for any $B \subseteq \mathcal U$, there exists a $\mathcal F' \subseteq \mathcal F$ such that $$B = \triangle_{F \in \mathcal F'} F,$$ so the problem is solvable.  I think the decision problem should be NP-hard.  Edit: The links in Kristoffer Arnsfelt Hansen's comments show that the problem of finding the smallest subset expressible as a symmetric difference of the subsets in $\mathbb F$ is NP-complete. This problem is somewhat different, and I am still looking for an algorithm.

this is a rewrite of another recent question of mine [1] that wasnt stated well (it had a semi obvious simplification, mea culpa) but I think theres still a nontrivial question at the heart of it. have seen similar problems in the literature but not this one in particular.  will write it in terms of bit-vectors because thats easiest for me.      let there be a set of bit-vectors of size $n$, $v_1, v_2, v_3, ... , v_n$. consider the bitwise XOR operation. given a target vector $v_0$. find a subset of vectors such that the bitwise XOR of the set equals the target vector. what is an efficient (or ideally, optimal) algorithm to find a subset?   the brute force algorithm enumerates the powerset of size $2^n$ and lists the 1st subset found. (slightly?) more efficient would look at 1-positions in the target and exclude subsets that do not have at least 1 vector with a 1 in a 1-position of the target.  the subset may or may not exist. it may or may not be unique.  closely related questions: (1) find the smallest subset, (2) output T/F depending on whether such a subset exists.  have a suspicion one of these problems is NP complete.  looking for references, insight etc. it would be interesting to know if there are "hard" vs "easy" inputs etc  as I wrote on the other question this seems closely related to the subset sum problem (see eg garey & johnson ref) which is known to be NP complete but this seems to have "slightly" less complexity because its simpler to compute a vector bitwise XOR than a binary sum (the sum can have more binary digits).  the problem also seems closely connected to bin fu's recent question [2]  [1]   [2]


But then, I fould out that it is normal for (La)TeX and Babel to hyphenate (microtype) text in a different way than software like Word, OpenOffice or Libre Offices does it.  Even when it would be possible to correctly hyphenate a word, (La)TeX sometimes does not do it, because it tries to make some kind of “aesthetic” hyphenation.  The word “hyphenation” could already be a good example. Its syllables are, according to  source, hy-phen-a-tion. (La)TeX may refuse to hyphenate this word as, for example, hy-phenation. But in software like Word, OpenOffice or Libre Office, the software would hyphenate a word wherever it is possible. So, seeing something like hy-phenation in a document created by these computer programmes may be quite common.  I would like to have this kind of hyphenation for (La)Tex, too. That is: Keep a minimum space between words in (justified) text and hyphenate the text wherever it is possible (that is, in terms of hyphenation like in Word, OpenOffice or Libre Office). If I do not like the hyphenation of a particular word, I would like to be able to manually suppress that hyphenation locally but not globally.  I have played around with \pretolerance=0, \hyphenpenalty=-10000 and \setlength\spaceskip{.3em plus .1em minus .1em} as  suggested, but nothing has worked so far. I even got some results where correct hyphenation has been totally ignored. For example, the word “standard” has once been hyphenated as stand-ard. I would like to avoid that.

\documentclass[12pt,a4paper]{report} \usepackage[british]{babel} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage[activate={true,nocompatibility},final,tracking=true,kerning=true,spacing=false]{microtype} \DisableLigatures[f]{encoding = T1} \microtypecontext{spacing=nonfrench} \usepackage{geometry} \geometry{     left=2cm,     right=2cm,     top=2cm,     bottom=2cm,     bindingoffset=0mm } \begin{document}     \noindent Note that the word “values” is not hyphenated as “val-ues”.     \begin{enumerate}         \item it could list every single one of them so that one knows that there are multiple mode values in a data set.         \item it could list every single one of them so that one knows that there are multiple mode val- ues in a data set.     \end{enumerate}     \noindent\rule{\textwidth}{0.1mm}\\      \noindent In the following example, the word “determined” is not hyphenated.     \vspace{3mm}      \noindent In a statistical hypothesis test, the \textbf{probability of an alpha error} (error probability) is determined. If the latter is low, $H_0$ can be rejected in favour of $H_1$!     \vspace{3mm}      \noindent In a statistical hypothesis test, the \textbf{probability of an alpha error} (error probability) is deter- mined. If the latter is low, $H_0$ can be rejected in favour of $H_1$! \end{document}


Theorem: A group $G$ of order $p^n$ is cyclic iff it is abelian having a unique subgroup of order $p$.   My problem is with the converse. If $a\in G$ have the largest order, say $p^k$, and $⟨a⟩$ is a proper subgroup of $G$, then there is $x\in G$ with $x\notin ⟨a⟩$ but with $x^p\in ⟨a⟩$.   I understand we must have an element of $G$ not in $⟨a⟩$ given that it's a proper subgroup. But I don't know why we must have such a $x$ so that $x^p$ is in $⟨a⟩$.  What I know is that $⟨G\setminus ⟨a⟩⟩ = G$, but don't know how this implies that we should have $x^p\in ⟨a⟩$ for a certain $x\notin ⟨a⟩$. Thanks in advance!

I've just read from An introduction to the theory of groups from Rotman's the following theorem:     Theorem 2.19. Let $p$ be a prime. A group $G$ of order $p^n$ is cyclic   if and only if it is an abelian group having a unique subgroup of order $p$.      Proof Necessity follows at once from Lemma 2.15. For the converse, let    $a \in G$ have largest order, say $p^k$ (it follows that $g^{p^k} = 1$ for   all $g \in G$). Of course, the unique subgroup $H$ of order $p$ is a subgroup   of $\langle a\rangle$. If $\langle a\rangle$ is a proper subgroup of $G$,   then there is $x \in G$ with $x \not \in \langle a\rangle$ but with   $x^p \in \langle a\rangle$; let $x^p = a^l$. If $k = 1$, then $x^p = 1$ and   $x \in H \subset \langle a\rangle$, a contradiction; we may, therefore,   assume that $k>1$. Now $$1 = x^{p^k}=(x^p)^{p^{k-1}}=a^{lp^{k-1}},$$   so that $l = pm$ for some integer $m$, by Exercise 2.13. Hence,   $x^p = a^{mp}$, and so $1 = x^{-p}a^{mp}$. Since $G$ is abelian,   $x^{-p}a^{mp} = (x^{-1}a^m)^p$, and so   $x^{-1}a^m \in H \subset \langle a\rangle$.   This gives $x \in \langle a\rangle$, a contradiction. Therefore,   $G = \langle a\rangle$ and hence is cyclic.   As usual, there is some trivial part of the proof which I don't understand: I don't see why "If $\langle a\rangle$ is a proper subgroup of $G$, then there is $x \in G$ with $x \not \in \langle a\rangle$ but with $x^p \in \langle a\rangle$", I understand the rest of the proof. I would appreciate if someone could explain to me that statement.


In my script I can select a midifile that's in the same directory as the script by typing the name of the file: 'moonlight.mid'. I chose to organize the midifiles and move them to the folder testmidifiles. I would expect that I could use 'testmidifiles/moonlight.mid' but this gives the error 'No such file in directory'. Is there a way to make this work? As an example: projectfolder/test.py print(open('testfolder/test.txt'))  projectfolder/testfolder/test.txt The reason is that testing on different systems, you have to change the path to the file every time and I'm a bit lazy :) I would love to know the trick!

How do you call an external command (as if I'd typed it at the Unix shell or Windows command prompt) from within a Python script?


When I had windows 10, i had 3 partitions, C, D and E, C was the OS partition and D & E stored my data, now when i installed ubuntu i wiped C and put the D&E to "Do not use this partition" also i switched from NTSF to ext2, when i finished installing, i mounted the D & E drives and nothing was in them. What could've happened? Please help me. Any help would be appreciated  Thanks for reading.

I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions  (C:) Vista  (D:) Entertainment  (E:) Work  (F:) Sources   and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB.  I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost  I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse?   I need these data badly as I don't have a backup for them.


There is a dateTime in the format of "dd/mm/yyyy hh:mm:ss tt". A string is required to be created from this, in the format of "yyyyMMddHHmmssfff".   string timestamp = (dateTimeUTC.Year).ToString() +  (dateTimeUTC.Month).ToString() + (dateTimeUTC.Day).ToString() + (dateTimeUTC.Hour).ToString() + (dateTimeUTC.Minute).ToString() +                            (dateTimeUTC.Second).ToString() + (dateTimeUTC.Millisecond).ToString();   The problem with this code is that if any of the digits for month or day are 0-9, there is no 0 in front of the digit. For example, suppose we have the dateTime 1/26/2020 11:59:53 PM. This must be converted to 20200126235651100. Instead it will be 20201262359530.

I have this function...  private string dateConvert(string datDate) {         System.Globalization.CultureInfo cultEnGb = new System.Globalization.CultureInfo("en-GB");         System.Globalization.CultureInfo cultEnUs = new System.Globalization.CultureInfo("en-US");          DateTime dtGb = Convert.ToDateTime(datDate, cultEnGb.DateTimeFormat);         datDate = dtGb.ToString(cultEnUs.DateTimeFormat.ShortDatePattern);          return datDate; }   But I want it with the leading zero still on lower digits (1-9) so the date is 11-09-2009 (mm-dd-yyyy)...  Now If I wasn't converting it id use string.Format("{0:d}", dateVar) how do I do this in the conversion?  ***** Solution ***** Used a slightly modified version of the answer below (i.e. one that would render).  Convert.ToDateTime(datDate).ToString("MM-dd-yyyy");


How do I prove that:  $$\sin(1)+\sin(2)+\cdots+\sin(n)=\frac{\sin\left(\frac{n+1}2\right)\sin\left(\frac n2\right)}{\sin\left(\frac12\right)}?$$  I have tried to to use the formula $\sin(2x)=2\sin(x)\cos(x)$ but without any success.

How can we sum up $\sin$ and $\cos$ series when the angles are in arithmetic progression? For example here is the sum of $\cos$ series:  $$\sum_{k=0}^{n-1}\cos (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \cos \biggl( \frac{ 2 a + (n-1)\cdot d}{2}\biggr)$$  There is a slight difference in case of $\sin$, which is: $$\sum_{k=0}^{n-1}\sin (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \sin\biggl( \frac{2  a + (n-1)\cdot d}{2}\biggr)$$   How do we prove the above two identities?


So have some divs on my webpage that I'd like to have some functionality with once clicked, but these divs aren't hard coded into the HTML, they are rendered using javascript as their appearance depends on what is in a database on the backend.  I set a function on click of these divs but absolutely nothing happens. I can't hard code these into the HTML as I need their appearance to be dependent on the database contents.  Here is my code to render the divs:  $.ajax({     method: "GET",     url: "../server-scripts/getTickets.php",     success: function(result) {         var safe = JSON.parse(result);         var tickets = safe["tickets"]         for(i = 0; i < tickets.length; i++) {             var stage = tickets[i]["stage"];             var name = tickets[i]["name"];             var field = "#"+stage;             $(field).append("
"+name+"
");         }     } });   And here is the code which is supposed to happen when you click on one of the divs:  $(".deployed-ticket").click(function() {     alert("Select a column to move the ticket"); });   I look at the developer console in my browser and absolutely nothing, the backend works just fine (tested) and this code for other, hard-coded elements works just fine.  Do I need to use different code in order to manipulate div elements rendered through javascript?   Thanks a lot! Much appreciated

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I use  to set my fan speed to maximum (the maximum provided in HWiNFO, there may be higher speeds) all the time I am using my laptop to cool the processor and GPU while video editing and playing games but also when doing normal tasks. Basically, all the time the laptop is on.  Is this damaging to the processor or the GPU or the fan itself? Does it shorten its life for example?

If I use a program such as SpeedFan to keep my fans at 100% power 24/7, will it harm my computer? I don't care about my power bill but if the excess power could harm my computer I would worry. I have a 350 watt power supply so I don't think the excess power usage will harm it. Here's what I think:  Pros   Things it cools off are kept cooler Cooler parts = faster computer Cooler parts = slower fail rate   Cons   It just sounds wrong. I know this sounds dumb but still Most fans are designed to do their job already I'm either gaming or just browsing the web. Obviously gaming while keeping the fans on can be beneficial but my computer doesn't get very hot while browsing the internet.


i would like to know the departure and arrival of a French Bee Flight BF711 on May 9,2019 from SFO to ORY if that is possible to know

The question  only deals with flights in the US sourced from the  . Is there some similar source for EU, Asia etc?


The issue isn't about downvotes themselves, it's the abuse done by them.  On my time on Stack Overflow I have often noticed the phenomena of dissatisfied people downvoting questions without any given reason (in my/other posters) opinion and that makes other site users not even go into the question thread seeing all the down-votes or going in the thread to also down-vote to help the apparent "cause" of the other users wanting to close the question down for whatever reason.  I think the downvoting system rather insults the question asker rather then helping him improve his question. Downvoting a question needs to have repercussions under abuse just like upvoting should have.  More often than not people that have a low post count and ask their first question aren't going to ask it in a way some more veteran users of the site expect it to be asked and therefor they feel like the community much prefers abusing his post instead of explaining to him what he did wrong and giving him a way to fix it.  Most people do not even bother to suggest edits leaving the beginner Stack Overflow experience to feel extremely "toxic" at first to people. The same people that don't understand the in and outs of it.  So whats the solution?  Making sure people that downvote don't abuse it by showing them if that is one of the first posts the question asker asked.  Making sure to people downvoting / upvoting in an abusive manner carries consequences and their vote practically looses its value because its never used in the right context.  Downvotes to people with low post counts should need to come with a short explanation or choice that is shown to the question asker to explain to him what he might have done wrong to receive that down-vote.  The voting system is highly problematic in my opinion and needs a serious rework.

Note: If you're looking for a simple explanation as to why comments aren't required on downvotes, see .   I used to get "upset" (though that is too strong a term) when I got downvoted without comment. If my answer isn't good enough then I'd like to know why. Not only does it improve the answer for the OP but it improves my knowledge too.  Where the down-vote has been explained I've found it useful & it has improved my answer, or forced me to delete the answer if it was totally wrong.  So is there any way we can encourage people to leave a comment? Perhaps they don't lose rep if they explain their down-vote?  I must admit though that I haven't always explained my down-vote either so you could call me a hypocrite. I've also grown a thicker skin over the months of using SO (it seems to have come with the higher rep score ;-)), so I'm less bothered about this now.


Here is the sentence: The result of the moisture-laden air entering window assembly is visible condensation or “fog”.  Doesn't the period go after the g?

As in the following:     A common proverb is: “A rolling stone gathers no moss.”        A common proverb is: “A rolling stone gathers no moss”.        A common proverb is: “A rolling stone gathers no moss.”.   If the proverb weren't a full sentence, I would immediately put a single period after the quote, at the very end.  But if it is a sentence, which period should be removed so that there is only one period? Two periods look absolutely dorky.


I've been put to work on a very complex Drupal 7 based system with multiple custom written modules for which the developers have gone or been re-assigned.  Documentation for the system is very sparse.  I think it would help me to get a a better overall picture of the system, as well as to figure out what is happening in particular parts of the system that I have been asked to fix or change, if I could see a listing of all of the hooks that are implemented.  I presume that Drupal scans all of the code in the system and builds itself some sort of structure or associative array in its cache memory so that it can quickly find any hooks that need to be invoked.  Is the result stored somewhere that I can read, for example in a database table or a global variable?  If I need to figure it out myself, is there a particular function, for example in the system module or bootstrap code that all hooks must pass through once?  If so, perhaps I could (temporarily) hack it to get the information I want.  If someone knows how to do this, I'd love to hear how.  If you don't know how to do it but have ideas about especially fruitful places to look in the code, database, drush functions, or wherever, that could be useful too.  Thank you very much.

I have a hook_form_alter in a module, and it should be firing, but it appears it's not. I've cleared caches and rebuilt the registry. Is there someplace in the database or somewhere else where I can see if my hook is registed? FWIW here is my hook:  /**  * Implements hook_form_alter  */ function my_module_form_alter(&$form, &$form_state, $form_id) {   drupal_set_message($form_id); }


Does the 50 ft extension cord my refrigerator is hooked up to cost me dbl in electricity?

My new mini refrigerator is plugged into a 50 ft extension cord that is plugged into my house. Does it cost more to run because of the cord?


I would like to add a rectangular box to my table to highlight some rows. I'm trying to use tikz with the second lot of code from  to a similar question. However, unlike the earlier question, I'm using beamer and the box appears in the wrong place after compiling several times. I'm attaching a picture with the desired result and what I obtain instead.      This is my code:  \documentclass{beamer} \usepackage[english]{babel} \usepackage{tabularx,booktabs,dcolumn} \usepackage{tikz} \usetikzlibrary{matrix,shapes,arrows,fit} \pdfmapfile{+sansmathaccent.map} \newcolumntype{d}{D..{-1}}  \newcounter{nodecount} \newcommand\tabnode[1]{\addtocounter{nodecount}{1} \tikz \node                (\arabic{nodecount}) {#1};}  % Some options common to all the nodes and paths \tikzstyle{every picture}+=[remember picture,baseline] \tikzstyle{every node}+=[inner sep=0pt,anchor=base, minimum width=1.8cm,align=center,text depth=.25ex,outer sep=1.5pt] \tikzstyle{every path}+=[thick, rounded corners]  \begin{document}  \begin{frame} \frametitle{Title of my slide} \begin{table} \resizebox{\textwidth}{!}{    \begin{tabular}{c*{7}{d}} \midrule  \multicolumn{1}{c}{$CCCCC$}  & \multicolumn{1}{c}{$CCCC$} & \multicolumn{1}{c}{$CCCC$} & \multicolumn{1}{c}{$CCC$} & \multicolumn{1}{c}{$CCCCCCC$} & \multicolumn{1}{c}{$CCCCC$} & \multicolumn{1}{c}{$CCCCC$} & \multicolumn{1}{c}{$CCCCCCC$} \\ \midrule \multicolumn{8}{c}{\textbf{Panel A: AAA}} \\ \midrule \tabnode{0}     & 0.00  & 0.00  & 0.00 & 0.00 & 0.00  & 0.00 &            \tabnode{0.00} \\ \tabnode{}    & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) &          \tabnode{0.00} \\   &       &       &       &       &       &       &  \\   0     & 0.00  & 0.00  & 0.00 & 0.00 & 0.00  & 0.00 & 0.00 \\   & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) \\   &       &       &       &       &       &       &  \\   0     & 0.00  & 0.00  & 0.00 & 0.00 & 0.00  & 0.00 & 0.00 \\   & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) \\   \multicolumn{8}{c}{\textbf{Panel B: BBB}} \\  \midrule  0     & 0.00  & 0.00  & 0.00 & 0.00 & 0.00  & 0.00 & 0.00 \\    & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) \\    &       &       &       &       &       &       &  \\  0     & 0.00  & 0.00  & 0.00 & 0.00 & 0.00  & 0.00 & 0.00 \\    & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) \\    &       &       &       &       &       &       &  \\  0     & 0.00  & 0.00  & 0.00 & 0.00 & 0.00  & 0.00 & 0.00 \\    & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) & (0.00) \\   \midrule  \end{tabular}  }  \begin{tikzpicture}[overlay]  \node[draw=red,rounded corners = 1ex,fit=(1)(4),inner sep = 1pt] {};  \end{tikzpicture}  \end{table} \end{frame} \end{document}

I asked a question  but, rather stupidly, added extra information after it had been answered.  My additional question is this: I have a table with varying lengths of words. I want to encircle different groups of cells, including diagonals. If possible, it would be great if the rectangles don't overlap each other where possible.  I looked at the answer , which, whilst tedious, worked except for the overlap.    This is where I've got to so far:  \documentclass[fleqn,12pt,a4paper,landscape]{article}  \usepackage{tikz} \usepackage{tabularx}  \begin{document}  % Introduce a new counter for counting the nodes needed for circling \newcounter{nodecount} % Command for making a new node and naming it according to the nodecount     counter \newcommand\tabnode[1]{\addtocounter{nodecount}{1} \tikz \node     (\arabic{nodecount}) {#1};}  % Some options common to all the nodes and paths \tikzstyle{every picture}+=[remember picture,baseline] \tikzstyle{every node}+=[inner sep=0pt,anchor=base, minimum width=1.8cm,align=center,text depth=.25ex,outer sep=1.5pt] \tikzstyle{every path}+=[thick, rounded corners]  \begin{table}[ht]   \begin{minipage}[b]{1 \linewidth}\centering    \begin{tabular}{cccccc} % Turn the cells needed for defining the circling paths into nodes with our     custom command \tabnode{Long ago}& \tabnode{A few days ago}& \tabnode{Day before         yesterday}& \tabnode{Yesterday} &  &  \\      & & &  & \tabnode{Today} & \tabnode{Now}\\      \tabnode{Long time in the future}& \tabnode{A few days on}&     \tabnode{Day after tomorrow}& \tabnode{Tomorrow} &  & \\      \end{tabular}    \end{minipage}   \begin{tikzpicture}[overlay] % Define the circle paths \draw [blue](1.north west) -- (1.north east) -| (7.north east) |- (7.south     west) |- (1.north west); \draw [red](8.south west) -| (2.north east) -| (2.south west) |- (8.south     west); \draw [yellow](9.south west) -| (3.north east) -| (3.south west) |- (9.south     west); \draw [green](8.south west) -| (3.north east) -| (2.south west) |- (8.south     west);   \end{tikzpicture}  \end{table} \end{document}  %%% Local Variables:  %%% mode: latex %%% TeX-master: t %%% End:


I am trying to Find out how often the line "character" is in a .txt file I tried This:  String line; int characterAmount; characterAmountReader = new LineNumberReader(new FileReader(filename)); while ((line = characterAmountReader.readLine()) != null) {     if(line == "<character>") {         characterAmount++;     } }   but for some reason it doesn't work : /

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


This might be late but my Pokemon all run away after the first throw. What is causing this?

I'm level 10 on Pokemon Go. I've caught at least 150 Pokemon, and had no problems. Now, every time I try to catch a Pokemon, no matter the level, it just rolls twice in the pokeball, breaks free, then runs away. Can anyone provide some insight on how to fix this problem?


I have this material, that is a subsurface and because some reason when the denoise is applied it gives my really strange artifacts only in the red parts(the oxidized metal is other object).

Since the Denoise feature was added to Blender I only use the default setting with it and it really does the work. But sometimes the denoise is noticable on some of my renders. How can I overcome the blurred effect? Denoising for me is a big help because my system is quite aged.


I have two HashMaps defined as follows:  HashMap EventTable = new HashMap(); HashMap MainTable = new HashMap ();   Now, suppose I insert some data into EventTable:  EventTable.put("name", "Test Event Name");   Then, suppose we insert the EventTable into the MainTable:  MainTable.put("table", EventTable);   and then print out MainTable:  {table={name=Test Event Name}}   Now if I modify Event Table as follows:   EventTable.put("more names", "More test events");   This changes the MainTable as well:   {table={more names=More test events, name=Test Event Name}}   So obviously, EventTable is being passed by reference to MainTable.   I don't understand why EventTable is being passed by reference.  Ideally I would like to reuse the EventTable HashMap to create other entries, while retaining my  old entries, so I would like to pass EventTable by value.  EDIT:  Forgot to mention this in the main question, but when I add a String to the MainTable, that does not change when I modify the string afterwards. So how is the behavior is different for the String?

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?