Answer:
At participation and performance in rigorous high school courses among California high school students, both overall and across demographic and racial/ethnic groups. While enrollment in rigorous courses has been increasing, particularly among students who are traditionally underrepresented in higher education. Here's my answer that I would put! =)
Ok. So I am not going to write it for you. But, here are some tips to accomplish these goals
1. Find some research articles ( credible ) and then write your claim off of this article. A claim is a <span>state or asserts that something is the case, typically without providing evidence or proof.
2. Find evidence in the articles for the evidence parts. For example. If one reason was some posts aren't safe. You would need evidence like a time someone was in danger because of a post.
3. Basically, rewrite your claim with a call to action. A call to action is where you tell the audience to do something about the problem
4. If your audience was kindergarteners, you would want to write it so the kids could understand what you are saying. Or if it was a college class make sure it is formal and well big words or whatever.
5. Indent for every paragraph and use correct spaces and things
6. I like to use Grammarly for my essays online. It really helps
I really hope these help you. If you need any sources or websites, or you need someone to peer review, just message me. I will help you. :) Good luck!!!!!</span>
Answer:
1) its because we managed to divide the answer so it is not a prime number.
2)
Code:
#include <stdio.h>
int main()
{
int i, j, n, isPrime; // isPrime is used as flag variable
/* Input upper limit to print prime */
printf("Enter your n : ");
scanf("%d", &n);
printf("Prime numbers from 1 to %d:\n", n);
/* Find all Prime numbers between 1 to n */
for(i=2; i<=n; i++)
{
/* Assume that the current number is Prime */
isPrime = 1;
/* Check if the current number i is prime or not */
for(j=2; j<=i/2; j++)
{
/*
* If i is divisible by any number other than 1 and self
* then it is not prime number
*/
if(i%j==0)
{
isPrime = 0;
break;
}
}
/* If the number is prime then print */
if(isPrime==1)
{
printf("%d,\n ", i);
}
}
return 0;
}
