This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Feedback from "El gran pregunton" !!!! | |
c = 0 | |
d = 0 | |
5001.times do | |
c += 1 | |
d = d + c | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Feedback from "El gran pregunton" !!!! | |
c = 0 | |
d = 0 | |
5001.times do | |
c += 1 | |
d = d + c | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
The following iterative sequence is defined for the set of positive integers: | |
n → n/2 (n is even) | |
n → 3n + 1 (n is odd) | |
Using the rule above and starting with 13, we generate the following sequence: | |
13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1 | |
It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. |
NewerOlder