class ass{
public static void main(String[] args ){
int 13,33,23,...193
sum = 0;
for (count = 0; count<=193; count++);
{
sum=sum+count;
System.out.print(count + "sum");
}System.out.println("sum is"+sum);
Find a prime number, add 2 to the number. Check if the new number is prime. IE : 3 is prime. 3+2 =5. 5 is prime. (3,5) are twin primes.
for(int i = 1; i < 100; i+=2) { System.out.println(i); }
where to start? do you have an algorithm and just want to implement it in java? depends on how big N is, as that will determine which method is most efficient
You can use the Math.pow function to raise one number to the power of another. Math.pow(24, 3) will return 243
This is a very simple problem, alnost certainly a homework problem, and you should make an effort to answer it yourself.
give description of that then i will send the answer
Use a text-editor like Notepad.
no
Spelling game does what? Please enter your idea of the game so that i can work for your programme
You can use Java's built-in functions to write a code that will find multilingual languages.
public int min(int[] arr) { int min = Integer.MAX_VALUE; for(int e : arr) if(e<min) min=e; return min; }
bgfygfrhjyuyhh
Find a prime number, add 2 to the number. Check if the new number is prime. IE : 3 is prime. 3+2 =5. 5 is prime. (3,5) are twin primes.
it runs on a java scrips platform
write a java program to find factorial using recursive and non recursive
java is an object oriented programme it is similar to c++ so if you know very well in c++ you can easily figure it out.
You can use the Math.sqrt() method.