Can I Set A Voltage Output On The D+/D- Lines Of USB Communication
Can I control voltage of USB data pins?
Mod of numbers with large exponents [modular order reduction] I've read about Fermat's little theorem and generally how congruence works. But I can't figure out how to work out these two:   $13^{100} \bmod 7$ $7^{100} \bmod 13$   I've also heard of this formula:  $$a \equiv b\pmod n \Rightarrow a^k \equiv b^k \pmod n $$  But I don't see how exactly to use that here, because from $13^1 \bmod 7$ I get 6, and $13^2 \bmod 7$ is 1. I'm unclear as to which one to raise to the kth power here (I'm assuming k = 100?)  Any hints or pointers in the right direction would be great. What can I do about uncounterable spells? I cast , sacrificing my only creature to kill my opponent.  My opponent responds with , which will win the game the other way.  Last Word says "This spell can't be countered."  What else can I do about it besides countering it to prevent my plans from being foiled?  (I'd really like to have the last word here.)    Historic Note: before of the April 2018 rules change, uncounterable spells with targets used to actually have different wording (still visible on the printed cards) implying that they still could be countered.  For example, Last Word said:     Last Word can't be countered by spells or abilities.   Meanwhile Akroma, Angel of Fury said:     Akroma, Angel of Fury can't be countered. Adding values to a C# array Partitioning sum of squares Phase shift of 180 degrees of transversal wave on reflection from denser medium Can anyone please provide an intuitive explanation of why phase shift of 180 degrees occurs in the Electric Field of a EM wave, when reflected from an optically denser medium?  I tried searching for it but everywhere the result is just used.The reason behind it is never specified. mysqldump, preserve update_time and modify_time attributes as listed by show table status from Does mysqldump preserve the create_time and update_time attributes that are output by show table status from?  If not, is there an option that does this?   it looks like mysqldump preserves this data if you export to XML. EDIT: Well the data is included in the export. Whether it's read in at the other end I'm not sure.  Is there a way to do this with a normal .sql dump? Shell script- To fetch the content from the specific tag at all occurrence using shell scripting I have an XML file on my server. In that file, I have many tags in which there is a tag for example, "container" tag. I need to fetch the content of all the container tags content separately. Many thanks in advance. How do I format a number in Java? Modelling with more variables than data points I'm fairly new to Machine Learning/Modelling and I'd like some background to this problem. I have a dataset where the number of observations is $n&lt;200$ however the number of variables is $p\sim 8000$. Firstly does it even make sense to consider building a model on a dataset like this or should one consider a variable selection technique to start with such as ridge regression or Lasso? I've read that this situation can lead to over-fitting. Is that the case for all ML techniques or do some techniques handle this better than others? Without too much maths a simple explanation on why the maths start to breakdown for $p&gt;n$ would be appreciated. I am looking for an option to require a passcode to power off my iPhone. That way, if the phone is lost, the person who finds it cannot simply turn it off, rendering Find My iPhone useless. Is there a way to accomplish this? I need to show the following: $$\lim_{k\rightarrow \infty} \left(1 + \frac{z}{k}\right)^k=e^z$$  For all complex numbers z. I don't know how to start this. Should I use l'Hopitals rule somehow? Undefined reference to static class member Can anyone explain why following code won't compile? At least on g++ 4.2.4.  And more interesting, why it will compile when I cast MEMBER to int?  #include &lt;vector&gt;  class Foo {   public:       static const int MEMBER = 1;   };  int main(){       vector&lt;int&gt; v;       v.push_back( Foo::MEMBER );       // undefined reference to `Foo::MEMBER'     v.push_back( (int) Foo::MEMBER ); // OK       return 0; } I am trying cmd --> MMC --> Server Manager and then connecting to my Server 2012 no GUI  but i keep getting the following error The WinRM client cannot process the request  I am unable to upload images right now  This is not related to other post "How to Remote Manage Windows Server 2012 in Server Manager?" because title and description of that post is quite different from what i am asking I am totally stumped for what to do here, any help would be appreciated.   1) What happens if you apply the method of steepest descent to $f(x)=x_1^2+x_2^2+x_3^2$?  2)Lagrange multipliers method- Find the dimensions of the rectangular box open at the top of greatest internal volume, given the surface area of the five faces is $108 \, \mathbb{cm}^2$.  Thanks Why does this function return a different value every time? E: The repository 'http//archive.canonical.com precise Release' is not signed Turning live() into on() in jQuery Suppose $f(x)$ is an irreducible polynomial over $\mathbb Z$ of degree $n$. Is it always the case that there exist distinct $x_1,\ldots,x_{2n+1}\in \mathbb Z$ such that $f(x_1),\ldots,f(x_{2n+1})$ are all prime?  So far I've tested a few irreducible polynomials using mathematica, and this has held. The motivation is to use this as a test for irreducibility, as if $f(x)$ is not irreducible then it takes on at most $2n$ prime values, as either factor takes on $1$ or $-1$ at most $2n$ times. (I'd also be interested in learning if this bound can be improved).  This could potentially be expended to other rings of integers, i.e. $\mathbb Z[i]$, but in that case the minimal number of primes needed to certify that $f(x)$ is irreducible would increase as more units appear. Two kinds of Duplicate closing are too confusing - suggestion for a possible fix Proving an identity for Bernoulli polynomials Consider the Bernoulli polynomials $B_n(x)$ given by the expansion  $$\frac{te^{xt}}{e^t-1} = \sum\limits_{n=0}^{\infty}B_n(x)\frac{t^n}{n!}.$$  I want to prove the identity $$B_n(1-x)=(-1)^nB_n(x).$$  This formula is given in a lot of books, but unfortunately without any proof. Therefore I'm wondering how to prove it. Do you have any idea?  I tried for instance:  $\sum\limits_{n=0}^{\infty}B_n(1-x)\frac{t^n}{n!}=\frac{te^{-xt}}{e^t-1}e^t=\left(\sum\limits_{n=0}^{\infty}B_n(-x)\frac{t^n}{n!}\right)\sum\limits_{n=0}^{\infty}\frac{t^n}{n!}=\sum\limits_{n=0}^{\infty}\left(\sum\limits_{l=0}^n\binom{n}{l}B_{l}(-x)  \right)\frac{t^n}{n!}$.  Hence  $B_n(1-x)=\sum\limits_{l=0}^n\binom{n}{l}B_{l}(-x)$.  But I do not know how to proceed.  On the other hand I know that $B_n(x+1)-B_n(x)=n x^{n-1}$. Hence  $B_{n}(1-x)=B_{n}(-x)-n(-x)^{n-1}$. But again, I do not know how I can go further.   Hopefully someone can help me.  Best regards