Is there any way to do modular arithmetic on a ti-84+se? i mean, a built in command.

not to sound increadably stupid, but what is "modular arithmetic"

its basically the remainder of a division say, 24/12=2 r 0, so 24 mod 12=0,

and 24/11=2 r 2, so 24 mod 11= 2.

addition is the same thing, sort of, like a clock.

(24 hour clock) 13:00=1:00 PM→ 13 mod 12=1

5:00AM + 10 hours= 15:00→ 15 mod 12= 3:00 PM

Visit Calccrypto for info on crypto

KC2ZOF

No built-in command, but you can usually use MfPart(A/M) for A mod M — unless A can be negative, in which case you need A-Mint(A/M).

is there a way to ask ti to put mod( into the next version of tios? that'll be useful

Visit Calccrypto for info on crypto

KC2ZOF

I think Omnicalc has a modular arithmic token in it.

But i'm not sure.

I know it has things like Gama and such

yeah it does, but it would be cooler if the 83/84s had them on their own

Visit Calccrypto for info on crypto

KC2ZOF

Remainder(A,M) would iff A is positive.

However I'd like to have A Mod M work for even negative numbers. Like for example -242 Mod 13.

How would I do this in a calculator? Or even yet, how would I program a function that will do this?

Quoting above:

A-Mint(A/M)

This performs A mod M. Since only the new OSes have the remainder( function, using the A-Mint(A/M method is probably the best :)

47%? Take a look and try to imagine how cool 100% will be. This has won zContest 2011 and made news on TICalc. This compromise between Assembly and BASIC parses like BASIC and is fast like assembly. Grammer 2