Jump to content



Photo
- - - - -

Anyway To Calculate Remainder?

Started by Mankul , Apr 16 2006 06:31 AM

  • Please log in to reply
23 replies to this topic

#1 Mankul

Mankul

    Newbie

  • Members
  • Pip
  • 2 posts

  • Calculators:
    fx-991MS S-V.P.A.M.

Posted 16 April 2006 - 06:31 AM

I'm taking a module on mod and congruency, primitive roots and index arithmetic.

Finding out remainders is a standard thing to do but is there a function to find out remainders?

I dont' think the simplied fraction to the lowest term is useful for big and high powered numbers.

Is there a way to do it on the fx-991MS S-V.P.A.M. calculator?

the link to the manual is here: http://ftp.casio.co....5MS_991MS_E.pdf


Thanks

#2 Guest_Guest_*

Guest_Guest_*
  • Guests

Posted 19 April 2006 - 10:09 AM

I'm taking a module on mod and congruency, primitive roots and index arithmetic.

Finding out remainders is a standard thing to do but is there a function to find out remainders?

I dont' think the simplied fraction to the lowest term is useful for big and high powered numbers.

Is there a way to do it on the fx-991MS S-V.P.A.M. calculator?

the link to the manual is here: http://ftp.casio.co....5MS_991MS_E.pdf
Thanks


Yes, it is very easy ...

OriginalValue - Int(OriginalValue/Divisor)*Divisor

#3 Mankul

Mankul

    Newbie

  • Members
  • Pip
  • 2 posts

  • Calculators:
    fx-991MS S-V.P.A.M.

Posted 19 April 2006 - 11:04 AM

Yes, it is very easy ...

OriginalValue - Int(OriginalValue/Divisor)*Divisor



pardon my ignorance but which buttons do I actualy have to press to create that function ?

#4 Guest_Guest_*

Guest_Guest_*
  • Guests

Posted 19 April 2006 - 11:59 AM

pardon my ignorance but which buttons do I actualy have to press to create that function ?


duh - The ones on the front :huh:

#5 Guest_samuel_*

Guest_samuel_*
  • Guests

Posted 19 April 2006 - 02:15 PM

Using the algorithm Original-Int(Original/divisor)*divisor

First you calculate Original/divisor; See what is the integer part
Then use the integer part to multiplies with the divisor. Finally Use the original to subtract the products.

For example, say to find remainder when 73 is divided by 8

So you find 73/8 = 9.125, and the integer part is 9.
Now find 9*8=72
So your remainder is 73-72=1

OK? :)

#6 Guest_Fatu_*

Guest_Fatu_*
  • Guests

Posted 02 July 2006 - 10:11 PM

Sorry, but i couldn't find the int button in the front pad. I understand that the question is if there exists an "int" function or "mod" function in this calculator model..., or at least a simple way to emulate it... ?

#7 Andy.Davies

Andy.Davies

    Forum Ghost

  • [Legends]
  • PipPipPipPipPipPipPipPip
  • 1547 posts
  • Gender:Male
  • Location:Dorset, England
  • Interests:Age: 18
    Studying: MEng in cybernetics at Reading uni
    Interests: Progaming (VB, VB.Net, C#, Casio Basic)
    Computers UBBD (Using, Building, Breaking & Destroying)
    Gaming (FPS, RTS, RPG)
    Electronics
    Rock Music (Preferably Loud)
    Riley's (Pool & Snooker Bar)
    Driving (Preferably fast)
    Aikedo (Martial Art)

  • Calculators:
    Algebra FX 2.0 ROM 1.01, FX9750G

Posted 03 July 2006 - 05:55 PM

it isnt in the front pad, INT is in OPTN > NUM on the calc

#8 Scratty

Scratty

    Casio Freak

  • Members
  • PipPipPipPip
  • 107 posts
  • Location:Mom's womb.
  • Interests:Medieval lifestyle, arms and armour. European medieval longsword fencing and martial arts. Amateur rocketry. Programming (graphics, games, hw-near programming, parsing). Oil-painting/drawing. Computer Graphics (modeling, animation, animation production). Screen-play writing. Juggling. Playing the guitar (jazz preferrably).

  • Calculators:
    CFX-9950G

Posted 04 July 2006 - 08:59 AM

So, it doesn't have a Frac command? Otherwise it's just den*Frac(num/den) if memory serves.

#9 samuel

samuel

    Casio Fan

  • Members
  • PipPip
  • 37 posts

  • Calculators:
    CP300, FX-9860G, CFX-9850GB+, FX-991ES, AFX-2.0+

Posted 04 July 2006 - 09:31 AM

I think you have mis interpret the original question...it was about finding remainder on the scientific calc 991MS or 991ES, not CFX or FX series. Those options you have suggested would not work.

To find the remainder on 991MS we should use the algorithm. 991MS is not programmable and has no INT or FRAC functions.

#10 TyYann

TyYann

    Casio Freak

  • Members
  • PipPipPipPip
  • 107 posts
  • Gender:Male
  • Location:Seoul, South Korea

  • Calculators:
    Casio fx-4000P (since 1988)
    Casio CFX-9850GB PLUS
    Sharp EL-9900
    Casio fx-9860G SD
    Casio fx-9860GII SD
    Casio Graph 90+E
    TI-83 Premium CE (no Python)
    and a 25-column abacus...

Posted 04 July 2006 - 06:10 PM

[Mode] <span class=1' /> (Fix) [0]
original [/] divisor [=]
<span class=Shift' /> [Rnd]
[-] original [/] divisor [=]
<span class=×' /> divisor [=]
<span class=Shift' /> [Rnd]
[0] [-] <span class=Shift' /> [Ans] [=]

Should make it. The idea is to use Rnd and Fix 0 to get the integer part.

The [0] [-] <span class=Shift' /> [Ans] [=] part is to get the sign right.

Nice challenge ;)

#11 James Bond 007

James Bond 007

    Newbie

  • Members
  • Pip
  • 6 posts
  • Location:Hong Kong

  • Calculators:
    Casio : FX-3650P / 3950P / 570MS / 991MS / 82ES / 991ES, FX-9860G SD / Algebra FX 2 Plus,, Hewlett Packard : HP-15C / 20S / 30S / 32SII / 33S / 40G / 48GII / 49G+,, Texas Instruments : TI-66 / 86 / 89 / 89 Titanium,, Sharp : EL-506V / 506W / 520W / 5250,, Citizen : SRP-175 / 285II,, Canon : F-803P

Posted 01 August 2006 - 12:33 PM

I'm taking a module on mod and congruency, primitive roots and index arithmetic.

Finding out remainders is a standard thing to do but is there a function to find out remainders?

I dont' think the simplied fraction to the lowest term is useful for big and high powered numbers.

Is there a way to do it on the fx-991MS S-V.P.A.M. calculator?

the link to the manual is here: http://ftp.casio.co....5MS_991MS_E.pdf
Thanks


May be a little late but how about this method?

Press MODE MODE 3 to enter BASE mode. Press DEC if necessary. The calculator should show d.

Now suppose you want to find the remainder when 24 is divided by 5. You would press 24 - 24 ? 5 X 5 =
The calculator should show the remainder 4.

In BASE mode the calculator automatically performs integer division. This is also true on the FX-3650P/3950P and you can use this property in writing programs.

Press MODE 1 to return to COMP mode.

#12 Guest_blabla_*

Guest_blabla_*
  • Guests

Posted 20 November 2007 - 04:16 PM

hey.............

I can't use anyone cos my number is too big like 88^7 mod 187.....
So how to do?

#13 Guest_ujazz_*

Guest_ujazz_*
  • Guests

Posted 10 March 2008 - 04:56 AM

Well, you could use the repeated squaring algorithm to simplify the calculation a bit

http://web.ew.usna.e...ook/node27.html

#14 Guest_vh_*

Guest_vh_*
  • Guests

Posted 01 October 2008 - 08:47 PM

The Rnd function doesn't work, thats all, folks.

#15 Guest_Naman Srivastava_*

Guest_Naman Srivastava_*
  • Guests

Posted 30 December 2008 - 05:33 PM

I'm taking a module on mod and congruency, primitive roots and index arithmetic.

Finding out remainders is a standard thing to do but is there a function to find out remainders?

I dont' think the simplied fraction to the lowest term is useful for big and high powered numbers.

Is there a way to do it on the fx-991MS S-V.P.A.M. calculator?

the link to the manual is here: http://ftp.casio.co....5MS_991MS_E.pdf


Thanks


#16 Guest_Naman Srivastava_*

Guest_Naman Srivastava_*
  • Guests

Posted 30 December 2008 - 05:39 PM

Sorry folks i posted the query agn by mistake..

Actually i was telling the solution to fing mod of any number on fx991MS Calculator.

its simple

Change the display to a b/c
and divide the no using the fraction symbol.
For Exampel

30/13 = 2 4/13

and there u go.... 4 is ur remainder !!!

#17 Guest_Nicholas_*

Guest_Nicholas_*
  • Guests

Posted 20 November 2009 - 03:54 AM

Good try but calculators always simplify fractions, so if the fraction part is 4/6 it will show 2/3 instead which will make this method have as many steps to compute as some of the other methods mentioned

#18 Guest_Rino_*

Guest_Rino_*
  • Guests

Posted 24 May 2010 - 11:48 AM

Using the algorithm Original-Int(Original/divisor)*divisor

First you calculate Original/divisor; See what is the integer part
Then use the integer part to multiplies with the divisor. Finally Use the original to subtract the products.

For example, say to find remainder when 73 is divided by 8

So you find 73/8 = 9.125, and the integer part is 9.
Now find 9*8=72
So your remainder is 73-72=1

OK? :)


#19 Guest_Rino_*

Guest_Rino_*
  • Guests

Posted 24 May 2010 - 11:49 AM

thanx a lot 4 this ....!!!!!

#20 Guest_b.kaarthick_*

Guest_b.kaarthick_*
  • Guests

Posted 25 October 2010 - 05:45 AM

Yes, it is very easy ...

OriginalValue - Int(OriginalValue/Divisor)*Divisor

its wrong

#21 Guest_Guest_*

Guest_Guest_*
  • Guests

Posted 25 October 2010 - 05:47 AM


#22 Guest_Sagar_*

Guest_Sagar_*
  • Guests

Posted 08 December 2010 - 01:16 PM

there is one button ab/c beneath CALC... if u want to calculate 7 mod 4 then... u should press 7 then ab/c 4 and equal to
1, 3 ,4 which is 4*1=4 and 7-4=3 remainder...

#23 Guest_Felix_*

Guest_Felix_*
  • Guests

Posted 01 February 2011 - 04:25 PM

Do it this way:

if you want to round with 2 digits after the comma

int (number * 100) / 100

with 3 digits after comma:

int (number * 1000) / 1000 and so on

#24 Guest_Mahesh_*

Guest_Mahesh_*
  • Guests

Posted 23 May 2011 - 02:48 PM

there is no separate key as such..
but ders a "a b/c" button near top left corner..
after finding say 7/3.. press that "a b/c" , so the answer will be the "b" value.. (here ans =4) that is the middle value..

8/4 gives 2, that is no decimal value, then mod value is 0..
Back to Casio CFX/AFX/FX/Prizm

1 user(s) are reading this topic

0 members, 1 guests, 0 anonymous users

  1. Universal Casio Forum
  2. → Calculators
  3. → Casio CFX/AFX/FX/Prizm
  4. Privacy Policy
  5. Forum Rules ·