Question

Find all integers n (positive, negative, or zero) so that (n^2)+1 is divisible by n+1. ANS:...

Find all integers n (positive, negative, or zero) so that (n^2)+1 is divisible by n+1.

ANS: n = -3, -2, 0, 1

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Characterize the set of all positive integers n for which φ(n) is divisible by 2 but...
Characterize the set of all positive integers n for which φ(n) is divisible by 2 but not by 4
Prove by induction that 5^n + 12n – 1 is divisible by 16 for all positive...
Prove by induction that 5^n + 12n – 1 is divisible by 16 for all positive integers n.
Find the number of positive integers not exceeding 10,000 that are not divisible by 3, 4,...
Find the number of positive integers not exceeding 10,000 that are not divisible by 3, 4, 7, or 11.
Prove that for all positive integers n, (1^3) + (2^3) + ... + (n^3) = (1+2+...+n)^2
Prove that for all positive integers n, (1^3) + (2^3) + ... + (n^3) = (1+2+...+n)^2
Prove by induction that 5n + 12n – 1 is divisible by 16 for all positive...
Prove by induction that 5n + 12n – 1 is divisible by 16 for all positive integers n.
4. Let Z be the set of all integers (positive, negative and zero.) Write a sequence...
4. Let Z be the set of all integers (positive, negative and zero.) Write a sequence containing every element of Z.
prove that for all non-negative integers k, k5-k is divisible by 10
prove that for all non-negative integers k, k5-k is divisible by 10
Show that for all positive integers n ∑(from i=0 to n) 2^i=2^(n+1)−1 please use induction only
Show that for all positive integers n ∑(from i=0 to n) 2^i=2^(n+1)−1 please use induction only
How many positive integers less than 50 are not divisible by 2, 3 or 5? [8]...
How many positive integers less than 50 are not divisible by 2, 3 or 5? [8] Check your solution by listing the numbers and eliminating those which are divisible by 2, 3 or 5 and counting the remainder.
Prove that for each positive integer n, (n+1)(n+2)...(2n) is divisible by 2^n
Prove that for each positive integer n, (n+1)(n+2)...(2n) is divisible by 2^n
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT