Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ ¹ ² ³ °
 

You are not logged in. #1 20060222 19:12:41
Discreet proof help needed1) Prove that no square integer number can have a remainder of 3 when divided by 5 #2 20060223 05:03:40
Re: Discreet proof help needed1. Since we want to show a remainder when dividing by 5, we must first get something that is divisble by 5. So lets consider the 5 cases: "In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..." #3 20060223 05:48:35
Re: Discreet proof help neededI really like the locker question. I am so tempted just to program it and get a result, but that's kind of cheating isn't it. I could show the results graphically after each student inorder to learn. igloo myrtilles fourmis #4 20060223 05:51:31
Re: Discreet proof help neededI am beginning to think you are right about perfect squares having an odd number of factors, so doors open because the square root factor is only counted once, and all the other factors are paired up. Nice work! igloo myrtilles fourmis #5 20060223 08:04:51
Re: Discreet proof help neededI've seen a variation of the 2nd puzzle where all the students change the state of the locker, instead of it being a rota of open, close, change, like it is here. Why did the vector cross the road? It wanted to be normal. 