Uploaded by maa4000

How to prove that n n squared plus twenty is divisible by forty

advertisement
How can I prove that n (n squared plus twenty) is divisible by forty eight?
Ad by DuckDuckGo
How do hidden web trackers put my privacy at risk?
Hidden trackers can follow you around the Internet and watch much of what you do online, but there are
simple tools you can use t…
Continue reading
7 Answers
Best
Arpit Agrawal
miss Mathematics out of my life · Author has 374 answers and 1.3M answer views · 8y
X(n) = n(n
2
+ 20)
For n = 2, X = 48 which is divisible.
Let us assume X is divisible by 48 for a general number n = m for m>=2
So that
2
m(m
+ 20)
is divisible by 48
Now we shall prove that X is divisible by 48 for m+2 as well
2
X(m + 1) = (m + 2)[(m + 2)
2
= (m + 2)(m
2
= m(m
2
= m(m
2
= m(m
+ 20]
+ 4m + 4 + 20)
2
+ 4m + 4 + 20) +2(m
+ 4m + 4 + 20)
2
+ 20) +m(4m + 4) + 2(m
2
+ 20) + 6m
+ 4m + 4 + 20)
+ 12m + 48
= 48Z + 6m(m + 2) + 48
Now if we prove that
6m(m + 2)
is divisible by 48 we are done.
Since m is even, one of the factors m or m+2 is a multiple of 4 as well. So the overall m(m+2) is a multiple
of 8 and hence 6m(m+2) is a multiple of 48.
Now, we have proved that if we assume X to be divisible by m, X is also divisible by m+2, and we have
shown X to be divisible by 2, so it concludes that X is divisible by 4 and hence 6 and so on.
This is called Proof by Principal of Mathematical induction
1.8K views · View upvotes
Related questions (More answers below)
How do you prove (n^2 - 1) is exactly divisible by 24, where n is a positive integer greater than or
equal to 5?
1,925 Views
How do you prove that 2^48 _1 is divisible by 97?
1,392 Views
How do you prove that 3n-2n2-1 is divisible by 8?
163 Views
How do I prove that
2
(n )!
is divisible by
n+1
(n!)
?
7,924 Views
How do you prove that 3^(n)-2n^(2)-1 is divisible by 8?
2,854 Views
Siddhant Sharan
Math makes us all Noobs. · 8y
Originally Answered: Show that n (n square plus twenty) is divisible by fourtyeight?
I'd like to do this problem by induction.
See below.
To prove
2
n (n + 20)
is divisible by
48
Now n is even . => n = 2x (x is a natural number)
Which makes our expression
2
8x(x
Now we just have to prove that
+ 5)
2
x(x
+ 5)
is a multiple of 6.
Using induction it can be done quite trivially.
First check the base case. Which is true.
Then assume
2
x(x
+ 5)
is = some
6y
Where y is a natural number.
Now we see that for x+1 in the expression,
3
= (x + 1)
3
= (x
+ 5x + x
+ 5) + 6 + 3x(x + 1)
= 6y + 6 + 3 ∗ (divisible by 2)
Which makes the expression divisible by 6. :)
Hence the original is divisibl… (more)
Promoted by Turing
How do companies tackle the problem of hiring strong software engineers in San Francisco?
Vijay Krishnan
2y
tl;dr: Try turing.com Jonathan and I faced this problem when running our previous AI startup in the bay
area. The strong engineers we knew from our Stanford alum networks were hard to hire, since there was
fierce competition from other bay area companies to hire them. We solved this proble…
Continue reading
Sadik
8y
To Prove :- n(n^2 + 20) = 48k.
Now, n can't be odd.
so take n = 2m
2m (4m^2 + 20) = 8m(m2 + 5).
Now, if we can prove that m(m^2 + 5) is a multiple of 6 then we are done.
for m = 1
1(12 + 5) = 6, divisible by 6.
True for m = 1
Now, Suppose it's true for m = k
so k(k^2 + 5) = 6n
Now, we have to prove it for m = k + 1
(k+1)( (k+1)^2 + 5) = (k + 1) ( k^2 + 2k + 6)
= k(k^2 + 5) + 3k^2 + 3k + 6
Open in App
= 6n + 3( k(k + 1) + 2)
= 6n + 3(2p + 2) as k(k + 1) is always divisible by 2.
= 6(n + p + 1)
hence (k + 1)((k + 1)^2 + 5) is divisible by 6. and so it's true for m = k + 1.
So, we ca… (more)
Ripusudan Agrawal
There is no ignorance, there is only knowledge · 8y
Originally Answered: Show that n (n square plus twenty) is divisible by fourtyeight?
Let us say our even number be n = 2m ,
so by putting this value in
2
8m(m
n(n
2
+ 20)
+ 5)
Now this is to be divisible by 48
or we can say
2
m(m
+ 5)
should be divisible by 6
Now this is our main problem
m can be written as
we get
Sign In
m = 6a + x
(where x can take value from 0 to 5)
Putting this in
m(m
2
(6a + x)(36a
2
+ 5)
2
+ x
we get
+ 12ax + 5)
We will consider different value of x one by one
Case 1: x=0
6a(36a
2
+ 5)
divisible by 6
Case 2: x=1
(6a + 1)(36a
(6a + 1)(36a
6(6a + 1)(6a
2
2
2
+ 1 + 12a + 5)
+ 12a + 6)
+ 2a + 1)
Divisible by 6
Case 3: x=2
(6a + 2)(36a
(6a + 2)(36a
2
2
6(3a + 1)(12a
+ 4 + 24a + 5)
+ 24a + 9)
2
+ 8a + 3)
Divisible by 6
C… (more)
Promoted by FinanceBuzz
How should I invest $1000?
FinanceBuzz
Updated Jan 10
Saving up $1,000 in your checking account is a huge milestone. And if you don’t need it to pay off bills or
debt, you have a huge opportunity to get ahead that most people don’t. If you’re like most people, you’ll just
leave the money you’ve saved in a checking or savings account. This is…
Continue reading
Related questions (More answers below)
How do you prove that 2^77 + 1 is divisible by 43?
1,084 Views
If S= 2016 C (1013) and S is divisible by 7^n, what is the maximum value of n?
728 Views
N into n square minus 1 is always divisible by what?
1,266 Views
How do I prove that (n!)! is divisible by (n!) ^(n-1)!?
1,688 Views
n
How do you show that
x
− x
is divisible by n for prime n?
1,365 Views
Jiemba Noah
Janitor at Janitorial Work · Author has 891 answers and 345.2K answer views · 3y
n(n
2
?
+ 20) = 48k
n has to be even, otherwise
n(n
2
+ 20)
is odd.
n = 2p
2
2p(4p
2
p(p
?
+ 20) = 48k
?
+ 5) = 6k
If
p
is even then
Is
p
divisible by
2
p
+ 5 = 9q
Therefore
2
2
p(p
2
p(p
3?
+ 5) mod 2 = 0 .
If yes then
2
p(p
If
p
is odd then
+ 5) mod 3 = 0 .
2
p
+ 5
is even and
Otherwise
2
p(p
p = 3q ± 1
+ 5) mod 2 = 0 .
and
± 6q + 6 mod 3 = 0 .
+ 5)
divides
2
and
3.
Thus
n(n
2
2
+ 20) = 8p(p
+ 5)
divides
2 ∗ 3 ∗ 8 = 48
QED
Your response is private
Was this worth your time?
This helps us sort answers on the page.
Absolutely not
Vijay Bhaskar
Passionate about number theory · Author has 58 answers and 151.8K answer views · 7y
N = n*(n^2+20) = 2k(4k^2+20) = 8k(k^2+5)
If k is odd, k^2+5 is even.
Hence k(k^2+5) | 2 ---------- 1
If k = 0 mod 3, k(k^2+5) | 3
If k = 1 mod 3, k^2 = 1 mod 3 => k^2 + 5 = 5+1 = 0 mod 3 => k(k^2+5) | 3
Definitely yes
If k = 2 mod 3 = -1 mod 3, k^2 = 1 mod 3 => k^2 + 5 = 5+1 = 0 mod 3 => k(k^2+5) | 3
Hence k(k^2+5) | 3 for all k ------- 2
From 1 and 2, k(k^2+5) | 6
Hence N | 8*6 or N | 48
Swadesh Kumar Nayak
Works at Reliance Jio (company) · 8y
If n is even, it can be expressed as 2u.
Let P= n(n squared + 20)
Substituting 'n' for '2u', we get the expression for P as 8u(u squared + 5).
Let Q= u(u squared + 5)
If 'u' is odd, (u squared + 5) is even and vice versa. Therefore Q is divisible by 2.
Now 'u' can be of three forms 3v, 3v+1 or 3v+2.
Case 1: u = 3v: Then Q is divisible by 3
Case 2: u = 3v+1: Then Q is divisible by 3 (Please substitute and confirm it for yourself)
Case 3: u=3v+2: Again Q is divisible by 3.
Therefore Q is divisible by 3 and 2.
Since P=8Q, P is divisible by 8*3*2=48. Hence Proved!
Related questions
How do you prove (n^2 - 1) is exactly divisible by 24, where n is a positive integer greater than or
equal to 5?
1,925 Views
How do you prove that 2^48 _1 is divisible by 97?
1,392 Views
How do you prove that 3n-2n2-1 is divisible by 8?
163 Views
How do I prove that
2
(n )!
is divisible by
n+1
(n!)
?
7,924 Views
How do you prove that 3^(n)-2n^(2)-1 is divisible by 8?
2,854 Views
How do you prove that 2^77 + 1 is divisible by 43?
1,084 Views
If S= 2016 C (1013) and S is divisible by 7^n, what is the maximum value of n?
728 Views
N into n square minus 1 is always divisible by what?
1,266 Views
How do I prove that (n!)! is divisible by (n!) ^(n-1)!?
1,688 Views
How do you show that
n
x
− x
is divisible by n for prime n?
1,365 Views
How do I prove that (n-1) (n+1) n^2 is divisible by 12?
3,645 Views
If a!\b! is divisible by 4, but not by 8, then what is the maximum value of a - b?
3,764 Views
How can I prove that
2n
5
n
− 2
is divisible by 23?
5,936 Views
For what value of n is
n
8
n
− 6
n
− 3
+ 1
divisible by 10?
2,410 Views
If you assume that n^2 is divisible by 3, how do you prove that n^2 is divisible by 9 (proof writing,
math)?
909 Views
About · Careers · Privacy · Terms · Contact · Languages · Your Ad Choices · Press · © Quora, Inc. 2022
Download