• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Modular arithmetic bo198214 Administrator Posts: 1,389 Threads: 90 Joined: Aug 2007 04/02/2010, 10:57 PM (04/02/2010, 07:16 PM)Stereotomy Wrote: $^{n}a\text{ mod }b= {}^{m}a\text{ mod }b$ $\text{For }^{n}a,{}^{m}a > b,\text{ }a,b,n,m \in \mathbb{N}$ Is this actually true? And if so is there a proof of it I'll be able to wrap my mind around? I dont think it is true. For example: $7^7 \text{mod} 5 = 3\neq 2 = 7 \text{mod} 5$ « Next Oldest | Next Newest »

 Messages In This Thread Modular arithmetic - by Stereotomy - 04/02/2010, 07:16 PM RE: Modular arithmetic - by bo198214 - 04/02/2010, 10:57 PM RE: Modular arithmetic - by Stereotomy - 04/03/2010, 12:18 AM RE: Modular arithmetic - by bo198214 - 04/03/2010, 12:00 PM

 Possibly Related Threads... Thread Author Replies Views Last Post [rule 30] Is it possible to easily rewrite rule 30 in terms of modular arithmetic ? tommy1729 0 2,023 07/24/2014, 11:09 PM Last Post: tommy1729 Generalized arithmetic operator hixidom 16 17,134 06/11/2014, 05:10 PM Last Post: hixidom Tetration and modular arithmetic. tommy1729 0 2,607 01/12/2014, 05:07 AM Last Post: tommy1729 modular tetration tommy1729 0 2,929 12/26/2010, 10:11 PM Last Post: tommy1729 Arithmetic in the height-parameter (sums, series) Gottfried 7 12,714 02/06/2010, 12:52 AM Last Post: bo198214

Users browsing this thread: 1 Guest(s)