Theorem of mutations in a numeral sequence

  • Context: Undergrad 
  • Thread starter Thread starter dimension10
  • Start date Start date
  • Tags Tags
    Sequence Theorem
Click For Summary
SUMMARY

The discussion centers on the interpretation of a theorem related to mutations in numeral sequences, specifically addressing the statement 'no matter what the X and Y sequences are n-n2.' Participants express confusion regarding the notation and its implications, particularly when n equals n2. The need for clearer communication of the theorem is emphasized, with suggestions for rephrasing to enhance understanding. The example mutation ABCDE->BAECD is cited as a point of contention, highlighting the complexities involved in the theorem's application.

PREREQUISITES
  • Understanding of numeral sequences and their properties
  • Familiarity with mathematical notation and terminology
  • Basic knowledge of mutation processes in sequences
  • Experience with theorem formulation and proof techniques
NEXT STEPS
  • Research the formal definition of mutations in numeral sequences
  • Study the implications of the notation n-n2 in mathematical contexts
  • Explore examples of theorem communication in mathematical papers
  • Investigate common pitfalls in sequence mutation examples
USEFUL FOR

Mathematicians, educators, and students interested in numerical sequences and theorem formulation will benefit from this discussion, particularly those seeking clarity in complex mathematical concepts.

dimension10
Messages
371
Reaction score
0
I have observed a strange thing when you modify a sequence of numbers bit by bit.
 

Attachments

Physics news on Phys.org
I have read your paper, but I am a bit perplexed by the last line:

'You will notice that no matter what the X and Y sequences are n-n2.'

What do you mean by this? If you mean that the sequences are of length n - n2, then this is not true as n = n2 = 3 in your example.

I am always interested in theorems regarding numerical strings, but I feel that your paper did not quite convey the theorem you are wanting to give us.

Any way you can simply write out the theorem without any example? If not, maybe rephrase your last line/paragraph to better explain this.

Ben
 
BWElbert said:
I have read your paper, but I am a bit perplexed by the last line:

'You will notice that no matter what the X and Y sequences are n-n2.'

What do you mean by this? If you mean that the sequences are of length n - n2, then this is not true as n = n2 = 3 in your example.

I am always interested in theorems regarding numerical strings, but I feel that your paper did not quite convey the theorem you are wanting to give us.

Any way you can simply write out the theorem without any example? If not, maybe rephrase your last line/paragraph to better explain this.

Ben

I think he meant n = n2 not n-n2
Edit but that can't be right since it dosn't work for the mutation ABCDE->BAECD.
 
Last edited:

Similar threads

  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
8
Views
2K
  • · Replies 41 ·
2
Replies
41
Views
4K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K