If $n$ and $k$ are positive integers such that $5<\frac nk<6$, then what is the smallest possible value of $\frac{\mathop{\text{lcm}}[n, k]}{\gcd(n, k)}$

Def is a scalene triangle

Well in order to lose a pound you would have to burn 1,500 calories. the more calories you burn the more weight you lose. in order to lose 2 pounds you would have to run 4 hours and 28 minutes.

We’re gonna need a picture to refer to in order to figure it out. try reposting your question with the picture included.

What the f u c k tou are talking