Ad

You may simply apply the power rule for determining the first derivative. If y = a * x^b then y' = a * b * x^(b-1).

In your case, a = 1, b = -1 you get:

y = x^(-1) =>

y' = 1 * (-1) * x^(-1 - 1) = -x^(-2).

Posted on Mar 20, 2014

Ad

Hi,

a 6ya expert can help you resolve that issue over the phone in a minute or two.

Best thing about this new service is that you are never placed on hold and get to talk to real repairmen in the US.

the service is completely free and covers almost anything you can think of.(from cars to computers, handyman, and even drones)

click here to download the app (for users in the US for now) and get all the help you need.

Goodluck!

Posted on Jan 02, 2017

Ad

A prime number is a whole number greater than 1, whose only two whole-number factors are 1 and itself. Read on at the link.

http://whatis.techtarget.com/definition/prime-number

http://whatis.techtarget.com/definition/prime-number

Apr 04, 2017 | Prime Computers & Internet

No it isn't as 1,2,4,8 can be used to divide it prime's are only dividable by 1 or itself only

20 is 1,2,4,5,10

20 is 1,2,4,5,10

Jan 23, 2017 | The Computers & Internet

It used to be. **The idea is that a prime decomposition must be unique.** If you write 13=1*13, you can also write 13=1*1*1*....*1*13. If you allow 1 to be a prime number, there is no unicity of any prime factor decomposition. Any prime number would have a infinity number of prime decompositions.

Sep 28, 2014 | Computers & Internet

A prime number is any whole number larger than 1 that cannot be evenly divided by any whole number other than 1 and itself. For example, 5 is prime because it can only be divided by 1 and 5, while 4 is not prime because it can also be divided by 2.

See http://en.wikipedia.org/wiki/Prime_number

See http://en.wikipedia.org/wiki/Prime_number

Sep 09, 2013 | Office Equipment & Supplies

"A **prime number** (or a **prime**) is a natural number greater than 1 that has no positive divisors other than 1 and itself." - wikipedia

A list would be impossible without a limit. if you can't divide it by anything but 1 and the number itself(which would also mean that you were dividing by one), then it's prime.

4 is not prime, because it is divisible by 1, 2, and 4. 5 is prime, because it cannot be divided by anything except 1 and 5(itself).

A list would be impossible without a limit. if you can't divide it by anything but 1 and the number itself(which would also mean that you were dividing by one), then it's prime.

4 is not prime, because it is divisible by 1, 2, and 4. 5 is prime, because it cannot be divided by anything except 1 and 5(itself).

Nov 08, 2012 | Computers & Internet

No, 1 is not a prime number. The decomposition of a number into prime factors must be unique so 2=1x2 is prime but since 1 can be written as 1=1x1x1x1....x1 with an arbitrary number of factors this opens up a can of worms as far as unicity of the decomposition is concerned. Conclusion: 1 has been ruled out as a prime number.

I hope that this gives you an idea why 1 is no longer considered prime.

I hope that this gives you an idea why 1 is no longer considered prime.

Jul 10, 2012 | Mathsoft StudyWorks! Middle School Deluxe...

Prime numbers are those numbers (greater than 1) that cannot be divided by any
number except themselves and one.

The Greek Eratosthenes created a method to find out these prime numbers, although it only worked over a limited range:

1) Write out the numbers from 1 to 100 in ten rows of 10.

The Greek Eratosthenes created a method to find out these prime numbers, although it only worked over a limited range:

1) Write out the numbers from 1 to 100 in ten rows of 10.

2) Cross off number 1, because all primes are greater than 1.

3) Number 2 is a prime, so we can keep it, but we need to cross off the multiples
of 2 (i.e. even numbers).

4) Number 3 is also a prime, so again we keep it and cross off the multiples
of 3.

5) The next number left is 5 (because four has been crossed off), so we keep
it and cross of the multiples of this number.

6) The final number left in the first row is number 7, so cross off its multiples.

7) You have finished. All of the "surviving" numbers (coloured in
white below) on your grid are prime numbers.

Oct 23, 2011 | MathRescue Word Problems Of Algebra Lite

Evan though you cleaned the bowl, the float isn't "floating" correct in the bowl to raise the needle for gas to flow into the carb. The float and needle can be replaced. When you prime an engine the gas shoots straight to the carb. As when the engine is running the floating goes up and down to raise the needle for gas to flow.

Jul 07, 2010 | Yard Machines 11A54MC006 21Inch 139cc MTD...

Try the Following Five Programs

1) Program for Prime Number Generation

#include <stdio.h>

main()

{

int n,i=1,j,c;

clrscr();

printf("Enter Number Of Terms

");

printf("Prime Numbers Are Follwing

");

scanf("%d",&n);

while(i<=n)

{

c=0;

for(j=1;j<=i;j++)

{

if(i%j==0)

c++;

}

if(c==2)

printf("%d ",i)

i++;

}

getch();

}

--------------------------------------------------------------------------------------------------------------------------------------------------

2)Program for finding the prime numbers

#include <stdio.h>

#include <conio.h>

void main()

{

int n,m,k,i,max;

char c;

clrscr();

repeat: max=0;

k=2;

n=1;

printf("You want prime numbers upto:- ");

scanf("%d",&max);

printf("

");

for (i=1;i<=max;i++)

{

again: m=(n/k)*k;

if (m!=n)

k=k+1;

else

goto try1;

if (k < n/2)

goto again;

else

printf("%d",n);

printf(" ");

try1: n=n+1;

k=2;

}

fflush(stdin);

printf ("

Do you want to continue?(y/n):- ");

scanf("%c",&c);

if (c=='y')

goto repeat;

getch();

}

---------------------------------------------------------------------------------------------------------------------------------------------------

3)

4)

#include<stdio.h>

#include<conio.h>

void main()

{

int n,i,c=0;

clrscr();

printf("enter the number:");

scanf("%d",&n);

for(i=1;i<=n;i++)

{

if(n%i==0)

{

c=c+1;

}

}

if(c==2)

printf("number is prime");

else

printf("number is not prime");

getch();

}

-------------------------------------------------------------------------

5)

#include<stdio.h>

#include<conio.h>

void main()

{

int a,b,c;

clrscr();

printf("enter the number:");

scanf("%d",&a);

for(b=2;b<a/2;b++)

{

if(n%i==0)

{

printf("\n Its not a Prime number");

c=1;

break;

}

if(flag==0)

printf("\n Its a Prime Number");

getch();

}

}

1) Program for Prime Number Generation

#include <stdio.h>

main()

{

int n,i=1,j,c;

clrscr();

printf("Enter Number Of Terms

");

printf("Prime Numbers Are Follwing

");

scanf("%d",&n);

while(i<=n)

{

c=0;

for(j=1;j<=i;j++)

{

if(i%j==0)

c++;

}

if(c==2)

printf("%d ",i)

i++;

}

getch();

}

--------------------------------------------------------------------------------------------------------------------------------------------------

2)Program for finding the prime numbers

#include <stdio.h>

#include <conio.h>

void main()

{

int n,m,k,i,max;

char c;

clrscr();

repeat: max=0;

k=2;

n=1;

printf("You want prime numbers upto:- ");

scanf("%d",&max);

printf("

");

for (i=1;i<=max;i++)

{

again: m=(n/k)*k;

if (m!=n)

k=k+1;

else

goto try1;

if (k < n/2)

goto again;

else

printf("%d",n);

printf(" ");

try1: n=n+1;

k=2;

}

fflush(stdin);

printf ("

Do you want to continue?(y/n):- ");

scanf("%c",&c);

if (c=='y')

goto repeat;

getch();

}

---------------------------------------------------------------------------------------------------------------------------------------------------

3)

- #include <stdio.h>
- int main(void) {
- int n,
- lcv,
- flag; /* flag initially is 1 and becomes 0 if we determine that n
- is not a prime */
- printf("Enter value of N > ");
- scanf("%d", &n);
- for (lcv=2, flag=1; lcv <= (n / 2); lcv++) {
- if ((n % lcv) == 0) {
- if (flag)
- printf("The non-trivial factors of %d are: \n", n);
- flag = 0;
- printf("\t%d\n", lcv);
- }
- }
- if (flag)
- printf("%d is prime\n", n);
- }

4)

#include<stdio.h>

#include<conio.h>

void main()

{

int n,i,c=0;

clrscr();

printf("enter the number:");

scanf("%d",&n);

for(i=1;i<=n;i++)

{

if(n%i==0)

{

c=c+1;

}

}

if(c==2)

printf("number is prime");

else

printf("number is not prime");

getch();

}

-------------------------------------------------------------------------

5)

#include<stdio.h>

#include<conio.h>

void main()

{

int a,b,c;

clrscr();

printf("enter the number:");

scanf("%d",&a);

for(b=2;b<a/2;b++)

{

if(n%i==0)

{

printf("\n Its not a Prime number");

c=1;

break;

}

if(flag==0)

printf("\n Its a Prime Number");

getch();

}

}

Sep 02, 2008 | Computers & Internet

May 21, 2014 | Texas Instruments TI-89 Calculator

Feb 17, 2014 | Texas Instruments TI-89 Calculator

44 people viewed this question

Usually answered in minutes!

×