Are There Simplification Rules for Modulo 1 Arithmetic?

  • Context: Undergrad 
  • Thread starter Thread starter svensl
  • Start date Start date
  • Tags Tags
    Arithmetic
Click For Summary

Discussion Overview

The discussion revolves around the rules and simplifications applicable to modulo 1 arithmetic, particularly in the context of real numbers and their fractional parts. Participants explore the differences between modulo 1 and modulo N arithmetic, seeking to understand whether similar simplification rules exist for operations involving fractional parts.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

Areas of Agreement / Disagreement

Participants generally agree that the arithmetic of reals modulo 1 differs fundamentally from that of integers modulo N, but no consensus is reached on specific simplification rules for modulo 1 operations.

Contextual Notes

Participants note the limitations of existing knowledge regarding simplifications in modulo 1 arithmetic, particularly in relation to multiplication and the application of rules from modulo N arithmetic.

Mathematics news on Phys.org
mattmns, read his post, he's obviously not just talking about integers. He's talking about the reals modulo 1, i.e. arithmetic of the fractional parts of reals.

svensl, what do you mean by "simplification rules"? For example, what could you find on mod N arithmetic?
 
AKG said:
mattmns, read his post, he's obviously not just talking about integers. He's talking about the reals modulo 1, i.e. arithmetic of the fractional parts of reals.

Woops! :redface: I knew I had to be missing something, sorry.
 
Thanks for the reply.

With modulo N arithmetic I was referring to:
http://en.wikipedia.org/wiki/Modular_arithmetic for example.

If N=12 as in hour clock system, I could say that (13 mod 12)*(14 mod 12) = 2 = ((13*14) mod 12) = 2. This I meant by simplification. However, these rules do not work for cases for mod 1. So, (1.222 mod 1)*(5.111 mod 1) is not equal to ((0.222*0.111) mod 1). I was wondering whether there are rules for this sort of thing.

For example, I can write <a + b > = <<a>+<b>>. Again <> stands for mod 1.
Or, <-a> = 1 - <a>.

Are there any for multiplication?

thanks,
svensl
 
If N=12 as in hour clock system, I could say that (13 mod 12)*(14 mod 12) = 2 = ((13*14) mod 12) = 2. This I meant by simplification. However, these rules do not work for cases for mod 1. So, (1.222 mod 1)*(5.111 mod 1) is not equal to ((0.222*0.111) mod 1).

Yes but it's not the difference between "1" and "12" that's operating here, it's the far more fundamental difference that in one case you're doing modulo arithmetic over the integers and in the other case you're doing it over the reals.

Try doing modulo 12 arithmetic over the reals and see how many of those results still hold.
 
Thanks for pointing this out uart.

Do you know of any literature which talks about mod 1? There is a wealth of literature on equidistributed mod 1 sequences, number theory, ergodic theory...but I have not found helping me whith my problem.

Cheers,
svensl
 

Similar threads

  • · Replies 35 ·
2
Replies
35
Views
4K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K