Quantcast
Channel: Prove integer remains $\mathbb{Z}_{n}$ after Division and Floor - Mathematics Stack Exchange
Browsing latest articles
Browse All 2 View Live

Answer by SomeStrangeUser for Prove integer remains $\mathbb{Z}_{n}$ after...

It's a simple exercise in inequality. No need to incorporate modular arithmetic. In particular, what you are asked to prove is that given any $0\le r\lt2^w$ and $0\le p<w$, we have:$$\lfloor...

View Article



Prove integer remains $\mathbb{Z}_{n}$ after Division and Floor

Given a positive integer $w$, let $r$ be an integer that satisfies: $r \in{} \{0,1,2, \ldots{}, 2^{w}-1 \}$, that is, $r \in{} \mathbb{Z}_{2^w}$.I want to prove that:for any $p$, that $p \in{}...

View Article
Browsing latest articles
Browse All 2 View Live




Latest Images