Hi everybody,

The Collatz conjecture can be used to give students a taste of a topic in Number Theory.  See the Wikipedia article for a good explaination.

https://en.wikipedia.org/wiki/Collatz_conjecture

Also, a conjecture is something that is probrably true.  Enjoy my little Maple procedure.  (in .mw and .pdf forms)

Collatz_third_time.mw

Collatz_third_time.pdf

Comments are appreciated.

Matt

HI MaplePrimes.com and other watchers,

Please enjoy the attaced files about combinatorics.
You may already know what '4 choose 3' is.

an_excercise_in_combinatorics.mw

an_excercise_in_combinatorics.pdf

Hopefully this can be useful to the casual mathematical observer.

Regards,

Matt

Hi MaplePrimes,

This YouTube video has a nice puzzle. 

It is titled "Can you solve the locker riddle". 
My first blush was to consider modular arithmatic
https://www.youtube.com/watch?v=c18GjbnZXMw

Here is a maple page -
divisors_excercise.mw

divisors_excercise.pdf

Have a very fine rest of the day.

Regards,
Matt

Hi Mapleprimes,

I have made this little procedure with Maple. 

check_g_conjecture_10.pdf

similar to this next one check_g_conjecture_10.mw

This may be worth a look.

Regards,

Matthew

P.S.   see  https://en.wikipedia.org/wiki/Goldbach%27s_conjecture

In My Humble Opinion, Wikipedia is a good crowd sourced resource.

The 196 algorithm goes like this.  Start with an integer.  Reverse the digits.  Add the reversed number to the integer.  For most numbers, this eventually leads to a palendrome.  That is to say the number is equal to the reversed number.  I wrote a little Maple procedure to explore 196, the smallest number that will probrably never become a palendrome when put into the algorithm.

Let me know if you like my code.

Regards,
Matt

proc4.pdf

proc4.mw

http://mathworld.wolfram.com/196-Algorithm.html