Recent content by fiksx

I also thought about that, but if it is like second, it is too obvious, but if it is like the first , how should i proof that? Is it use inclusion exclusion principle?

Is this related to pigeon principle? $$S_1=\{1,2,3,4\},$$ $$S_2=\{2,3,4,5\},$$ $$S_3=\{4,5,6,7\},$$ $$S_4=\{5,6,7,8\},$$ $$S_5=\{7,8,9,10\},$$ $$S_6=\{8,9,10,11\},$$ $$S_7=\{5,6,2,4\},$$ $$S_8=\{1,5,7,9\},$$ $$S_9=\{4,8,10,11\},$$ $$S_{10}=\{5,7,10,11\}$$ When we choose two of them, there is...

a,b,c you can see the diagram i drew, a means PC set include crystal screen and printer b means PC set include crystal screen and scanner c mean PC set include scanner and printer 1. $$S_1$$ means 18=a+b+3+crystal screen only 2. $$S_2$$ means 12 = a+c+3+ printer only 3. $$S_3$$ means 6=b+c...

In a computer shop, there are $$33$$ PC set that are sold: 1. with 18 sets of PC have crystal screen PC included, 2. with 12 sets of PC have printer included, 3. with 6 sets of PC have scanner system included, 4. with 3 sets of PC that include all(printer, scanner system, crystal screen...

$X_1, X_2, ..., X_{15}$ are independently to each other and follow $N (7, 3^2)$ what distribution the following statistics follow$T = \frac{(\bar{X}− 7)}{\sqrt{s^2/15}}$i know this follow t distribution $t_(n-1) =t_{14}$but how do i find what distribution $T^2$ follows, can i just multiply it?$T...

I know that to get the minimum height, the tree has timo be complete 3ary tree,where in each level is full right(?)

m = 3 that limits its children to three. See the tree, it has children 3 for all nodes right , see the parent of the node in circle red , it has three children right ok maybe this will help, all node but lead nodes has m children where m=3 . Is it makes sense now?

what do you mean by at least? there is no at least, all node have 3 children . as you can see in the link i provide , "In graph theory, an m-ary tree (also known as k-ary or k-way tree) is a rooted tree in which each node has no more than m children. A binary tree is the special case where m =...

https://en.wikipedia.org/wiki/M-ary_tree i found this. For an m-ary tree with height h, the upper bound for the maximum number of leaves is {\displaystyle m^{h}}. The height h of an m-ary tree does not include the root node, with a tree containing only a root node having a height of 0. The...

the tree always have node with three children since it is ternary tree like in graph so it cannot have one child or two child total leaves=101 not nodes

this is the tree not necessary complete but have 3 children

how to find upper bound height and lower bound height of 3-ary ordered tree that have leaves of 101? ( the tree don't have to be complete tree, but have to be have 3 children) $$m^h \ge 101=3^h \ge 101$$ $$log \, m^h \ge 101=3^h \ge 101$$ $$h \ge 5$$ but how to know upper bound and lower...

Thankyou but for ordered tree with height of 3 is the total possibility tree are 511? Because all sum possible combination of 9Ck (1<=k<=9) =511 Or other way multiplication of possibility in each subtree. First subtree will be 3C0 +3C1+3C2+3C3= 8 , because there are 3 subtree in height 1 so...

Summary: I’m not too familiar with ordered tree. I’m solving exercise about tree but i’m not sure it is right or wrong How many regular ternary ordered tree with height 3 (ordered tree means children of each vertex are assigned a fixed ordering)? What is the smallest and biggest radius for...

thankyou for answering my questions! i think this has relation to equivalence class such as {8,16},{7,9},{6,10},{5,11},{4,12},{3,13},{14,2},{15,1} for example for k=1 $$ 1≡-15 mod 16$$ and k=15 $$15≡−1 mod16 $$ is in same class so it is isomorphism as it will have same edge and vertex , is my...