Hey there! We receieved your request
Stay Tuned as we are going to contact you within 1 Hour
One of our academic counsellors will contact you within 1 working day.
Click to Chat
1800-5470-145
+91 7353221155
Use Coupon: CART20 and get 20% off on all online Study Material
Complete Your Registration (Step 2 of 2 )
Sit and relax as our customer representative will contact you within 1 business day
OTP to be sent to Change
Prove that for any integer n > 1,4^n + n^4 is composite.
The question can be solved with sophie germain identity.
To prove that a no is non prime, we have to prove tht it can be resolutted into two integral factors
For odd n:
4n+n4= 4(4n-1)+n4 = 4(4(n-1)/4)4+n4. Taking 4(n-1)/4 as t , the equation becomes 4t4+ n4
Solving this by Sophie Germain identity
= (n4+2(t)2+2nt)(n4+2(t)2-2nt)
Now Putting 4(n-1)/4 in the palce of n , the equation becomes
=(n4+2(4(n-1)/2) +2n(4(n-1)/4))(n4+2(4(n-1)/2) -2n(4(n-1)/4 ))
=(n4+2n +2n(2(n-1)/2))(n4+2n -2n(2(n-1)/2 ))
Now fr proving that it is not a prime, We have to prove that the two factors n4+2n -2n(2(n-1)/2 ) and n4+2n +2n(2(n-1)/2 )is integral. Since n4+2n is always integral we ave to prove 2n(2(n-1)/2)
For n is odd the no greater than 1 , the factors are definitely integers as (2(n-1)/2 ) is integral fr every odd n.
For even n:
Let n is a even no, then it can be represented in form of 2m where m is a natural no
(2m)4+(4)2m always consist of 2 as its factor. So it is a composite for even n.
Hence Proved.
Get your questions answered by the expert for free
You will get reply from our expert in sometime.
We will notify you when Our expert answers your question. To View your Question
Win Gift vouchers upto Rs 500/-
Register Yourself for a FREE Demo Class by Top IITians & Medical Experts Today !