 Whether to use Z or T test statistic for a sample of 50, known sample variance and unknown population variance
 GARCH model project
 Prove that $T = (X_{(1)}, X_{(n)})$ is complete for Uniform$(\theta_1, \theta_2)$
 Vector fields commute implies flows can be written as composition of individual flows
 Linear Algebra for Khovanov Homology
 In a number field $\mathbb{Q}(\alpha)$, $\alpha$ integer on $\mathbb{Q},$ root of a pEisenstein polynomial: p doesn’t divide the index
 Why is the first cohomology of a projective curve over an algebraically closed field a birational invariant?
 Uniform integrability, Lebesgue Nikodym Theorem , Terrence Tao's Notes
 Show that ${\cal A_\sigma(K)=B}(X)$
 Is the discount factor $v=(1+i)^{1}$, where $i$ is an interest rate, always annualized?
 Describe an algorithm that checks if edge e is in MST of G
 How to obtain the posterior density, $p(\theta  \alpha, \beta, y)$
 Explanation of Dijkstra's algorithm
 $I$ be a finitely generated ideal of $R$ such that $R/I$ is a Noetherian and $R$ is $I$adically complete. Then $R$ is Noetherian
 What is the derivative of a summation with respect to its upper limit?
 Comparison Singular Sheaf Cohomology of Locally Contractable Space
 Disprove $m!=100x^2+20x$ using an estimation for factorial.
 What is the Fourier transform? (Symmetric invertible matrix)
 Asymptotic form of the beta probability density function
 Consider C [−1, 1]. Give examples of subspaces A ⊂ C [−1, 1] with particular properties.
how to explain zero knowledge proof to your 7 year old cousin?
how to explain zero knowledge proof to your 7 year old cousin?
Nathan Aw
The simplest example of zero knowledge proof I know of ia for graph isomorphism. It's somewhat less interesting following Babai's quasi polynomial result, but for educational purpose we will ignore that. The zero knowledge proof still stands. I'm not sure it is simple enough for a 7 year old but here goes:
We have two graphs where the nodes have different names, we want to prove they are essentially the same graph. Meaning there is a one to one mapping between the nodes of the graphs which preserves the edges. Or alternatively we can rename the nodes of one graph to recieve the second. We want to prove the existence of such a mapping without revealing it.
This can be done by taking ine of the graphs and renaming the nodes to random names(providing edges in random order). We send this new graph to verifier who asks to reveal a mapping between it and one of the two originals of his choice. Th

The simplest example of zero knowledge proof I know of ia for graph isomorphism. It's somewhat less interesting following Babai's quasi polynomial result, but for educational purpose we will ignore that. The zero knowledge proof still stands. I'm not sure it is simple enough for a 7 year old but here goes:
We have two graphs where the nodes have different names, we want to prove they are essentially the same graph. Meaning there is a one to one mapping between the nodes of the graphs which preserves the edges. Or alternatively we can rename the nodes of one graph to recieve the second. We want to prove the existence of such a mapping without revealing it.
This can be done by taking ine of the graphs and renaming the nodes to random names(providing edges in random order). We send this new graph to verifier who asks to reveal a mapping between it and one of the two originals of his choice. The prover provides such a mapping. Repeat until desired confidence is reached.
It probably i
20180321 09:55:05