Convert this in flow chart and see if it can help
Start
Display "Enter 2 numbers"
Accept 2 numbers A & B
Divide the A with B
Is result Zero? ---- No - A is not Dividable with second
Yes - A is Dividable with second
End
Starting with 4, every fourth number from 4 to 100 is divisible by 4. The numbers are: 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100. 25 numbers between 1 and 100 are divisible by 4.
Yes. Choose any three consecutive counting numbers. The first number is the second number subtract 1 The third number is the second number add 1 Adding the three numbers together is the same as adding: (the second number subtract one) plus the second number plus (the second number add one). The "subtract one" and "add one" cancel each other out to leave the sum as: the second number plus the second number plus the second number Which is the same as 3 times the second number, ie the sum is a multiple of 3 and so is divisible by 3. For example: 10 + 11 + 12 = (11 - 1) + 11 + (11 + 1) = 11 - 1 + 11 + 11 + 1 = 11 + 11 + 11 + (1 - 1) = 11 + 11 + 11 + 0 = 11 + 11 + 11 = 3 x 11
divisible
The digital root (sum of digit) must be divisible by 9, and the number formed by the last 4 digits must be divisible by 16. The second requirement ensures that the number is divisible by 16.
= The sum of two numbers is -42 the first number minus the second number is 52 Find the numbers? =
Drawing flowcharts is impossible in a text-based forum. So here's the pseudocode instead:input xinput yif(x%y==0) then print "x is divisible by y" else print "x is not divisible by y"Note that line 3 divides x by y and if the remainder is 0 then x is divisible by y, otherwise it is not.
The concept of divisible and non-divisible makes sense only in the context of whole numbers. Once you allow fractions (or their decimal representations), every number is divisible by any non-zero number.
All numbers are not divisible by 3. In order to test if a number is a prime, you first test to see if it ends in a 2, 4, 6, 8, or 0. In that case it is divisible by 2 and not a prime. The next number you use for your test is 3. More odd numbers are divisible by 3 than by any other odd number but it is only the second number used for the test. You continue testing until you reach the square root of the number. If the number is only divisible by itself and one, it is prime. 3 is only the second test number in the division test for primes.
divisible
#include using std::cout;using std::cin;using std::endl;int main(){double firstNumber = 0;cout > firstNumber;double secondNumber =0;cout
The second.
If the second number is divisible by 6 then neither first nor second number is odd.
Starting with 4, every fourth number from 4 to 100 is divisible by 4. The numbers are: 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100. 25 numbers between 1 and 100 are divisible by 4.
The second.
Sometimes.
Accept is stressed on the second syllable.
Two numbers: the first of them is 1 and the second is not!Two numbers: the first of them is 1 and the second is not!Two numbers: the first of them is 1 and the second is not!Two numbers: the first of them is 1 and the second is not!