Math Wiki

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

4 October 2024

  • curprev 00:3400:34, 4 October 2024Jaseroach0129 talk contribs 1,447 bytes +88 No edit summary Tag: Visual edit
  • curprev 00:3000:30, 4 October 2024Jaseroach0129 talk contribsm 1,359 bytes +104 No edit summary Tag: Visual edit
  • curprev 00:2600:26, 4 October 2024Jaseroach0129 talk contribs 1,255 bytes +1,255 Created page with "The Modified Recursive Sum Sequence Problem (MRSSP): Steps: Define a sequence 𝑆 (𝑛) as follows: 1. Start with any positive integer 𝑛. 2. If 𝑛 is even, let the next number in the sequence be the sum of all digits of 𝑛. 3. If 𝑛 is odd, let the next number in the sequence be 3𝑛+1 4. Repeat the process indefinitely. Explanation: In the Modified Recursive Sum Sequence Problem (MRSSP), the behavior of the sequence can vary significantly depending..." Tag: Visual edit