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;
}
The evidence Levitt and Dubner present in response to the counterclaim is that 7-7 wresters' results drop (first option).
<h3>What is a counterclaim?</h3>
This is a statement that disproves the main claim or thesis. Moreover, this can be answered by providing evidence that disproves the counterclaim.
<h3>What evidence do Levitt and Dubner present?</h3>
The counterclaim is that a 7-7 is more likely to win, this can be disproved through the detail that these wrestlers' results drop because this shows they are not more likely to win than others.
Note: This question is incomplete because the options are missing; here are the options:
In the next match, 7-7 wrestlers' results drop below their predicted percentage.
The 7-7 wrestlers do well against both 8-6 and 9-5 opponents.
Wrestling matches only last a few seconds and are won by a quick exertion of force.
Wrestlers from the same stable do not oppose one another.
Learn more about counterclaim in: brainly.com/question/1757292
#SPJ1
