Using php: write a function that: given a numerical parameter in input, computes and prints all the prime numbers up to that value. example: if input parameter is 10, output is "2, 3, 5, 7" if input parameter is 100, output is "2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97" write a "tester function" that: given a specific subset of inputs, tests the function described above (point 1).

answer:

yes

explanation:

answer:

it thinks that you spelled something wrong.

explanation:

answer:

clock

explanation:

always running (on) sing each hour (chime) and the clock face (front)

answer:

// here is code in C++.

#include <bits/stdc++.h>

using namespace std;

//main function

int main()

{

  // variable

 int n;

 cout<<"enter a number:";

 // read the input

 cin>>n;

 // find the square root of the absolute value

 float square_root=sqrt(abs(n));

 // print the square_root

 cout<<"square root of "<<n<<" is: "<<square_root<<endl;

  return 0;

}

Explanation:

Read a number from user and assign it to "n".Then find its absolute value with abs() function.Then calculate the square root of the absolute value with sqrt() function.Print the square root of the number.

Output:

enter a number:-17

square root of -17 is: 4.12311

                                                         This is easy

                                                     sinserly Natalie 7 grader (this is not that hard)