we first prove an exact result for hypergraphs: given $r\ge 2$, let $p$ be the smallest prime factor of $r-1$. if $n> (p-1)r$ and $g$ is an $r$- uniform hypergraph on $[n]$ such that every $r+1$ vertices contain $0$ or $r$ edges, then $g$ is either empty or a star, $\{e\subset [n]: |e|=r, e\ni x\}$ for some $x\in [n]$. then we use it to slightly improve best known bounds for hypergraph tur\'an numbers. we show that $\pi(k^r_{r+1})\leq 1- \frac{1}{r} - \left(1- \frac{1}{r^{p-1}}\right)\frac{(r-1)^2}{2r^p({r+p\choose p-1}+{r+1\choose 2})}$ when $r\ge 4$ is even. this is joint work with linyuan lu.