Why I didn't received a Bronze Medal after reaching the goal "Curious"?

I already have reached the goal, as it shows on the board of my profile:   It's been (at least) a week since I have reached the goal, but no medal counted.  In  question, it says that it takes probably a day for it.  Am I missing something regarding the proposed objective to get this medal?


I have a txt file which actually is a html source of some webpage. Inside that txt file there are various strings preceded by a "title=" tag.  e.g.   <div id='UWTDivDomains_5_6_2_2'  title='Connectivity Framework'>    I am interested in getting the text Connectivity Framework to be extraced and written to a separate file.  Like this, there are many such tags each having a different text after the title='some text here which i need to extract '  I want to extract all such instances of the text from the html source/txt file and write to a separate txt file. The text can contain lower case, upper case letters and number only. The length of each text string(in characters) will vary.  I am using PowerGrep for windows. Powergrep allows me to search a text file with regular expression inout. I tried using the search as        title='[a-zA-Z0-9]  It shows the correct matches, but it matches only first character of the string and writes only the first character of the text string matched to the second txt file, not all string.   I want all string to be matched and written to the second file.  What is the correct regular expression or way to do what i want to do, using powergrep?  -AD.


What are the different reasons why theory of gravity mediated through gravitons fails?


Someone asked me to check on his usb stick because it was not recognized properly and he wanted to get his data back. It's a PHILIPS FM16FD70B. Windows disk manager reports No Media but i can mount it with a letter. When I try to chkdsk, it just says unable to open the volume in direct access. In linux, neither fdisk or parted see it. It does appear (only the disk, not the partitions) in /dev but when I try to copy from it using dd it just says '/dev/sdc': No medium found. When I look at dmesg, i have this :  [May 8 11:25] usb 1-3: new high-speed USB device number 8 using xhci_hcd [  +0.140243] usb 1-3: New USB device found, idVendor=ffff, idProduct=1201, bcdDevice= 0.00 [  +0.000007] usb 1-3: New USB device strings: Mfr=0, Product=0, SerialNumber=0 [  +0.002358] usb-storage 1-3:1.0: USB Mass Storage device detected [  +0.002429] scsi host4: usb-storage 1-3:1.0 [  +0.059393] usbcore: registered new interface driver uas [  +0.775138] audit: type=1101 audit(1588929907.791:92): pid=1247 uid=1000 auid=1000 ses=2 msg='op=PAM:accounting grantors=pam_unix,pam_permit,pam_time acct="root" exe="/usr/bin/sudo" hostn> [  +0.000175] audit: type=1110 audit(1588929907.791:93): pid=1247 uid=0 auid=1000 ses=2 msg='op=PAM:setcred grantors=pam_unix,pam_permit,pam_env acct="root" exe="/usr/bin/sudo" hostname=? a> [  +0.001889] audit: type=1105 audit(1588929907.794:94): pid=1247 uid=0 auid=1000 ses=2 msg='op=PAM:session_open grantors=pam_limits,pam_unix,pam_permit acct="root" exe="/usr/bin/sudo" host> [  +0.178887] scsi 4:0:0:0: Direct-Access     NAND     USB2DISK         0.00 PQ: 0 ANSI: 4 [  +0.040526] sd 4:0:0:0: [sdc] Attached SCSI removable disk   Also, I'm not sure it's useful but the stick was mainly used with MacOS. I'm thinking about a dead controller (especially with the idVendor=ffff), but since the key is only 6 months old, I'm not quite sure. Do you have any idea if the data is recoverable or if I can do anything about it ?


How to factorize $5$ in $\mathbb{Z}[\root 3 \of 2]$?

Since $5$ has a norm of $125$ in this domain, and $N(1 + (\root 3 \of 2)^2) = 5$, it seems like a sensible proposition that $5 = (1 + (\root 3 \of 2)^2) \pi_2 \pi_3$, where $\pi_2, \pi_3$ are two other numbers in this domain having norms of $5$ or $-5$. This is supposed to be a unique factorization domain, right?  I am encouraged by the fact that $$N\left(\frac{5}{1 + (\root 3 \of 2)^2}\right) = N(1 + 2 \root 3 \of 2 - (\root 3 \of 2)^2) = 25.$$  But I am discouraged by the fact that $$\frac{5}{(-1 - (\root 3 \of 2)^2)(1 + (\root 3 \of 2)^2)} = \frac{7 - 6 \root 3 \of 2 - 2 (\root 3 \of 2)^2}{5}$$ is an algebraic number but not an algebraic integer. I have found a couple of other numbers with norms of $5$ or $-5$ but can't get them to multiply to $5$ in any of the combinations of three of them that I have tried. I feel like I'm going around in circles.


JPA: How to load original entity in transaction

I'm trying to calculate the modifications in an entity before updating it.   display HTML form on submit:  start transaction load entity apply form data to entity calculate changes persist entity    Steps 2.1 through 2.3 are managed through my MVC framework (Spring MVC) so I never actually have a reference to the original entity without the changes.  So what I'm currently trying to do is the following:  // transaction is already started public Modifications store(Entity updated) {     Entity original = entityManager.find(Entity.class, updated.getId());     Modifications mods = calculateModifications(original, updated);     entityManager.merge(updated);     return mods; }   But unfortunately the entity I receive from the entity manager is the same (read ==) as the updated one.  Here's the question: How do I force the entity manager to load the entity again from the database without detaching my updated entity?  I am using Hibernate as my persistence provider, but I would like to keep this provider agnostic as much as possible.


I am trying to set up a postfix server for smtp relay. Centos 5.5  I have followed  but am getting a FAILED error when trying to restart or reload postfix.  When I do:  cat maillog   I get:  fatal: open /etc/postfix/main.cf: Permission denied   Here is what I have tried:  chown postfix /etc/postfix/main.cf chmod u+rwx /etc/postfix/main.cf   After that, I do:  ls -l /etc/postfix/main.cf   Which gives me:  -rwx------. 1 postfix anotheruser 27531 Apf 29 12:19 /etc/postfix/main.cf   No dice. Same error. I even tried temporarily doing chmod 777 but got same error.  Any ideas on the permissions problem? I am assuming it is running the service as the postfix user.  Thanks


I am attempting to move my 3 vertically aligned gradient border with border-radius elements to horizontally aligned elements. I tried to use display: flex but it did not make it horizontal. If there is anything anyone knows that will fix my issue, please comment.   .gradient-box {   width: 30px;   height: 30px;   position: relative;   padding: 40%;   color: #FFF;   background: #000;   background-clip: padding-box;   /* !importanté */   border: solid 20px transparent;   /* !importanté */   border-radius: 50%;  } .gradient-box:before {   content: "";   position: absolute;   top: 0;   right: 0;   bottom: 0;   left: 0;   z-index: -1;   margin: -5px;   /* !importanté */   border-radius: inherit;   /* !importanté */   background: linear-gradient(to right, #ffcfd2, #ffb6c3, #ff9bbb, #ff80b8, #ff63bb); }  html {   height: 100%;   background: #000;   display: flex; }  body {   margin: auto; } <!DOCTYPE html>     <meta charset="UTF-8">   <title>CodePen - A Pen by Eden</title>   <link rel="stylesheet" href="./style.css">


\documentclass{article}: show author's position

My Latex code is:  \documentclass{article} \begin{document} \author{Author} \title{Title} \maketitle Document's text. \end{document}   The output is:   How can I show the author's position underneath the author's name, e.g. Professor at ...?


Splitting very big numbers over several lines

Possible Duplicate:          I'm writing a report (in LaTeX) in cryptology and I have to work with very large numbers. I want those big numbers to be on multi-lines, I mean when I write my big number, and after compiling, LaTeX puts this big number on a single line, but we can only read the beginning of this number. How to print the big number on multi-lines automatically ? Is there a tag to use or something else? Thanks


Can Community ♦ raise a duplicate content flag when an answer is deleted and re-posted as a new answer?

I haven't seen this behavior out in the wild much, but it happened again recently and I was wondering if a flag could be automatically raised when this happens:   User posts answer Answer is down voted User deletes answer User posts exact same text as a new answer User effectively ditched down votes   Got down voted again? Wash, rinse and repeat. Profit (perhaps after modifying the post, which is what you should have done to begin with)    I feel that this should raise a duplicate content flag, with slightly stronger wording. Would this be possible to implement? Or, perhaps, don't let users post new answers if they have a deleted answer to a question. Rather, force them to edit and restore the deleted answer instead, unless locked by a moderator.  I do have a link, but I don't want a lot of people to descend on it and create an even bigger disruption. It happened exactly as I described.


No internet connection after update from ubuntu 14.04 to 16.04

Is there anyone who may help me with the following problem? I upgraded ubuntu 14.04 to ubuntu 16.04 and I have problem with the internet connection. Secifically, DNS after update stopped working, I added the DNS 8.8.8.8 to configuration, but resolving is still doesn't work; The outputs of nmcli device show wlan1 | grep IP4 is:   pc@pc:~$ nmcli device show wlan1 | grep IP4 IP4.ADDRESS[1]: 192.168.1.3/24 IP4.GATEWAY: 192.168.1.1 IP4.ROUTE[1]: dst = 169.254.0.0/16, nh = 0.0.0.0, mt = 1000 IP4.DNS[1]: 8.8.8.8   The output from  dig @8.8.8.8 google.com and dig google.com:  dig @8.8.8.8 google.com ; <<>> DiG 9.10.3-P4-Ubuntu <<>> @8.8.8.8 google.com ; (1 server found) ;; global options: +cmd ;; Got answer: ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: 60075 ;; flags: qr rd ra; QUERY: 1, ANSWER: 12, AUTHORITY: 0, ADDITIONAL: 1 ;; OPT PSEUDOSECTION: ; EDNS: version: 0, flags:; udp: 512 ;; QUESTION SECTION: ;google.com.            IN  A  ;; ANSWER SECTION: google.com.     27  IN  A   62.75.23.245 google.com.     27  IN  A   62.75.23.230 google.com.     27  IN  A   62.75.23.216 google.com.     27  IN  A   62.75.23.238 google.com.     27  IN  A   62.75.23.224 google.com.     27  IN  A   62.75.23.223 google.com.     27  IN  A   62.75.23.237 google.com.     27  IN  A   62.75.23.210 google.com.     27  IN  A   62.75.23.217 google.com.     27  IN  A   62.75.23.231 google.com.     27  IN  A   62.75.23.244 google.com.     27  IN  A   62.75.23.251  ;; Query time: 89 msec ;; SERVER: 8.8.8.8#53(8.8.8.8) ;; WHEN: Sat Apr 30 19:39:24 EEST 2016 ;; MSG SIZE  rcvd: 231 pc@pc:~$ dig google.com ; <<>> DiG 9.10.3-P4-Ubuntu <<>> google.com ;; global options: +cmd ;; connection timed out; no servers could be reached  pc@pc:~$ route -n Kernel IP routing table Destination     Gateway         Genmask         Flags Metric Ref    Use Iface 0.0.0.0         192.168.1.1     0.0.0.0         UG    600    0        0 wlan1 169.254.0.0     0.0.0.0         255.255.0.0     U     1000   0        0 wlan1 192.168.1.0     0.0.0.0         255.255.255.0   U     600    0        0 wlan1


Divisibility by Quadratics $b^2+ba+1\mid a^2+ab+1\Rightarrow\ a=b$

The natural numbers $a$ and $b$ are such $a^2+ab+1$ is divisible by $b^2+ba+1$. Prove that $a = b$.   I tried to algebraically manipulate it as follows:  $(b^2 + ba + 1)k = a^2 + ab + 1$  $[b(a + b) + 1]k = a(a + b) + 1$  $kb(a + b) + k = a(a + b) + 1$  $k - 1 = (a - kb)(a + b)$  I'm stuck here. What should I do next? A case-by-case analysis of possible congruencies would be too tedious and inelegant.


Does it matter if I bought something on the wrong account?

I bought the season pass on the playstation store accidentally on my brothers user, I meant to purchase on my user. Does this even matter, or will it work on both users? How do I know if its even installed?


Visa issue: need to extend visa for more period

I'm a Sri Lankan student who came to study in Spain, but I"m here not with student visa, but Schengan visa ( a mistake happen in first place). my visa expires at 12th of Dec, but I have to Stay until end of January in Spain. since this is type C , spain embassy said I can not change it to type D being in a European country. Could you please tell me the options I have to get visa ( it's ok even to get the type C again ) from Dec to January without me going back to Sri Lanka and apply again. ( Sri Lanka doesnt have a spain embassy so I have to go to India , if I happen to go)


Can I use inferential statistics from a "non-random" sample of 34000?

I have 10 years of data on football players individual games which works out to 34000 samples. Can I use this to draw inference about football players in general?  Drawing on 3 requirements of CLT this is what I see:  1) Is it independent?  Yes, this 10 years of data is less than 10% of all football players ever played.  2) Is n>30?  Obviously yes.  3) Random Sample?  This one I'm hung up on. Should I have taken a random sample of the past 10 years? To me it is better to have a lot of observations. Can I use my large sample to draw inference on the larger population or should I be drawing inference on just the past 10 years of players?


I have a problem with a java plugin. I want to create a File with name "spawns.yml" in a Folder with the name of the main class. So i have 2 Classes.  The Main-Class called Tutorial:   import java.io.File; public class Tutorial extends JavaPlugin {   private static Tutorial plugin;   private File f;   private FileConfiguration fc;   public void onEnable()   {     f= YamlHandler.createFile("Spawns.yml");     fc=YamlHandler.createYamlFile(f);     YamlHandler.saveYamlFile(fc,f);     plugin=this;   }   public static Tutorial getInstance()   {     return plugin;   } }   And the YamlHandler, where the problem is:  import java.io.File; import java.io.IOException;  import org.bukkit.configuration.file.FileConfiguration; import org.bukkit.configuration.file.YamlConfiguration;  public class YamlHandler {     public static File createFile(String filename)     {         File dir=new File(Tutorial.getInstance().getDataFolder().getAbsolutePath()+File.separator+Tutorial.getInstance().toString());         dir.mkdir();         File f= new File(dir.getAbsolutePath() + File.separator + filename);         if(!f.exists())         {             try {                 f.createNewFile();             } catch (IOException e) {                 // TODO Auto-generated catch block                 e.printStackTrace();             }         }         return f;     }     public static FileConfiguration createYamlFile(File f)     {         FileConfiguration fc= YamlConfiguration.loadConfiguration(f);          return fc;     }      public static void saveYamlFile(FileConfiguration c,File f)     {         try {             c.save(f);         } catch (IOException e) {             // TODO Auto-generated catch block             e.printStackTrace();         }      }  }   The Exception says:        java.lang.NullPointerException                at YamlHandler.YamlHandler.createFile(YamlHandler.java:17)~[?:?]  which is this line:    File dir=new File(Tutorial.getInstance().getDataFolder().getAbsolutePath()+File.separator+Tutorial.getInstance().toString());`   Any ideas?


Why is my MacBook visibile on Bluetooth after Yosemite install?

Since upgrading to Yosemite (from Mavericks) my MacBook Pro (Retina mid 2014) is visible (in ) on Bluetooth (at least to my iPhone). It was not visible prior to Yosemite, and there's nothing that I did on my iPhone (that I can recall) to make this happen.  Why is my Mac visible on Bluetooth, and how do I hide it again?


I have used a lot of recipes for Japanese cotton cheesecake, but none of them have worked well for me. I am currently using the following recipe and method:   60 gr of full milk 140 gr of cream cheese 40 gr butter 50 gr plain flour 15 gr cornstarch 5 eggs 100 gr fine sugar   Method: mix milk and cheese and add flour + cornstarch, then mix in the yolks. Make meringue and fold in.  Bake at 180C for 15 min, then lower the temperature to 160C and bake for 50 min.  Turn off the oven and leave the cake in the oven for 1 hour.  My problem: the cake is rising well during baking but then it deflates when it cools in the oven. What am I doing wrong?


Why doesn't `\\` make a newline in TikZ?

This code  \tikz \graph [layered layout] { "I want newline after comma:" -> "Hello,\\ World."; };   just gets rid of the whitespace between the "," and the "W" of "World" below:    Why doesn't it make a newline?


How to balance a very-low magic campaign

Recently, my players and I got kind of bored with the fact that Pathfinder relies heavily on magic items than martial prowess for fighting classes. I realize and accept the fact that spellcasters are more powerful than petty sword fighters in Pathfinder, but my players usually prefer fighters, rangers or rogues not spellcasting classes.  So, we came up with the idea of playing a low-magic campaign. Here are the terms;   No spellcasting classes for players. This includes paladins, rangers, bards etc. But archetypes that replace spells(such as skirmisher archetype for ranger) is ok. No magical items except for very rare and powerful artifacts that will serve a specific purpose. There will be spellcasters in the world, but, again very rare and they will probably be the villains of the story. Alchemy exists, as well as special materials such as cold iron, mithral etc. There will be magical creatures, such as undead, demons, devils.   The main purpose here is that, I want my players to feel competent when they kill a horrific creature, I want them to feel they killed it because of teamwork and tactics, not because they had the right magical item combinations.  Of course, with this comes several concerns on balance of the game.   How should I handle healing between encounters? Refilling 30 hp can last a long time, even with the help of Heal skill. How should I balance encounters? Challenge Ratings assume access to magical items and magical items improve at an exponantial rate so maybe treat the party level as -1 for every four levels they have(against the magical creatures or those rare spellcasters of course)? Example; Party level 1-4 = -1 Effective party level, Party level 4-8 -2 Effective party level etc when determining Challenge ratings for "magical encounters". Without magic, Armor Class does not scale, however attack rolls do. At some point, attack rolls will be automatic hits and I don't like that prospect without magic or healing to aid the players. This will make fighting defensively, or feats like Dodge or Combat Expertise more important but I feel, they won't be enough. How should this be handled? And finally, without magic, everyone will be a fighter of one kind or another.  What are your thoughts on replacing Fighter-level Requirements on feats like Weapon Specialization with Character level?   P.S; The question may be too broad and not have only one definitive answer from one person only, but every idea helps and I will combine those ideas while creating the campaign.  Thanks in advance.


How to redirect output to file to STDOUT?

Similar problem as here  However, the solution given there is not universal.  My problem: I have a command that produces output to STDOUT. At the same time, I can specify via arguments to produce another output that goes straight to a file.  tcsh$ hmmscan --domtblout FILEOUTPUT Pfam-A.hmm query.fasta   Pfam-A.hmm is a database file (input); query.fasta is also an input file  How can I redirect FILEOUTPUT to STDOUT ?  Background: I plan to use the command on thousands of inputs and I need to run it for each of them separately. The command is called within a Python script, and I would like to read its FILEOUTPUT directly into the memory/a variable using the subprocess module. I know how to get the STDOUT with the subprocess module; so if I could redirect FILEOUTPUT to STDOUT...  I tried already stuff like this (ended up with errors or created files):  tcsh$ hmmscan --domtblout >/dev/tty Pfam-A.hmm query.fasta tcsh$ hmmscan --domtblout >(mypipe) Pfam-A.hmm query.fasta tcsh$ hmmscan --domtblout >$ Pfam-A.hmm query.fasta tcsh$ hmmscan --domtblout >($1) Pfam-A.hmm query.fasta tcsh$ hmmscan --domtblout >cat Pfam-A.hmm query.fasta tcsh$ hmmscan --domtblout test.tab Pfam-A.hmm query.fasta >/dev/tty


Ghost Schedulable Classes Blocking Deployment

Recently I've been running into issues where deployments were blocked due to a Schedulable job pending or in progress when I'd already cleared the Schedulable job from that class.  Any tips for resolving this issue?  I've had success in the past by querying all CronTrigger objects and aborting the jobs that don't have a status of 'Deleted', but that has the unwanted side effect of cancelling all Dashboard Refreshes as well.  I'm sure there is just a stuck job in there somewhere, but was curious if any of you code heads out there had other ideas ...


Let $a,b$ be positive integers such that $a\mid b^2 , b^2\mid a^3 , a^3\mid b^4 \ldots$ so on , then $a=b$?

Let $a,b$ be positive integers such that $a\mid b^2 , b^2\mid a^3 , a^3\mid b^4 \ldots$ that is $a^{2n-1}\mid b^{2n} ; b^{2n}\mid a^{2n+1} , \forall n \in \mathbb Z^+$ , then is it true that $a=b$ ?


Can someone respond to a question by just saying "I´ll" instead of "I will"? Why or why not?

My friend keeps on responding to questions by just saying "I´ll". This doesn´t seem grammatically correct to me. However I would like to know what would be the proper use of that contraction.


Forcing decimal numbers to use comma in ArcGIS Field Calculator?

Can I add the comma "," to force the decimals to remove from the attribute and replace with the number?   For example, I have an Acres field column that says 506320.0750 and I want to replace the decimal with the comma, say 506,320? I want that number to be permanment.   Is that possible? I'm using ArcGIS Desktop 9.3.1


I'm new to regex, so I've done a bit research. My filter should only allow:   a-Z 0-9 (meaning 0 to 9) () []   I've found  regex:  "/^[a-zA-Z0-9]+$/"   I edited it to allow ()  "/^[a-zA-Z0-9()]+$/"   But how to make the regex allowing [] too? Seems like [] need to be escaped somehow.


How can a photon have energy when its mass is zero? According to Einstein's equation $E = mc^2$ energy depends on $mass*c^2$ Light has zero mass so the energy would be zero too but solar cells use photon's energy but how can a photon have energy when its mass is zero?


How to find public ip for a freebsd system

Can someone tell me a command that will find my external ip for a freebsd 10 system.


Does OS X Yosemite support spotlight on network drives?

I know in the past OS X did not support indexing network drives.   Has this changed?   Do more recent versions of OS X such as Yosemite support spotlight on network drives?  I am thinking of investing in a NAS storage device such as Synology and spotlight support is a requirement.  Since I have lots of data on my external drives right now.


In a few weeks' time, I will be visiting the US for 14 days. Coming from the EU, roaming is very expensive, so I am considering getting a temporary SIM card. However, looking around for the options, I ran into a few things that seem to work differently that I'm not sure about.  What I would like is the following:   Something that works with my European  Reasonable coverage in Utah and adjacent states (I understand there's no reception at the bottom of Grand Canyon, but it would be nice to have coverage most of the time while driving down I15 from Salt Lake to Vegas). Small data bundle to look up addresses and stuff along the way (500 MB or 1GB will do, doesn't have to be 4G all the time) Will use mostly for calling within US, but would be nice if there's a reasonable rate for calling to (or being called from) the EU so I can call home a few times.   Looking at the options, I got really confused about a few things.   Since I have my own device, can I get a SIM only without buying a phone?  It seems that I need to buy the credit separately, or is a starting credit usually included?  Is it possible to get internet access on a prepaid card? Do I buy this separately or is it included in the credit, at $ xx / MB?  Should I order anything in advance or can I just walk into a local AT&T store or Walmart and walk out with a local phone number?   Since I'll only be there for two weeks, ideally I'd like to keep the total around $30. Is that reasonable?


I have seen that we can implement multiple inheritance in ANSI C?  As we can create any class like  struct sampleClass {     int size;     struct sampleClass *ptr1; };   As I tred to create class and want to implement inheritance. Can you give me some idea how to implement that?


Let $X_{1},\ldots,X_{n}$ be i.i.d. $U[\alpha,\beta]$ r.v.s., and let $X_{(1)}$ denote the $\min$, and $X_{(n)}$ the $\max$. Show that   $$ \mathbb{E}\left(\overline{X}_{n}\mid X_{(1)},X_{(n)}\right) = \frac{X_{(1)}+X_{(n)}}{2}. $$   I know that $\displaystyle\mathbb{E}\left(\overline{X}_{n}\mid X_{(1)},X_{(n)}\right)=\mathbb{E}\left({X}_{1}\mid X_{(1)},X_{(n)}\right)$ but not much more.


Is there a reason to use dd if I don't use any extra parameters?

I often use dd when I for example want to copy an image to a usb drive. I only do dd if=infile of=/dev/sdb. Is there any advantage to this over < infile > /dev/sdb? And is this the exact same as pv infile > /dev/sdb?


(a) If $a,b$ are positive quantities such that $(a<b)$ and if    $a_1 = \frac{a+b}{2}$, $b_1 = \sqrt{a_1b}$, $a_2 = \frac{a_1+b_1}{2}$, $b_2 = \sqrt{a_2b_1},\dotsc, a_n = \frac{a_{n-1}+b_{n-1}}{2}$, $b_n=\sqrt{a_nb_{n-1}},\dotsc$ then show that $\lim_{n\to\infty} b_n = \frac{\sqrt{b^2-a^2}}{\cos^{-1}\frac{a}{b}}$.      Please give me hints so that i can solve it..I am stuck...  I found that $b_n=\frac {1}{2}\sqrt{a_{n-2}b_{n-1}+a_{n-2}b_{n-2}+b_{n-2}b_{n-1}+a_{n-2}b_{n-3}}$  Now i m stuck...cant understand what to do


how can i get a float value from this string using?? C programing

I'm learning C and I'm trying to extract a float value from a string, it must be in this kind of format. But when I enter a number in my string it only returns an int, can someone help me? thank you  #include <stdio.h>  float daNum(void); int main (void) {   float value = 0;  printf("please enter a value:"); value =  daNum();  printf("your value is:%.3f \n", value);  return 0; }   float daNum(void) { char store[121] = {0};     float numba = 0; int const kInvalInput = -5;  fgets (store, 121, stdin);   if( sscanf (store, "%f", &numba) != 1) { numba = kInvalInput; }  return numba; }


Here's something I realized recently. If your post has a certain error (eg: duplicate title) and you click the post button, Stack Overflow detects it as a submission.   This means scrolling back up and fixing the title and then pressing the submit again will display the error you can only submit once every 90 minutes.  I have not tried this out in other sites on the SE.  Update: After trying several times repeatedly, I was able to post it after 10 mins from the original time.


I'm a noob to android development and I am trying to split a string multiple times by its multiple line breaks.  the string I'm trying to split is pulled from a database query and is constructed like this:  public String getCoin() {     // TODO Auto-generated method stub     String[] columns = new String[]{ KEY_ROWID, KEY_NAME, KEY_QUANTITY, KEY_OUNCES, KEY_VALUE };     Cursor c = ourDatabase.query(DATABASE_TABLE, columns, null, null, null, null, null);     String result = "";      int iRow = c.getColumnIndex(KEY_ROWID);     int iName = c.getColumnIndex(KEY_NAME);     int iQuantity = c.getColumnIndex(KEY_QUANTITY);     int iOunces = c.getColumnIndex(KEY_OUNCES);     int iValue = c.getColumnIndex(KEY_VALUE);      for (c.moveToFirst(); !c.isAfterLast(); c.moveToNext()){         result = result + /*c.getString(iRow) + " " +*/ c.getString(iName).substring(0, Math.min(18, c.getString(iName).length())) + "\n";     }     c.close();     return result;   result.getCoin reads as this:   alphabravocharlie   I want to split the string at the line break and place each substring into a String Array. This is my current code:  String[] separated = result.split("\n");       for (int i = 0; i < separated.length; i++) {            chartnames.add("$." + separated[i] + " some text" );             }   This gives me an output of:  "$.alpha bravo charlie some text"   instead of my desired output of:  "$.alpha some text, $.bravo some text, $.charlie some text"   Any help is greatly appreciated


How to reach $U = mgh$ Using Newton's Law of Universal Gravitation?

today i was curious about the potential energy, so, i started studying the Newton's Law of Universal Gravitation which its equation is \begin{eqnarray} U= -\frac{GMm}{r}.\end{eqnarray} Well, since i gotthis equation i really know how to reach at this point ( due some experiments, also some documents help me to get until here), i was very excited about reaching this point, and i told to myself : "Alright, good job." the excitement passed away when a friend told me that i can transform this equation into:\begin{eqnarray} U= m.g.h.\end{eqnarray} Sadly, i don't even know how to start with,i know that The  potential should be an approximation for the general potential energy when r = r (of earth), but the problem is... Equation 1 Scales with radius and the other one with height.


Display of spam vs normal flags on flag summary inconsistent

As I was going through my flag summary on Stack Overflow, I noticed that we display different information depending on what kind of flag it is.    These are the differences that I noticed:   "flagged as" prepended to the spam flag My username is included in the normal flag The time that I flagged with the normal flag is included in the display


How is the no-cloning theorem compatible with the fact that fan-out gates work?

I have some difficulty with understanding no-cloning theorem. Simply speaking, according to the theorem, it is not possible to copy a quantum state.  On the other hand, CNOT gate can be used as so-called fan-out gate which purpose is to copy one qubit to another one, previously in state $|0\rangle$.  It seems that these two facts negate each other.   My question: How is no-cloning theorem compatible with the fact that fan-out gate works?


What is the distribution of the k-th event in the Poisson process?

Assuming we have a Poisson process of density $\lambda$ I'm trying to find a distribution of a random variable $\tau_k$ - the time when k-th event has happened. E.g. in case of $\tau_1$ it is an exponential distribution. My approach is the following: $$ F(t) = P(\tau_k \le t) = 1 - P(\tau_k > t) = 1 - \sum_{i=1}^{k}P(\xi_t = i-1), where \\ P(\xi_t = k) = \frac{(\lambda t)^k}{k!}e^{-\lambda t} $$ I'd further need to calculate an expectation and a dispersion which is complicated in case of this sum. Any help appreciated.


Cosmic jets are jets of matter ejected from super massive black holes. The gravitational pull of a black hole is so high that even light can't escape it. Yet particles with mass traveling at speeds slower than the speed of light are ejected out. Why does this paradox exist? Is the laws of physics violated? (A humble doubt from a layman)


Overstayed on Visa Waiver Program and I am planning another holiday?

I went on the Visa Waiver Program to Chicago 3 years ago, I ended up over staying by 2 days. I am now going back for a week long holiday and I am just wondering what I need this time to allow me into country with no hassle? I am travelling from Ireland.


Prove $0<a_k\in \mathbb R$ and $\prod\limits_{k=1}^n a_k =1$, then $\prod\limits_{k=1}^n (1+a_k) \ge 2^n$

Prove:$$0<a_k\in \mathbb R\quad and\quad\prod_{k=1}^n a_k =1,\quad then\quad \prod_{k=1}^n (1+a_k) \ge 2^n$$  (*) I guess that the minimum of $\prod\limits_{k=1}^n (1+a_k)$ happens when all $a_k$'s are $1$, but can't prove it. Thanks.


Is there a way to assign variables and values and refer to the new variables in a bash for loop?

I want to execute a for loop, create new variables with values that vary with the loop iteration, and refer to the new variables within the loop or later in the shell script. Can't figure out how to refer to the new variables because of the way they are being evaluated. A simple example of what I need but does not work -  for i in {1..4}  do  my${i}var="./path_to/my${i}file"  echo $my${i}var  done


In a short exact sequence of modules, the extremes are finitely presented. Why is the central module finitely presented?

I am currently stuck in the following problem, which is an excercise of a lecture of module theory:     Problem. Let $R$ be a unital ring and $$(*)\quad 0\rightarrow M\overset{f}{\rightarrow}N\overset{g}{\rightarrow}P\rightarrow 0$$ be a short exact sequence of right $R$-modules. If $M$ and $P$ are finitely presented, then $N$ is finitely presented.   All I have so far is that by the exactness of $(*)$ and the following exact sequences \begin{align} &R^m\rightarrow R^n\rightarrow M\rightarrow 0\\ &R^k\rightarrow R^l\rightarrow P\rightarrow 0 \end{align} it can be seen that $\ker g$ and $N/\ker g$ are both finitely presented. But I can hardly figure out what to do next. Does it follow from this fact that $N$ is finitely presented?


Why didn't Thanos just reduce the fertility rate?

Thanos' goal is to halve the population, to reduce demand for resources. The best way to kill half the population is to get all six infinity stones; then you can make half of all life just disappear.  But if you have all six infinity stones, you could just reduce the fertility of all species in the galaxy, so that the population gradually falls to half of its original size.   Why does Thanos prefer murder over birth control?


What would the rainbow look like if we could see the full EM spectrum?

Would the rainbow look different if we could see the full EM spectrum (or at least a lot more of it)? Would the width of a rainbow be bigger and would all wave lengths of light be in a rainbow?


How to show that log|z| has no harmonic conjugate on the complex plane with origin removed?

I know log |z| has a complex harmonic conjugate if we only consider the complex plane with $(-\infty , 0]$ removed because log |z| is just the real part of the principal Log function, so we can just use say $v=Arg(\theta)$. But I'm not sure how to make the same argument if we only consider the complex plane without the origin. Yes, the Arg function no longer works because it is not continuous but you can still argue there may be another harmonic function that works. How can we argue that there is absolutely no other harmonic function v such that log|z| + iv(x,y) is analytic on C*? Also, complex integration has not been introduced, so I don't want to prove this using any complex integration.


Prove $$\sum_{k = 0}^{n}(-1)^{n - k} \binom{n}{k} \cdot k^n = n! \qquad\text{and}\qquad \sum_{k = 0}^{n}(-1)^{n - k} \binom{n}{k} \cdot k^m = 0,$$ where $m \in \{0, 1, 2, \cdots, n - 1\}$.  To be honest, I tried to use some combinatorial ideas but was not able to see interconnections. Also, I had an idea to prove it using induction but failed to do that either. Help will be much appreciated! I just got stuck and don't see any continuation of solution for this problem


Properly sort index containing utf8 characters?

If my input file is utf8 encoded, how to I create an index where the entries are properly sorted?  Minimal example  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage{makeidx} \makeindex \begin{document} Hello World\index{Gödel}\index{Galois} \printindex \end{document}   After compiling with pdflatex and makeindex, the entries show up with “Gödel” before “Galois”, which is wrong.  In another  it is suggested to compile with xelatex instead; however I'm trying to do this in a large-ish project already written by someone else, and trying to switch to xelatex is proving a bit problematic.  So, is there a way to make it work with pdflatex?


Finding and changing measurement units using QGIS?

Using QGIS 2.4, I want to create 1,000m buffer around an object, but when I enter 1,000 as the distance I get something that looks more like a 100,000m buffer.    I can enter 0.01 to get what looks like a 1,000m buffer, but I would rather work in single metres.   How do I change the settings so that the number I enter is in single metres?


How can I modify labels in default wordpress registration form?

I need to change Label text in registration form, especially "Email" label. I want to add asterisk or just add text "required field" How can I do that? Please advice...


Subject -verb agreement with appositive clauses

When I add an appositive clause explaining subject that is different in term of singular/plural , how to choose verb agreement with the subject. Should I use " these chemical reactions" or " that is the greenhouse effect" as a subject  or should I avoid all along by not adding appositive clause?     Some greenhouse gases such as carbon-monoxide or water vapor are   natural gases which exist in the atmosphere already. Nevertheless, when   we produce too much of the greenhouse gases, they trap the solar heat rays and   prevent them from escaping from the Earth's atmosphere and surface.   These chemical reactions, that is the greenhouse effect,    results/ result in global warming.     Does the fact that these refers to the post-positioned the greenhouse effect affect the choice of tense?


Have written and wrote. They mean the same thing?

I have written a letter. I wrote a letter.  Do they mean the same thing or there is a difference?  If there is a difference then where should I use "have written" and "wrote"? (I'm also talking about every other verbs)


How to check if your bootloader is unlocked

I'm about to flash a custom recovery, but I'm not sure if my bootloader is unlocked or not (phone is rooted, but I did it a while ago, so I can't remember the process I went with), and I don't want to do anything that might risk losing all my current data. Can I simply run fastboot flash recovery [recovery image], and if it doesn't work, take that to mean my bootloader is locked? Are there any negative consequences to attempting this with a locked bootloader?


Print numbered paragraph after title with Biblatex

My question is related with Biber and Biblatex (latest versions). I need to quote the number of a paragraph of an old Christian text which is published within a book printed nowadays.   More clearly, I'm working with this Biblatex item (it's in Italian):  @INBOOK{Clemente1984Lettera,   author = {Clemente di Roma},   title = {Lettera di Clemente Romano ai Corinti},   year = {1984},   booktitle = {I Padri apostolici},   editor = {Quaquarelli, Antonio},   location = {Roma},   pages = {41-92},   publisher = {Città Nuova} }   I quote it in a common LaTex file with the BibTex key:  \cite[42]{Clemente1985Lettera}   With a humanistic Biblatex style, the final citation is:  Clemente di Roma, Lettera di Clemente Romano ai Corinti, in "I Padri apostolici", edited by A. Quaquarelli, Roma 1985, p. 42.  Anyway, I need to quote specifically the n. 2 of the letter of Clement, so I have to print this number just after the title "Lettera di Clemente Romano ai Corinti". So, I'd like to have this citation:  Clemente di Roma, Lettera di Clemente Romano ai Corinti, n. 2, in "I Padri apostolici", edited by A. Quaquarelli, Roma 1985, p. 42.  Now, I can find no Biblatex field to store the "n. 2" text, and no way to print it after the title. Of course, I could create a specific item in the bibliographic file in which the title field, or another one which is supposed to follow it, contains the "n. 2" indication. Anyway, this solution is very bad to me, because I should fill my archive with items of specific citations, and not of single titles.  What I'm looking for is what I've already implemented in the Bibfilex citations system (), which is moreover far less powerful that Biber: the possibility to add a pipe in the postnote of a BibTex key to separate a possible indication of a number of a paragraph, to be printed just after the title, from the pages of the volume. So a key like that  \cite[2|42]{Clemente1985Lettera}   should print   Clemente di Roma, Lettera di Clemente Romano ai Corinti, n. 2, in "I Padri apostolici", edited by A. Quaquarelli, Roma 1985, p. 42.  Anybody knows how to do that with Biber and Biblatex?  Thanks.


Understanding Why $\mathbb{Q}^+$ Isn't a Cyclic Group Under Multiplication

I'm just trying to understand why the positive rationals do not form a cyclic group under multiplication. Please let me know if my reasoning is correct, and where I made mistakes.  Proof by Contradiction:  If the positive rational numbers form a cyclic group, then that means that $\mathbb{Q}^+$ = $\left\langle\frac{a}{b}\right\rangle$. This implies every single positive rational number can be written in the form of $(\frac{a}{b})^n$. Assume that this is true, and take the rational number $\frac{a}{2b}$. Since $\mathbb{Q}^+$ = $\left\langle\frac{a}{b}\right\rangle$, this means that $\left(\frac{a}{b}\right)^n$  = $\frac{a}{2b}$. However, no such $n$ exists such that this is true. Therefore, there is no generator for $\mathbb{Q}^+$, and is not a cyclic group.  Is my reasoning correct? I'd really like to understand this airtight since the concept will be used in an exam, so I'd like any form of critique or correcting. Thanks for helping me!


When we study topology, we typically study topological spaces and continuous maps between them. From a categorical perspective, this is "wrong," because continuous maps are not the structure preserving maps. If "the structure of a topological space" is it's topology (i.e., it's open sets) then it seems like the natural choice for the definition of a structure preserving map would be an open map. So why do we like continuous maps instead of open maps?


Notification icon that looks like 'b' with 3 dots

Does anyone know what this symbol is in my notification bar? I'm guessing it's from a 3rd party app. Please excuse my poor attempt to recreate it. :)


How do I change the "Selected Items" color?

I was trying to change the selected items color from the default orange to something else, however, the option isn't there, as it used to be in the Appearance properties in previous versions of ubuntu. Any idea where it could be in the beta?


What will happen if I don't use my Schengen visa?

I've been given a Schengen visa valid for 1 month.  Unfortunately, I won't be able to travel during the dates I've specified in my application.  What should I do?  Do I just not use the visa?  Or should I let the embassy know so they can cancel it?


Speed up the compilation of a document with a lot of tikzpictures made with pgfplots

I have a document with a lot of tikzpicture made with pgfplots, most of them take data from files so the compilation may be very long. In order to have only a draft I would like to have blank images with same dimension of the full ones.  Until now I used a trick of having a tikzpicture with an empty axis environment of the same dimensions of the original one and with some if statements I included the blank or the full image like this:  \newcommand{\img}{Y} % immages Y(es) or N(o) ... \begin{figure}   \centering   \ifthenelse{\equal{\img}{Y}}{%     \input{Immagini/full.tex}}{%     \input{Immagini/empty.tex}}   \caption{caption} \end{figure}   file full.tex  \begin{tikzpicture}   \begin{axis}[height=9cm, width=.8\textwidth]     \addplot table [x index=0, y index=2] {dati.dat};   \end{axis} \end{tikzpicture}   file empty.tex  \begin{tikzpicture}   \begin{axis}[height=9cm, width=.8\textwidth]   \end{axis} \end{tikzpicture}   But today I read this question  and now I would like to know if there is a similar way to the draft option of the package graphicx that does the same thing with tikzpicture.


Quickly open your favorite folders on OS X?

What are the options which would be faster than opening Finder and browsing the folder, to open it?  (I like to keep the desktop completely clean so will avoid Desktop shortcuts if other options are available)  Usually what happens with me is that there are a few folders (favorites?) which I need to open very frequently like multiple times a day and almost daily (and get landed to some other folder while browsing through Finder).  Can imagine something like 'pinning' to the Finder icon on the Dock could be of great help, like one can pin favorite folders on the taskbar on Windows.  What do you do to quickly go to your favorite folders?


Pre-print service like arXiv but with private option, so I can correct my mistakes without publicly advertising my mistakes?

As a student, I make mistakes all the time, and stealing my idea will not face heavy retaliation. I don't mind if someone comes up with concurrent works, but I do mind if my key idea is leaked. Many graduate students in my field therefore only use pre-print services if their papers are either publicly presented or conditionally accepted. I am looking for a website that can do most of what ArXiv does, with an additional private option or limited visibility, for example an option to make the paper unindexed by search engines. This way, my paper cannot be seen for at least a few months. By doing so, I can at least claim that I am one of the first few researchers who got the idea right. And most importantly, I can privately correct my mistakes, if any. Publishing mistakes is embarrassing and sometimes harms one's career. Many mistakes will be revealed during the peer-review processes and I have a chance to correct them before publicizing. Please kindly think twice before giving ethically and "politically correct" comments like no one will scoop me, everyone will cite me, and the scoopers will be punished. At least in my field, scooping and idea-stealing is commonly observable, and big-names don't care about publicizing pre-prints because they have resources to punish the scoopers. I do understand that keeping my work private might harm the community as the information becomes less transparent. However, it could also be possible that my un-reviewed flawed works misguide the community, and a paper reviewed will benefit the society more. I personally wasted six months because of someone else's mistake in a published work.  I heard that in molecular biology there is a widely-used service to upload your research data, like protein structure and sequencing, to get a timestamp. The uploaded materials can be set to be private for a period, and fully disclosed later. A lot of people do use this function. This is not exactly what I am looking for but shares some similar ideas. If I remember correctly, there is an interesting paper studying the scooping patterns with the aid of this database.  Solutions found!  and some other university-run pre-print services do have an embargo function. Moreover,  is a widely used repository, that, unlike arxiv, only displays the newest version to the general public, although still keeps a tag on the first submitted date!


As per the new data retention policy, when will inactive accounts now be deleted?

Prior to May 2017, accounts used to be automatically deleted if they met . However, in May 2017, we stopped culling inactive users (see ).  Today, in the , it says:     As part of our new data-retention policy, we will now delete accounts that have been inactive for more than two years and where the user has never engaged in any meaningful activity.   What is the definition of "meaningful activity" here?


How to jusify {e,n} is a valid RSA public key?

I have a  two set of key {36,77} and {50,117},  How can validate if it is a valid RSA public keys? Is there any simple method?


In carrom, what if a player pocket the last piece of other player, while queen still on the board?

One player pocket the black piece of other player while the queen is still on the board.   Does the other player whose black piece was being pocketed by other player wins? If so, then by how many points?


What is a good introductory text on resampling methods?

I have found a few decent ones about specific resampling applications such as bootstrapped confidence intervals, but nothing broader. A journal article or book chapter would be preferable to an entire book, but all recommendations are welcome.   Edit: I am looking for an article or chapter that provides an overview of the wider range of resampling methods (e.g., bootstrapping, jackknifing, subsampling) rather than a treatment of just one.


Trying to solve  I tried to find the complete list of all available/possible default "post meta" tags/entries. I couldn't find this info documented anywhere. Any pointers?


PHP return messy characters after calling fsockopen

I met with a PHP messy characters issue. Although it maybe a simple or basic question, it hasn't been solved until now after hours googling. I run the following simple snippet to access an unreachable IP, and echo $errstr. <?php header("Content-type: text/html; charset=utf-8"); $socket = fsockopen("10.180.100.100", "23", $errno, $errstr, 3);// IP which can't access echo $errstr."
"; echo mb_detect_encoding($errstr)."
";  When I run it from PHP CLI, the result is what I expect.  When I access it from my Apache server, I get messy characters.  I have set header("Content-type: text/html; charset=utf-8"), and set page encoding as UTF-8. Neither is helpful. Any ideas why?


Creative Commons Mix and Printed Materials

Hello graphic design exchange.  I have a question about creative commons and its mix usage for printed materials.  As you know there are lots of websites offering free vectors for commercial uses. In my case, it is freepik.com. It says it allows commercial usage if we attribute them.  My question is how can we attribute on printed materials like business cards?  For example I design some business cards for my freelance customers and want to use some brush or shape from one element. Maybe I use lots of background elements seperately.  How can I attribute on business card for example? For example a web banner, how can we attribute? or a smaller project a logo and I like a shape vector and want to use by mixing other elements, how can I attribute these types of designs?  edit: this question marked as a duplicate, but I have different situation. On a magazine, there can be a copyright, on a poster, there can be a little statement, but on a business card design? For example floral vector backgrounds from a cc licensed file?


Proof that $\sqrt[p]{n}$ is irrational if $n$ is not a perfect pth power

i'm using Courant's book for self study, i would like to know if my proof that $\sqrt[p]{n}$ is irrational if $n$ is not a perfect pth power. Also would appreciate if someone do know where i can look for the solutions.    If $n$ is not a perfect pth power i can express it in terms of $n^{pm + 1}$. Assuming that $\sqrt[p]{n^{pm+1}}$ is rational i would have:  $$ \sqrt[p]{n^{pm+1}} = \frac{k}{j} \\ n^{pm + 1} = \frac{k^p}{j^p} \\ n^{pm + 1}j^p = k^p \\ n^mn^{\frac{1}{p}}j = k \\ j^p = \frac{k^p}{n^{pm+1}} \\ j = \frac{k}{n^mn^{\frac{1}{p}}} $$  Which is a contradiction because they do have a common factor.


Equipartition theorem. Neglecting one rotational degree of freedom

My teacher said that a rotational degree of freedom for a molecule in a gas can be neglected if the associated moment of inertia is very small, because the associated frequency of rotation will be very high.  Could somebody explain this to me ?


using saved format for all other documents

I pre-apologize for any stupid questions here. I'm still very beginner in LaTeX and trying to learn how to use it efficiently.  I have certain commands and basic setup that I use for all the documents I write. It includes ams symbol, tikz-cd setting, font setting and many personal commands that I use (like \Q for rational number). However, I change them sometimes and I wish that change goes into all of my documents uniformly.  So here is what I think, if I write these setup in one document and modify it whenever necessary, can I bring this to other documents using something like \bring{mysetup}? Or do you just copy & paste your format all the time whenever you write a new one?  Thanks in advance.


What's the term for becoming used to something so you don't even notice it anymore?

Is there a term for this? I had my SIL's birthday present on my desk for weeks, and then the day I went to visit her, I forgot to bring it with me because it had sort of become part of the furniture and I didn't notice it there. Or when you walk into a room and notice the smell, but then you get used to it after a while so you don't notice it anymore. Or you walk past a shop so often that you don't notice it, and when you want to buy something that the shop sells, you forget about the shop's existence because you don't notice it anymore.


Make mouse left-handed and touchpad right-handed

I see that I can configure mouse and touchpad all in one panel (Ubuntu 13.10, defaults, Gnome). Which is to some extend. Namely, I want to have the touchpad differently configured then the mouse and ...  When I have an (USB) mouse attached I use it normally left-handed. Therefore I switch the buttons to left-handed. But when I use the touchpad I feel little bit lost with that kind of configuration. Therefore I wanna have it right-handed.  Is there a way to achieve the following: when I plugin a mouse (respectively when it is detected) automatically switch to left-handed and when I unplug it, switch automatically to right-handed?


What I'm doing is working with a text document that I'm pulling numbers from a saved text document, each line has its own number, and it ignores any lines starting with a !, so, when using these codes, I am getting a NullPointerException and I'm not sure why, Its not filling the ArrayList because of this, how come?  try{                 File f = new File(extStorageDirectory+"/data.txt");                 FileInputStream fileIS = new FileInputStream(f);                 BufferedReader buf = new BufferedReader(new InputStreamReader(fileIS));                 String readString = new String();                 integers.clear();                char check;                while((readString = buf.readLine())!= null){                    check = readString.charAt(0);                   if(check == '!'){                    }                   else{                       //integers.add(0,Integer.parseInt(readString));                       if(check == 0){                           integers.add(0);                       } else {                           if(check == 1) {                               integers.add(1);                           } else {                               if(check == 2){                                   integers.add(2);                               }                           }                       }                   }                }             } catch (Exception e) {                 Toast.makeText(getApplicationContext(),"Find Data: "+e.toString(),Toast.LENGTH_LONG).show();             }


How to construct an auxiliary function in this mean value theorem question?

Let $f(x)$ be a real-valued function that is thrice differentiable on $[a,b]$, prove there exists a $\xi \in (a,b)$ such that $$f(b)=f(a)+\frac{1}{2}(b-a)(f'(a)+f'(b))-\frac{1}{12}(b-a)^3f'''(\xi)$$ I failed to establish a fine auxiliary function and the Taylor formula seems useless here. Please help me with your fabulous auxiliary function :)


I used to use the implicit call of toString when wanting some debug info about an object, because in case of the object is null it does not throw an Exception.  For instance:    System.out.println("obj: "+obj);   instead of:  System.out.println("obj: "+obj.toString());   Is there any difference apart from the null case? Can the latter case work, when the former does not?  Edit: What exactly is done, in case of the implicit call?


Is there an easy way to add four empty lines between each sentence.   For example, this paragraph:  This combination of vitamins and selected minerals is used to prevent or treat vitamin  deficiency due to poor eating habits, problems that affect the body's ability to absorb nutrition from food, or increased need for vitamins and minerals due to stress  or illness. Vitamins are needed for the body to function well. This vitamin/mineral combination contains high levels of B vitamins (e.g., folic acid,  niacin, B-1, B-2, B-6, and B-12) and vitamin C. It also contains other vitamins (A, D, and E) and minerals such as zinc. This medication does not contain iron and has only a  small amount of calcium. Therefore, it should not be used to treat "iron-poor" blood  (anemia) or to prevent osteoporosis.   How I can make it:  This combination of vitamins and selected minerals is used to prevent or treat vitamin      deficiency due to poor eating habits, problems that affect the body's ability to absorb nutrition from food, or increased need for vitamins and minerals due to stress      or illness. Vitamins are needed for the body to function well.     This vitamin/mineral combination contains high levels of B vitamins (e.g., folic acid,      niacin, B-1, B-2, B-6, and B-12) and vitamin C. It also contains other vitamins (A, D, and E) and minerals such as zinc. This medication does not contain iron and has only a      small amount of calcium. Therefore, it should not be used to treat "iron-poor" blood      (anemia) or to prevent osteoporosis.   I would like:  1-  to add four blank spaces between each line.  2-  to add one blank space after the first line then every four spaces


Encouraging software publishers to use StackExchange as support mechanism

Whenever I deal with an application publisher's custom support mechanism because I can't see any evidence of activity on StackExchange, I always wish they'd just migrate to StackExchange, particularly when I get a prompt response from them. What a waste, I think, that my question and answer weren't captured on SE.  In cases where there is some activity for the application on SE, I'll post my question there and, if I get no response, reference the SE question in my email follow-up. In the case of , that had a happy ending where the support person posted the answer to the SE site at the same time they emailed me.  My related meta questions are:   Are there any obvious downsides to publishers effectively "giving up" their custom support mechanisms, or at least their custom forum, in favor of the appropriate SE site? Are there any obvious downsides to SE for publishers making this transition? Is SE staff engaged in any systematic marketing efforts to get publishers to make this transition? Is there any SE documentation which lists the advantages of publishers making this transition?


How can I show that $y'=\sqrt{|y|}$ has infinitely many solutions?

Show that the first order differential equation $y'(x)=\sqrt{|y(x)|}$ with intial value $y(1/2)= 1/16$ has infinitely many solutions on the interval [−1, 1].  My thought were to show that this equation has two solutions (just by ansatz, or just looking at the interval $]0, 1]$ to get $y'(x) = \sqrt{|y(x)|}$) and deduce from that that there must be infinitely many solutions since the solution set forms a vector space. I've got a nagging feeling this isn't the way to go though. Can anybody give me a hint where to look?


Check a string to see if all characters are hexadecimal values

What is the most efficient way in C# 2.0 to check each character in a string and return true if they are all valid hexadecimal characters and false otherwise? Example void Test() {     OnlyHexInString("123ABC"); // Returns true     OnlyHexInString("123def"); // Returns true     OnlyHexInString("123g"); // Returns false }  bool OnlyHexInString(string text) {     // Most efficient algorithm to check each digit in C# 2.0 goes here }


A linear map $S:Y^*\to X^*$ is weak$^*$ continuous if and only if $S=T^*$ for som $T\in B(X,Y)$

As the title says, the question is how to prove  Let $X,Y$ be Banach spaces. A linear map $S:Y^*\to X^*$ is weak$^*$ continuous if and only if $S=T^*$ for some $T\in B(X,Y)$


PDO json_encode does not work, where is the error?

I'm trying this for the first time, so my code comes entirely from tutorials but it just doesn't work. I run PHP 7 with JSON 1.4.0 enabled.  I can print the resulting rows if I don't use json_encode, so my connection and the query are OK.  Error reporting is active but doesn't output anything either.  If I run the php file on my server, I just get a blank page.  Here's my code:  error_reporting(-1);  try {     $conn=new PDO("mysql:host=server.com;dbname=theDB",username,password);     $conn->setAttribute(PDO::ATTR_ERRMODE, PDO::ERRMODE_EXCEPTION);     $stmt = $conn->prepare('SELECT * FROM table');     $stmt->execute();      header('Content-type: application/json');     echo json_encode($stmt->fetchAll(PDO::FETCH_ASSOC));    } catch(PDOException $e) {         echo 'ERROR: ' . $e->getMessage(); }


Null Pointer Exception in Prepared Statement

I ran in to a problem while trying to get data from my sql server where they give a null point exception at prepared statement. I'm sure this must be a noob question but please do help :)   this is the method i'm calling   public void notification(){     int MachCode = 1721;     try{         String sql ="Select TimeOn from PRODUCTIONS_MONITOR where MachCode='"+MachCode+"'";         pst = con.prepareStatement(sql);         rs = pst.executeQuery();          while(rs.next()){             arrCount.add(rs.getInt(1));          }          for(int i=0;i<arrCount.size();i++){               Count = Count + arrCount.get(i);          }          if(Count % 10 == 0){              System.out.println("Time = " + Count);          }      }catch(SQLException e){          e.printStackTrace();      }  }   and here is my db connection    public static Connection ConnecrDb() {     try {         Class.forName("com.microsoft.sqlserver.jdbc.SQLServerDriver");          Connection con = DriverManager.getConnection("jdbc:sqlserver://10.228.59.2:1433;databaseName=dbNautilus;user=SA;password=KreedaIntimo@2017;");          System.out.println("Connected to database !");      } catch (SQLException sqle) {         System.out.println("Sql Exception :" + sqle.getMessage());     } catch (ClassNotFoundException e) {         System.out.println("Class Not Found Exception :" + e.getMessage());     }      return null; }


Is there any difference between sudo password and the one I used to login?

I was under the impression that both the sudo password and the password that I use to login to Ubuntu are the same. But it happened that after logging into the system, tying the password in terminal followed by su, it raises Authentication failure ! error. Aren't they the same ?


Upload image with ajax, HttpPostedFileBase is null Mvc Asp

I must upload image before Form is submitted. So I used ajax to do it.  Here is my HelpController:  [HttpPost] public void AcceptUpload(HttpPostedFileBase TemporaryForLast, string ReferanceNo) {     TemporaryForLast.SaveAs(Server.MapPath("~/Profiles/images/" + ReferanceNo + "/") + "HoldCopy" + ".jpg"); }   Here is my view:  <input id="HoldCopy" type="file" name="HoldCopy" accept="image/*">   Ans Script:  $("#acceptUpload").click(function () {     var formData= new FormData();     var imagefile=document.getElementById("HoldCopy").files[0];     formData.append("imageFile",imageFile);     var xhr = new XMLHttpRequest();     xhr.open("POST", "/Help/AcceptUpload", true);     xhr.addEventListener("load", function (evt) { UploadComplete(evt); }, false);     xhr.addEventListener("error", function (evt) { UploadFailed(evt); }, false);     xhr.send(formData); });   error functions are also updated.


How to get attention to a post on a child meta site

If I want to draw people's attention to a post on a child meta site, how can I do that? I want to get people  over at Area 51 to see what they think of the idea, because it requires opinions from the community. However, posts on the discussion zone of Area 51 rarely get activity, so it seems like I'm out of luck, unless something is changed. And from the sounds of , it seems like this is a problem on all child metas.  That post is similar, but while it talks about increasing activity in general, I am talking about how to raise participation to an individual post; the equivalent of a bounty  I can't use bounties because reputation is the same.   Could there be another way of drawing attention to individual posts?


How to reinstall Ubuntu as part of dual boot?

How do I completely reinstall Ubuntu without affecting the Windows partition? The way I setup my laptop is like this:   Completely wiped everything using GParted from Ubuntu CD Partitioned the HDD to 3 partitions (one for Windows, one for Ubuntu, one for Storage) Installed Windows 7 Pro 64-bit Installed Ubuntu 10.04 LTS 64-bit   The reason why I want to reinstall is NOTHING works in Ubuntu. No internet at all both Ethernet, and Wireless and when I figured out how to fix the wireless, there is no way to download drivers for the display so everything is just ugly and big. To make things more complicated, upgrading to 10.10 via update manager just gives me an error.  The way I see it right now is I have to try to wipe 10.04 and just install 11.04 from scratch but I'm not sure how to do that? Does anyone know?


Is there any way to remove a program that has been installed with a .tar.gz file?

Is there any way to remove a program and all of its executable files and docs that have installed from a .tar.gz file (for example on an Arch Linux)  by :  ./configure make make install   Answer : I thought always there is a short way to uninstall all the programs that were installed from a source, no matter who wrote them (and how), but apparently, sometimes there is no way (except manually )and this may be the reason to build a package manager.


Statistical saturation attack on block ciphers

I was wondering if anyone around here could give me some explanation on this type of attacks. Pretty much the only thing that I could find is .  What I really need is basic explanation of the attack itself with a small example if possible such as any basic block cipher that you could come up with with 3-4 rounds. This is for my personal understanding so any input is more than welcome.


How do I add watermark/background image in Google Docs?

How can I add a watermark or a background image in Google Docs?


How can I increase memory security in Delphi?

Is it possible to "wipe" strings in Delphi? Let me explain:  I am writing an application that will include a DLL to authorise users. It will read an encrypted file into an XML DOM, use the information there, and then release the DOM.  It is obvious that the unencrypted XML is still sitting in the memory of the DLL, and therefore vulnerable to examination. Now, I'm not going to go overboard in protecting this - the user could create another DLL - but I'd like to take a basic step to preventing user names from sitting in memory for ages. However, I don't think I can easily wipe the memory anyway because of references. If I traverse my DOM (which is a TNativeXML class) and find every string instance and then make it into something like "aaaaa", then will it not actually assign the new string pointer to the DOM reference, and then leave the old string sitting there in memory awaiting re-allocation? Is there a way to be sure I am killing the only and original copy?  Or is there in D2007 a means to tell it to wipe all unused memory from the heap? So I could release the DOM, and then tell it to wipe.   Or should I just get on with my next task and forget this because it is really not worth bothering.


I recently submitted a sitemap.xml in Google's Webmaster Tools and some of the pages already got indexed. The problem now is, that I cleaned my URLs with MOD_REWRITE in the .htaccess file afterwards and I would like the new ones to be indexed. The old ones should be removed from the Google Index.  Indexed Page:  www.example.com/article.php?=article=this%is%an%example   New URL:  www.example.com/article-this-is-an-example   Do I even have to remove them manually from the index in any way or do they refresh if Google crawls my new sitemap? I really wan't to prevent duplicate content.  Thanks in advance.


As a graduate student I switch between many tasks during each week. My activities consist of attending classes, doing homework, grading, working on my research and studying for exams. However I notice that from time to time I tend to procrastinate and this happens mostly when I have to switch from one task to another or when I feel that a task is difficult and I am not yet sure of how to handle it. It also may occur when I work at home in Sundays or when unexpected lab meetings interrupt me from my schedule.  My situation is not that I do not feel productive, but some hours per week can be lost due to this issue (which is an important thing).  In general the main idea of my problem is: I tend to procrastinate when switching tasks.  To protect me from distractions I have installed browser plug-ins that do not allow me viewing distracting websites more than 5 minutes per day. I also try to keep track of how much time I spend on each task and have established a relatively stable weekly program.  However I believe I could benefit from better time management advices to handle procrastination...  What are your suggestions ?  p.s. Sometimes what also takes time, is communicating with family and friends. I am an international student and I dont want to lose touch with my people. Although I have a relatively steady pattern of communication with them (usually within weekends) nostalgia beats me wanting more discussion.  ----EDIT---- Most answers seem to suggest micromanagement time approaches. However I believe that micromanagement tends to take a lot of time too. How can you reduce effectively the time it takes to make a schedule for a specific day ?


How to get the first occurrence ? regex python

I have this html tag:  x="""
ad
  \n\n
 correct value

 wrong value
   """   I want to get the corret value  so I search for the word ad followed by
 then any thing until another
 then get all the values until
  I use this code:  re.findall(r'ad
.*
(.*)
',x,re.S)   I use the falg re.S because I want the dot to match new line also. I don't know How much lines there are between the divs. so i use .*  !  I think findall should return correct value, but it return  wrong value. why ? it search for the last div not the first one ?


German visitor visa for my Indian parents and brother

I'm going to invite my parents and brother to Germany for a visit of two weeks. I will send them the invitation; I earn a decent salary and am able to share the cost for them.    Should I invite them and also show the sponsorship (Verpflichtungserklärung) for both my parents and brother? Do my parents need to demonstrate their own financial ability?  My brother works in my uncle's business and he doesn't have payslips to support his own financial claims. Can my parents show that they also support my brother financially?


Georeference a polyygon within a pdf file

I have this pdf file that contains a specific borough of my city, Montreal, with a polygon inside it. Link to pdf file:   The jpeg image once exported from the pdf file is the following    I am trying to extract the red polygon and georeference it.  I have tried using QGIS to open the image file and then manually add coordinate points to specific portion, but it seems tedious and long as I have around 90 different pdf file that I aim to georeference.  Is there an easier way such as taking an actual map of montreal and overlay this map on top of the previous one, and then automatically georeference it?  I don't know if it can help you but the actual pdf file is a vector, when I opened it using illustrator I was able to check or uncheck the red portion.  The ultimate goal is to transform this red polygon into a geojson file. I don't mind doing it manually if theres an efficient way but I would be even happier If there's was some way to automate this through a script.   I have been looking over the past week on the internet for georeference tutorials but most of them are for raster images and do not take in account pdf file (vectorized), I mean in theory, in my opinion it seems possible to compare 2 vector file, mine and lets say the whole vector file of montreal and then georeference it automatically.


Using pop up or modal for mobile/tablet a good practice? If yes, why? If no, what are alternative options?

In what cases should pop up and modal should be used? What are the best and worst case scenario of using pop up and modal?  In mobile/ipad version which option is most suitable option & why?  Which websites do you use pop & modal? (for ex: Facebook, Trello, amazon etc.)


I was wondering if the No Free Lunch (NFL) theorem applies to even the estimation problem. Suppose there are $N$ points in the input. We are trying to estimate the mean value say weights associated with the $N$ points. By randomly selecting $n$ of the $N$ points, we obtain an unbiased estimate of the population mean weight.   However, the NFL states that the knowledge of the $n$ doesn't imply the goodness of the estimate of the remaining $N-n$ points. Does this mean there is no best estimator of the population mean in statistics?  I will also be very grateful if someone could share some papers on NFL in sampling and statistics since I haven't been able to find them yet.     Clarification: I asked this question in maths forum but didn't get any answers, so I am re-posting it here.


What are these different kinds of memory usage in Windows 7 task manager?

In Windows 7's task manager, I can select different columns to show. There are a bunch that are related to memory and memory usage, but I'm not sure what it all means.  I have a Dutch installation of Windows, so I'll try to translate them; as I'm not sure of the English names.    In order:   Working set Peak working set Private working set Commit charge Paged pool Not-paged pool


How to check which element  was clicked using JQuery?

I have a problem - I put a piece of html code on the page using jQuery Ajax  example code:

a1

a2

a3

   I would like to know which element (id) was clicked by the user. Unfortunately, the following code does not work :(  $('li').click(function(){    var info = $(this).attr('id');    alert(info); });   It seems to me that the problem stems from serving html with ajax. jQuery can not see it?


Stop showing "Suggesting Edits Pending Approval" when I'm past my quota

As a newly minted 10K rep user my status bar now has a few new icons. One of them indicates how many "Suggesting Edits Pending Approval" there are in the queue with a dark orange background. When I complete my possible 20 edits for the allotted time-span however, the icon still stays lit up:     Suggestion: Remove the icon while my cooldown is in effect. Once it's up, I'll know I can go back to approving edits. If you want to keep the queue number still up, at least have it change color to indcate that "there is work to be done" and "you have the ability to do this work".


Use polar complex numbers to find multiplicative inverse

Use the polar form of complex numbers to show that every complex number $z\neq0$ has multiplicative inverse $z^{-1}$.  If $z=a+bi$, then the polar form is $z=r(cos(\alpha))+i(sin(\alpha))$.  I can do it, not using polar coordinates: Let $z=a+ib$.  Since $1+0i$ is the multiplicative identity, if $x+iy$ is the multiplicative inverse of $z=a+ib$, then $(a+ib)(x+iy)=1+i0$ $\Rightarrow$ $(ax-by)+i(ay+bx)=1+i0$ $\Rightarrow$ $ax-by=1bx+ay=0$ $\Rightarrow$ $x=\frac{a}{a^2+b^2}$, $y=\frac{-b}{a^2+b^2}$, if $a^2+b^2\neq0$.  The multiplicative inverse of $a+ib$ is therefore $\frac{a}{a^2+b^2} +i\frac{-b}{a^2+b^2}$.  Now, should I use this same process and just replace $z=a+ib$ with $z=r(cos(\alpha))+i(sin(\alpha))$??  Or is there another way to go about this process?


Are Spiderman's Web Shooters Biological or Artificial?

I am confused. I thought Spiderman's ability to shoot web was through biologically built-in nodules in his wrists due to the mutations that happened when he was bitten by the spider.   But then in MCU films and the most recent Spider-verse film by Sony, we see that he's using artificial shooters on his wrists.   So which is more original to Spider-canon? Is his ability to shoot/produce web supposed to be biological as part of the mutation? Or was it always artificial?


Add AD users to sudo group not working | CentOS 6.7

I am on CentOS 6.7 and want to add two domain admins to the sudo group.   I have tried adding both users individully and both together see below:   someuser ALL=(ALL) ALL #THIS Works, but is not a domain account   %domain\ admins ALL=(ALL) ALL #this does not work  CS\domainUser ALL=(ALL) ALL #this does not work either  cs\domainUser ALL=(ALL) ALL #this does not work either  anotherdomainUser ALL=(ALL) ALL #this does not work either   When I su into each doamin user then run the sudo command I type my password as prompted and I get a wrong password error.   What am I doing wrong?


What if interactions such as gravity faded with respect to the cube of distance, rather than square?

It's generally understood that anything that "spreads out" in 3D space dissipates at a rate proportional to the square of distance. Light, sound, gravitational force, etc. I know this is a pretty fixed rate due to geometry.  A thought I can't get out of my head, though: What if it somehow made since for this rate to be cubic? What if doubling the distance didn't make an interaction one fourth as strong, but one eight, etc? Particularly gravity on a cosmic scale.  Apologies if this question is too broad, but I couldn't think of a better place to ask it.


cp not evaluating dirname properly in find operation

I'm trying to create a script which will find files of a certain filename, copy a  file to that file's location, and then delete the found file.   Ignoring the delete part for now, this is what I have so far:  find /path/to/searchdir -name "file.rtf" -exec cp -v "/path/to/filetocopy.rtf" `dirname {}` \;   Unfortunately I can't seem to get it to evaluate the dirname properly, as it returns "." for any instances of the file that it finds.


How to show a running clock in terminal before the command prompt

I prefer to use terminal and spend most of the time using it. I am searching a way to see time in terminal while I use it parallel. The time would change automatically when it passes. It would be awesome if it would display left to my command prompt.  If this is my command prompt in terminal:  saurav@saurav-P4I45Gx-PE:~$   Then I would like to see clock(time) as:  saurav@saurav-P4I45Gx-PE[06:27:01]:~$   or  saurav@(06:27:01):~$   or any other format. where 06:27:01 is the time. What I want is just to show the time which changes when seconds pass.  So is there any way to achieve this?


Phython Flask SQLite objects created in a thread can only be used in that same thread

I have flask code in helloflask.py and abcd.py in the same folder:  import abcd as abc     @app.route("/ddata")     def stuff1():          p=abc.run('somefile.txt')         return json.dumps(p)   abcd.py has following code  connection = sqlite3.connect('C:\\Users\me\Desktop\Python\my.db') cursor=connection.cursor()  def dbcall(ip_rel,c_mac):     sql="select count(*) from myDB"     cursor.execute(sql)     row=cursor.fetchone()     count =row[0]      return count #I am returning a list here in my original code   When I run helloflask.py I get following error while retrieving rows:  ERROR:     File "C:\Users\mvahuje\Desktop\Python\Application\Dsharkclass.py",   line 25, in dbcall    cursor.execute(sql) ProgrammingError: SQLite   objects created in a thread can only be used in that sa me thread.The   object was created in thread id 15108 and this is thread id 14488   This has something to do with thread permissions sqlite3. But I am not sure what could I do additionally to get it working.  Individually out abcd.py works perfectly fine when called into other code.


I have a slideshow in my website and I wanted to use the cool looking content built-in with CSS. I am pretty sure my code is right, but for some reason, the arrows show up as boxes. I don't know what is happening. Here is my code:    .slider .nav-next:before, .slider .nav-previous:before {   -moz-osx-font-smoothing: grayscale;   -webkit-font-smoothing: antialiased;   font-family: FontAwesome;   font-style: normal;   font-weight: normal;   text-transform: none !important; }  .slider .nav-next:before, .slider .nav-previous:before {   position: relative; }  .slider .nav-next {   right: 0; }  .slider .nav-next:before {   content: '\f105';   right: -0.05em; }  .slider .nav-previous {   left: 0; }  .slider .nav-previous:before {   content: '\f104';   left: -0.05em; }


I'm trying to replace the default network manager with wicd. Wicd installs fine, but there is no notification icon, and the default network manager is not disabled. If I log off my wifi using the default network manager and log on using wicd, I cannot access the internet.  Using ps -e I can see that both Network Manager and Wicd is running - should they both be running?  Wicd is set to start at boot, but I don't see it, when the computerstarts. Do I need to do something else than just install Wicd to replace the default manager? Should I apt-get remove the default manager? I have really skow wifi, and after to computer sleeps, I loose the connection completely.  So what Im looking for is a complete replacement of Network Manager to make my connection a lot more stable.  The possible duplicate suggested by Huckle applies to older versions of Ubuntu.  I'm running Ubuntu 16.04 LTS.  Thanks for any help


In a monoid, does $x \cdot y=e$ imply $y \cdot x=e$?

A  is a set $S$ together with a  $\cdot:S \times S \rightarrow S$ such that:   The binary operation $\cdot$ is associative, that is, $(a\cdot b) \cdot c=a\cdot (b \cdot c)$ for all $a,b,c \in S$. There is an identity element $e \in S$, that is, there exists $e \in S$ such that $e \cdot a=a$ and $a \cdot e=a$ for all $a \in S$.      Question:  Suppose, $x,y \in S$ such that $x \cdot y=e$.  Does $y \cdot x=e$?   This question was motivated by the question , where the author attempts to prove a special case of the above in the context of matrix multiplication.  It was subsequently proved, but the proofs require the properties of the matrix.  I attempted to use  to prove the statement.  Here's the input:  formulas(assumptions).  % associativity (x * y) * z = x * (y * z).  % identity element a x * a = x. a * x = x.  end_of_list.  formulas(goals).  x * y = a -> y * x = a.  end_of_list.   and it returned sos_empty, which, I guess, implies that no proof of the above statement is possible from the axioms of monoids alone.  I ran Mace4 on the same input, and found no counter-examples for monoids of sizes $1,2,\ldots,82$.  A comment by Martin Brandenburg  regarding K-algebras might also apply here.  For example, the property might be true for finite monoids, but not all infinite monoids.  A counter-example would (obviously) need to be non-commutative.


"Edit Approved" links are showing as plain text

I was approving an edit on DIY when i noticed that the "edit approved" link was not rendering properly on any page I could find     It looks like the node is somehow set to text. FF 64.0.2 (and 65.0.0) draws it as a text node. Chrome 71's inspector shows it like this


Find general solution for $\tan{x} +\tan{2x} +\tan{3x}= 0$

My approach :-  $\tan{(x+2x)}= \tan{3x}$  $\tan{x}+\tan{2x} = \tan{3x}(1-\tan{x}.\tan{2x})$  Putting this in my equation ,  $\tan{3x}.(2-\tan{x}tan{2x}) =0$  Now either  $\tan{3x}= 0$    or  $\tan{x}\tan{2x}=2$  Hence we get either  $x=\frac{n\pi}{3}$    or  $x= n\pi ± \arctan{\frac{1}{√2}}.$  However , my textbook says that the solution is   $x=n\pi$    or    $x= n\pi \pm \frac{\pi}{3}$  Why is there a disparity in both the solutions? If they are equivalent , how?  I apologize in advance as I'm using latex for the first time. Thank You


I am trying to solve a problem involving a motor attached to an object. The motor is below the centre of gravity. When the motor is running it will apply a torque off axis to the object.   What will the effect of this be on the object?   Does the distance between the motor and the C.O.G have any effect on the magnitude of the response?


What filesystem should I format my USB drive to for maximum compatiblity?

I'm formatting (a single partition on) my USB drive, for read-write use on multiple computers - at the very least Windows (XP and up), Mac OS (not sure which versions) and Linux (distributions which are no more than, say, 4 years old). In the olden days I would probably use FAT32, which I remember to be quite widely supported - but that has a 4GB file limit.  So, in this day and age, and for the OSes I mentioned (perhaps even others) - which filesystem should I choose? My current best guess is NTFS, since I know the Linux support is decent (or better) and for Windows it's native. Is there a better choice?  Notes:   Unlike , I can't accept the 4GB file limit. Also, the answer there suggests filesystems which typically require installing third-party drivers or have other issues. I'm not interested in performance/security/fault tolerance or other such features, just portability. I'm not asking which filesystem is "better", I just want to maximize the spectrum of systems I can use my USB drive with, without having to install drivers or update the OS.


Availability Group how to determine last Failover time

I'd just like to know if there is any way to query when the AG group failed over.  eg - this is the Primary Replica now, but I'm pretty sure it was the secondary yesterday?  How can i find when the failover took place    is there something specific in the Logs I should be looking for, or is there a tsql script to use?


Prove $\binom{n}{a}\binom{n-a}{b-a} = \binom{n}{b}\binom{b}{a}$

I want to prove this equation, $$ \binom{n}{a}\binom{n-a}{b-a} = \binom{n}{b}\binom{b}{a} $$ I thought of proving this equation by prove that you are using different ways to count the same set of balls and get the same result. But I'm stuck. Help me please.   (Presumptive) Source: Theoretical Exercise 1.14(a), P19, A First Course in Pr, 8th Ed, by S Ross.


Why is $\emptyset$ called both open and closed

$\emptyset$ is called both open and closed. Trying to understand this. It's complement is $R$ for instance. Does that mean R is both open and closed? R is unbounded for sure, but every cluster point of R is contained in R (which satisfies the definition of being closed). R is closed looked from this point of view. This would make $$\emptyset$$ open.  But R could also be considered as open, since every point $p_o$ has a neighbourhood which is interior to $R$. Is this why $\emptyset$ is considered both open and closed, therefore $R$ is considered both open and closed?  Another example :  Considered the set $$S={x^2+y^2≥0}$$ Can this be considered both open and closed then?. This condition is satisfied for all $x,y$ therefore this set would be the $R$ itself. Complement of this set is the empty set, and since empty set is considered both open and closed as proved above. This set is also considered both open and closed.


how to install grsecurity in Ubuntu 16.04

How can I install grsecurity on Ubuntu 16.04?  I tried searching google and I am not finding anything even on the ubuntu website or this site.


I have this code in header  class MyMathUtils {    template <typename T> static bool IsEqual(const T & val1, const T & val2); };   template <typename T> bool MyMathUtils::IsEqual(const T & val1, const T & val2) {     return (val1 == val2); };   And this in cpp  template <> bool MyMathUtils::IsEqual<float>(const float & val1, const float & val2) {     if ((val1 - val2) < -EPSILON) return false;     if ((val1 - val2) > EPSILON) return false;     return true; }   Problem is, that compiler gives me this error:     MyMath::MyMathUtils::IsEqual(float const &,float const &)"   (??$IsEqual@M@MyMathUtils@MyMath@@SA_NABM0@Z) already defined in   MyMathUtils.obj; second definition ignored   But if I use the same, but instead of float I put double, it is compiled correctly. What is incorrect here, that I am missing?


Statistics disappear after incremental update

We have a large partitioned SQL Server database utilizing incremental statistics. All of the indexes are partitioned aligned. When we try to rebuild a partition online by partition all of the statistics disappear after the index is rebuilt.   Below is a script to replicate the issue in SQL Server 2014 with the AdventureWorks2014 database.  --Example against AdventureWorks2014 Database  CREATE PARTITION FUNCTION TransactionRangePF1 (DATETIME) AS RANGE RIGHT FOR VALUES  (    '20130501', '20130601', '20130701', '20130801',     '20130901', '20131001', '20131101', '20131201',     '20140101', '20140201', '20140301' ); GO  CREATE PARTITION SCHEME TransactionsPS1 AS PARTITION TransactionRangePF1 TO  (   [PRIMARY], [PRIMARY], [PRIMARY], [PRIMARY], [PRIMARY],    [PRIMARY], [PRIMARY], [PRIMARY], [PRIMARY], [PRIMARY],    [PRIMARY], [PRIMARY], [PRIMARY] ); GO  CREATE TABLE dbo.TransactionHistory  (   TransactionID        INT      NOT NULL, -- not bothering with IDENTITY here   ProductID            INT      NOT NULL,   ReferenceOrderID     INT      NOT NULL,   ReferenceOrderLineID INT      NOT NULL DEFAULT (0),   TransactionDate      DATETIME NOT NULL DEFAULT (GETDATE()),   TransactionType      NCHAR(1) NOT NULL,   Quantity             INT      NOT NULL,   ActualCost           MONEY    NOT NULL,   ModifiedDate         DATETIME NOT NULL DEFAULT (GETDATE()),   CONSTRAINT CK_TransactionType      CHECK (UPPER(TransactionType) IN (N'W', N'S', N'P')) )  ON TransactionsPS1 (TransactionDate);   INSERT INTO dbo.TransactionHistory SELECT * FROM Production.TransactionHistory --  SELECT * FROM sys.partitions --  WHERE object_id = OBJECT_ID('dbo.TransactionHistory');  CREATE NONCLUSTERED INDEX IDX_ProductId ON dbo.TransactionHistory (ProductId)    WITH (DATA_COMPRESSION = ROW, STATISTICS_INCREMENTAL=ON)     ON TransactionsPS1 (TransactionDate)  DBCC SHOW_STATISTICS('dbo.TransactionHistory', IDX_ProductId); PRINT 'Stats are avialable'    ALTER INDEX [IDX_ProductId] ON [dbo].[TransactionHistory] REBUILD    PARTITION = 9 WITH (ONLINE = ON , DATA_COMPRESSION = ROW)  PRINT 'After online index rebuild by partition stats are now gone' DBCC SHOW_STATISTICS('dbo.TransactionHistory', IDX_ProductId);  PRINT 'Rebuild the stats with a rebuild for all paritions (this works)'  ALTER INDEX [IDX_ProductId] ON [dbo].[TransactionHistory] REBUILD    PARTITION = ALL WITH (ONLINE = ON , DATA_COMPRESSION = ROW,    STATISTICS_INCREMENTAL = ON)  PRINT 'Stats are back' DBCC SHOW_STATISTICS('dbo.TransactionHistory', IDX_ProductId);  PRINT 'Works correctly for an offline rebuild by partition' ALTER INDEX [IDX_ProductId] ON [dbo].[TransactionHistory] REBUILD    PARTITION = 9 WITH (ONLINE = OFF , DATA_COMPRESSION = ROW)      --stats still there   DBCC SHOW_STATISTICS('dbo.TransactionHistory', IDX_ProductId);  ALTER INDEX [IDX_ProductId] ON [dbo].[TransactionHistory] REBUILD    PARTITION = 9 WITH (ONLINE = ON , DATA_COMPRESSION = ROW)  DBCC SHOW_STATISTICS('dbo.TransactionHistory', IDX_ProductId); PRINT' stats are gone!!!!!!'   As shown, we cannot rebuild indexes by partition online without losing all statistics for index. This is a major maintenance issue for us. It almost appears that stats incremental option needs to be a part of the single index rebuild syntax or the online option needs to properly handle it like the offline option does.   Please let me know if I am missing something?  Updates:  As far as our need for incremental stats: We are partitioning on an internal customer id and not a date. So when a new client is brought in (large back-load of data) we can simply update the stats for the partition and quickly avoid any ugly plans being created for this new customer. I think I will file it with Microsoft as a bug and see what they have to say and go with the solution of just re-sampling the stats for that partition.  Connect bug report:    Update: Microsoft has confirmed that it is a bug.


How to change CSS of a lightning-accordion-section label in Lightning Web Component

I can't change the CSS of the accordion title because of the shadow DOM in lwc. Is there any way to accomplish that?  Here is the code:  <lightning-accordion onsectiontoggle={handleToggleSection} active-section-name={itemConfig} allow-multiple-sections-open >     <lightning-accordion-section name="MyForm" label="MyForm" class="accordionPadding_small"></lightning-accordion-section> </lightning-accordion>


where can I find the folder where notepad++ stores unsaved tabs?

My laptop crashed one month ago. The HDD has not been damaged and I can read it from my new laptop.  However, I'd like to restore my unsaved tabs in Notepad++, but can't find them back; I can't even find in which path they were stored. I found the config.xml file stating that RememberLastSession was set to yes, but nothing else.  Can anyone help me with this?  Thanks a lot  pp  EDIT: Thanks, but I've read this thread before posting and could not find the folders specified in the thread. As the flag RememberLastSession was turned on, could you tell me in which file the path is stored?


I have added a table and after the table a graph.   I am using \begin{table}[H]  (i tried with !h but it doesn't fix the problem) to control position of tables and similar code for figures. But although I put explicitly the table before the graph, the graph appears before. Is there any way to control it? Is there any way to order all floats in one shot?  What i have in my file looks like this:  \begin{center} \begin{table}[h] \centering \caption{Convergencia pm6} \label{convergencia_cluster_pm6_table} \begin{tabular}{|l|l|l|} \hline \textbf{nºconf} & \textbf{$\Delta G^0$-SS} & \textbf{$\Delta G^0$-Packmol} \\ \hline 5 & -64.6 & -64.7 \\ \hline 10 & -65.5 & -64.1 \\ \hline 15 & -63.7 & -66.5 \\ \hline 20 & -64.3 & -65.0 \\ \hline 30 & -65.9 & -66.3 \\ \hline 40 & -67.2 & -65.6 \\ \hline \end{tabular} \end{table} \end{center} and for images:  \begin{figure} \caption{Convergencia pm6 cluster} \label{Convergencia_cluser_pm6_figure}     \includegraphics[page=1,trim=0 140 0 360, clip, width=\linewidth]{imagenes/all_results_thesis.pdf} \end{figure}


Is peer-accountability permitted on meta.stackexchange?

StackExchange grants users the ability to use "Contact Us" at the bottom of the page to report issues with Moderators. I don't see a rule prohibiting questioning a mod's actions here.  I have one moderator openly calling me an "asshole" and I just got chat-banned for thirty minutes for pasting the log of it because I was in violation of bringing up mod-drama in chat.  This very same moderator has recently amplified the recent site drama and threatened to resign. How come in the case of the recent drama we can get hundreds of posts, resignations, and even religious manifestos by diamond moderators on this network questioning the network's actions. But when it comes to questioning their own actions, even with screenshots, we're prohibited and told to message team@stackexchange.com privately?  Can we use MSE for accountability, or not? I would like a consistent stance on this. If it's a site run by us we should all be allowed to demand redress with our peers, not just the anti-COC clique that's in vogue right now.


Minimal polynomial of root $\zeta_n$ over finite field $\mathbb{F}_p$

Let $n>1$ a number and $\zeta_n$ the the $n$-th root. $p$ be a prime. I'm looking for strategys & theorems which allow to calculate the minimal poplynomial $m_{\zeta_n}$ of $\zeta_n$ over $\mathbb{F}_p$. (the case $n=p-1$ is boring).  first of all since the cyclotomic polynomial $\Phi_n(X)$ is the minimal polynomial of $\zeta_n$ over $\mathbb{Q}$ with coefficients in $\mathbb{Z}$ we apply the reduction modulo $p$ and see that $m_{\zeta_n}$ divides $\overline{\Phi_n(X)}$ with $\overline{\Phi_n(X)}$ the image of $\Phi_n(X)$ under reduction map $\mathbb{Z}[X] \to \mathbb{F}_p[X]$.  are there some irriducibility criterions? for example I found : see Bruno Joyal's answer following statement:  the cyclotomic polynomial $\Phi_n(X)$ is irreducible over $\mathbf F_p$ precisely when $p$ has multiplicative order $\varphi(n)$ modulo $n$.  could anybody give the reference where it is proved or a sketch of it if it's not too deep?  do there exist another nice theorems treat this question?


I have been experimenting with 2D Simplex noise for a mini-project and while I cannot say I understand the maths behind it, I begin to feel quite confident with how I can manipulate it to get different types of output.  While noise generation/algorithms/manipulation are quite easy to find, I am having trouble finding any good resources on the next step, i.e. placing 2D tiles based on the noise output (for the purpose of making some kind of 2D terrain).  I realize a crude and simple way would be to just loop through my array and place a tile on every coordinate where the noise value is above a certain point, but the output would look very rough, tiles would be overlapping each other, etc.  Does anyone have any good resources or information to share on this subject?  Thanks,


Failed to open a port in my ubuntu machine

Recently I added to iptables a rule which was supposed to allow incoming traffic through port 993. The rule I used is the one shown below:  sudo iptables -A INPUT -p tcp --dport 993 -j ACCEPT   After I entered the rule, I ran "iptables-save > /etc/iptables/rules.v4" and rebooted the server. However when I use the telnet command to check the port I am getting following error.  telnet localhost 993  it tells me the connection is refused by the host (my server). This is not only happening to this port but to other ports I try to open. Am I doing something wrong, running a wrong command, etc? Please help me.


How to easily resize/optimize an image size with iOS?

My application is downloading a set of image files from the network, and saving them to the local iPhone disk. Some of those images are pretty big in size (widths larger than 500 pixels, for instance). Since the iPhone doesn't even have a big enough display to show the image in its original size, I'm planning on resizing the image to something a bit smaller to save on space/performance.  Also, some of those images are JPEGs and they are not saved as the usual 60% quality setting.  How can I resize a picture with the iPhone SDK, and how can I change the quality setting of a JPEG image?


Can I perform reviews from the mobile app?

Went on mobile, I have more free moments here and there – as compared with when I'm at my desk. I could use the time to moderate and perform reviews.  Maybe this could be limited to a subset of reviews, initially, and the quality of feedback compared with desktop users.  This would help  determine suitability of the mobile context as an environment for reviews.