0
/*PROGRAM TO ACCEPT TWO NUMBERS FROM THE USER AND PRINT THEIR MULTIPLICATION. */
#include<stdio.h>
#include<conio.h>
void main()
{
int a, b, c; // Declaration of Variables. Variables 'a' & 'b' to hold first & second number. And 'c' to hold result.
clrscr(); // To clear the output screen every time program is executed.
printf("\n Enter the first number : ");
scanf("%d", &a); // To accept the first number.
printf("\n Enter the second number : ");
scanf("%d", &b); // To accept the second number.
c = a*b; // Logic to get the product of the entered two numbers.
printf("\n Multiplication of %d & %d = %d", a, b, c); // Displaying result.
getch(); // To hold the output screen.
}
What else can I help you with?
How do you write a C program to find the GCD of two given integers using non recursive functions?
Use the following function: int gcd (int a, int b) { while (b != 0) { a %= b; a ^= b ^= a ^= b; } return a; } Note that a ^= b ^= a ^= b is an efficient method of swapping two values.
Write a program to find gcd using recursive method in java?
for two positive integers: public static int gcd(int i1, int i2) { // using Euclid's algorithm int a=i1, b=i2, temp; while (b!=0) { temp=b; b=a%temp; a=temp; } return a; }
What is the least common multiple of decimals and fractions in C?
To calculate the least common multiple (lcm) of decimals (integers) and fractions you first need to calculate the greatest common divisor (gcd) of two integers: int gcd (int a, int b) { int c; while (a != 0) { c = a; a = b % a; b = c; } return b; } With this function in place, we can calculate the lcm of two integers: int lcm (int a, int b) { return a / gcd (a, b) * b; } And with this function in place we can calculate the lcm of two fractions (a/b and c/d): int lcm_fraction (int a, int b, int c, int d) { return lcm (a, c) / gcd (b, d); }
Write a c program to find the product of two numbers without using operator?
#include<stdio.h> #include<conio.h> void main() { int a,b,multi; clrscr(); printf("enter a value for a and b"); scanf("%d%d",&a,&b); multi=a*b; printf("the result is %d", multi); getch() }
What are the conditions to swap in c plus plus without temporary?
You can swap two integers without temporary storage by bitwise exclusive-or'ing them in a specific sequence...a ^= b;b ^= a;a ^= b;
How do you find the product of 2 integers?
To find the product of two integers, you multiply them together using the multiplication operation. For example, if you have integers ( a ) and ( b ), their product is calculated as ( a \times b ). You can perform this multiplication using various methods, such as repeated addition, the standard algorithm, or using a calculator. The result will be a single integer representing the total value of the multiplication.
What is a Set closed under multiplication?
A set is said to be closed under multiplication if, for any two elements ( a ) and ( b ) within that set, the product ( a \times b ) is also an element of the same set. This property ensures that multiplying any two members of the set does not produce an element outside of it. For example, the set of integers is closed under multiplication because the product of any two integers is always an integer. In contrast, the set of positive integers is also closed under multiplication for the same reason.
What is the distributive property of addition over multiplication for integers?
Addition is not distrbutive over multiplication. In general,a + (b*c) ≠(a+b)*(a+c) [unless a+b+c = 1]
When multiplying two integer what are the four possible combination of sign how can they be grouped into two integers?
The four possible combinations are:A = (+, +)B = (+, -)C = (-, +) andD = (-, -)In A and D, the two numbers have the same signs and the multiplication gives a positive answer.In B and C, the two numbers have different signs and the multiplication gives a negative answer.
Is sum of two integers is equal to the difference of the same two integers?
No, the sum of two integers is not equal to the difference of the same two integers, except in specific cases. For two integers ( a ) and ( b ), the sum is ( a + b ) and the difference is ( a - b ). These two expressions can only be equal if one of the integers is zero or if they are equal (i.e., ( a = b )). In general, the sum will be greater than or less than the difference, depending on the values of ( a ) and ( b ).
How you write multiplication program without asterisk symbol?
a*b = exp (ln a + ln b)
What is b and a if both are positive integers but a does not equal b?
Then they are, simply, two different integers. Any two positive integers will do, according to the specification.Then they are, simply, two different integers. Any two positive integers will do, according to the specification.Then they are, simply, two different integers. Any two positive integers will do, according to the specification.Then they are, simply, two different integers. Any two positive integers will do, according to the specification.
Are cubed numbers closed under multiplication?
Yes. If you have two positive integers "a" and "b", and their corresponding cubes "a^3" and "b^3" (using "^" for "power"), then the product of the two cubes would be a^3 times b^3 = (ab)^3. Since the product of "a" and "b" is also an integer, you have the cube of an integer.
What is the difference between 2 positive integers is 40?
The two integers are A and A+40 or, equivalently, B and B-40.
Prove that if a and b are rational numbers then a plus b is a rational number?
Because a is rational, there exist integers m and n such that a=m/n. Because b is rational, there exist integers p and q such that b=p/q. Consider a+b. a+b=(m/n)+(p/q)=(mq/nq)+(pn/mq)=(mq+pn)/(nq). (mq+pn) is an integer because the product of two integers is an integer, and the sum of two integers is an integer. nq is an integer since the product of two integers is an integer. Because a+b equals the quotient of two integers, a+b is rational.
Two integers A and B are graphed on a number line. If A is less than B is A always less than B?
Two integers A and B are graphed on a number line. If A is less than B is A always less than B?
How do you write a C program to find the GCD of two given integers using non recursive functions?
Use the following function: int gcd (int a, int b) { while (b != 0) { a %= b; a ^= b ^= a ^= b; } return a; } Note that a ^= b ^= a ^= b is an efficient method of swapping two values.
