C program check whether a number is even or odd

Logic to check even or odd

A number exactly divisible by 2 leaving no remainder, is known as even number. Programmatically, if any number modulo divided by 2 equals to 0 then, the number is even otherwise odd.

Step by step descriptive logic to check whether a number is even or odd.

Input a number from user. Store it in some variable say num.
Check if number modulo division equal to 0 or not i.e. if(num % 2 == 0) then the number is even otherwise odd.

Important Note: Do not confuse modulo division operator % as percentage operator. There is no percentage operator in C.

/** * C program to check even or odd number */ #include <stdio.h> int main() { int num; /* Input number from user */ printf("Enter any number to check even or odd: "); scanf("%d", &num); /* Check if the number is divisible by 2 then it is even */ if(num % 2 == 0) { /* num % 2 is 0 */ printf("Number is Even."); } else { /* num % 2 is 1 */ printf("Number is Odd."); } return 0; }

Comments

Discrete Mathematics - Rules of Inference

To deduce new statements from the statements whose truth that we already know, Rules of Inference are used. What are Rules of Inference for? Mathematical logic is often used for logical proofs. Proofs are valid arguments that determine the truth values of mathematical statements. An argument is a sequence of statements. The last statement is the conclusion and all its preceding statements are called premises (or hypothesis). The symbol “ ∴ ∴ ”, (read therefore) is placed before the conclusion. A valid argument is one where the conclusion follows from the truth values of the premises. Rules of Inference provide the templates or guidelines for constructing valid arguments from the statements that we already have. Table of Rules of Inference Rule of Inference Name Rule of Inference Name P ∴ P ∨ Q P ∴ P ∨ Q Addition P ∨ Q ¬ P ∴ Q P ∨ Q ¬ P ∴ Q Disjunctive Syllogism P Q ∴ P ∧ Q P Q ∴ P ∧ Q Conjunction P → Q Q → R ∴ P → R P → Q Q → R ∴ P → R Hypothet

5 best private search engines and why you need to use them.

5 best private search engines and why you need to use them By: Boniyeamin laju ▪ May 31, 2019 ▪ 3 minute read 5 best private search engines and why you need to use Normal browsers like Google and Bing are designed to track users’ activities and profile their online behavior. The primary reason for this is to create advertisements that will be attractive to the user. However, there-there is always the concern of personal information being compromised due to security breaches, state surveillance, and unauthorized data sharing. Fortunately, private search engines can help keep your private information safe. Simply put, Private Search Engines, also known as PSE, uses proxy and encrypted search request to hide your personal information from anyone looking to misuse your information. Below you will find more information about what a PSE is, how it works, and where to find the best private search engines on the internet

Discrete Mathematics - Propositional Logic

The rules of mathematical logic specify methods of reasoning mathematical statements. Greek philosopher, Aristotle, was the pioneer of logical reasoning. Logical reasoning provides the theoretical base for many areas of mathematics and consequently computer science. It has many practical applications in computer science like design of computing machines, artificial intelligence, definition of data structures for programming languages etc. Propositional Logic is concerned with statements to which the truth values, “true” and “false”, can be assigned. The purpose is to analyze these statements either individually or in a composite manner. Prepositional Logic – Definition A proposition is a collection of declarative statements that has either a truth value "true” or a truth value "false". A propositional consists of propositional variables and connectives. We denote the propositional variables by capital letters (A, B, etc). The connectives connect the propositi

My skill

Search This Blog