Math induction divisiblity proof
- Thread starter Chiraq
- Start date
Dr.Peterson
Elite Member
- Joined
- Nov 12, 2017
- Messages
- 16,749
Can you show us the actual entire problem, ideally as an image? This doesn't make sense to me.
Assuming it means "6 is not divisible by 2^n for any positive integer n>1", you don't need induction. For n>2, 2^n>6 so 6 is obviously not divisible by 2^n.
Harry_the_cat
Elite Member
- Joined
- Mar 16, 2016
- Messages
- 3,772
Do you perhaps mean that 2^n is not divisible by 6? But as Dr P said, show us the actual problem.
The actual entire problem is MU puzzle, you can find it on internet (you can also find solution, but I didn't know that hahaah).
This is entire problem :
Begin with the string MI.
Repeatedly apply one of the following operations:
Double the contents of the string after the M: for example, MIIU becomes MIIUIIU, or MI becomes MII.
Replace III with U: MIIII becomes MUI or MIU.
Append U to the string if it ends in I: MI becomes MIU.
Remove any UU: MUUU becomes MU.
So while I was solving it I figured out that we can only write I letter as 2^n, but to solve that problem we need at least 6 I letters and it's impossible. I wanted to proof (cause I need to solve it by using math indution) that 2^n can never be 6.