Are There Simplification Rules for Modulo 1 Arithmetic?

  • Thread starter Thread starter svensl
  • Start date Start date
  • Tags Tags
    Arithmetic
Click For Summary
The discussion centers on the lack of simplification rules for modulo 1 arithmetic, particularly concerning the fractional parts of real numbers. Participants clarify that while modular arithmetic is well-documented for integers and certain cases like mod N, similar rules do not apply to mod 1. Specifically, operations such as multiplication do not yield straightforward simplifications, as demonstrated by examples provided. The conversation also touches on the distinction between integer and real number modular arithmetic, emphasizing the complexity of the latter. Participants express a desire for literature or resources that address these specific challenges in modulo 1 arithmetic.
svensl
Messages
5
Reaction score
0
I was wondering whether there are any simplification/rules when doing modulo 1 arithmetic.

For example: <a+b>*<c+d> = ? or <a+b>^2=?
Here, <> is the fractional part, i.e <4.2> = 0.2

There is plenty I could find on mod N arithmetic with n>1 but nothing on mod 1.

thanks for any tips.

Svensl
 
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
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

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