Home
Class 12
MATHS
Show that the number of primes in N is i...

Show that the number of primes in N is infinite.

Promotional Banner

Topper's Solved these Questions

  • BASIC MATHEMATIC & LOGARITHM

    MOTION|Exercise Exercise - 1|36 Videos

  • BASIC MATHEMATIC & LOGARITHM

    MOTION|Exercise Exercise - 2 (Level -I)|19 Videos

  • AREA UNDER THE CURVE

    MOTION|Exercise EXERCISE - 4 LEVEL - II|14 Videos

  • BINOMIAL THEOREM

    MOTION|Exercise Exercise -4 (Level - II) ( Previous Year )|7 Videos

Similar Questions

Explore conceptually related problems

Show that the number of states with the same quantum number n is 2n^(2) .

Prime number

Let p be a prime number such that p>=3. Let n=p!+1. The number of primes in the list n+1,n+2,n+3,......n+p-1 is

If a in N and 1 le a le 20 , then find the number of prime numbers in the form of 5a+1 .

If a varepsilon N and 1<=a<=20, then find the number of prime numbers in the form of 5a+1.

Write the prime factorisation of the number 27300. In the factorisation find (i) the total number of primes and (ii) the total number of distinct primes.

If A={ p in N,p is a prime and p=(7n^(2)+3n+3)/(n) for some n in N ), then the number of elements in the set A is