Questions on Remainder & Integer Divisibility

Click For Summary

Discussion Overview

The discussion revolves around two mathematical questions related to remainder and integer divisibility, specifically focusing on the remainder of 100! when divided by 103 and the conditions under which one integer divides another based on their prime factorizations. The scope includes theoretical exploration and mathematical reasoning.

Discussion Character

  • Exploratory
  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant questions the remainder of 100! when divided by 103 and expresses uncertainty about how to approach the problem.
  • Another participant suggests starting with the remainder of 102! divided by 103, arguing that since 103 is prime, the numbers from 1 to 102 form a multiplicative group, leading to the conclusion that 102! is congruent to -1 mod 103.
  • A subsequent participant requests clarification on how the -1 result is derived, indicating confusion about the explanation provided.
  • Another participant references Wilson's theorem in relation to the first question and prompts discussion on how the exponents in prime factorizations can determine divisibility between two integers.
  • One participant elaborates on the properties of integers modulo a prime, explaining that in the field of integers modulo 103, the product of all elements results in -1, thus reinforcing the earlier claim about 102! modulo 103.

Areas of Agreement / Disagreement

Participants express varying levels of understanding and agreement on the application of Wilson's theorem and the properties of prime numbers in modular arithmetic. There is no consensus on the remainder of 100! or the conditions for divisibility between the integers a and b.

Contextual Notes

Some participants rely on specific mathematical theorems and properties that may not be universally understood, leading to confusion. The discussion includes unresolved steps in the reasoning process regarding the calculations and implications of the prime factorization.

clueles
Messages
15
Reaction score
0
I have 2 questions.

1)what is the remainder with 100! is divided by 103? explain your answer

2)a = 238000 = 2^4 x 5^3 x 7 x 17 and b=299880 = 2^3 x 3^2 x 5 7^2 17. Is there an integer so that a divides b^n? if so what is the smallest possibility for n?

the first one i have no idea how to even start it and the second one i know that the prime factorization helps to find out what n is.
 
Physics news on Phys.org
I think I would start by asking what is the remainder when 102! is divided by 103. i.e. zero. Then let's see if that helps.

Since 103 is prime, then mod 103, the numbers from 1 to 102 forma multiplicative group, i.e. each has an inverse such thnat its product with that guy is 1. now there are two numbers equal to their own inverse 1 and 102 = -1. so no other number equals its own inverse. thus when we multiplky all these numbers to gether, we get -1. so the remainder of 102! is -1 mod 103. but 102! equals (102)(101)(100!),

so (102)(101)(100!) = -1 mod 103. does that help?
 
can you explain it again

i'm still confused about it. how do you get the -1. I'm sorry would you be able to explain it a different way?
 
1) have you seen Wilson's theorem? If so, mathwonk's post should look familiar

2) How do the exponents in the prime factorization tell you when one number is divisible by another? Can you answer this- does a divide b? Can you tell this just from comparing exponents?
 
The integers taken modulo any prime p form a field. 103 is prime, so [tex]\mathbb{Z}_{103}[/tex] is a field. Thus, [tex]\forall x \in \mathbb{Z}_{103}, \exists x^{-1} \in \mathbb{Z}_{103} \ \mbox{s.t.} \ xx^{-1} = x^{-1}x = 1[/tex]. Now, if [tex]x=1 \ \mbox{or} \ x=102 = -1, \ \mbox{then} \ x^{-1} = x \ \mbox{in} \ \mathbb{Z}_{103}[/tex]. Thus when you multiply all the elements in [tex]\mathbb{Z}_{103}[/tex] together, ie. take [tex]102! = \prod_{\mathbb{Z}_{103} \ni i=1}^{102} i[/tex], you just get [tex](102)(1) = (-1)(1) = -1[/tex], and so [tex]102! \equiv -1 \equiv 102 \ (\mbox{mod} 103)[/tex]
 
Last edited:

Similar threads

  • · Replies 5 ·
Replies
5
Views
927
Replies
48
Views
7K
  • · Replies 33 ·
2
Replies
33
Views
5K
Replies
9
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K