In my office i am using NETGEAR Wi-Fi device. Some person get my wifi password and using my internet connection. I am using NETGEAR genie software. it shows the connected device MAC address &amp; IP address. Then how to block the particular device. (IP address) I have many time change my wifi password. that also no use.     My PC have wired connection with WIFI system. I cant turnoff myWIFI. Bcse my boss using Laptop. i only want to block the particular device IP. Kindly send the solution. My PC OS is win 7 home premium 64bit. my wifi system is NETGEAR-WNR3500Lv2
I kust realized that some other PC is also getting assigned a IP address (DHCP Lease) from my modem. I am sure this is not one of the PCs in my home.  My modem was using WEP security. I know WEP is far less secure and WPA is better, but this actually is a borrowed modem, and I did not know that WEP was used.  I immediately did the following : On My Modem    Changed the encryption mode from WEP to WPA   Changed the password   After this I do not see the intruder PC on the DHCP list.  On my Mac:     Changed the permissions on the public folder to "everyone - no access"   Turned off "File Sharing" in System Preferences (But I would want to turn it back on sometime)   My mac is the one that is always on, Both the admin user and the user I normally use are password protected.  Is the above sufficient? Should I do something more?  Also, is WPA security sufficient? Should I take other steps?
Before, the concept of imaginary numbers, the number $i = \sqrt{-1}$ was shown to have no solution among the numbers that we had. So we declared $i$ to be a new type of number. How come we don't do the same for other "impossible" equations, such as $x = x + 1$, or $x = 1/0$?  Edit: OK, a lot of people have said that a number $x$ such that $x = x + 1$ would break the rule that $0 \neq 1$. However, let's look at the extension from whole numbers to include negative numbers (yes, I said that I wasn't going to include this) by defining $-1$ to be the number such that $-1 + 1 = 0$. Note that this breaks the "rule" that "if $x \leq y$, then $ax \leq ay$", which was true for all $a, x, y$ before the introduction of negative numbers. So I'm not convinced that "That would break some obvious truth about all numbers" is necessarily an argument against this sort of thing. How to highlight whole row and column under cursor in OpenOffice Calc? I need to work with large table. Something like in this illustation image will be helpfull for better orientation:    Is there some settings which makes this possible? A question about how to express a fraction as ${1\over q_1}+{1\over q_2}+ \cdots+{1\over q_N}$ Let $x$ be a positive rational number, strictly between $0$ and $1$. Prove that there is a finite strictly increasing list of positive integers $2 \leq q_1&lt;q_2&lt;\cdots&lt;q_N $ such that $$x={1\over q_1}+{1\over q_2}+ \cdots+{1\over q_N}.$$  I have tried many methods, such as mathematical induction. I know it is obvious that $\frac{1}{m}$ is right for assumption, but when I begin to prove $\frac{2}{m}$, I feel it is hard to find some patterns for $\frac{2}{m}$. Thus, maybe my thoughts are wrong.  Also, I still tried to change the fraction so that the numerator will be smaller and smaller. But I still cannot find a way to lower the numerator. Can someone help me solve the question? Or, can someone give me some hints. I will appreciate you very much! Symbols instead of numbers as footnote markers How can I make LaTeX use symbols (*, †, ‡, and so on) instead of numbers to mark footnotes?  (The numbers are confusing because I use superscripted numbers for citations.) Can you be refused a visitor visa to US if you have bad Credit there? I'm using TikZ to plotting some functions for a document. For example, I want to plot 1/(x+1). So I did something like this:  \begin{tikzpicture}[&gt;=stealth,x=3mm,y=3mm] \draw (0,5) node[above]{\fimg $y=f(x+1)=\dfrac{1}{x+1}$}; \clip (-5,-5) rectangle (5,5); \ejes[1]{-4}{4}{-4}{4} \draw[samples=100] plot(\x,{1/(\x+1)}); \end{tikzpicture}   where \ejes[style]{xmin}{xmax}{ymin}{ymax} is command, that I have defined before to draw the axes (join with \fimg). My expected output for the code below was just the function, but I get this:    So, TikZ automagically put the vertical asymptote at x=-1. That isn't a bad thing, but now I want to have some control over it. For example I want dotted lines for vertical asymptotes. How can I do that? Find a recurrence relation for the number of $n$-digit binary sequences with no pair of consecutive $1$s Find a recurrence relation for the number of $n$-digit binary sequences with no pair of consecutive $1$s.  I know my base case:$$a_1 = 2$$ for either $1$ or $0$. Normally to construct the recurrent relation I would say fill in $n-1$ spaces then add a $1$ or $0$, which is simply:$$a_n = 2\cdot a_{n-1}$$However, I don't believe this is right, because this doesn't take into account that there can't be any consecutive $1$s.  Even when I use the base case of $2$ digits:$$a_2 = 3$$for either $01$, $10$, or $00$, I still get the recurrence relation of:$$a_n = 3\cdot a_{n-2}$$which also does not account for $01$ and $10$ occurring consecutively.   So how would I express this? What is Ubuntu's status on the Meltdown and Spectre vulnerabilities? Any questions relating to status updates, or asking if anything is going to be patched for these vulnerabilities should be closed as duplicates of this question.    are in the news right now and sound pretty severe. I don't see any security updates from Ubuntu that cover these vulnerabilities.  What is Ubuntu doing about these vulnerabilities, and what should Ubuntu users be doing?  These are CVE-2017-5753, CVE-2017-5715 and CVE-2017-5754. Principal $n$th root of a complex number This is really two questions.   Is there a definition of the principal $n$th root of a complex number? I can't find it anywhere. Presumably, the usual definition is $[r\exp(i\theta)]^{1/n} = r^{1/n}\exp(i\theta/n)$ for $\theta \in [0,2\pi)$, but I have yet to see this anywhere. Is this because it has bad properties? For instance, according to this definition is it true that for all complex $z$ it holds that $(z^{1/a})^b = (z^b)^{1/a}$? I'm using iPhone 6s 16 GB. My storage isn't full but still I can't download anything. Every time I wanted to start a download it keeps telling:  app name* could not be download at this time How create Redirect pattern from old to new URLs? D7: I'm going to update an articles path pattern (/articles/[node:uid] → /post/[new tokens]) but I need redirect users from old path to new one using tokens. And I don't know how to do that.  I tried using the , but it allows set only separate URL for each node; no group redirect patterns are allowed. Also the  doesn't allow to set patterns. How can I achieve this?    The problem partially solves by applying "Update url alias" option in admin/content. I do not find out how to show all selected type nodes at one page without pages, because it is terrible slow applying option page by page. Anyway, by this way, old aliases still exist, work, and don't redirect to new aliases. Childrens fantasy, blind monk leading boy who can control the elements Prime factors + number of Divisors I know that one way to find the number of divisors is to find the prime factors of that number and add one to all of the powers and then multiply them together so for example  $$555 = 3^1 \cdot 5^1 \cdot 37^1$$  therefore the number of divisors = $(1+1)(1+1)(1+1) = 2 \cdot 2 \cdot 2 = 8$  What I do not know (and can't seem to find when I look) is WHY this relationship exists or a formula which shows its proof.  Has anyone seen such a formula? I have a Git repo that I have deleted four files from using rm (not git rm), and my Git status looks like this:  #    deleted:    file1.txt #    deleted:    file2.txt #    deleted:    file3.txt #    deleted:    file4.txt   How do I remove these files from Git without having to manually go through and add each file like this:  git rm file1 file2 file3 file4   Ideally, I'm looking for something that works in the same way that git add . does, if that's possible. Tangential component of Electric field The above question i'm trying for so long but failed. This is from my class $12$ book(india).First of all i'm confused with tangential component of electric field, I mean why this? So far I've studied that electric field(Whether its own or someone's else) is always perpendicular to a charged body. So, there shouldn't be any tangential component. Could someone please explain me visually what's happening?  Strict Note: A class $12$ answer required. No complex statements please. Only for school childs. Compute: $\lim_{n \rightarrow \infty}\sqrt{n}(A_{n+1} − A_n)$ where $A_n = \frac{1}{n}(a_1 + a_2 + \cdots + a_n)$ Let $\{a_n\}, {n\geq 1}$, be a sequence of real numbers satisfying $|a_n|\leq 1$ for all $n$. Define  $$A_n = \frac{1}{n}(a_1 + a_2 + \cdots + a_n),$$ for $n\geq 1$. Then find $\displaystyle\lim_{n \rightarrow \infty}\sqrt{n}(A_{n+1} − A_n)$ .    I proceed in this way  $$\lim_{n \rightarrow \infty}\sqrt{n}(A_{n+1} − A_n)=\lim_{n \rightarrow \infty}\sqrt{n}\left[\frac{1}{n+1}(a_1 + a_2 + \cdots + a_n+a_{n+1})-\frac{1}{n}(a_1 + a_2 + \cdots + a_{n})\right]=\lim_{n \rightarrow \infty}\left[{(na_{n+1}-a_1 - a_2 - \cdots - a_n})\frac{1}{\sqrt{n}(n+1)}\right]$$  Please help me to complete from here How to grep a specific line _and_ the first line of a file? Assuming a simple grep such as:  $ psa aux | grep someApp 1000     11634 51.2  0.1  32824  9112 pts/1    SN+  13:24   7:49 someApp   This provides much information, but as the first line of the ps command is missing there is no context for the info. I would prefer that the first line of ps be shown as well:  $ psa aux | someMagic someApp USER       PID %CPU %MEM    VSZ   RSS TTY      STAT START   TIME COMMAND 1000     11634 51.2  0.1  32824  9112 pts/1    SN+  13:24   7:49 someApp   Of course, I could add a regex to grep specifically for ps:  $ ps aux | grep -E "COMMAND|someApp"   However, I would prefer a more general solution as there are other cases in which I would like to have the first line as well.  Seems like this would be a good use case for . Solving "MySQL server has gone away", mysql error 2006 I have a site at hostgator, using their "Business account". It's cheap, and comes with a private SSL cert. HOWEVER, their MySQL settings are such that any db connection goes stale fairly quickly, and then the hostgator staff try to convince you to use a VPS or dedicated server at multiple times the expense.  I'm creating and deploying WebAPIs, which can have a 'conversation' which exceeds 60 seconds. When this occurs, the db connection handle is stale, causing any db operations after my timeout to fail.  I'm in the process of implementing the following solution, but am curious if anyone else has solved this issue (where they can not modify their my.ini or my.cnf to give MySQL more resources) in a similar or completely different manner.  last part of a hook_update:  $ret = db_query( "UPDATE {my_table} set field1 = '%s', field2 = %d ... WHERE vid - %d", $node-&gt;field1, $node-&gt;field2, ... $node-&gt;vid ); if (!$ret) {        // get private storage directory for this node:        $cexStorage    = _cex_front_getCexStore();        $nodeFilesPath = DRUPALROOT.'/'.$cexStorage.'/'.$node-&gt;storeDir;        $fname         = $nodeFilesPath.'/recover.node';         $readyToWrite  = serialize( $node );        file_put_contents( $fname, $readyToWrite );        if (file_exists( $fname )) {          _dbgReport( 'seems to have worked!' );        }     }   Then this is called in my hook_form, right after I determine that node->nid is valid:  function _cex_front_recover_node( &amp;$node ) {   if (!isset($node-&gt;storeDir)) {      _dbgReport( '**************************** _cex_front_recover_node: no storeDir!!!' );      return;   }    // get private storage directory for this node:   $cexStorage    = _cex_front_getCexStore();   $nodeFilesPath = DRUPALROOT.'/'.$cexStorage.'/'.$node-&gt;storeDir;   $fname         = $nodeFilesPath.'/recover.node';   if (file_exists( $fname )) {     $recovered = file_get_contents( $fname );     if ($recovered) {       // no longer needed:       unlink( $fname );       $recoveredNode = unserialize( $recovered );       // restore the key values I need to proceed with this node:       $node-&gt;stage = $recoveredNode-&gt;stage;       $node-&gt;rnid  = $recoveredNode-&gt;rnid;       $node-&gt;iris  = $recoveredNode-&gt;iris;       cex_front_update( $node );     }     else {       _dbgReport( '********* failed to read "'.$fname.'"' );     }   } }   I'll be pairing the logic down to only store the key fields I need, but this works! Sure beats upgrading my server at 3x the expense. Anyone else doing something like this? Prove that $f$ has finite number of roots Let $f:[0,1]\to \mathbb{R}$ be a differentiable function. If there do not exist any $x\in[0,1]$ such that $f(x)=f'(x)=0$, prove that $f$ has only finite number of zeros in $[0,1]$.   I'm not getting any idea how to proceed. Slower download speed compared to Windows on Ubuntu 20.04