..
n
Chat with our AI personalities
N x N + 1 = answer
There is something missing from your question: what about the two consecutive integers? Is the proof required that one of them is divisible by 2? Or that their product is (which amounts to the same thing)? Showing that one of two consecutive number is divisible by 2: Suppose your two numbers are n and (n+1). If n is divisible by 2, ie n = 2k, the result is shown. Otherwise assume n is not divisible by 2. In this case n = 2m+1. Then: (n+1) = ((2m+1)+1) = 2m + 2 = 2(m+1) which is a multiple of 2 and so divisible by 2. QED. Showing that exactly one of two consecutive integers is divisible by two is shown above with the addition to the first part: "as (n+1) = 2k+1 is not divisible by two and so only n is divisible by 2." To show the product is divisible by 2, show either n is divisible by 2 or (n+1) is as above, then the result follows as one of n and (n+1) is divisible by 2 and so their product is.
Add any two numbers that add to 1134 or 7734. So pick any number, say n. Calculate the second number as 1134 - n or 7734 - n. Add these two.
one face eight edges and five corners * * * * * The above answer is complete rubbish. A pyramid is a generic term for three dimensional shapes which consist of an n-sided polygon (n > 2) as base and n triangular faces meeting at an apex above the base. For any integer n>2, a pryramid with an n-polygonal base has: n + 1 faces n + 1 vertices and 2n edges.
2n can be split into 2 n's so: n+n then add one to one of the n's and subtract one from one of the n's n+1+n-1 ^two consecutive odd integers^