Discrete Math
posted by Ron .
If n is a positive integer and n > 1,prove that (n) + (n1) is a perfect sq
(2) ( 2 )
Respond to this Question
Similar Questions

discrete math
Prove by contradiction that for any even integer a and any odd integer b, 4 does not divide (a^2 + 2b^2). Proposition: That 4k (k is any integer) = a^2 +2b^2, and a is even, and b is odd. But 4k is even (product of any integer and … 
Discrete Math
1. Assume that n is a positive integer. Use the proof by contradiction method to prove: If 7n + 4 is an even integer then n is an even integer. 2. Prove: n is an even integer iff 7n + 4 is an even integer. (Note this is an if and only … 
maths
A positive integer n is such that numbers 2n+1 and 3n+1 are perfect squares. Prove that n is divisible by 8. thanks 
math
Find a positive integer m such that 1 2m is a perfect square and 1 3m is a perfect cube. Can you find a positive integer n for which 1 2n is a perfect square, 1 3n is a perfect cube and 1 5n is a perfect fifth power? 
MATH
Find a positive integer m such that 1/2m is a perfect square and 1/3m is a perfect cube. Can you find a positive integer n for which 1/2n is a perfect square, 1/3n is a perfect cube and 1/5n is a perfect fifth power? 
Discrete Mathematics
Prove that if n is an odd positive integer, then 1 ≡ n(power of 2) (mod 4). 
Discrete Math
If n is a positive integer and n > 1, prove that (n over 2)+ (n1 over 2) is a perfect square. 
DISCRETE MATHS
We need to show that 4 divides 1n2 whenever n is an odd positive integer. If n is an odd positive integer then by definition n = 2k+1 for some non negative integer, k. Now 1  n2 = 1  (2k+1)2 = 4k24k = 4 (k24k). k is a nonnegative … 
DISCRETE MATHS
Prove that if n is an odd positive integer, then 1 ≡ n2 (mod 4). 
math
2x is a perfect square, 3x a perfect cube, and 5x a perfect 5th power. Find the sum of the exponents in the prime factorization of the smallest such positive integer x. Thank you.