Timeline for Expressability of an electrical circuit with probabilistic switches
Current License: CC BY-SA 2.5
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 29, 2009 at 23:43 | comment | added | Kristal Cantwell | I think I have managed to extend the result from 25 to the squares of all primes greater than 3 it is in another post. | |
Dec 27, 2009 at 22:51 | comment | added | Gjergji Zaimi | I wish your argument for q=25 was generalizable. | |
Dec 27, 2009 at 22:12 | history | edited | Kristal Cantwell | CC BY-SA 2.5 |
addition of material
|
Dec 25, 2009 at 21:26 | history | edited | Kristal Cantwell | CC BY-SA 2.5 |
addition of material
|
Dec 24, 2009 at 0:41 | history | edited | Kristal Cantwell | CC BY-SA 2.5 |
addition of material
|
Dec 24, 2009 at 0:24 | comment | added | Kristal Cantwell | I rewrote the proof with a value in the range q to 2q-1. | |
Dec 24, 2009 at 0:20 | history | edited | Kristal Cantwell | CC BY-SA 2.5 |
minor change
|
Dec 23, 2009 at 23:13 | comment | added | Gjergji Zaimi | $\frac{7}{p^2}$ can be achieved as 7/p and 1/p in series if p>7. But you are right and primes q>3 are not good as one can choose a prime q<r<2q-1. and then $\frac{r}{q^2}$ is not expressible because of a similar argument. | |
Dec 23, 2009 at 23:05 | history | answered | Kristal Cantwell | CC BY-SA 2.5 |