虽然没有财富值,希望有人帮忙编一下啊

Write a method named isPrime, which takes an integer as an augment and return true if the argument is a prime number, or false otherwise.
You may use a remainder operation for isPrime method. The method will return 0 if a dividend is evenly divisible by a divisor. If choose this method for isPrime, you are not allowed to use “%” operator. In such case, you need to create a getRemainder method by the following function.
r = n - [n/d]‧d
r is the remainder, n is the dividend, and d is the divisor.   is the floor function. The above function produces the same results as “%” operator. If you cannot write the above function, you can use “%” operator, but lose some marks for this part.
Write a method named testNumber that asks a user to enter a number, and tell the user whether the number is a prime number by using isPrime method. You need to use dialog window to get the user input and use message dialog window to display the messages.
Write a method called primeList that uses the isPrime method in a program that find and list of all the prime numbers from 1 through 100. The method will save the result in a file.
The testNumber and primeList methods are implemented in the main program. To test the testNumber method, you need to run the program two times in your demonstration
写一个方法名为ISPRIME,这需要一个整数增大,返回true,如果参数是一个素数,否则返回false。
您可以使用其余操作isPrime方法。该方法将返回0,如果股息整指银除的一个除数。如果选择此方法isPrime,你不能使用“%”操作。在这种情况下,你需要通过下面的函数创建一个getRemainder方法。
R = N - [N / D]‧ð
r是余数,n是股息,d是除数。蚂清是地板的功能。上面的函数为“%”操作产生的结果相同。如果你不能写上面的函数,你可以使用“%”操作,但失去这部分的一些痕迹。
写一个方法名为testNumber,要求用户输入一个数字,告诉用唯物宴户数是否是一个素数,通过使用isPrime方法。您需要使用“窗口,以获取用户输入和使用消息对话框窗口显示的消息。
写一个的方法称为primeList在一个程序中,找到并列出所有的素数从1到100,使用的isPrime方法。该方法将结果保存在一个文件中。
在主程序中实现的testNumber和primeList方法。要测试testNumber方法,你需要运行的程序,两次在您的演示
帮你翻译一下
Write a method named isPrime, which takes an integer as an augment and return true if the argument is a prime number, or false otherwise.
  碰察You may use a remainder operation for isPrime method. The method will return 0 if a dividend is evenly divisible by a divisor. If choose this method for isPrime, you are not allowed to use “%” operator. In such case, you need to create a getRemainder method by the following function.
  r = n - [n/d]‧d
  r is the remainder, n is the dividend, and d is the divisor.  简没 is the floor function. The above function produces the same results as “%” operator. If you cannot write the above function, you can use “%” operator, but lose some marks for this part.
 拦吵纳 Write a method named testNumber that asks a user to enter a number, and tell the user whether the number is a prime number by using isPrime method. You need to use dialog window to get the user input and use message dialog window to display the messages.
  Write a method called primeList that uses the isPrime method in a program that find and list of all the prime numbers from 1 through 100. The method will save the result in a file.
 
  Write a method named isPrime, which takes an integer as an augment and return true if the argument is a prime number, or false otherwise.
  You may use a remainder operation for isPrime method. The method will return 0 if a dividend is evenly divisible by a divisor. If choose this method for isPrime, you are not allowed to use “%” operator. In such case, you need to create a getRemainder method by the following function.
  中昌r = n - 卖渣扒[n/d]‧梁罩d
  r is the remainder, n is the dividend, and d is the divisor.   is the floor function. The above function produces the same results as “%” operator. If you cannot write the above function, you can use “%” operator, but lose some marks for this part.
  Write a method named testNumber that asks a user to enter a number, and tell the user whether the number is a prime number by using isPrime method. You need to use dialog window to get the user input and use message dialog window to display the messages.
  Write a method called primeList that uses the isPrime method in a program that find and list of all the prime numbers from 1 through 100. The method will save the result in a file.
  The testNumber and primeList methods are implemented in the main program. To test the testNumber method, you need to run the program two times in your demonstration