I am learning JavaScript, so today I came across to know that to print or get object properties the for..in loop is used. but i got confuse here because I haven't seen the for..in loop before. so I encountered a query that why we cant use for loop in JavaScript to print the object property? and how does this for..in loop works? here's an example. let object1 = { name : 'someone', name2 : 'someone2', phno : 234568969 };  and to print this everyone suggests for(let key in object1) { console.log(key + "=" + object1[key]); }  and my question is how does this loop works, and why this loop for printing the properties.

Do you think there is a big difference in for...in and for loops? What kind of "for" do you prefer to use and why?  Let's say we have an array of associative arrays:  var myArray = [{'key': 'value'}, {'key': 'value1'}];   So we can iterate:  for (var i = 0; i < myArray.length; i++)   And:  for (var i in myArray)   I don't see a big difference. Are there any performance issues?


Please point out any mistakes and flaws in my arguments. Thanks! Hint: $\forall a\in D\setminus{0}$, $\mu(1) \leq \mu(a)$ (Proof. $\mu(1) \leq \mu(1a) = \mu(a)$) Proof. ($\implies$) Suppose $\mu(1) = \mu(u)$ s.t. $u$ is a non-unit in $D$. $u = 0$ is not possible since $\mu(0)$ is undefined, so $u \neq 0$. Then $\exists q,r \in D$ s.t. $1 = uq + r$. If $r=0$, then $u$ is a unit, a contradiction. If $\mu(r) < \mu(u)$, then $\mu(r)< \mu(1)$, contradicting the hint. Thus $u$ is a unit. ($\impliedby$) Let $u$ be a unit in $D$. From the hint, $\mu(1) \leq \mu(u)$. Also $\mu(u) \leq \mu(uu^{-1}) = \mu(1)$. Thus $\mu(1) = \mu(u)$.

Let's start with a definition:     Definition: Let $F$ be a field, $I$ a nonzero ideal in $F[x]$, and $g(x)$ an element of $F[x]$. Then, $I= \langle g(x)\rangle$ if and only if $g(x)$ is a nonzero polynomial of minimum degree in $I$.   Now it gets completely foggy what is meant with "minimum degree".I constantly come across the "minimal polynomial". This seems to be linked, but it seems strange that there is a division here.   Could someone give a pointer to what the second line actually means. Maybe some example or diagram (if possible) would help a lot here.


My Nokia Lumia 730 (WP8.1) is not getting detected on Ubuntu 15.04.  Can anybody tell me how to fix this?

I have trouble to connect my new Nokia 730 to Ubuntu 14.04.  I tried some solution I found searching WEB (like this one: ) but nothing helped. My File-Manager Thunar (I am using XFCE) shows also that something is mounted, but when I click on each icon, following error appears:  In German:     Der Datenträger »Lumia 730 Dual SIM (RM-1040)« konnte nicht eingehängt werden. Fehler beim Initialisieren der Kamera: -1: Unspecified error.   English (automatically translated from askubuntu):     The disk » Lumia 730 Dual SIM (RM -1040 ) " could not be mounted. Failed to initialize the camera : -1: Unspecified error   The Nokia is plugged in but recognized wrongly, as a camera!  With Android I had no problems and the two icons in Thunar pointed respectively to the phone and to the card. The MTP worked with Android and I don't think is a missing MTP tools. I tried and installed all I needed, but with Windows phone does not work correctly.  Can anyone help me and give me a solution?  My Systemlog shows following informations:   kernel: [  461.933996] usb 3-10: new high-speed USB device number 12 using xhci_hcd  kernel: [  461.965116] usb 3-10: New USB device found, idVendor=0421,  idProduct=06fc  kernel: [  461.965125] usb 3-10: New USB device strings: Mfr=1, Product=2, SerialNumber=3  kernel: [  461.965130] usb 3-10: Product: Lumia 730 Dual SIM (RM-1040)  kernel: [  461.965134] usb 3-10: Manufacturer: Microsoft  kernel: [  461.965138] usb 3-10: SerialNumber: 1100000058BE4FB90000000000000000  colord: Device added: sysfs-Microsoft-Lumia_730_Dual_SIM__RM-1040_  colord: Device added: sysfs-(null)


Suppose $f:\mathbb{D}\to \mathbb{C}$ is holomorphic and the diameter d:= $sup_{z,w\in \mathbb {D}} \vert{f(z)-f(w)}\vert $ of the image of $f$. We know that 2$\vert f'(0) \vert = d $ if and only if $f$ is linear.   If $f(z)=z+\textbf{a}z^2$ for some nonzero $\textbf{a}\in \mathbb{C}$, then $f$ is not linear. We know that $f'(0)=1$. Then, the diameter of $f$ >2 because 2$\vert f'(0) \vert \leq d$ always satisfy. However, if $\vert \textbf{a} \vert$ be very small, I couldn't  find the points $z,w \in \mathbb{\bar{D}}$ satisfying d(the diameter of $f$) > 2.  Any help is appreciated..!  Thank you.

Suppose $f$ is a holomorphic map on the unit disc. Let $d$ be the diameter of the image of $f$. If $ 2|f'(0)|=d $, please show that $f$ is a linear function.   I think maybe I can prove it by using Schwarz lemma, but I failed.


I have a "Console Application" in C# that uses a external dll e.g.    [DllImport("utils\\rapi.dll")]  internal static extern int CeRapiInit(); .. ..   Then,  I need that this dll (radi.dll) is loaded from a resources into console application. How to do this?

Is it possible to embed a pre-existing DLL into a compiled C# executable (so that you only have one file to distribute)? If it is possible, how would one go about doing it?  Normally, I'm cool with just leaving the DLLs outside and having the setup program handle everything, but there have been a couple of people at work who have asked me this and I honestly don't know.


It is a theorem that a commutative ring is a field if and only if it has no nontrivial ideals. Clearly this does not hold in the noncommutative case. I am trying to show for instance that the ring of $n $ x $n$ matrices in a given field has no nontrivial ideals despite it not being a field. Now this is the part I am not completely sure about. My understanding is that the kernel of a ring homomorphsim is an ideal and viceversa, every ideal of a ring is the kernel of some ring homomorphsim. So my approach has been to show that there are no homomorphisms in the ring of matrices that do not have a nontrivial kernel. However I am stuck on this step. Any thoughts?

What are the left and right ideals of matrix ring? How about the two sided ideals?


Is there a function in R which will loop through a layer of zonal polygons (i.e. a polygon grid) and return the area of a second polygon layer that is contained in each grid cell? I have a layer of polygons representing areas of forest (in blue), and a second layer representing ordinance survey grid cells (in pink - each grid cell has a unique "name"). Both layers are polygon shapefiles. I would like to calculate how much forest is present in each grid cell but I cannot find a tool that will do this in R. I'm looking for something equivalent to tabulate area in ArcGIS. As you can see, the forest polygons are complex and in many cases there are several of them per grid cell, which is making it trickier.

I have two polygons. One contains fields(X,Y,Z) and the other contains soil types (A,B,C,D). I want to know what  area of every field contains which type of soil. I tried the following:    library(rgdal) library(rgeos) Field<-readOGR("./","Field") Soil<-readOGR("./","Soil") Results<-gIntersects(Soil,Field,byid=TRUE) rownames(Results)<-Field@data$FieldName colnames(Results)<-Soil@data$SoilType  > Results       A     B     C     D Z  TRUE FALSE FALSE FALSE Y FALSE  TRUE  TRUE FALSE X  TRUE  TRUE  TRUE  TRUE   and achieved good results with it telling me which field contains which soil type. However, how do I get the area instead?


Assignment asks to explain why max of X will have the highest probability..   What is the reason why the probabilities of each random variable create a constant positive slope?   𝑃(max$𝑋_k$≤𝑥)=𝑃(𝑋1 ≤ 𝑥 ∩ 𝑋2 ≤ 𝑥 ∩ ⋯𝑃 𝑋n ≤ 𝑥)  explain why  OR  =𝑃(𝑋1≤𝑥)𝑃(𝑋2≤𝑥)⋯ 𝑃(𝑋 ≤𝑥) explain why   is this because of linearity and independence ?    This is the very first statistics class I've taken. I'm still learning.   I am suppose to find an unbiased estimator for a given pmf for a uniform distribution.   pmf: $𝑓(𝑥) = \frac{1}\theta{} \ \ \ \ (0 < 𝑥 < 𝜃)$

For a random sample $X_1,X_2,\ldots,X_n$ from a $\operatorname{Uniform}[0,\theta]$ distribution, with probability density function $$ f(x;\theta) = \begin{cases} 1/\theta,  & 0 \le x \le \theta \\ 0, & \text{otherwise} \end{cases} $$  Let $X_{\max} = \max(X_1,X_2,\ldots,X_n).$ What is the value of k such that $\hat \theta  = kX_{\max}$ is an unbiased estimator of $\theta$ ?    I'm not sure if there is more to this question, because my intuitive answer answer is just  $k=1$. This is because if you order the sample like $$x_{(1)} \le x_{(2)} \le \cdots \le x_{(n)}$$ such that $x_{(n)} = E[X_{\max}]$.  and the fact that the distribution is uniform, the estimator of $\theta$ should just be $X_{\max}$.  Unbiased estimator -> $E\left[\widehat{\theta\,}\right] = kE[X_{\max}] = \theta$  Is my logic wrong here?


character in my blender is Low quality    but in the render is:   I want render quality = quality in 3D view

I have a problem. I am going to make a minecraft animation in blender. But when I put a minecraft texture on a 3d cube that is 16x16x16 it is very low resolution is there a way to get the texture in a better resolution or is there a way to make blender make the texture better?  I hope you have an answer. Thanks in advance


Consider this simple code fragment :    {    if(fork())  { printf("Parent terminated\n");  }  else  {    char *s = "hello world";   *s = 'H';  printf("child terminated\n");  } wait(NULL);   return 0; }   When I compile it  I dont get a segmentation fault error as we expect while assigning to *s The output is :  Parent Terminated  ( without printing child terminated)  Now if I remove the two lines char *s=......'H' I get the normal output .Can someone please explain this

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


I have temperature and humidity readings from two different sensors (located in the same geographical area). The data is logged every hour and I have data for more than a year, logged this way 2/1/2019 15:00. Now, I want to validate that the sensors are working correctly and that they should produce similar results for a given time period. Like their hourly readings, in general, shouldn't vary a lot. How do I statistically measure their similarity?  I have tried a two-sample Kolmogorov–Smirnov test from scipy. However, I am not sure if this is the right approach as the result gave a very small value of pvalue=4.082677479167249e-05. Their histogram plots look almost identical (normal distribution). And from inspection, it appeared that the sensors are producing similar results.   stats.ks_2samp(df1.temp,df2.temp)

I have two different analytical methods that can measure the concentration of a particular molecule in a matrix (for instance measure the amount of salt in water)  The two methods are different, and each has it's own error.  What ways exist to show the two methods are equivalent (or not).  I'm thinking that plotting the results from a number of samples measured by both methods on a scatter graph is a good first step, but are there any good statistical methods ?


I'm running a number of MongoDB nodes on dedicated servers running Centos6. Each machine has two SSDs which I have in Raid1 with two logical partitions:  # df -h Filesystem      Size  Used Avail Use% Mounted on /dev/md2        424G  233G  170G  58% / tmpfs            16G     0   16G   0% /dev/shm /dev/md1        496M  116M  355M  25% /boot  # cat /proc/mdstat Personalities : [raid1]  md1 : active raid1 sdb2[1] sda2[0]       524224 blocks super 1.0 [2/2] [UU]  md2 : active raid1 sdb3[1] sda3[0]       451545792 blocks super 1.0 [2/2] [UU]  md0 : active raid1 sda1[0] sdb1[1]       16777088 blocks super 1.0 [2/2] [UU]   It is recommended for MongoDB to reduce the read ahead from 256 to ~32 since that give about 16kb which is bigger than the average document.  # sudo blockdev --report RO    RA   SSZ   BSZ   StartSec            Size   Device rw   256   512  4096          0    480103981056   /dev/sdb rw   256   512   512       2048     17179869696   /dev/sdb1 rw   256   512   512   33558528       536871424   /dev/sdb2 rw   256   512   512   34609152    462383047168   /dev/sdb3 rw   256   512  4096          0    480103981056   /dev/sda rw   256   512   512       2048     17179869696   /dev/sda1 rw   256   512   512   33558528       536871424   /dev/sda2 rw   256   512   512   34609152    462383047168   /dev/sda3 rw   256   512  4096          0     17179738112   /dev/md0 rw   256   512  4096          0    462382891008   /dev/md2 rw   256   512  1024          0       536805376   /dev/md1   Since I have this structure, do I need to just run sudo blockdev --setra 32 /dev/md2 ? Since the underlying drives still load 256 will this have any impact, or do I need to manually set the 32 block readahead for all /dev/sdaX and /dev/sdbX also?  Also, is an OS restart required to see the impact of the change in readahead?  Update: I think this is slightly different to the previous questioner, since here the RA for the mdX is much smaller than the underlying block device. I'm thinking that even if /dev/md2 loads only 16kb, the underlying block device will still load 128kb each time.

I've been trying to find a straight answer on this one, and it has proved elusive.  This  and  is close, but does not really give me the specifics I would like.  Let's start with what I think I know.  If you have a standard block device and you run sudo blockdev --report you will get something like this:  RO    RA   SSZ   BSZ   StartSec            Size   Device rw   256   512  4096          0    500107862016   /dev/sda rw   256   512  4096       2048    399999238144   /dev/sda1 rw   256   512  1024  781252606            1024   /dev/sda2   Now, you decide to change that default 256 to 128 using --setra on any of the partitions and it happens to the whole block device, like so:  sudo blockdev --setra 128 /dev/sda1 sudo blockdev --report RO    RA   SSZ   BSZ   StartSec            Size   Device rw   128   512  4096          0    500107862016   /dev/sda rw   128   512  4096       2048    399999238144   /dev/sda1 rw   128   512  1024  781252606            1024   /dev/sda2   This makes perfect sense to me - the block level device is where the setting is, not the partition, so it all changes.  Also the default relationship between the RA setting and the device makes sense to me, it is generally:  RA * sector size (default = 512 bytes)   Hence, the changes I made above, with the default sector size will drop readahead from 128k to 64k.  All well and good so far.  However, what happens when we add in a software RAID, or LVM and device-mapper?  Imagine your report looks like this instead:  RO    RA   SSZ   BSZ   StartSec            Size   Device rw   256   512  4096          0     10737418240   /dev/xvda1 rw   256   512  4096          0    901875499008   /dev/xvdb rw   256   512  4096          0    108447924224   /dev/xvdj rw   256   512  4096          0    108447924224   /dev/xvdi rw   256   512  4096          0    108447924224   /dev/xvdh rw   256   512  4096          0    108447924224   /dev/xvdg rw  4096   512  4096          0    433787502592   /dev/md0 rw  4096   512   512          0    429496729600   /dev/dm-0   In this case we have a device-mapped dm-0 LVM device on top of the md0 created by mdadm, which is in fact a RAID0 stripe across the four devices xvdg-j.  Both the md0 and dm-0 have settings of 4096 for RA, far higher than the block devices.  So, some questions here:   How does the RA setting get passed down the virtual block device chain? Does dm-0 trump all because that is the top level block device you are actually accessing? Would lvchange -r have an impact on the dm-0 device and not show up here?   If it is as simple as, the RA setting from the virtual block device you are using gets passed on, does that mean that a read from dm-0 (or md0) will translate into 4 x 4096 RA reads? (one on each block device).  If so, that would mean that these settings explode the size of the readahead in the scenario above.  Then in terms of figuring out what the readahead setting is actually doing:  What do you use, equivalent to the sector size above to determine the actual readahead value for a virtual device:   The stripe size of the RAID (for md0)?  Some other sector size equivalent?  Is it configurable, and how? Does the FS play a part (I am primarily interested in ext4 and XFS)? Or, if it is just passed on, is it simply the RA setting from the top level device multiplied by the sector size of the real block devices?   Finally, would there be any preferred relationship between stripe size and the RA setting (for example)?  Here I am thinking that if the stripe is the smallest element that is going to be pulled off the RAID device, you would ideally not want there to have to be 2 disk accesses to service that minimum unit of data and would want to make the RA large enough to fulfill the request with a single access.


I have three computers connected to a router at home. I am sure my router has only one address. When the packet arrives from computer 1, the source IP is translated to the router IP address.   Let's say both computers 1 and 2 access the same destination, this time the entry in the NAT will have the same destination address. So, how is the packet forwarded here?   When the packet arrives from destination, how are the packages distinguished between computer 1 and 2? I have a Belkin router, is it generating many source addresses. For example, dynamic NAT, each source IP is converted into a different IP address? How does it generate a pool of addresses.

my question does not concern how it moves through the internet, but how it moves through the router to a certain device. All devices connected to a router in a home network have the same external IP. Say device A is loading a page and packets are sent from an external source to the router because the packets know the external IP of device A and they are able to get to the router. But now, how does it get to device A? How does the router know to send it to device A instead of device B?  I think this involves the NAT, but i'm just looking for a logical explanation of what NAT does to accomplish this.


I want to update a table by merging the categories separated by comma wherever we have a duplicate IDs for instance:  ID            Category 802              A 802              k            803              x              804              y 804              z  So here is the desired results that I would like to see after the update is run: ID            Category 802              A, k 803              x              804              y, z   Thanks

Consider a database table holding names, with three rows:  Peter Paul Mary   Is there an easy way to turn this into a single string of Peter, Paul, Mary?


Prove that $e^x - \ln(x)=2^{2014}$ has exactly two positive real roots.   I know how to do it by graph. I need equation based solution.  I differentiated it twice and got it's strictly increasing on $0$. How to proceed?

How can I show that the equation  $$e^x-\ln(x)-2^{2014}=0$$ has exactly two positive roots?


I want install skype. I'm opening terminal and writing sudo apt-get install skype but terminal says:   E: Malformed entry 53 in list file /etc/apt/sources.list (Component) E: The list of sources could not be read. E: Malformed entry 53 in list file /etc/apt/sources.list (Component) E: The list of sources could not be read.   Why? Help please.

I have unistalled and reinstalled the Ubuntu Software Center as per info I found in a similar thread and I got the same response about line 91 or something like that.  I just tried to upload a screen shot but since I'm new it won't allow me to.  I also can not figure out how to cut and paste anything so I have to hand type what the error screen says, both when I attempt to open the software center and nothing happens, when I try to enter commands into the terminal to uninstall, reinstall, whatever I get the same following:  COULD NOT INTITIALIZE THE PACKAGE INFORMATION An unresolvable problem occured while initializing the package information Please report t:his bug against the 'update-manager' package and include the following error message: 'E: Malformed line 91 in source list/etc/apt/sources.list (dist parse)  E: The list of sources could not be read.,  E: The package list of status file could not be parsed or opened.   How do I report bugs?  What can be done about this.  I have searched and everything everyone says to do leads me back to the same line error message.  So, I don't know how to get to line 91 in the source list; to tell you what it says. Sorry, I'm really new to this. That is what I need is to find out how to get there and fix what it says. I would really like to NOT have to re partition my hard drive and start from scratch, so I'm really looking forward to getting this problem solved. I need to be able to install new software.


I have 2 Excel sheets and 2 monitors that are interconnected. I want Book1 to display in one screen and Book2 to display on another instantly the moment I turn it on. However, when I turn them on, both files open in the same Excel instance, and when I use the "Shift + click new Excel in taskbar and open Book2" trick, both display at the same screen.  Now I have 2 questions.   How to open both books in separate instances the moment I double click their links? How to make the Excel documents to default so that Book1 displays at monitor 1 and Book2 display at monitor 2 when they open? Without the need to drag them.

With office 2010 I would like to open two excel document on different monitor. The only way I achieved to do this was to widden the Excel main window over the both screen which is not very convenient because:   the mouse operation is not so easy. it hides what is between the two excel sheet.   Excel 2007 used to perform this very easily with a multi window system. Is there a tricks for 2010?


I can't tin the iron properly, because feeding solder onto the tip has it flow downwards and collect into a blob before splitting off and creating a mess.  My iron may not be calibrated. And I don't know how to measure its temperature without a device to do so (I only have a multimeter). It is supposed to go from 250 Celsius to 450 Celsius (840 °F), but I can only solder onto the pad quickly at 450 °C. The solder melts at around 300 °C, but it doesn't flow quickly.  The iron I use is the T12 type.

First, I've read though questions  and  and was unable to solve my problem. I have recently (as in less then a month ago) obtained  with  tip.  From the start I had problems wetting the tip. I tried everything but solder just wouldn't flow over the whole tip. I later found information in one of manufacturer's catalogs that I should wrap solder with flux around the tip and then turn on the iron. After few tries, I managed to get a big part of the tip wet (and it was working great), but one small part wouldn't wet.  After some soldering I decided to try to get whole tip wet and obtained  tip refresher. After using it according to the manual, the whole tip was covered in black substance which should be easily removable, but it isn't.  Now about half of the tip is contaminated and about half seems to be working (I managed to clean the working part).  My question is: Is there any other way to clean the tip? Two things from questions I linked I didn't use were dedicated tip cleaning mesh (couldn't find a source of them in my country) and flux outside the wire (because I don't have any at the moment) and how to decide when a tip is dead and needs replacing?  Also, how do the tip refreshers feel (I'm assuming that they are more or less all alike)? I often find them described as paste, while the one I got is solid (but melts when in contact with hot tip).


The Title says it all. Whenever I hit render, nothing comes out. Just a gray checkered screen. I didn't mess with the camera or render settings, and my other files render just fine, so I'm stumped. The blend file is

A scene I made is not rendering, at all. This grey screen stays the same and nothing changes.  Here are my settings:  [


I am looking to find my grandfather's service record in the German navy during the Second World War.  He was also a prisoner of war and I have the paper work for this.

Where can I find information on German soldiers from World War I and World War II?   I am curious to find out about my ancestors' role in the wars, i.e. what rank they had, where they where fighting, with whom and anything else.


How many elements does the set $\{z\in \mathbb C:z^{60}=-1,z^k\not=-1\text{ for } 0<k<60\}$ have ? (A) $24$   (B) $30$   (C) $32$   (D) $45$. Which is correct ?  $z^{60}=-1=\cos(2k\pi+\pi)+i\sin(2k\pi+\pi)$. Then , $z=\cos\left(\frac{2k+1}{60}\pi\right)+i\sin\left(\frac{2k+1}{60}\pi\right)$ , for $k=0,1,\ldots,59$. But I am unable to use the second condition. Please anyone  help me.......

How many elements does  the set $$\{z\in \mathbb{C}\mid z^{60}= -1; z^k \neq -1\text{ for } 0\lt k< 60\}$$ have?  $1.\quad24$  $2.\quad30$  $3.\quad32$  $4.\quad45$  I assumed  that  set  consists  of  elements  of  order  $120$ (as $(-1)^{2}=1$) i.e no  lesser  number  than  120  can  take   them to  $1$ because  if  a  number  lesser  than  60  can  take  them  to  $-1$ then a  lesser  than 120  number  can take  them to  $1$  also. So  the number  of  primitive  $60$th  roots  of $1$ , that  happens  to  be  32. But  the  answer  is  given  30. What  am  I  missing  here?


I got a VPS running Ubuntu 14.04.5 LTS:  # uname -a Linux host.xyz 3.13.0-042stab123.9 #1 SMP Thu Jun 29 13:01:59 MSK 2017 x86_64 x86_64 x86_64 GNU/Linux   The kernel itself seems to support ext4:  # cat /proc/filesystems nodev   cgroup nodev   devpts nodev   mqueue         ext4 nodev   nfs nodev   nfs4 nodev   delayfs nodev   devtmpfs nodev   sysfs nodev   proc nodev   tmpfs nodev   binfmt_misc nodev   fusectl nodev   fuse nodev   rpc_pipefs   But mkfs does not:  # mkfs. mkfs.bfs     mkfs.cramfs  mkfs.minix   I would like to format a partition as ext4 but apparently, the preinstalled image does not include the required executable. Is there any way to install it? If there is not, what is my best option?

Simple enough question: is there some shell command (or GUI method) I can use that, given the path to a file on my system, tells me what package put it there? Assuming the file did in fact come from a package, that is.  Bonus question: what if it's a file that isn't installed on my system? Is there, say, a website that will let me look up a file and see what packages, if any, provide it?


I laid frozen beef ribs out about midnight in the sink, got up around 9 am   and remember I laid them out. will they still be safe to grill???

I generally defrost meat on the kitchen counter. A friend of mine suggested that this was dangerous and suggested that I defrost meat in the refrigerator. I am no biologist but it seems to me that as long as the meat doesn't get warm defrosting it on the counter should be safe.  Generally, I remove the frozen items from the freezer and place them on a plate on the counter in the packaging they were frozen in. When they are mostly / completely thawed I place the meat in the refrigerator.  Am I wrong and should I be defrosting in the refrigerator?


I am new to WordPress contact form 7 plugin and I need to add this to my contact form.. Anybody can help me please?

I tried adding placeholder similar to the given for ContactNumber for my drop down Outlet but it doesn't appear.  Code-
       [tel* ContactNumber /8 class:form-control placeholder "Contact Number *"]

   [select Outlet id:outlet class:form-control "-- Select Outlet--" "Pasir Ris" "Thomson"]
   Tried adding first_as_label "Preferred outlet?" so this displays as ordinary drop down values.  Rest all of the fields do show the placeholder,any other way to give placeholder for drop down?


I want to flash a new Stock Rom on my Galaxy Mega. I'm quite hesitant using Clorkworkmod. Will I lose my Root if I use Odin to upgrade? Also, what happens to Clockworkmod if I use Odin?

I'm going to root my Samsung Galaxy Note and I come across the terms CWM and Odin very often. What exactly are they? It seems that CWM is used for rooting and Odin for flashing the phone. Is there more to it?  I've posted here because I have been unable to to find a good explanation online.


I like to have references to images etc. on my beamer slides printed in the footline area of the frame, i.e. close to the bottom:    In the example I create the footnote 'manually' like this:   \begin{frame}{Testframe}    It is known\textsuperscript{1}    \footlinetext{\textsuperscript{1}en.wikipedia.org} \end{frame}   where the '\footlinetext' command has been created according to   My question is now: Can I redirect the output generated by '\footnote' commands to the footline via '\footlinetext' ? Specifically, I'd like to use Biblatex citation commands such as '\footfullcite' automatically generate the footnotemark and to fill the footline with the reference's information from the bibtex database.   So this code should produce the same output than above:  \begin{frame}{Testframe}    It is known\footfullcite{wiki-en} \end{frame}   assuming that 'wiki-en' is the Bibtex key for en.wikipedia.org

I must place footnotes and footcites at the bottom of the frames, like shown in the picture:   The line above the footnotes must always be there, and it must have a minimum distance to the bottom of lets say 2.5em.  So I see two possible solutions:   Add the footnote via \setbeamertemplate to the footline. Change the format of the footnoteline and let it always appear, even if no footnote was used.   For the last hours, I tried to accomplish point 1, but I had absolutely no success. Can you please help me? Otherwise I have to use *whisper* Powerpoint. ;)    EDIT: Do you know the phenomenon that only after you ask someone, you can get the right ideas? ;)  Here is a MWE of my current solution:  \documentclass[xcolor={dvipsnames}]{beamer}  \usepackage[absolute, overlay]{textpos} \usepackage{environ}   \usetheme{default} \setbeamertemplate{navigation symbols}{}%remove navigation symbols   \newcommand{\makemyrule}{%     \setlength{\unitlength}{14pt}%      minimum distance to bottom     \ifdim\footnoteheight>\unitlength \setlength{\unitlength}{\footnoteheight} \fi%     check which distance is bigger     \begin{textblock*}{\linewidth}(0pt,\dimexpr\textheight-\unitlength)%    place with use of textpos         \textcolor{blue}{\rule{\paperwidth}{.3ex}}     \end{textblock*} }   \let\oldfootnote\footnote%      redefine the footnote command \renewcommand{\footnote}[1]{\Addheight{#1}\oldfootnote{#1}}  \newlength{\footnoteheight} \newsavebox{\mytext} \newcommand{\Addheight}[1]%     measure height of the text         {%                 \savebox{\mytext}{\small\strut\parbox{\textwidth}%                 {\hspace*{2em}\thefootnote#1}\strut}%       approximated by eye, not perfect!                 \addtolength{\footnoteheight}{\ht\mytext}%                 \addtolength{\footnoteheight}{\dp\mytext}%         }     \NewEnviron{myframe}[1]{%     \begin{frame}{#1}%     \setlength{\footnoteheight}{0pt}%     \BODY%     \makemyrule%     \end{frame}%     }    \renewcommand\footnoterule{}  \begin{document} \begin{myframe}{} \frametitle{Beamer example} using\footnote{Y LUSPIN, et al} footnotes\footnote{P. GHOSEZ, et al and a lot more information to create a linebreak} excessively \footnote{You do not need to read this, this is only blindtext to create even more and more text. Blindtext will go on forever, nobody can stop the allmighty blindtext. I think I am a blindtext author.} \end{myframe}{} \begin{myframe} \frametitle{Beamer example} using\footnote{Y LUSPIN, et al} footnotes\footnote{P. GHOSEZ, et al} \end{myframe}{} \begin{myframe} \frametitle{Another example} without footnotes\\ \end{myframe} \end{document}   What this does: At the beginning of each myframe-environment, the length \footnoteheight is reseted to zero. When a \footnote is placed, the height of the text is added to this length. At the end of each frame, via \makemyrule the bottom rule is created, which is above the footnote texts (my solution is not perfect) or, if there are no footnotes, at least 14pt above the bottom.  My wishes (not real problems, but I want it to work better) are   The height of the footnotetext is only approximated. I would like a solution where you can measure the height of the formatted footnote. The frame environment needs to be renamed to myframe. I would like a solution which works without changing the document. But it all failed, because I could not execute \makemyrule before \end{frame} automatically.


I have built the following C example trying to simulate simplistic generic driver code which can be used in small ARM micro-controllers:  #include <stdio.h> #include <string.h>  typedef unsigned char uint8_t; typedef void (*generic_func_t)(uint8_t);  typedef struct {         generic_func_t init;         generic_func_t open;         generic_func_t read;         generic_func_t write;         generic_func_t close;         generic_func_t exit; } driver_t;  void USB_init(uint8_t x) {         /* here body of this f-n */         printf("USB_open 0x%x\n", x); }  void USB_open(uint8_t x) {         /* here body of this f-n */         printf("USB_open 0x%x\n", x); }  void USB_read(uint8_t x) {         /* here body of this f-n */         printf("USB_read 0x%x\n", x); }  void USB_write(uint8_t x) {         /* here body of this f-n */         printf("USB_write 0x%x\n", x); }  void USB_close(uint8_t x) {         /* here body of this f-n */         printf("USB_close 0x%x\n", x); }  void USB_exit(uint8_t x) {         /* here body of this f-n */         printf("USB_close 0x%x\n", x); }  typedef struct driver_t USB_driver;  #if 1         USB_driver.init = &USB_init;         USB_driver.open = &USB_open;         USB_driver.read  = &USB_read;         USB_driver.write = &USB_write;         USB_driver.close = &USB_close;         USB_driver.exit  = &USB_exit; #endif  #if 1 void main(void) {} #endif #if 0 void main(void) {         USB_driver.init(0x01);         USB_driver.open(0x02);         USB_driver.read(0x03);         USB_driver.write(0x04);         USB_driver.close(0x05);         USB_driver.exit(0x06); } #endif   The following error appears:  [user@localhost fn-ptr]$ emacs fn-ptr.c  (emacs:4983): Gtk-WARNING **: Allocating size to Emacs 0xdb4270 without calling gtk_widget_get_preferred_width/height(). How does the code know the size to allocate? [user@localhost fn-ptr]$ gcc fn-ptr.c fn-ptr.c:78:11: error: expected identifier or ‘(’ before ‘.’ token  USB_driver.init = &USB_init;            ^ fn-ptr.c:79:11: error: expected identifier or ‘(’ before ‘.’ token  USB_driver.open = &USB_open;            ^ fn-ptr.c:80:11: error: expected identifier or ‘(’ before ‘.’ token  USB_driver.read  = &USB_read;            ^ fn-ptr.c:81:11: error: expected identifier or ‘(’ before ‘.’ token  USB_driver.write = &USB_write;            ^ fn-ptr.c:82:11: error: expected identifier or ‘(’ before ‘.’ token  USB_driver.close = &USB_close;            ^ fn-ptr.c:83:11: error: expected identifier or ‘(’ before ‘.’ token  USB_driver.exit  = &USB_exit;            ^ [user@localhost fn-ptr]$    The question here is: what should I do to make this code to work, since the following single function pointer example, upon which this code is built, works perfectly:  typedef unsigned char uint8_t; typedef void (*generic_func_t)(uint8_t);  generic_func_t init;  void USB_init(uint8_t x) {         /* here body of this f-n */         printf("USB_open 0x%x\n", x); }  init = &USB_init;

I want to initialize a struct element, split in declaration and initialization. This is what I have:  typedef struct MY_TYPE {   bool flag;   short int value;   double stuff; } MY_TYPE;  void function(void) {   MY_TYPE a;   ...   a = { true, 15, 0.123 } }   Is this the way to declare and initialize a local variable of MY_TYPE in accordance with C programming language standards (C89, C90, C99, C11, etc.)? Or is there anything better or at least working?  Update I ended up having a static initialization element where I set every subelement according to my needs.


What is a word to describe holding two opposites at the same time as truth. To believe  and hold opposing truths or doctrines both as true at the same time, though they are completely in opposition.  Example.  "I believe that  women are  equal to men even though they are inferior to men."

I think some good words would be conflicted, or confused. As an example of context, think of someone who believes in freedom of speech, but, at the same time, they would support banning comedians who make jokes about certain issues that person cares about.


Firstly I have read this question  -- I'm verified on Amazon SES and have DKIM enabled.  I'm sending emails via Amazon SES - on Worpdress (using a plugin MyMail).  I have for the past year been sending weekly newsletters which have been working fine, no problem.   For the past month I have been sending daily automated emails to subscribers (who have double opted in) who have asked for betting tips (horseracing). Each day these tips are generated from my clients database. The email consists of four tips and then links to betting pages on my clients site. There is an unsubscribe button on all emails.  I have noticed in the past few days that Google is sending to spam all emails coming from this domain whether it be a weekly newsletter or these daily betting tips. This wasn't happening before I started sending the daily automated emails. My emails stats haven't changed too drastically though but I presume that's cause most of the receivers aren't using Gmail.  My open rate is about 20% and the click rate about 50%. I realise the terms 'betting' and 'tips' probably flag as spammy but all of my subscribers asked specifically to be on this list.  How I can address this problem? Am I stuck between a rock and hard place owing to the nature of the content - betting and tips  Bearing in mind the subscribers want these daily tips, they signed up for them. I get the feeling these daily emails (not the weekly newsletter) are damaging the website domains reputation.  I'd appreciate any advice on how to approach this situation?

When sending or forwarding emails using a personal or company domain using a  website or email client, how do I prevent the email from being incorrectly marked as spam?


I've seen lots of tutorials on resolving a relative url to an absolute path, but i want to do the opposite: resolve an system absolute filepath into a relative url.  Is there a nice hack-free way to turn a filepath like c:\my_website_root\images\picture_a.jpg into images/picture_a.jpg  I've had a look at Uri.MakeRelative() but i dont think it will be of use in this case.  Edit: I've implemented it like this, still seems hacky (esp line#2)  var urlPath = new Uri(@"c:\mywebfolder\images\picture1.jpg"); var urlRoot = new Uri(Server.MapPath("~")+"/"); string relative = urlRoot.MakeRelativeUri(urlPath).ToString();

If I have managed to locate and verify the existence of a file using Server.MapPath and I now want to send the user directly to that file, what is the fastest way to convert that absolute path back into a relative web path?


I am applying for higher studies in US universities. Every time I fill up the online form, there is a section where they asked which other universities or programs I am applying too? Why do they ask these questions? Do they check where I am applying? What if I wrote a university name but later drop the idea to apply?

What do the admission committees learn about an applicant by knowing which other programs and schools one has applied to? Does applying to another program which is more prestigious make the applicant seem more serious?


I have 4 questions regarding the imaginary and complex numbers. (And some ideas)  My questions are about the way that I’m trying to come up with a proof to the equation i²=-1 (and from there maybe also the equation sqrt(-1)=i or -i) without of course first accepting them to be true axiomatically.  I would like to hear your ideas! The following is not any kind of proof itself, but just some ideas that I am having and I would like to know if they are correct or not and what are your ideas about them.    We start by having 2 axes, one for the real numbers and one (at right angles to it) for the imaginary ones, forming the complex plain. But because we have not defined any complex numbers yet we should better avoid naming it "complex plain" just yet.  xx' axes are the axes of the real numbers  yy' axes are the axes of the imaginary numbers  *(note 1: we should not call "i" or any other imaginary number, "imaginary" yet. At least not before proving them to be so)  *(note2: angles are measured counterclockwise from the x’x axes)  I will first take i and give this new definition where: i=1<90° (or i=(1,90°))  1) i=1<90°  That notation means that i is a number on top of a vector with a length of 1 unit and 90° degrees angle counterclockwise from the x’x axes.  I will also take -1 and make it a vector on my complex plain. -1 of course is a number on a vector with 180° of angle from the x’x axes and a length of 1 unit. Therefore -1 can be written as a vector of (1<180°). This can also be written as -1=(1,180°) but I'll just stick with the complex polar form for the rest of this approach.  *(note3: the symbol < means "angle" by the way)  2) -1=1<180°  Then I will proceed on squaring this new i number.  Squaring i will also square the vector (1<90°) and we all know that squaring this vector in polar form equals to ( 1*1 < 90°+90° ) which equals to (1<180°)  i²=(1<90°)² =>  i²=(1*1 <90°+90°) =>  i²=(1<180°)  Therefore I ended up with this equation i²=(1<180°)  3) i²=(1<180°)  i² therefore is a new number upon our new vector (1<180°) that has a length of 1 and an angle of 180° counterclockwise from the xx' axes  Using (2) We know that -1=1<180°  So squaring the i, will lead us upon the real number -1  So to recap the whole thing we did:  i²=(1<90°)²  => Step 1  i²=(1*1 < 90°+90°) => Step 2  i²=(1<180°) => using (2) Step 3  i²=-1 Step 4  sqr(-1)=±i ??? Step 5  And here are my 4 questions:   1) Is it correct to go from step 1 to step 2 ?  2) Can we therefore prove that i²=-1 from the 3rd step i²=(1<180°) ?  3) Can we then say that from i²=-1 we can get to sqr(-1)=±i step 5 ?  4) And even further, can we then define the imaginary and complex numbers and base their new definitions (and maybe the whole ℂ) in this new equation i=1<90° instead of this i²=-1 or ±i=sqr(-1) equation?    Main goal for me is to get a better understanding on the whole concept of imaginary numbers, and I have to be honest with you, that the way I was introduced in school to the imaginary numbers and being told that people just accepted this idea just because it worked is not the best way, the already open mind of a student, to be introduced in complex analysis and beyond.  Are imaginary numbers created or invented? A 'meaning' can mean a lot of things, but most importantly a 'meaning' in mathematics is a way to logically connect 2 and more things together and see how they cooperate. Algebra and geometry for example.   You name it!  Thanks for your time.

While teaching complex numbers for those who are encounter for the first time (usually 10th grader and 11th grader), I get the question like      "Can even squared number give negative results? How come there be square root of negative numbers? How much length does $i \; \mathrm{cm}$ represent in meter scale?"     in every year and in every section. I have been answering      "Well, this is just a construction such that it gives solution to equation $x^2 + 1 = 0$ which must have two solution by use of Fundamental theorem of algebra but since we do not have that in Real numbers, we are forced to construct $i$ that way." Then I go to history accepting the difficulty of some numbers like $\sqrt 2 $ by ancient  (just a red herring). Then I continue "Natural number is used to represent Money while Real number is used to measure length, complex number, while not representing length or weight, it my represent some other things than money or length that has applications in physics, math and engineering and so it is valid to take construct a symbol $i^2 = -1$."   I don't know if I am speaking too much out of my limited knowledge. What is the best way this knucklehead to explain those knucklehead who have been brainwashed in secondary and lower-secondary school that you cannot take square root of negative numbers, while still being correct and make them accept it easily?  EDIT: I have last question. Are some problems that is impossible to solve without use of Complex Numbers or all problems involving complex numbers have other workarounds?  EDIT-ADDED:: What would mathematics be like without the use of complex numbers? Perhaps, if I mention this clearly, maybe it would be helpful for students. One example is given by @Semiclassical on the comments in the first answer. What other things cannot be absolutely solved without the use of complex numbers?


I'm wondering how to solve this. We have an infinite countable set A ⊂ R is such that λ * (A) =0, . I would appreciate any help. Thanks.

Definition of Lebesgue Outer Measure: Given a set $E$ of $\mathbb R$, we define the Lebesgue Outer Measure of $E$ by, $$m^*(E) = \inf \left\{\sum_{n=1}^{+\infty} \ell(I_n): E \subset \bigcup_{n=1}^{+\infty}I_n \right\}$$ where $\ell(I_n)$ denotes the length of interval (bounded and nonempty interval).  Definition of measurable set: A set $E$ measurable if $$m^*(T) = m^*(T \cap E) + m^*(T \cap E^c)$$ for every subset of $T$ of $\mathbb R$.   If $E \subset \mathbb R$ with $m^*(E) = 0$ and $\exists$ finite interval $I,$ such that $E \subset I, $, then is $E$ measurable?  If $E \subset \mathbb R$ with $m^*(E) = 0$, then is $E$ measurable?


I've got Ubuntu 10.10 installed to use my whole hard-disk, but would like to use the 130GB of free space I've got to create a new partition and do some development on Unity and Natty.  Can I use gparted to do this?  If so how?

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


With services like Google Finance or Yahoo Finance it is very convenient to find the historical stock price metric of a listed company, but if the company is not listed, I can't find the data.  For example, I want to see the price metrics for Lawson Software, which had been listed  on NASDAQ (LWSN). How could I find its historical price metrics?

With services like Google Finance or Yahoo Finance it is very convenient to find the historical stock price metric of a listed company, but if the company is not listed, I can't find the data.  For example, I want to see the price metrics for Macromedia, which had been listed in 1993 on NASDAQ (MACR), then acquired by Adobe in 2005. How could I find its historical price metrics?


Let $f:\Bbb R\to \Bbb R$ be additive i.e. satisfies $f(x+y)=f(x)+f(y)$ for all $x$, $y$. and Lebesgue measurable.     Show that $f$ is continuous and hence of the form $f(x)=cx$.   In order to show that $f$ is continuous at  a   point $a$ we have to show that $|f(x)-f(a)|<\epsilon $ whenever $|x-a|<\delta$.  But I can't find any way to proceed here. Please give some hints.

Let $f:\mathbb R \rightarrow \mathbb R$, and for every $x,y\in \mathbb R$ we have $f(x+y)=f(x)+f(y)$.  Show that $f$ measurable $\Leftrightarrow f$ continuous.


Ubuntu won't install. Have a new computer with Win 10. Have formatted the drive to add a partition for Ubuntu 18.04. Used Rufus to get Ubuntu onto a USB Stick. With USB Stick in place, I reboot and get the message: "Couldn't get size: 0x8000...". Anybody have a fix for this?

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


OK, this is the problem that I'm trying to solve - I want to assign object properities returned through linq from db, to this object prperties and get possibility to update any changes, without inserting new row in db.  partial class Employee : Person {     public Employee(int id = 0)     {         if (id > 0)             this.get(id);     }      public override bool get(int id)     {         Employee empl = db.Employees.Single(Employee => Employee.id == id);         if (empl != null)         {             // here I need to do sth like             this = empl;             // or             ObjectProperties.Copy(empl, this);             return true;         }         else             return false;     }      public override void save()     {         if (this.id > 0)         {             db.SubmitChanges();         }         else         {             db.Employees.InsertOnSubmit(this);             db.SubmitChanges();         }     }      public override void remove()     {         if (this.id > 0)         {             db.Employees.DeleteOnSubmit(this);             db.SubmitChanges();         }     } }   And I don't want to make get method static.

Does anybody have useful example of this assignment inside a C# method? I have been asked for it once during job interview, and I am still interested in answer myself.


I notice the Serbia's flag has been added to  but doesn't work on the game yet.  I would like to ask Agar.io to add Serbia's flag. Does anybody knows how I can do that? Thanks!

I have noticed recently that people have their own skins. Not like the ones where you type in a specific nickname and it gives you a skin but where the people make their own. How do you do it?


Good day, I want to show in my plot angle between coordinate line and plot like this:    Сan anybody help me with it?

I would like to draw an arc between to lines in a pgfplots picture using axis cs. My first attempt is as follows:      \documentclass[12pt,a4paper]{article}     \usepackage{pgfplots}      \pgfplotsset{compat=newest}      \begin{document}      \begin{center}     \begin{tikzpicture}         \begin{axis}[xmin=-8,xmax=8,xtick={-8,-6,...,8},             ymin=-8,ymax=8,ytick={-8,-6,...,8},grid=major             ,view={0}{90},x post scale={2},y post scale=2             ]         \addplot[black,thin,domain=0:8]{0};         \addplot[black,thin,domain=0:8]{2.3962931*x};         \draw [->] (axis cs:2,0) arc [radius=17mm,start angle=0,end angle=64.3];     \end{axis}     \end{tikzpicture}     \end{center}      \end{document}   However, the value of the radius and angle needed to be determined via trial and error. Hence, if I change the scaling (as used with x post scale and y post scale) then the arc does not display correctly.  Clearly, I have missed something and there should be a straight forward way to achieve my aims. I can change the arc to a circle (set radius=2 (with no units)) and I get what I expect and it scales.  Any insights would be much appreciated.  Peter Johnston.


Try the following steps:   Open this question in two different tabs. Favorite it in the first tab. Look at the icon in the second tab. It appears not to be favorited. Click the favorite icon in the second tab, causing the question to appear to be favorited.   The question now appears to be favorited in both tabs, but in fact is not. Your second click on the button unfavorited it.  Alternatively, another way to fall into the same trap:   Favorite this question. Follow any link on the page. Click the 'back' button in your browser. Look at the favorite icon. The question appears not to be favorited. Click the favorite icon again.   The question now appears to be favorited once more. However, it isn't. Again, your second click unfavorited it.  When hastily researching some issue, I frequently follow links and then click 'back', or follow loads of links and end up with multiple instances of the same question open in different tabs. As such, I've fallen into both of these traps a few times in reality.  The better behavior would be if clicking an unhighlighted favorites icon always caused the question to become favorited, regardless of whether it currently is or not, and clicking a highlighted one always caused it to become unfavorited. The icon's state becoming out of date doesn't bother me, but the fact that I can accidentally end up unfavoriting something I want favorited bothers me a little.  Any chance of a fix?

There is a very small bug when it comes to toggling favorites.  Steps to reproduce:   Open the same question in two tabs In one tab, mark the question as a favorite In the second tab, mark the question as a favorite   Result: Question is now "un-favorited", even though both tabs show that I have marked the question as a favorite. The reason is that the front-end display is not syncing with the back-end, despite the fact that each click will toggle your selection in the back-end.  Now you may think: That's stupid. Why would I open the same question in two tabs?  Here's how I noticed it. This happens in Chrome, other browsers are untested.   Open a question and mark it as favorite Go to the location bar and enter a new URL (e.g. Google) Hit the back button The cached version of the page now shows that the question is not favorited, even though it is in the back-end Select the question as favorite (again). This will make it appear as if the question is now favorited, when in fact you have now "un-favorited" the question in the back-end. Refresh to confirm.   I realize this is a small bug, but it is a bug nonetheless.


I have many JPEG files in folder D:\folder. I want to delete all metadata from all JPEG files in this folder. I used ImageMagick. I made: magick mogrify -strip "D:\folder\*" Am I right?

Whenever I share my photographs, I also share lots of information that I do not want to pass on:   specific camera model that the photo was taken with exposure time focal ratio ...   How can I remove all those metadata for sharing?  I'm particularly looking for solutions for Max OS X.


I made a command for a user user1 so when i write in terminal cool-retro-term it runs the application   If I switch user to user2 and I try to run cool-retro-term or sudo cool-retro-term it says the command not found  I want to know how to make the command usable for all users.  Until now I installed and compiled the application like they said. then i made a bash script in /home/user1/bin where i added  #!/bin/bash /home/user1/cool-retro-term/cool-retro-term   to run my application   I modified .bashrc PATH=$PATH:/home/crs/bin and then I ran chmod u+x /home/crs/bin/cool-retro-term  I EDITED my question    i want to make my command something like ls or cd or other command usable for all users. something like that . ANY IDEAS?

I'd like to know if there is a way to run  program/shell script without typing full path:  /opt/idea/bin/idea.sh


Consider the number 1.1010010001... defined as 1.1 followed by linearly increasing numbers of zeroes separated by ones. This number must almost certainly be irrational, but is it also transcendental?  $$\sum_{i=1}^\infty 10^{-(i^2 -i)/2}$$  The number is superficially similar to Liouville's constant, but instead of containing a factorial in the sum there is a combination which is equivalent to (n-1)n/2, somewhat simpler algebraically.  It also appears to be related to the Jacobi-theta function.  If this constant is indeed irrational and transcendental what would be the best way to go about proving this?

Does anyone know if this number is algebraic or transcendental, and why?  $$\sum\limits_{n = 1}^\infty  {10}^{ - n(n + 1)/2}  = 0.1010010001000010000010000001 \ldots $$


Let $K$ be a field, which is a finitely generated $\mathbb{Z}$-algebra. Show that $K$ has characteristic $> 0$. I have this hint but I am not quit sure that I understand it; if $\operatorname{char}(K) = 0$, then $\mathbb{Z} \subset K$, then $\Bbb Q \subset K$, and $K$ is a finitely generated $\Bbb Q$-algebra. Use Zariski's Lemma to show that $K$ is a finitely generated $\Bbb Q$-module, and then Artin-Tate Lemma to get a contradiction

Suppose $k$ is a field that is finitely generated as a ${\mathbb Z}$-algebra.  (That is, $k$ is a quotient of ${\mathbb Z}[X_1,\dots,X_n]$ for some $n$). Does it follow that $k$ is finite?


I am stuck at 34 votes on MathOverflow. Some previous answers like  say that this is because the 40 votes should be 30 for answers, 10 for questions. But, it seems different in my case as I get the error popup whether I'm voting on answers or on questions. So I can't get closer to 40 votes by just voting on questions.      Both screenshots are from within a window of 1 or 2 minutes.

So now . But the way this is implemented is… bizarre. After casting 30 votes, we may cast 10 more votes on questions, regardless of what we voted on before.  I generally vote on a question and any answer it already has (if they deserve votes, of course) when I first view a page, and vote on new answers if I visit the page again later. So I tend to vote on questions a little before answers. After 30 votes, I can no longer maintain my voting habits, and the extra votes don't do me any good. (I frequently reach the cap on , where I'm very active.)  Please don't make a difference between voting on 10 questions first and then 30 other posts, and voting on 30 posts first and then 10 questions. (Yes, this means the figures may need to be adjusted.)  Or, maybe I'm voting on questions too much? I don't think I can see my voting statistics, but I have the Electorate badge on  with 1961 votes, which is probably about 30–35% on questions.


given $a_{n+1}= \frac{1}{2}(a_n+\frac{5}{a_n})$ , $a_1=1$    How can i prove that $a_n \geq a_{n+1}$ for $n > 1$?    I tried by induction, but i don't know how to do the stage of the "prove" in the induction.

Suppose that $S_0$ and A are positive numbers, let $$S_{n+1} = \frac{1}{2}\left(S_n +\frac{A}{S_n}\right)$$ with $n \geq 0 $.      (a)Show that $S_{n+1} \geq \sqrt{A} $ if $n \geq 0$       (b)Show that $S_{n+1} \leq S_n $ , if $n \geq 1$      (c) Show that $s= \lim\limits_{n \rightarrow \infty} S_n$ exists      (d) find s   (a) Show that $S_{n+1} \geq \sqrt{A} $ if $n \geq 0$  Given $$P_n:  S_{n+1} = \frac{1}{2}\left(S_n +\frac{A}{S_n}\right) \geq \sqrt{A}$$  $$P_0: S_{1} = \frac{1}{2}\left(S_0 +\frac{A}{S_0}\right) \geq \sqrt{A}  $$  We assume that $P_n$ is true  $$P_{n+1}: S_{n+2}= \frac{1}{2}\left(S_{n+1} +\frac{A}{S_{n+1}}\right)$$ by assumption $$S_{n+2}= \frac{1}{2}\left(S_{n+1}\left(1 +\frac{A}{(S_{n+1})^2}\right)\right) \geq \frac{1}{2}\left(\sqrt{A}\left(1 +\frac{A}{(\sqrt{A})^2}\right)\right)$$ $$ S_{n+2}= \frac{1}{2}\left(S_{n+1} +\frac{A}{S_{n+1}}\right) \geq \sqrt{A}  $$  It follows that $S_{n+1} \geq \sqrt{A} $    (b) Show that $S_{n+1} \leq S_n $ , if $n \geq 1$  $$S_{n+1} \leq S_n$$ $$\frac{1}{2}\left(S_n +\frac{A}{S_n}\right) \leq S_n $$ Dividing by $S_n$ $$\frac{1}{2}\left(1 +\frac{A}{S_n^2}\right) \leq 1 $$ $$\frac{A}{2S_n^2} \leq \frac{1}{2}$$ $$A \leq S_n^2$$ $$S_n \geq \sqrt{A}$$ As  $S_{n+1} \leq S_n$ yields a true statement, it follows $S_{n+1} \leq S_n$ is true.    (c) Show that $s= \lim\limits_{n \rightarrow \infty} S_n$ exists  Since $S_{n+1} \leq S_n$, the sequence is non-increasing,   using the non-increasing theorem stating that      if $\{S_n\}$ is non-increasing then $$\lim\limits_{n \rightarrow > \infty} S_n = \inf\{S_n\} $$     (d) find s    Is the argumentation in (a) and (b) appropriate? Also, I have to admit I m getting less confident in my argumentation (c) and (d). How to proceed in (c) and (d)?  Much appreciated for your input or help.


What happened to the close vote option for posts that describe an error or unexpected result but don't include the relevant code or any code!? This is on of the two most popular I use.. What am I supposed to do about questions like  now!?  I just also noticed "must show minimal understanding" is missing as well. After reading over the new option again, I am supposing that the intention is to use "not likely to be helpful for future viewers" for both of these?

Note: the eventual outcome of this discussion involved dropping this particular off-topic reason, along with other changes. See:    —Shog     I was using the reason "demonstrate a minimal understanding" myself quite frequently, but the more I review, the more I have doubts about it and I think this reason can either be dropped entirely or at least rephrased, so I started to use "problems with code you've written must describe the specific problem" instead:     Questions asking for code must demonstrate a minimal understanding of the problem being solved.   So the poster has posted some description, maybe even a snippet of code and in his mind that already proves that he has that minimal understanding required. After all he described the problem and what he tried to solve. So telling him that he lacks that understanding is rather rude, and from the posters point of view doesn't even apply. What both version of the reason not emphasize is that a description of a problem is not various versions of     it doesn't work   but that we rather mean really specific details (see below). I can often see in the reopen review queue that the "improved" version just includes a more verbatim description, while what usually would be expected is some specific error message, a trace or a log, or whatever applies.  Then it continues with:     Include attempted solutions, why they didn't work, and the expected results. See also: Stack Overflow question checklist   comparing it to:     problems with code you've written must describe the specific problem — and include valid code to reproduce it — in the question itself. See SSCCE.org for guidance.   Which says essentially the same, only in more detail.   So the "minimum understanding" reason is IMO a more rude version of the reason telling the user that an SSCCE is missing.  The intent of giving this reason is to tell the user that he needs to give exact details to be able to help him, so IMO a checklist would be much better. Something like:     Your question was closed because it may not provide enough details. Things you can do to improve your question to get an answer include:         Format the code in a way that makes it readable and easily understandable.   Provide the smallest working sample of code demonstrating the problem (link to SSCCE)   Include your input and output.   If applicable provide logs (i.e. Android debugging log, stack trace, etc.).   If applicable provide the exact error messages (compiler, etc.).      And something like this should be best included already in the banner that appears when a question is closed instead of being hidden in some pages you often enough have to actively looking for.  It might be helpful to adjust this, based on the tags or close reason, as I realize that I'm more focused on the programming area, and the above list may not apply to other areas of SO.  Update  Another thing I forgot to mention (but wanted to) is this:     Questions asking for code   Is IMO essentially an invitation of the type of questions     I have a problem, can you provide the solution? (with an optional please)   while     Questions concerning problems with code you've written   puts at least some emphasis on the fact that the poster has to put some effort himself in trying to solve the problem by providing the code which he used to attempt the solution.


I am trying to loop out a list of names and console.logging the values that match. Am I going wrong using (if value in array)?      for (var i = 0; i < this.state.apiResponse.length ; i++) {        var selectedChars = this.state.chosenChars       var returnedChars = this.state.apiResponse[i].name        console.log(selectedChars)       console.log(returnedChars)         // I think i'm making a mistake with this if statement       if (returnedChars in selectedChars) {         console.log(this.state.apiResponse[i].name);                   }   The selectedChars array and returned values:  ["Luke Skywalker", "Han Solo"]  Luke Skywalker Han Solo Chewbacca

What is the most concise and efficient way to find out if a JavaScript array contains a value? This is the only way I know to do it: function contains(a, obj) {     for (var i = 0; i < a.length; i++) {         if (a[i] === obj) {             return true;         }     }     return false; }  Is there a better and more concise way to accomplish this?


I used which to tell the location of a runnable file. For example, which pwd returns /bin/pwd. However, I found which alias or which compgen etc returns nothing.   What are commands like alias? Aren't they executable files on my Linux? I am using bash 4.3 on Ubuntu.

I tried which cd and it didn't give a path but instead returned the exit code 1 (checked with echo $?). The coreutil cd itself is working, so the executable should be there, right? I also ran a find for cd, but there was no executable file shown. How is it implemented then?  Update:  I don't know if I should ask this in another post but since I think it is good here, I'm expanding (?) the post... So the answer was actually quite simple, there's no executable for that — because it's a builtin — But I've found some builtins (bash shell in Fedora) have the executable files! So builtin -> no executable isn't right I suppose? Maybe an answer explaining what builtins actually are (builtin commands?), which actually is the matter here, rather than focusing more on cd... Some good links posted previously indicate that builtins are not programs... so what are they? How do they work? Are they just functions or threads of the shell?


sorry for bad english. I'm using Ubuntu 14.04 64 bit and I have a strange internet connection problem. When I'm at work I can access internet via DHCP wireless and wired without problems. When I'm at home with wireless connection or when I use tethering hotspot with my mobile phone I cant connect internet using DHCP. The only way to connect internet is to set manually the DNS (8.8.8.8) in Network Manager. Why? With Ubuntu 12.04 I've never set DNS on DHCP and it worked fine... Thank you.

I recently upgraded from 11.10 to 12.04, and now NetworkManager isn't populating /etc/resolv.conf when connecting to wireless networks, when it had been working perfectly in 11.10. I'm not seeing any explicit errors in either the NetworkManager, UI or in syslog. How do I diagnose what's wrong?  Edit: If I try to run resolvconf, I get the error      resolvconf: Error: /etc/resolv.conf isn't a symlink, not doing anything.   What should it be, a symlink to and/or how do I get NetworkManager to populate it?  says the symlink should point to /run/resolvconf/resolv.conf, but that file does not exist on my system.


I get date in a format like LocalDate dateOfBirthday = LocalDate.of(2000, 1, 1);. I need to get the day of the month from that date. I using dateOfBirthday.getDayOfMonth() and it works and return 1, but I need to get 01. How I can do it?

Is there a better way of getting this result? This function fails if num has more digits than digits, and I feel like it should be in the library somewhere (like Integer.toString(x,"%3d") or something)  static String intToString(int num, int digits) {     StringBuffer s = new StringBuffer(digits);     int zeroes = digits - (int) (Math.log(num) / Math.log(10)) - 1;      for (int i = 0; i < zeroes; i++) {         s.append(0);     }     return s.append(num).toString(); }


I have an issue with evee (both in 2.8 and 2.9) - on my setup background and HDRI illumination isn't blocked off by other surfaces and materials. So, even in a completely closed room, all surfaces seem equally lit. I did some research, but couln't find a solution to that exact issue. Would be glad if anyone had an idea...? Thanks in advance! Ro.

Blender 2.8 supports the same world node setup that Cycles does. This correctly puts the HDR image in the world background.  But EEVEE doesn't light the scene properly. Everything looks flat and washed out. Is there a way to properly light an EEVEE scene with an HDR?


I am looking for a novel that I read when I was a teenager (late 90s to early 00s). I don't think I ever finished it so I would like a chance to do so but I can't remember the name! Hopefully the following description is not too vague.  The main character was a human who trained as some sort of travelling storyteller. At the start of the story the country/kingdom that the character lives in is coming under attack from another country/kingdom overseas. A big part of he story was the tension between humans and a human-animal servant class that were usually described by which animal they most closely represent (equine, bovine etc). I'm pretty sure there were also dragons in the world, although they may have been absent for quite a while.

This was a thick book that I read over fifteen years ago that I never finished reading because someone borrowed it and didn't return it to the school library. I want to find its title.  The story takes place in a kingdom that is preparing for the a cycle of war, where every time the winds changes (50 or 100 years), invaders will try to cross the sea from another continent using airships with air balloons, filled with soldiers and warlocks. The kingdom has made several man-made island fortress along their coastline, filled with soldiers with war machines, sorcerers, and enchanters who act as the main guard/defence for the kingdom, calling lightning and fireballs, and using machines to stop and destroy and bring down as many of the invader airships as possible while countering the warlocks on board.  The book involved a man and a girl whose journey brought them apart in preparing for the imminent war.   The women found herself adept in magic and went to the academy in the capital to learn to be a sorceress.   The man found a different calling. With a good memory, he was sent to learn to become a mnemonic storyteller (to train with battle staff and fighting skill and mnēmonikos skill) who carried the history, literature of the entire culture in their heads. They used their knowledge to convey the kingdom's literature, poetry, history and stories to the people from generation to generation.  Both eventually "graduate". Sadly, and with great emotion, both have to part ways. She was sent to a fortress island and began her role as a sorcerer who will stand guard there. He, as a storyteller, began his own journey without her, going from town to town, village and soldier barrack, across the kingdom, telling stories of great men and their deeds, and courageous heroes who fought the war, to uplift the spirit of the people and bring valor to the soldiers stationed at the border and people in the coming war.   In brief, he meets a dragon (who used to be involved in the war in ages past), long thought to be extinct. He finds himself able to communicate with it and has a "born" friendship with it. The dragon teaches him to become a "dragon rider", a long-lost ability of his people (due to the "extinction" of dragons.)   The wind changes with the dread of war hanging on the kingdom.  Airships start to blacken the sky again with soldiers and war machines battling each other.


I have this whining question on my head, which stuck me for days.  Correct me if I'm wrong: My aspect on computer architecture and organisation is that,   In early day computers, there was a single processor on a single chip. And with evaluation there were multi-chip processors, with each chip having a single processor.  Then in modern days there are multiprocessors. With each processor chip called a socket, this socket contained multiple processors. They are called cores.   Core: An individual processing unit on a processor chip. A core may be equivalent in functionality to a CPU on a single - CPU system.     Now I will briefly lay my understanding on Hyper Threading Technology.    For each physical core that is actually present in the socket, the operating system addresses two virtual (logical) cores and shares the workload whenever possible. These cores have multiple levels of large memory caches . And the logical processors sharing the execution units of each of core.   Now my question is what is a thread?   As a programmer when I create two threads and I run my program, how does the threads divide in to cores.  I want to know that on which logical processors that these threads run on.   I gave myself an answer for that,     These threads must be run on two separate logical processors that belongs to two physical cores, because if we divide these threads to the two logical processors of one physical core, concurrency is not achieved. As one logical processor is run at a given time in one physical core.   If my answer for my problem is wrong please help me out. I really appreciate it.

I understand that a multi-core processor can run multiple threads of the same process at the same time using its different cores. Can it also run multiple processes at the same time(each core running a different process)?


A tennis match is played as a series of POINTS, contained within GAMES, which in turn are contained within SETS.  If a player reaches 4 or more points won in a game, and also has won 2 points more than their opponent, then they win that game.  If a player reaches 6 or more games won in a set, and also has won 2 games more than their opponent, then they win that set. If both players reach 6 games, then a TIE-BREAK is played to determine the winner of the set.  Suppose Djokovic plays a set of tennis against Murray under these rules, and his probablity of winning a point is 0.48. Assuming the probability of winning a point remains constant throughout, what would be the probability of Djokovic winning the set 7-5?  I do understand the questions but my problem is at a fundamental level of posing the problem so some guideance would be appreciated and yes, I am a total noob

I have a bet with a co-worker that out of 50 ping pong games (first to win 21 points, win by 2), I will win all 50. So far we've played 15 games and on average I win 58% of the points, plus I've won all the games so far. So we're wondering if I have a 58% chance of winning a point and he has a 42% chance of winning a point, what's the percent chance that I would win the game? Is there a formula that we can plug in difference % chances?  We've googled all over and even asked the data scientists at our company but couldn't find a straight answer.  Edit: Wow, I am blown away by the thoroughness of responses. Thank you all so much!!! In case people are curious, I have an update to how my bet is going: I've now won 18 out of 50 games, so I need to win 32 more games. I've won 58.7% of all points and my opponent has therefore won 41.3% of points. The standard deviation for my opponent is 3.52, his average score is 14.83, and his median score is 15.50. Below is a screenshot of the score of each game so far. I can keep updating as the bet goes on, if people are interested.  Edit #2: Unfortunately we've only been able to play a few more games, below are the results. I'm just going to keep replacing the picture so I don't have a bunch of screenshots of the score.  Final Update: I finally lost to my co-worker on game #28. He beat me 21-13. Thanks for all of your help!


How do I make RewriteCond+RewriteRule change site1.com/folder1 to site2.com/folder1, only if file in this directory don't exist. For example: site1.com/wp-content/uploads/2014/03/image.jpg  If image site1.com/wp-content/uploads/2014/03/image.jpg  don't exists, than get site2.com/wp-content/uploads/2014/03/image.jpg But if image exists, don't do anything.  Update, here code what i need, thanks all for help )  Options +FollowSymLinks RewriteEngine ON RewriteCond %{REQUEST_URI} "/uploads/" RewriteCond %{REQUEST_FILENAME} .*\.(jpeg|jpg|gif|png)$ RewriteCond %{REQUEST_FILENAME} !-f RewriteRule (.+) http://site2.com/$1 [L,R=301]

This is a  about Apache's mod_rewrite.   Changing a request URL or redirecting users to a different URL than the one they originally requested is done using mod_rewrite. This includes such things as:   Changing HTTP to HTTPS (or the other way around) Changing a request to a page which no longer exist to a new replacement. Modifying a URL format (such as ?id=3433 to /id/3433 ) Presenting a different page based on the browser, based on the referrer, based on anything possible under the moon and sun. Anything you want to mess around with URL   Everything You Ever Wanted to Know about Mod_Rewrite Rules but Were Afraid to Ask!  How can I become an expert at writing mod_rewrite rules?   What is the fundamental format and structure of mod_rewrite rules? What form/flavor of regular expressions do I need to have a solid grasp of? What are the most common mistakes/pitfalls when writing rewrite rules? What is a good method for testing and verifying mod_rewrite rules? Are there SEO or performance implications of mod_rewrite rules I should be aware of? Are there common situations where mod_rewrite might seem like the right tool for the job but isn't? What are some common examples?   A place to test your rules  The  web site is a great place to play around with your rules and test them. It even shows the debug output so you can see what matched and what did not.


My problem is that i can't find synaptic when I click on more programs how to set the .deb files to run with synaptic?

I want to install a .deb file. After going through various questions, I came across these three options: dpkg, GDebi and Ubuntu Software Center. However, I want to install the. Deb file via Synaptic Package Manager only. Is there any method by which I can install. Deb file as well as all it's dependencies via Synaptic Package Manager?


Can anyone tell me the difference between int main() and int main(void)? Why do both of them work and what is the default argument to int main()?

What is the correct (most efficient) way to define the main() function in C and C++ — int main() or void main() — and why? And how about the arguments? If int main() then return 1 or return 0?  There are numerous duplicates of this question, including:       — For C++, with a very good answer indeed.     Related:


I have the following two list of lists and I want to substract every item from a from the corresponding item in b:  a = [[8.5], [9.3], [8.2]] b = [[7.4], [2.3], [3.4]]   So the output should be   c = [[1.1], [7], [4.8]]   It seems to be very simple, but I am struggling with it. Does somebody have a solution?

Right now I have vector3 values represented as lists. is there a way to subtract 2 of these like vector3 values, like  [2,2,2] - [1,1,1] = [1,1,1]   Should I use tuples?  If none of them defines these operands on these types, can I define it instead?  If not, should I create a new vector3 class?


It is known that user votes are removed when account is deleted. Is accept of the answer included in this?   To be more clear, OP has accepted an answer. Later when their account is deleted, will the tick also disappear along with the votes cast by them?

In my opinion the accepted answer should permanently stick as only the original question submitter has the ability to accept.


find the lim $$\lim_{x\to 0}\; \sum_{n=1}^{\infty}\frac{\sin(nx)}{n^2}$$    Is it correct to do this: $$\lim_{x\to 0} x\frac{\sin x}{x}+x\frac{\sin2x}{4x}+x\frac{\sin3x}{9x} + \cdots$$ this becomes $$\lim_{x\to 0} x+\frac{x}{2}+\frac{x}{3}+\cdots $$  or $$\lim_{x\to 0} x\left(1+\frac{1}{2}+\frac{1}{3} + \cdots \right) $$  now what does this result to?  if this way is wrong, then can we first find sum of $\displaystyle\sum_{n=1}^{\infty}\frac{\sin(nx)}{n^2}$  , how to proceed to find this sum?

I must show that $\sum\limits_{n\geq1} \frac{\sin(nx)}{n^2}$ converges $\forall x \in {R}$. Then  if $f(x)=\sum\limits_{n=1}^\infty f_n(x)$, I must prove that  $f(x)$ is continuous for $x\in [0, \pi]$  and  $\int\limits_0^\pi f(x)=2\sum\limits_{n=1}^\infty \frac{1}{(2n-1)^3}$.  I used Weistrass M-test: $\sum\limits_{n\geq1} \frac{\sin(nx)}{n^2}$ converges uniformly because $|\frac{\sin(nx)}{n^2}|\le \frac{1}{n^2}, \forall x\in R$ and $\sum \frac {1}{n^2}$ converges.  I found somewhere that $f(x)=\lim\limits_{n\to\infty}f_n(x)$. Where does it come from? I don't understand. How $f(x)$ looks like? Without $f(x)$ I don't know how to prove the last equality from exercise:(    Later edit: If $ \sum\limits_{n\geq1}f_n\to f$ uniformly , then $f_n\to f$ (punctual converges to $f $- I hope this is correct translation) which means $f_n(x)\to f(x)$ when $n\to \infty ?$   I hope someone could help me again...


Let $a(n)$ is a , find the sum $$ \sum\limits_{n=1}^{\infty}\frac{a(n)}{n(n+1)}. $$

How does one [easily] calculate $\sum\limits_{n=1}^\infty\frac{\mathrm{pop}(n)}{n(n+1)}$, where $\mathrm{pop}(n)$ counts the number of bits '1' in the binary representation of $n$? Is there any trick to calculate the sum? From what I already have, it definitely converges.


I am trying to understand the most significant jewel in mathematics - the Euler's formula. But first I try to re-catch my understanding of exponent function.  At the very beginning, exponent is used as a shorthand notion of multiplying several identical number together. For example, $5*5*5$ is noted as $5^3$. In this context, the exponent can only be $N$.  Then the exponent extends naturally to $0$, negative number, and fractions. These are easy to understand with just a little bit of reasoning. Thus the exponent extends to $Q$  Then it came to irrational number. I don't quite understand what an irrational exponent means? For example, how do we calculate the $5^{\sqrt{2}}$? Do we first get an approximate value of $\sqrt{2}$, say $1.414$. Then convert it to $\frac{1414}{1000}$. And then multiply 5 for 1414 times and then get the $1000^{th}$ root of the result?   ADD 1  Thanks to the replies so far.   In  recommended by several comments, a function definition is mentioned as below:  $$ ln(x) = \int_1^x \frac{1}{t}\,\mathrm{d}t $$  And its inverse function is intentionally written like this:  $$ exp(x) $$  And it implies this is the logarithms function because it abides by the laws of logarithms.   I guess by the laws of logarithms that thread means something like this:  $$ f(x_1*x_2)=f(x_1)+f(x_2) $$  But that doesn't necessarily mean the function $f$ is the logarithms function. I can think of several function definitions satisfying the above law.  So what if we don't explicitly name the function as $ln(x)$ but write it like this:  $$ g(x) = \int_1^x \frac{1}{t}\,\mathrm{d}t $$  And its reverse as this:  $$ g^{-1}(x) $$  How can we tell they are still the logarithm/exponent function as we know them?

Say you have a number $x^{\sqrt 2}$.  Is there any way to represent this number so that there's no root (or irrational) as the exponent (so that it's easier to understand for me)? I just can't wrap my head around this.  I was thinking something like $$x^{2^{1/2}}$$ and extending on that idea, but I don't know how.  Also, what about for $x^{\sqrt 3}$? Or $x^{\sqrt n}$?


The Dualboot is not working, so I want to get rid of Ubuntu.  I think the problem has something to do with UEFI / Legacy, But I have given up now and acceptet that Ubuntu is still for IT Experts only.  My problem is that if I startup in boot manager, It will not startup Windows.

How do I format drive and unistall Ubuntu 11.10?  I wanted a dual boot and was given an option to overwrite Windows XP partition and said yes.  Format options don't work.  I tried a few dos prompts and probably not using correct fdisk.  Format options state drive is busy closed all windows.  Tried to boot windows XP and disk says its corrupt.


I need to send instructions to blender trough an external application.  for example: import model to current scene   Is this possible? Can someone point me in the right direction based on previous experience.  Thanks in advance  Ghus

I don't want to use /Application.../blender -P my_script.py but I want to tell a running Blender process to execute a script.   Is there an existing method to tell a running Blender process to execute a python script?  For example using http://localhost:123/run_script=myscript.py


I am not able to render background image and audio visualization into one video. I have tried compositioning audio visualization(spectrum) and background image into one but the render gives me only images 0001.png, 0002.png and so on.  Here's how it looks in blender:    Here's what I get:    Basically if there's another way to render audio visualization with background image, please mention it. I have no experience in blender.

I would like to render an animation as a series of .png images with transparent backgrounds for use in a video. Is this possible?


I got my Multi Entry Schengen visa(Type C) on french embassy using the itinerary which covers french cities only but I have dropped the itinerary for some personal reasons.   Can I enter Germany as my first entry point now ?  Are there any stamping issues associated with that during the Immigration check in on Airport? Based on my current itinerary I'm spending more time on Germany and Austria than France , again would it become a problem ? Will there be any problem when I apply schengen visa through french embassy in future ?   Looking for some guidance on this although I presume none of this should be a problem since I have already got visa with me and I'm free to use till it's validity.  I just want to make sure I'm not breaking any law here as well.

In case, if I get a multiple-entry Schengen visa in one of the embassies in Ukraine, Kyiv - should my first trip be to the country which issued the visa?  Any there any requirements of this sort? Does this condition vary depending on embassy which issued the visa?  What are the possible consequences on not visiting that country first? Does it somehow depend on country where the embassy is (i.e. non-Schengen and not EU members)?


I am still quite new to regression models, but I am trying to apply a regression model to predict  victimization(0,1) in R given childhood experience. I have done many research but i still cannot find a suitable prior distribution to give us an informative(or at least weakly informative) prior. It is known that the observation for victimization is either 0 or 1, with a mean of 0.03441526. Any input will be much appreciated.

I need help in my choice of a prior for a bayesian model.  I have data from a set of participants responding to a set of yes/no questions. Answers are correct or incorrect. I suspect some questions are harder than others. I also suspect that some participants are smarter than others. Some of the variance in question difficulty might be explained by question category which I know. Some of the variance in participant smartness might be explained by participant age which I also know.  In a frequentist framework I use a hierarchical logistic generalised linear regression model which predicts response to questions (correct / incorrect)  from question category and participant age as population-level predictors with a grouping factor for participants and for questions.   (Age effects might vary across questions and category effects might vary across participants but let's not go there now.)   I'm uncomfortable with the frequentist approach because my participant pool and question pool are both finite. A p value of 0.05 (or whatever) is not trivial to interpret.  As a result I switched to a Bayesian GLMM. This is now easy to do, even for people like me. It has the same description and uses a bernoulli error distribution (recommended by Stan for binary data) and a logit link function. I'm unsure about the choice of a prior for the intercept and for the beta. I don't have great convictions on the prior and want to keep it weakly informative.   I first used a noninformative prior, because that's closest to the frequentist mechanics. I can generate the posteriors just fine (based on the  checklist). But this is generally advised against and, to be honest, I don't actually think that the responses and the effects have infinite variance and can be just about anywhere. I could assume a normal distribution as my prior, or perhaps a student distribution to be a bit stricter. This will be wilfully ignorant of the process that I think is generating my data but it probably won't hurt much. I could use a binomial distribution? I could use a beta distribution? That is apparently the conjugate prior for a Bernoulli likelihood function but I'm not sure how much I should worry about that. Also I'm not sure how to keep such a prior weakly informative but I can look it up.


If I see a bug in Android app and the same bug is in iOS app, is it recommended to create two separate bug reports for  and ?   Or can I create a bug report just for  and add some note in the post that states the same issue is in iOS app too?  Note: I got this question after seeing the comments of this

A little ago, I found  in the review queue. The asker is reporting a bug he found in the android SE app.  The suggested edit proposed to add a second tag to the question to indicate that the bug seem to be present on the IOS app too. I approved the edit and added that info to the question.  Soon after, an user on the Tavern chat room made me notice that this way the staff can't actually mark the bug as fixed until both app are fixed. I am left now wondering... what is the preferred way to handle this situation? Have two copy of the question, each one referencing to one app?   I am especially interested in any info that can provide indication about the staff preferences, ie - finding the posting pattern that is simpler for them to manage.


Is it possible to change the email associated with Pokemon go? I used my collage email which will soon be deleted.

I've been playing the game a while now and have ranked up considerably. I'm wondering if there is any way to change to a different Google account and still keep all of my Pokemon/items etc, as I stupidly used my university gmail account when I first downloaded the app (which will be automatically deleted in September).   Is there any way to transfer my trainer/Pokemon/items etc to a different Google account?


def GenerateFibonaci(x):   if(x == 0):   return 0   elif(x == 1):   return 1   else:     for i in range(x):        return GenerateFibonaci(x-1) + GenerateFibonaci(x-2)   print(GenerateFibonaci(x))   I'm attempting to write a program GenerateFibonaci(x) that takes one input and prints a listed fibonaci sequence depending on the length of x.   Here's what I get as an output, only one value instead of a list:  >>> GenerateFibonaci(6) 8   This is what I'm trying to get it to look like:  >>> GenerateFibonaci(5) [0,1,1,2,3] >>> GenerateFibonaci(8) [0,1,1,2,3,5,8,13]   Not sure if I need to add a list statement or a new nested loop? Any help would be greatly appreciated.

I had originally coded the program wrongly. Instead of returning the Fibonacci numbers between a range (ie. startNumber 1, endNumber 20 should = only those numbers between 1 & 20), I have written for the program to display all Fibonacci numbers between a range (ie. startNumber 1, endNumber 20 displays = First 20 Fibonacci numbers). I thought I had a sure-fire code. I also do not see why this is happening.  startNumber = int(raw_input("Enter the start number here ")) endNumber = int(raw_input("Enter the end number here "))  def fib(n):     if n < 2:         return n     return fib(n-2) + fib(n-1)  print map(fib, range(startNumber, endNumber))   Someone pointed out in my Part II (which was closed for being a duplicate - ) that I need to pass the startNumber and endNumber through a generator using a while loop. Can someone please point me in the direction on how to do this? Any help is welcome.    I'm a learning programmer and I've run into a bit of a jumble. I am asked to write a program that will compute and display Fibonacci's Sequence by a user inputted start number and end number (ie. startNumber = 20 endNumber = 100 and it will display only the numbers between that range). The trick is to use it inclusively (which I do not know how to do in Python? - I'm assuming this means to use an inclusive range?).  What I have so far is no actual coding but rather:   Write Fib sequence formula to infinite Display startNumber to endNumber only from Fib sequence.   I have no idea where to start and I am asking for ideas or insight into how to write this. I also have tried to write the Fib sequence forumla but I get lost on that as well.


Hi everybody I have an array with 1 to 100 number and I want to group it to four group that each group have 25 number. How can i do it. Thanks   static void Main(string[] args)         {             int[] array = new int[101];             for (int i = 1; i <= 100; i++)             {                 array[i] = i; Console.WriteLine(array[i]);              }             var s = array.GroupBy(x => array.Length % 25).Select(d => new { k = d.Key, v = d.OrderBy(f => f) });             foreach (var item in s)             {                 Console.WriteLine($"{item.k}");                 foreach (var item2 in item.v)                 {                     Console.WriteLine($"\t{item2}");                 }                 Console.WriteLine("------------");             }`enter code here`

Is there a nice way to split a collection into n parts with LINQ? Not necessarily evenly of course.  That is, I want to divide the collection into sub-collections, which each contains a subset of the elements, where the last collection can be ragged.


Is there a way to find out the password of a saved wifi network from an iPhone 6 running 12.2?  This sending/sharing the password doesn't seem to work on this version.  I have no access to the router. (not hacking, just community difficulties in college dorm, and it's an ubee anyway. those devices have individual admin passwords printed on their bottoms)  thank you

I've previously connected to a wifi network on my iPhone but I've no way of finding out the password. So is there any way to view saved wifi passwords on the iPhone?


If $V$ is a vector space over $\mathbb{C}$ and $\dim V\ge 2$, prove that if $q: V \rightarrow \Bbb{C}$ is a Quadratic form then exists $v \ne 0$ such that $q(v)=0$   I'm not sure I even understand why this is true. Any tips?

Let $ V $ be a vector space of finite dimension on $\mathbb{C} $ and $ \dim(V) \gt 1 $. Show that for every quadratic form $ q : V \to \mathbb{C} $ there exists $ 0 \neq v \in V $ such that $ q(v) = 0 $.  It certainly has something to do with the fact that we are in $\mathbb{C} $ and not $ \mathbb{R} $, but I'm since $ q $ can be represented by any non-singular complex matrix, I don't know how this is even possible.  (edit: V is of finite dimension)


Recently, I have been finding a lot of cool questions on Stack Overflow. I am very into Ruby, Java and JavaScript, but after only recently finding many cool questions I have found that the things I have starred as favorites are kind of just randomly ordered. This of course becomes especially annoying if you start starring tons of questions.  It would be nice if there was a way that I can have a column or something like that where I can put the cool questions I found on Ruby. Then another for Java etc. Of course there are some questions on SO that are not so much language specific, but it would be nice to have a way to organize this so that later when I want to see a specific cool question from Ruby I can already filter the Java questions out. Right now I just put all these links into an Excel file and have some headers.

I don't know about anyone else, but I have a reasonable list of favourites now, and it can be rather difficult to find the relevant ones at any given time. Sometimes, I have a specific one in mind, others I just want to see all favourites relating to a specific topic. It would be nice if there were a way to organise my favourites by tag, or OP, or possibly just search them.  How can we improve the favourites feature?  Please post your ideas on how we might improve the favourites feature of the Stack Exchange sites. Try to keep each answer to one idea so that the votes reflect the popularity of a single idea.


I am getting data from a csv file and parsing it to my application. In my csv file I have a column price whose value I use as of course the price of an item in my project.   However, the price in the csv file does not contain trailing 0s, For example, if the price of and item is $5.00, the csv file has it as $5, if the price is $9.60, the csv has it as $9.6. Other prices such as $9.56 are fine though.  This is how I retrieve the price from the csv file:   Price = string.IsNullOrEmpty(columns[3].Trim()) ?      null : (decimal?)decimal.Parse(columns[3]),    In my class Price is set as public decimal? Price { get; set; }.  How do I format what is returned to fix this problem?  Price = String.Format("Price: {0:C}",       string.IsNullOrEmpty(columns[3].Trim()) ?          null : (decimal?)decimal.Parse(columns[3]));   I tried the above but didn't work.  How do I fix it so that values in the csv as $5.9 are formatted to $5.90.  EDIT:  Tried:  Price=decimal.Round(string.IsNullOrEmpty(columns[3].Trim()) ?      null :      (decimal?)decimal.Parse(columns[3]), 2, MidpointRounding.AwayFromZero);   Not sure if I did that right?  Also, I'm not certain how I can use the below option in my code:  decimalVar.ToString ("#.##");   Also tried:   Price = string.IsNullOrEmpty(columns[3].Trim()) ?        null : (decimal?)decimal.Parse(columns[3], NumberStyles.Currency)   But still doesn't work.

When displaying the value of a decimal currently with .ToString(), it's accurate to like 15 decimal places, and since I'm using it to represent dollars and cents, I only want the output to be 2 decimal places.   Do I use a variation of .ToString() for this?