MY CART (5)

Use Coupon: CART20 and get 20% off on all online Study Material

ITEM
DETAILS
MRP
DISCOUNT
FINAL PRICE
Total Price: Rs.

There are no items in this cart.
Continue Shopping
Menu
Grade: 9
        
Show that there are infinitely many primes of th form 4n+3
2 years ago

Answers : (2)

Arun
23742 Points
							
Dear student
 
We emulate Euclid’s argument for the existence of infinitely many primes:
Let’s argue by contradiction. Suppose there are finitely many primes of the form
4n + 3 and they are exactly {p1, . . . , pk}. Consider N = (p1 · · · pk)
2 + 2. Then
N ≡ 3 (mod 4). On the other hand N is odd and is not divisible by any pi
. It
follows that all prime divisors of N are congruent to 1 modulo 4. Conclude N ≡ 1
(mod 4). A contradiction!
 
Regards
Arun (askIITians forum expert)
2 years ago
Atharv Sagar Suryawanshi
25 Points
							
 Sir I didn't understood the last argument N is not divisible by pi . Is i>k?
As N is product of primes then it should be divisible by pi right?
2 years ago
Think You Can Provide A Better Answer ?
Answer & Earn Cool Goodies


Course Features

  • 731 Video Lectures
  • Revision Notes
  • Previous Year Papers
  • Mind Map
  • Study Planner
  • NCERT Solutions
  • Discussion Forum
  • Test paper with Video Solution


Course Features

  • 731 Video Lectures
  • Revision Notes
  • Test paper with Video Solution
  • Mind Map
  • Study Planner
  • NCERT Solutions
  • Discussion Forum
  • Previous Year Exam Questions


Ask Experts

Have any Question? Ask Experts

Post Question

 
 
Answer ‘n’ Earn
Attractive Gift
Vouchers
To Win!!! Click Here for details