Depends on the value of n
We know that the complete graph has n(n-1)/2 edges and we want to find out n such that n(n-1)/2 greater or equal to 500. Thus n(n-1) greater or equal to 1000. Taking n=33, we have, n(n-1)=33(33-1)=1056>1000. Therefore required smallest integer is n=33.
300
50n = 5000 n = 5000/50 n = 100
If ten times the number n decreased by 13 is equal to the square of the same number n increased by 3, then the value of n is either 8 or 2.
1 N is equal to 1/1000 kN. 23400 is equal to 23400/1000=23.4 kN.
6n2
6% times n = 120 6/100 = .06 .06n = 120 .06n/.06 = 120/.06 n = answer
Depends on the value of n
We know that the complete graph has n(n-1)/2 edges and we want to find out n such that n(n-1)/2 greater or equal to 500. Thus n(n-1) greater or equal to 1000. Taking n=33, we have, n(n-1)=33(33-1)=1056>1000. Therefore required smallest integer is n=33.
300
50n = 5000 n = 5000/50 n = 100
If ten times the number n decreased by 13 is equal to the square of the same number n increased by 3, then the value of n is either 8 or 2.
no
4*(n + 1) = 6*n*3
It is very simple..The value of n must be equal to 0.0002.(The easiest way to solve this prob is dividing 0.00008 by 0.4i.e. n=0.00008/0.4)Therefore, n=0.0002.
100 x 50 because if you divided 5000 by 50 it gives you 1000 so n = 1000