# Ruby code
print 'Enter n: '; n = gets.to_i
n.times { | i |
puts ( i + 1 ) ** 2 if ( i + 1 ) % 3.0 == 0.0
}
maa ki aank
if ( x % 6 == 0 ){ printf( "%d is divisible by 6", x ); } else { printf( "%d is not divisible by 6", x ); }
Write a program to find the number and sum of all integers from 100 to 300 that are divisible by 11
you cant
Reference:http:cprogramming-bd.com/c_page2.aspx# strange number
To check for divisibility, use the modulus, or % operator. If the expression results in zero, then the first number is divisible by the second number. For example, 10%5 equals 0 because 10 is divisible by 5. When the expression does not result in 0, the number is not divisible(10%7=3, so 10 is not divisible by 7).
write a c program to accept a number and generate a square root cube and exponential values
if ( x % 6 == 0 ){ printf( "%d is divisible by 6", x ); } else { printf( "%d is not divisible by 6", x ); }
What for? There is only a 154 inside that is divisible by 77...
int isDivisibleByTwo(int N) return N % 2 == 0;
Write a program to find the number and sum of all integers from 100 to 300 that are divisible by 11
Prime numbers are numbers that are only divisible by themselves and the number 1. You can write a program to print all prime numbers from 1 to 100 in FoxPro.
Yes.
dim a input a
15
C programm
Write a program to convert a 2-digit BCD number into hexadecimal
you cant