Modular Arithmetic: Explained and Proven

  • Thread starter davon806
  • Start date
  • Tags
    Arithmetic
In summary, the conversation discussed the properties of modular arithmetic and how they apply to different types of numbers. The addition property can be applied to all real numbers, while the multiplicative property only holds for integers. A mathematical proof was provided to explain this, and a counterexample was mentioned for when the a's and b's are real numbers. The conversation also touched on the possibility of the multiplicative property holding for rational numbers in certain cases.
  • #1
davon806
148
1
Please see the attached,which was quoted from the following website:
http://en.wikipedia.org/wiki/Modular_arithmetic

It said that the multiplicative property is only applicable if n is an integer.On the contrary,the addition property can be applied to all real numbers.
I don't quite understand what this sentence means.Can anyone explain it to me?Any mathematical proof provided will be appreciated.
Thanks.
 

Attachments

  • ???.png
    ???.png
    9.2 KB · Views: 446
Mathematics news on Phys.org
  • #2
Well suppose all [tex]a_1,a_2,b_1,b_2,n[/tex] are real numbers and that
[tex]a_1=b_1 (mod n)[/tex]
[tex]a_2=b_2 (mod n)[/tex]
then by the definition of mod n equality we can conclude that there exist integers [tex]k_1,k_2[/tex] such that [tex]a_1-b_1=k_1n , a_2-b_2=k_2n[/tex]
so by adding the last 2 equations we have [tex](a_1+a_2)-(b_1+b_2)=(k_1+k_2)n[/tex] therefore there exists the integer [tex]k_3=k_1+k_2[/tex] such that [tex](a_1+a_2)-(b_1+b_2)=(k_3)n[/tex] hence by definition of (mod n) equality this means that [tex](a_1+a_2)=(b_1+b_2) (mod n)[/tex]. As you see in the proof we don't need anything of the a's or b's or the n to be integer.

However if we want to prove that [tex]a_1a_2=b_1b_2 (mod n) (1)[/tex] we going to need a's and b's as well n to be integers because the proof goes like this:
[tex]a_1a_2-a_1b_2-b_1a_2+b_1b_2=k_1k_2n^2[/tex] so n has to be integer in order for [tex](a_1a_2+b_1b_2)=(a_1b_2+b_1a_2) (mod n) (2)[/tex] . We will also need a's and b's to be integers in order to prove that [tex]a_1b_2=b_1b_2 (mod n) (3.1) b_1b_2=b_1a_2 (mod n) (3.2)[/tex] hold. From (2) and (3)s we can infer the (1).
 
Last edited:
  • #3
Why did a1a2−a1b2−b1a2+b1b2=k1k2n2?
 
  • #4
By multiplying [tex]a_1-b_1=k_1n , a_2-b_2=k_2n[/tex] together. I have omitted some steps cause it isn't allowed here to give too much help with homework.

Eventually to prove why (1) doesn't hold if all a's and b's and n are real, you ll have to construct a counter example. I just pinpointed where the proof goes wrong if a's and b's and n arent all integers, but one could claim that there might be another proof specific made for when a's and b's and n are reals.
 
Last edited:
  • #5
Sorry,please see the attached,I came up with a contradiction while proving the above.If my proof is correct,then the multiplicative property can be applied to rational numbers,so there must be something wrong but I couldn't find it.Thx very much
 

Attachments

  • IMG_1533.JPG
    IMG_1533.JPG
    40.4 KB · Views: 415
  • IMG_1534.JPG
    IMG_1534.JPG
    33.4 KB · Views: 438
  • #6
The final expression for a1a2-b1b2 should have k1 inside as well and not only k2. Anyway it seems for specific a's and b's that satisfy some extra equations, the multiplicative property could hold for those specific rationals , but you want to hold for every rational in order to be usefull.
 
  • #7
thx for your help
 
  • #8
You are welcome :)
 

What is modular arithmetic?

Modular arithmetic, also known as clock arithmetic, is a mathematical system that deals with integers and their remainders when divided by a fixed number called the modulus. It is often used to calculate time, dates, and to encrypt data in computer science.

What is the purpose of modular arithmetic?

The main purpose of modular arithmetic is to simplify calculations involving large numbers and to make it easier to work with cyclical patterns. It is also used in various fields such as cryptography, coding theory, and computer science.

How is modular arithmetic performed?

To perform modular arithmetic, you take the given number and divide it by the modulus. The remainder is the result of the modular operation. For example, 17 modulo 5 would be 2, because 17 divided by 5 is 3 with a remainder of 2.

What are some real-life applications of modular arithmetic?

Modular arithmetic has many practical applications. It is used to calculate time, such as determining what day of the week a particular date falls on. It is also used in cryptography to encrypt and decrypt data, and in coding theory to detect and correct errors in data transmission. In computer science, modular arithmetic is used in programming and algorithms for efficient calculations.

How is modular arithmetic related to algebra?

Modular arithmetic is closely related to algebra, as it involves manipulating numbers and performing operations on them. It follows the same rules as regular arithmetic, except that the operations are performed on the remainders instead of the actual numbers. This allows for simpler calculations and makes it easier to solve equations involving large numbers.

Similar threads

  • Science and Math Textbooks
Replies
6
Views
1K
Replies
33
Views
5K
  • Set Theory, Logic, Probability, Statistics
Replies
21
Views
1K
  • Beyond the Standard Models
Replies
7
Views
4K
Replies
9
Views
4K
Replies
8
Views
2K
  • Topology and Analysis
Replies
2
Views
2K
Replies
3
Views
1K
  • Programming and Computer Science
Replies
29
Views
3K
  • STEM Academic Advising
Replies
9
Views
1K
Back
Top