BlackHat Posted January 18, 2020 Share Posted January 18, 2020 (edited) So I was trying to register somewhere and got this --> Quote For all the comma seperated numbers from this morse code "..--- ----· ---.. --..-- ....- ----· ---.. --..-- .---- ----- ---.. --..-- ....- ----- ----- --..-- ...-- --... -.... --..-- .---- .---- ---.. ", find for each number the amount of iterations required to reach 1, as if the number was used to start the sequence in the Collatz conjecture. The solution to the challenge is the sum of all the resulting numbers. The Collatz conjecture concerns a sequence that starts with any positive number n. Each next term is obtained using the following rules: If n is even, divide it by 2. If n is odd, multiply it by 3 and add 1. The conjecture states that repeating this process will result in the sequence converging to the number 1. For example the number 13 requires 9 iterations to reach 1, namely: [40, 20, 10, 5, 16, 8, 4, 2, 1]. anyone can help me to solve this ?? What he actually wants to say here? The question is not clear and english is terrible tbh to understand. Thank god this guy (Who made captcha) is not a teacher otherwise probably students like me gonna fail. Edited January 18, 2020 by BlackHat Link to comment

Kurapica Posted January 18, 2020 Share Posted January 18, 2020 The morse code translates to "298,498,108,400,376,118" so you will have to calc the Collatz conjecture for each one of those numbers 298 : 149, 448, 224, 112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 498 : 249, 748, 374, 187, 562, 281, 844, 422, 211, 634, 317, 952, 476, 238, 119, 358, 179, 538, 269, 808, 404, 202, 101, 304, 152, 76, 38, 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 108 : 54, 27, 82, 41, 124, 62, 31, 94, 47, 142, 71, 214, 107, 322, 161, 484, 242, 121, 364, 182, 91, 274, 137, 412, 206, 103, 310, 155, 466, 233, 700, 350, 175, 526, 263, 790, 395, 1186, 593, 1780, 890, 445, 1336, 668, 334, 167, 502, 251, 754, 377, 1132, 566, 283, 850, 425, 1276, 638, 319, 958, 479, 1438, 719, 2158, 1079, 3238, 1619, 4858, 2429, 7288, 3644, 1822, 911, 2734, 1367, 4102, 2051, 6154, 3077, 9232, 4616, 2308, 1154, 577, 1732, 866, 433, 1300, 650, 325, 976, 488, 244, 122, 61, 184, 92, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1 400 : 200, 100, 50, 25, 76, 38, 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 376 : 188, 94, 47, 142, 71, 214, 107, 322, 161, 484, 242, 121, 364, 182, 91, 274, 137, 412, 206, 103, 310, 155, 466, 233, 700, 350, 175, 526, 263, 790, 395, 1186, 593, 1780, 890, 445, 1336, 668, 334, 167, 502, 251, 754, 377, 1132, 566, 283, 850, 425, 1276, 638, 319, 958, 479, 1438, 719, 2158, 1079, 3238, 1619, 4858, 2429, 7288, 3644, 1822, 911, 2734, 1367, 4102, 2051, 6154, 3077, 9232, 4616, 2308, 1154, 577, 1732, 866, 433, 1300, 650, 325, 976, 488, 244, 122, 61, 184, 92, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1 118 : 59, 178, 89, 268, 134, 67, 202, 101, 304, 152, 76, 38, 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 but It's not clear what is needed to be summed, the whole sequences or the number of elements in each sequence or ? 1 Link to comment

ToMKoL Posted January 19, 2020 Share Posted January 19, 2020 Read it carefully and try to understand. It looks complicated but shouldn't be. Almost all work is done by Kurapica. Now what is left is: Quote find for each number the amount of iterations required to reach 1, as if the number was used to start the sequence in the Collatz conjecture. The solution to the challenge is the sum of all the resulting numbers. Just count the number of iterations needed to reach 1 as in example. 298 - 24 iterations 498 - 48 iterations 108 - 114 iterations 400 - 27 iterations 376 - 107 iterations 118 - 33 iterations Now sum all iterations together and we have result. 24 + 48 +114 + 27 + 107 + 33 = 353 If I understood this riddle correctly then Your answer is 353. Try it and tell us if it worked. 1 Link to comment

BlackHat Posted January 19, 2020 Author Share Posted January 19, 2020 1 hour ago, ToMKoL said: Read it carefully and try to understand. It looks complicated but shouldn't be. Almost all work is done by Kurapica. Now what is left is: Just count the number of iterations needed to reach 1 as in example. 298 - 24 iterations 498 - 48 iterations 108 - 114 iterations 400 - 27 iterations 376 - 107 iterations 118 - 33 iterations Now sum all iterations together and we have result. 24 + 48 +114 + 27 + 107 + 33 = 353 If I understood this riddle correctly then Your answer is 353. Try it and tell us if it worked. Yes it worked !!! Link to comment

ToMKoL Posted January 20, 2020 Share Posted January 20, 2020 I'm glad that it worked for You. Link to comment

## Recommended Posts

## Create an account or sign in to comment

You need to be a member in order to leave a comment

## Create an account

Sign up for a new account in our community. It's easy!

Register a new account## Sign in

Already have an account? Sign in here.

Sign In Now