modulus - Developer IT

Mathematical modulus in c#

- by penguat

Is there a library function in c# for the mathematical modulus of a number - by this I specifically mean that a negative integer modulo a positive integer should yield a positive result.

I don't really understand how modulus division works. I was calculating 27 % 16 and wound up with 11 and I don't understand why. I can't seem to find an explanation in layman's terms online. Can someone elaborate on a very high level as to what's going on here? EDIT: Thanks for all your answers. You guys are incredibly quick. It all makes sense now.

Read the article

Better ways to implement a modulo operation (algorithm question)

- by ryxxui

I've been trying to implement a modular exponentiator recently. I'm writing the code in VHDL, but I'm looking for advice of a more algorithmic nature. The main component of the modular exponentiator is a modular multiplier which I also have to implement myself. I haven't had any problems with the multiplication algorithm- it's just adding and shifting and I've done a good job of figuring out what all of my variables mean so that I can multiply in a pretty reasonable amount of time. The problem that I'm having is with implementing the modulus operation in the multiplier. I know that performing repeated subtractions will work, but it will also be slow. I found out that I could shift the modulus to effectively subtract large multiples of the modulus but I think there might still be better ways to do this. The algorithm that I'm using works something like this (weird pseudocode follows): result,modulus : integer (n bits) (previously defined) shiftcount : integer (initialized to zero) while( (modulus<result) and (modulus(n-1) != 1) ){ modulus = modulus << 1 shiftcount++ } for(i=shiftcount;i>=0;i++){ if(modulus<result){result = result-modulus} if(i!=0){modulus = modulus << 1} } So...is this a good algorithm, or at least a good place to start? Wikipedia doesn't really discuss algorithms for implementing the modulo operation, and whenever I try to search elsewhere I find really interesting but incredibly complicated (and often unrelated) research papers and publications. If there's an obvious way to implement this that I'm not seeing, I'd really appreciate some feedback.

Read the article

How do I do modulus in C++?

- by user161190

How do I perform a mod operation between two integers in C++?

Read the article

Why is modulus different in different programming languages?

- by boost

Perl print 2 % -18; -- -16 Tcl puts [expr {2 % -18}] -- -16 but VBScript wscript.echo 2 mod -18 -- 2 Why the difference?

Read the article

Changing video resolution with Handbrake - anamorphic and modulus parameter

- by MarAja

I would like to convert a video in 16:9 format (1920*1080) to a 4:3 format (640*480) with Handbrake. Can anyone explain me what are anamorphic and modulus parameters? I tried to set modulus to 2 or 16 on a video but I can't really see the difference between both videos. I would also know if there are different algorithms to change a video resolution and if I am doing it in the right way. Bonus question: What are PAR width and height? They are set by default to 1, should I change them?

Read the article

Algorithm to add two digits to the end of a number to calculate a specific modulus?

- by Jim

So, lets say I have a number 123456. 123456 % 97 = 72. How can I determine what two digits need to be added to the end of 123456 such that the new number % 97 = 1? Note--it must always be two digits. For example, 12345676 % 97 = 1. In this case, I need to add the digits "76" to the end of the number. (This is for IBAN number calculation.)

Read the article

Code-Golf: Modulus Divide

- by thyrgle

Challenge: Without using the modulus divide operator provided already by your language, write a program that will take two integer inputs from a user and then displays the result of the first number modulus divided number by the second number. Example: Input of first number:2 Input of second number:2 Result:0 Who wins: In case you don't know how Code Golf the winner is the person who writes this program in the least amount of characters.

Read the article

Most optimized way to calculate modulus in C

- by hasanatkazmi

I have minimize cost of calculating modulus in C. say I have a number x and n is the number which will divide x when n == 65536 (which happens to be 2^16): mod = x % n (11 assembly instructions as produced by GCC) or mod = x & 0xffff which is equal to mod = x & 65535 (4 assembly instructions) so, GCC doesn't optimize it to this extent. In my case n is not x^(int) but is largest prime less than 2^16 which is 65521 as I showed for n == 2^16, bit-wise operations can optimize the computation. What bit-wise operations can I preform when n == 65521 to calculate modulus.

Read the article

How do I use modulus for float/double?

- by ShrimpCrackers

I'm creating an RPN calculator for a school project. I'm having trouble with the modulus operator. Since we're using the double data type, modulus won't work on floating point numbers. For example, 0.5 % 0.3 should return 0.2 but I'm getting a division by zero exception. The instruction says to use fmod(). I've looked everywhere for fmod(), including javadocs but I can't find it. I'm starting to think it's a method I'm going to have to create? edit: hmm, strange. I just plugged in those numbers again and it seems to be working fine...but just in case. Do I need to watch out using the mod operator in Java when using floating types? I know something like this can't be done in C++ (I think).

Read the article

How to determine the modulus of a Float in Ada 95

- by mat_geek

I need to determine the amount left of a time cycle. To do that in C I would use fmod. But in ada I can find no reference to a similar function. It needs to be accurate and it needs to return a float for precision. So how do I determine the modulus of a Float in Ada 95? elapsed := time_taken mod 10.348; left := 10.348 - elapsed; delay Duration(left);

Read the article

Analyzing Python Code: Modulus Operator

- by Bhubhu Hbuhdbus

I was looking at some code in Python (I know nothing about Python) and I came across this portion: def do_req(body): global host, req data = "" s = socket.socket(socket.AF_INET, socket.SOCK_STREAM) s.connect((host, 80)) s.sendall(req % (len(body), body)) tmpdata = s.recv(8192) while len(tmpdata) > 0: data += tmpdata tmpdata = s.recv(8192) s.close() return data This is then called later on with body of huge size, as in over 500,000 bytes. This is sent to an Apache server that has the max request size on the default 8190 bytes. My question is what is happening at the "s.sendall()" part? Obviously the entire body cannot be sent at once and I'm guessing it is reduced by way of the modulus operator. I don't know how it works in Python, though. Can anyone explain? Thanks.

Read the article

Modulus PHP Problem

- by Eli

I have a problem, I am trying to calculate what the lowest prime is of a number but I do not understand the result that PHP is giving me. If I have this number $number = 600851475143; Then I modulus it: $primes = array( 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97); foreach($primes as $key=>$value) { if($number % $value == 0 ) {echo $value; break; } } Why is it that $value = 3? If $value = 3, that means that 600851475143 / 3 should be an integer, but its not. So I do not understand why that if() evaluates to true?

Read the article

Cleaner/more effective way to use modulus and creating columned lists

- by WmasterJ

I currently have a list (<ul>) of people that I have divided up into two columns. But after finishing the code for it I keept wondering if there is a more effective or clean way to do the same thing. echo "<table class='area_list'><tr>"; // Loop users within areas, divided up in 2 columns $count = count($areaArray); for($i=0 ; $i<$count ; $i++) { // get the modulus value + ceil for uneven numbers $rowCalc = ($i+1) % ceil($count/2); if ($rowCalc == 1) echo "<td><ul>"; // OUTPUT the actual list item echo "<li>{$users[$uid]->profile_lastname}</li>"; if ($rowCalc == 0 && $i!=0) echo "</ul></td>"; } echo "</table>"; Any ideas of how to make this cleaner or do it in another way?

Read the article

Cleaner way of using modulus for columns

- by WmasterJ

I currently have a list (<ul>) of people that I have divided up into two columns. But after finishing the code for it I keept wondering if there is a more effective or clean way to do the same thing. echo "<table class='area_list'><tr>"; // Loop users within areas, divided up in 2 columns $count = count($areaArray); for($i=0 ; $i<$count ; $i++) { $uid = $areaArray[$i]; // get the modulus value + ceil for uneven numbers $rowCalc = ($i+1) % ceil($count/2); if ($rowCalc == 1) echo "<td><ul>"; // OUTPUT the actual list item echo "<li>{$users[$uid]->profile_lastname}</li>"; if ($rowCalc == 0 && $i!=0) echo "</ul></td>"; } echo "</tr></table>"; Any ideas of how to make this cleaner or do it in another way?

Read the article

PHP - Large Interger mod calculation

- by Kami

I need to calculate modulus with large number like : <?php $largenum = 95635000009453274121700; echo $largenum % 97; ?> It's not working... beacause $largenum is too big for an int in PHP. Any idea how to do this ?

Read the article

Find multiples of a number in PHP

- by dotty

Hay i need help. I want to find all muliples of a number in PHP. I'm using something like this if($count != 20 ) to work out if $count is not equal to 20. but i also need this script to check if $count is not equal to 20,40,60,80,100,120,140,160 etc. Any ideas? I think i need to use the modulus symbol (%), but i don't know. Thanks

Read the article

How to find the remainder of large number division in C++?

- by Beelzeboul

Hello, I have a question regarding modulus in C++. What I was trying to do was divide a very large number, lets say for example, M % 2, where M = 54,302,495,302,423. However, when I go to compile it says that the number is to 'long' for int. Then when I switch it to a double it repeats the same error message. Is there a way I can do this in which I will get the remainder of this very large number or possibly an even larger number? Thanks for your help, much appreciated.

Read the article

If I'm using a 1d array to represent a square board, how can I take my index and check the sqaures a

- by FrankTheTank

If I have a 4x4 gameboard which I'm representing in my program as a 1d integer array of size 16. How can I get the indexs of the squares above, below, to the left and to the right any given index? So, for example: A = { 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 } Which represents this board 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Lets say I am currently on index #8 in the board (value = 7). How can I get the index for 4 (value = 3) , 5 (value = 6), 10 (value = 11) and realize that there is no right square because it is on the right hand edge of the board. I know I need to use some modulus math but I'm failing to come up with the right way to get the indexes for adjacent squares. I'm thinking something like... if ((i % 4) + 1 < 3) right = i + 1; if ((i % 4) - 1 > 0) left = i - 1; if ((i % 4) + 4 < 15) bottom = i + 4; if ((i % 4) - 4 > 0 ) top = i - 4; Does this seem like it is the right approach?

Read the article

need to print 5 column list in alpha order, vertically

- by Brad

Have a webpage that will be viewed by mainly IE users, so CSS3 is out of the question. I want it to list like: A D G B E H C F I Here is the function that currently lists like: A B C D E F G H I function listPhoneExtensions($group,$group_title) { $adldap = new adLDAP(); $group_membership = $adldap->group_members(strtoupper($group),FALSE); sort($group_membership); print " <a name=\"".strtolower($group_title)."\"></a> <h2>".$group_title."</h2> <ul class=\"phone-extensions\">"; foreach ($group_membership as $i => $username) { $userinfo = $adldap->user_info($username, array("givenname","sn","telephonenumber")); $displayname = "".substr($userinfo[0]["sn"][0],0,9).", ".substr($userinfo[0]["givenname"][0],0,9)."".$userinfo[0]["telephonenumber"][0].""; if($userinfo[0]["sn"][0] != "" && $userinfo[0]["givenname"][0] != "" && $userinfo[0]["telephonenumber"][0] != "") { print "<li>".$displayname."</li>"; } } print "</ul><a href=\"#top\" class=\"link-to-top\">↑ top</a>"; } Example rendered html: <ul class="phone-extensions"> <li>Barry Bonds8281</li> <li>Gerald Clark8211</li> <li>Juan Dixon8282</li> <li>Omar Ebbs8252</li> <li>Freddie Flank2281</li> <li>Jerry Gilmore4231</li> <li>Kim Moore5767</li> <li>Barry Bonds8281</li> <li>Gerald Clark8211</li> <li>Juan Dixon8282</li> <li>Omar Ebbs8252</li> <li>Freddie Flank2281</li> <li>Jerry Gilmore4231</li> <li>Kim Moore5767</li> <li>Barry Bonds8281</li> <li>Gerald Clark8211</li> <li>Juan Dixon8282</li> <li>Omar Ebbs8252</li> <li>Freddie Flank2281</li> <li>Jerry Gilmore4231</li> <li>Kim Moore5767</li> </ul> Any help is appreciated to getting it to list alpha vertically.

Read the article

Weird Objective-C Mod Behavior

- by coneybeare

So I thought that negative numbers, when mod'ed should be put into positive space... I cant get this to happen in objective-c I expect this: -1 % 3 = 2 0 % 3 = 0 1 % 3 = 1 2 % 3 = 2 But get this -1 % 3 = -1 0 % 3 = 0 1 % 3 = 1 2 % 3 = 2 Why is this and is there a workaround?

Read the article

"Nearly divisible"

- by bobobobo

I want to check if a floating point value is "nearly" a multiple of 32. E.g. 64.1 is "nearly" divisible by 32, and so is 63.9. Right now I'm doing this: #define NEARLY_DIVISIBLE 0.1f float offset = fmodf( val, 32.0f ) ; if( offset < NEARLY_DIVISIBLE ) { // its near from above } // if it was 63.9, then the remainder would be large, so add some then and check again else if( fmodf( val + 2*NEARLY_DIVISIBLE, 32.0f ) < NEARLY_DIVISIBLE ) { // its near from below } Got a better way to do this?

Read the article

Implementing the modulo operator as a function in C

- by Yktula

How can we implement the modulo operator as a function in C without using the operator?

Read the article

How can I do mod without a mod operator?

- by tladuke

This silly scripting language doesn't have a % or Mod(). I do have a Fix() that chops off the decimal part of a number. I only need positive results, so don't get too robust.

Read the article

Handling "Big" Integers in C#

- by priyanka.sarkar

How do I handle big integers in C#? I have a function that will give me the product of divisors: private static int GetDivisorProduct(int N, int product) { for (int i = 1; i < N; i++) { if (N % i == 0) { Console.WriteLine(i.ToString()); product *= i; } } return product; } The calling function is GetDivisorProduct(N, 1) If the result is bigger than 4 digits , I should obtain only the last 4 digits. ( E.g. If I give an input of 957, the output is 7493 after trimming out only the last four values. The actual result is 876467493.). Other sample inputs: If I give 10000, the output is 0. The BigInteger class has been removed from the C# library! How can I get the last four digits?

Search Results

Search found 101 results on 5 pages for 'modulus'.

Page 1/5 | 1 2 3 4 5 | Next Page >

- by penguat

- by NSWOA

- by ryxxui

- by user161190

- by boost

- by MarAja

- by Jim

- by thyrgle

- by hasanatkazmi

- by ShrimpCrackers

- by mat_geek

- by Bhubhu Hbuhdbus

- by Eli

- by WmasterJ

- by WmasterJ

- by Kami

- by dotty

- by Beelzeboul

- by FrankTheTank

- by Brad

- by coneybeare

- by bobobobo

- by Yktula

- by tladuke

- by priyanka.sarkar

1 2 3 4 5 | Next Page >