Here is a purely number theoretical question that I got to know from our electrical engineering department.
Call a number qinmathbbN, good if one can do the following:
Given a set of "probabilistic" switches, each of which is open with probability fracaq, a=1,2,dots,q−1 (you have infinitely many of each type), and two nodes U,V. Then for every n,binmathbbN such that bleqn−1 one can build a simple series parallel circuit (where one can use each type of switch more than once) connecting U to V where the probability of UtoV being open is exactly fracbqn.
The question is which numbers are good? I think the conjecture is that only numbers which are multiples of 2 or 3 are good. 5 for example is not good as one can not construct a circuit which is open with probability exactly frac725.
P.S. A "simple series parallel" circuit is one that can be build recursively by the operation of placing a switch in series with our circuit or placing a switch in parallel with our circuit. For example the wheatstone bridge is not simple series parallel. Also if one for example, connects between U,V two switches with probabilities p1,p2 (of being open) in series one gets a probability of p1p2 of the section UV being open, while if we connect them in parallel we get a probability 1−(1−p1)(1−p2) of it being open.
EDIT: I will rephrase the question in simple mathematical terms, as the original question is poorly phrased.
Let qinN. A set SqsubsetmathbbQ contains all numbers of the form fracaq, with a=1,2,dotsq−1. It also satisfies the property xinSqimpliesfracaxqinSq and x+fraca−axqinSq for any a=1,2,dotsq−1.
For which q does Sq contain every number of the form fracbqn (where b<qn)?
No comments:
Post a Comment