3n+1 (1 Viewer)

Euler

Member
Joined
Sep 7, 2003
Messages
81
pick a positive integer.

1. if it is even, divide by 2
2. if it is odd, multiply by 3 and add 1
3. repeat steps 1 and 2.

eventually, you will reach the value 1, in which case you go into the loop 4, 2, 1.

for example, starting at 3, you get 10, then 5, 16, 8, 4, 2, 1.

starting at 7, you get 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1.

Show that no matter what number you pick at the beginning, you will eventually get to 1.
 

Euler

Member
Joined
Sep 7, 2003
Messages
81
Originally posted by turtle_2468
Famous unsolved problem...
Don't tell anyone. The psychological barrier is often the most difficult one...
 

underthesun

N1NJ4
Joined
Aug 10, 2002
Messages
1,781
Location
At the top of Riovanes Castle
Gender
Undisclosed
HSC
2010
Originally posted by Euler
Don't tell anyone. The psychological barrier is often the most difficult one...
Yeah, like I was trying to figure out the pattern of prime numbers using by analising them in binary format. Hours of wasted time :p Was fun though, I guess..
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top