Find remainder when (2∗4∗6∗8⋯∗2016)−(1∗3∗5∗7⋯∗2015) is divided by 2017

In summary, the mathematical expression for this problem is (2*4*6*8*...*2016) - (1*3*5*7*...*2015). To find the remainder when divided by 2017, the modulus operator can be used. This problem can also be solved using the Chinese Remainder Theorem. The number 2017 is significant because it is a prime number. This problem can be generalized for any series of even and odd numbers using the formula (a1*a2*a3*...*an)-(b1*b2*b3*...*bm), where a1 to an are even numbers and b1 to bm are odd numbers.
  • #1
kaliprasad
Gold Member
MHB
1,335
0
$ ( 2 * 4 * 6 * 8 \cdots * 2016) - ( 1 * 3 * 5 * 7 \cdots * 2015)$ is divided by 2017 what is the remainder
 
Last edited:
Mathematics news on Phys.org
  • #2
Fun little problem.
First p=2017 is a prime congruent to 1 mod 4; i.e (p-1)/2 is even. Let $x=2\times4\times\cdots \times p-1$ and $y=1\times3\times5\cdots\times p-2$. Now there are (p-1)/2 factors in x. Write x in reverse order: $x=p-1\times p-3\times p-5\cdots p-(p-2)$. So mod p we see that $x=(-1)^{(p-1)/2}1\times3\times5\cdots\times p-2=y$. So x - y is 0 mod p. Notice the result is true for any prime that is 1 mod 4.
 
  • #3
johng said:
Fun little problem.
First p=2017 is a prime congruent to 1 mod 4; i.e (p-1)/2 is even. Let $x=2\times4\times\cdots \times p-1$ and $y=1\times3\times5\cdots\times p-2$. Now there are (p-1)/2 factors in x. Write x in reverse order: $x=p-1\times p-3\times p-5\cdots p-(p-2)$. So mod p we see that $x=(-1)^{(p-1)/2}1\times3\times5\cdots\times p-2=y$. So x - y is 0 mod p. Notice the result is true for any prime that is 1 mod 4.

above is correct but p need not be prime. you have not used the fact. 2017 is incidentally prime but this fact is not used.
 

Related to Find remainder when (2∗4∗6∗8⋯∗2016)−(1∗3∗5∗7⋯∗2015) is divided by 2017

1. What is the mathematical expression for this problem?

The mathematical expression is (2*4*6*8*...*2016) - (1*3*5*7*...*2015).

2. How do you find the remainder when divided by 2017?

To find the remainder, we can use the modulus operator (%) which gives the remainder when one number is divided by another. In this case, we would divide the result of the expression by 2017 and use the remainder as the answer.

3. Can this problem be solved without calculating the entire product?

Yes, it can be solved using a shortcut method called the Chinese Remainder Theorem. This method involves breaking down the problem into smaller parts and finding the remainder for each part, then combining them to find the final remainder.

4. What is the significance of using the number 2017 in this problem?

The number 2017 is a prime number, which means it is only divisible by 1 and itself. This makes it a useful number in mathematics, especially in problems involving remainders.

5. Can this problem be generalized for any series of even and odd numbers?

Yes, this problem can be generalized for any series of even and odd numbers. The formula would be (a1*a2*a3*...*an)-(b1*b2*b3*...*bm), where a1 to an are even numbers and b1 to bm are odd numbers.

Similar threads

  • General Math
Replies
1
Views
769
  • General Math
Replies
2
Views
983
Replies
11
Views
515
Replies
3
Views
512
Replies
5
Views
2K
Replies
4
Views
941
  • Precalculus Mathematics Homework Help
Replies
1
Views
550
Replies
5
Views
1K
Replies
1
Views
761
Back
Top