{"id":23225,"date":"2023-12-01T11:34:15","date_gmt":"2023-12-01T11:34:15","guid":{"rendered":"https:\/\/linuxways.net\/?p=23225"},"modified":"2024-03-25T02:10:29","modified_gmt":"2024-03-25T02:10:29","slug":"modulus-c-language","status":"publish","type":"post","link":"https:\/\/linuxways.net\/de\/scripting\/modulus-c-language\/","title":{"rendered":"Modulus in C Language"},"content":{"rendered":"
\nIn this Linux Ways article, you will learn how to get the remainder after a division between two variables. We will show you the easiest way to get a module using the \u201c%\u201d operator and also the mathematical formula to get it by applying it, so you can see the different possibilities you have to solve the remainder of a division.<\/p>\n

We’ll then put what we learned into practice with several practical examples using the code and images, so you’ll understand how each method works and be able to use them quickly.<\/p>\n

<\/a>Module or Remainder After Division<\/h2>\n

The rule for exact division of integers is that the divisor must be a multiple of the dividend. When we work with integers and perform the division operations, in cases where the dividend is not divisible by the divisor, the result is an integer approximation. From this division, we are left with a remainder that is less than the divisor.<\/p>\n

This remainder, also called modulus, affects the accuracy of the operations because, as we already said, the result of a division that has a remainder is only an integer approximation.<\/p>\n

<\/a>Formula to Determine the Modulus of a Division<\/h2>\n

One way to get the modulus of a division is to subtract the result of the division from the dividend multiplied by the divisor. The following is the formula to obtain the modulus of \u201ca\u201d divided by \u201cb\u201d using this method:<\/p>\n

mod =<\/span> a -<\/span>(<\/span>a\/<\/span>b)<\/span>*<\/span>b;<\/span><\/div><\/div>\n

Now, let’s see how to apply this formula in a simple example that gives the modulus of the division of 27 divided by 5:<\/p>\n

#include <stdio.h><\/span>
\n
\nvoid<\/span> main (<\/span>)<\/span>
\n{<\/span>
\nint<\/span> a =<\/span>27<\/span>;<\/span>
\nint<\/span> b =<\/span>5<\/span>;<\/span>
\nint<\/span> d;<\/span>
\nint<\/span> mod;<\/span>
\nd =<\/span> a\/<\/span>b;<\/span>
\n
\nmod =<\/span> a -<\/span>(<\/span>a\/<\/span>b)<\/span>*<\/span>b;<\/span> \/\/Get module<\/span>
\n
\nprintf<\/span><\/a> (<\/span>"a \/ b = %i\\n<\/span>"<\/span>,<\/span> d)<\/span>;<\/span>  
\nprintf<\/span><\/a> (<\/span>"mod = %i\\n<\/span>"<\/span>,<\/span> mod)<\/span>;<\/span>  
\n}<\/span><\/div><\/div>\n

The following is the execution of this code where we can see the result of \u201ca\u201d divided by \u201cb\u201d or the remainder of the division of 27 over 5:<\/p>\n

<\/p>\n

<\/a>The \u201c%\u201d Operator to Obtain the Module of a Division<\/h2>\n

The C language provides the \u201c%\u201d operator to obtain the modulus in a division. Because of its simple syntax, the use of this operator to obtain the modulus of a division is the most commonly used in the C language. The following is the expression that is used to obtain the modulus of \u201ca\u201d divided by \u201cb\u201d:<\/p>\n

mod =<\/span> a %<\/span> b;<\/span><\/div><\/div>\n

NOTE: The \u201c%\u201d operator that is used under this expression refers to a mathematical operator that has nothing to do with the format identifiers that are used in the strings of the printf() function to specify the output format.<\/p>\n

<\/a>How to Get the Modulus of a Division with the \u201c%\u201d Operator<\/h2>\n

In this example, we will show you how to use the \u201c%\u201d operator to get the modulus of a division. To do this, we specify the integer that we want the dividend to be and give it a random odd value.<\/p>\n

We also declare the \u201cb\u201d integer which will be the divisor that we will assign with a random even value. We store the result in the \u201cmod\u201d integer which we then output to the screen using the printf() function.<\/p>\n

The next step is to apply the operation with the \u201c%\u201d operator to the \u201ca\u201d and \u201cb\u201d variables and display the result in the command console. Let\u2019s see the following code for this example:<\/p>\n

#include <stdio.h><\/span>
\n
\nvoid<\/span> main (<\/span>)<\/span>{<\/span>
\nint<\/span> a =<\/span>27<\/span>;<\/span>
\nint<\/span> b =<\/span>4<\/span>;<\/span>
\nint<\/span> mod;<\/span>
\n
\nmod =<\/span> a -<\/span>(<\/span>a\/<\/span>b)<\/span>*<\/span>b;<\/span>
\n 
\nprintf<\/span><\/a> (<\/span>"mod = %i\\n<\/span>"<\/span>,<\/span> mod)<\/span>;<\/span>  
\n}<\/span><\/div><\/div>\n

The following image illustrates the execution of this code:<\/p>\n

<\/p>\n

As we can see in the figure, the division of an odd number by an even number is not exact, which is why it resulted in a remainder or modulus which, in this case, is equal to 3.<\/p>\n

<\/a>How to Know If a Number Is a Multiple of Another with the \u201c%\u201d Operator<\/h2>\n

The \u201c%\u201d operator allows us to solve various programming tasks such as determining whether one value is a multiple of another. To do this, we simply perform a modulo operation where a result that is equal to 0 means that the divisor is a multiple of the dividend.<\/p>\n

In the following, we will see an example that lists the values from 0 to 255, which are multiples of 8, using a modulo operation and an \u201cif\u201d condition to determine them:<\/p>\n

#include <stdio.h><\/span>
\n
\nvoid<\/span> main (<\/span>)<\/span>{<\/span>
\n
\nint<\/span> mod;<\/span>
\n
\nfor<\/span> (<\/span>int<\/span> a=<\/span> 0<\/span>;<\/span> a !=<\/span> 255<\/span>;<\/span> a++<\/span>)<\/span>{<\/span>
\n     mod =<\/span> a %<\/span> 8<\/span>;<\/span>
\n     if<\/span> (<\/span>mod ==<\/span> 0<\/span>)<\/span>
\n        printf<\/span><\/a> (<\/span>"%i Is multiple of 8\\n<\/span>"<\/span>,<\/span> a)<\/span>;<\/span>  
\n    }<\/span>
\n}<\/span><\/div><\/div>\n

The following image shows the list of multiples of 8 which is generated with the \u201c%\u201d operator and the \u201cif\u201d condition:<\/p>\n

<\/p>\n

<\/a>Conclusion<\/h2>\n

In this Linux Ways article, we showed you how to get the module of a division with two different modes. We explained how to get a modulus by a simple operation with the \u201c%\u201d operator. To see the different ways to solve the same problem in this language, we also showed you the applied equation which is used for this purpose.<\/p>\n

Also, as an example, we showed you how the \u201c%\u201d operator can be used to solve various problems such as finding the multiples of a given value using the simple conditionals and module operations.\n<\/p><\/div>","protected":false},"excerpt":{"rendered":"

Comprehensive tutorial on how to get the module of a division with two different modes and how to get a modulus by a simple operation with the \u201c%\u201d operator.<\/p>","protected":false},"author":110,"featured_media":23235,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[168],"tags":[],"class_list":["post-23225","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-scripting"],"_links":{"self":[{"href":"https:\/\/linuxways.net\/de\/wp-json\/wp\/v2\/posts\/23225","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/linuxways.net\/de\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/linuxways.net\/de\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/linuxways.net\/de\/wp-json\/wp\/v2\/users\/110"}],"replies":[{"embeddable":true,"href":"https:\/\/linuxways.net\/de\/wp-json\/wp\/v2\/comments?post=23225"}],"version-history":[{"count":0,"href":"https:\/\/linuxways.net\/de\/wp-json\/wp\/v2\/posts\/23225\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/linuxways.net\/de\/wp-json\/wp\/v2\/media\/23235"}],"wp:attachment":[{"href":"https:\/\/linuxways.net\/de\/wp-json\/wp\/v2\/media?parent=23225"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/linuxways.net\/de\/wp-json\/wp\/v2\/categories?post=23225"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/linuxways.net\/de\/wp-json\/wp\/v2\/tags?post=23225"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}