7
Mutliplied two prime numbers to get 400?
Would be that number. Example: 7+0= 7 0+7=7
-7-(-7)=0
843.3719
public static void main(String[] args) { int count = 0; int sum = 0; for(int i = 100; i < 200; i++) { if(i%7 == 0){ System.out.println(i); count++; sum = sum + i; } } System.out.println("Number of values divisble by 7 is: " + count); System.out.println("Sum of the values divisible by 7 is: " + sum); }
To find the vector sum of (7, 5) and (13, -5), you add the corresponding components. For the x-components: 7 + 13 = 20. For the y-components: 5 + (-5) = 0. Therefore, the vector sum is (20, 0).
I assume you mean the additive inverse. The sum of any number and its additive inverse is zero. For example, 7 + (-7) = 0.
The sum of these numbers is 38. There are 8 numbers. The mean is thus:38/8 = 4.75
0+7 1+6 2+5 3+4 4+3 5+2 6+1 7+0
Well, honey, any integer greater than 7 will do the trick. Just pick a number, add it to -7, and if the sum is greater than 0, you've hit the jackpot. Just remember, the bigger the integer, the better chance you have of getting a positive sum.
#include<stdio.h> #include<conio.h> void main() { int i=1,sum=0; clrscr(); while(i<10000) { if((i%3==0)(i%5==0)(i%7==0)) { sum=sum+i; } i++; } printf("\nThe sum is%d",sum); getch(); }
9