wu :: forums
wu :: forums - More hailstone numbers

Welcome, Guest. Please Login or Register.
May 27th, 2022, 11:14am

RIDDLES SITE WRITE MATH! Home Home Help Help Search Search Members Members Login Login Register Register
   wu :: forums
   riddles
   hard
(Moderators: Grimbal, william wu, Eigenray, towr, ThudnBlunder, Icarus, SMQ)
   More hailstone numbers
« Previous topic | Next topic »
Pages: 1  Reply Reply Notify of replies Notify of replies Send Topic Send Topic Print Print
   Author  Topic: More hailstone numbers  (Read 1530 times)
JocK
Uberpuzzler
*****






   


Gender: male
Posts: 877
More hailstone numbers  
« on: Jun 25th, 2005, 8:42am »
Quote Quote Modify Modify

Starting from a positive integer k, one can generate a series of integers by iterating the mapping:
 
k' = k/2 if k even,
 
k' = (3k+5n)/2 if k odd.
 
Here, n is an odd positive integer constant.
 
Can you find a starting value and a n-value for which the iteration fails to yield a value not exceeding 347n?
 
 
 
 
« Last Edit: Jun 25th, 2005, 8:43am by JocK » IP Logged

solving abstract problems is like sex: it may occasionally have some practical use, but that is not why we do it.

xy - y = x5 - y4 - y3 = 20; x>0, y>0.
Barukh
Uberpuzzler
*****






   


Gender: male
Posts: 2276
Re: More hailstone numbers  
« Reply #1 on: Jun 26th, 2005, 11:43pm »
Quote Quote Modify Modify

hidden:

The minimal solution I've found is: n = 29, k = 12655. It generates a 66-long cycle with minimal element 19055.
 
Of course, this was achieved using computing power. Currently, I have no idea how to tackle this problem more intelligently.
IP Logged
Pages: 1  Reply Reply Notify of replies Notify of replies Send Topic Send Topic Print Print

« Previous topic | Next topic »

Powered by YaBB 1 Gold - SP 1.4!
Forum software copyright 2000-2004 Yet another Bulletin Board