Modulus and Congruency Problem

  • Thread starter Thread starter war485
  • Start date Start date
  • Tags Tags
    Modulus
Click For Summary

Homework Help Overview

The discussion revolves around a problem involving modulus and congruency, specifically focusing on integers that satisfy certain conditions related to modulo 17. The first part of the problem requires listing integers within a specified range that are congruent to 7 modulo 17, while the second part asks for representatives modulo 17 that are multiples of 3.

Discussion Character

  • Exploratory, Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants explore the congruency condition and attempt to list integers that fit the criteria. Some express uncertainty about their answers and seek validation. There is also confusion regarding the interpretation of the second part of the problem, particularly about whether it refers to multiples of 3 from the first set or a new set of representatives modulo 17.

Discussion Status

Several participants have provided insights and clarifications regarding the conditions of the problem. There is an ongoing exploration of the requirements for the second part, with some participants questioning the phrasing of the problem and the implications of the modulo operation.

Contextual Notes

Participants note the potential for misunderstanding the problem's requirements, particularly regarding the distinction between the sets involved in parts a and b. There is also discussion about the nature of remainders in relation to division and congruency.

war485
Messages
90
Reaction score
0

Homework Statement



a) List all integers, A, that is in the range where A is greater than -51 and less than 51 such that it also satisfies: A is congruent to 7 (mod 17)

b) has a set of representatives modulo 17, made up entirely of multiples of 3

Homework Equations



Only need to know what modulo is, which I believe is:
when a is congruent to b (mod n)
then (a-b) is a multiple integer of n

also, mod is for finding the remainder of a division

The Attempt at a Solution


(x-7)=17n ---> x = 17n + 7
a) going by what I think is true (above) then I think possible answers for A are:
-44,-27,-10,7,24,41

< never done congruencies before >
Is that right?

b) This is where I got really stumped because it seemed too easy:
0,3,6,9,12,15,18,21,24,27,30, 33,36,39,42,45,48 (similarly for the negatives) ?
 
Physics news on Phys.org
For a) you're not far off. The set is {-41, -24, -7, 10, 27, 44}. Notice that this set is {-34 - 7, -17 - 7, 0 - 7, 17 - 7, 34 - 7, 51 - 7}.

For b) I'm not totally clear what the problem is asking for. Is it the numbers in the first set that are multiples of 3? If so, only -24 and 27 would be included.
 
war485 said:

Homework Statement



a) List all integers, A, that is in the range where A is greater than -51 and less than 51 such that it also satisfies: A is congruent to 7 (mod 17)

b) has a set of representatives modulo 17, made up entirely of multiples of 3

Homework Equations



Only need to know what modulo is, which I believe is:
when a is congruent to b (mod n)
then (a-b) is a multiple integer of n

also, mod is for finding the remainder of a division

The Attempt at a Solution


(x-7)=17n ---> x = 17n + 7
a) going by what I think is true (above) then I think possible answers for A are:
-44,-27,-10,7,24,41
Good. Notice that each of those is the previous number plus 17.

< never done congruencies before >
Is that right?

b) This is where I got really stumped because it seemed too easy:
0,3,6,9,12,15,18,21,24,27,30, 33,36,39,42,45,48 (similarly for the negatives) ?
No, it is the remainders, after division by 17 that must be multiples of 3:
3, 20, 37: 3= 0(17)+ 3, 20= 1(17)+ 3, 37= 2(17)+ 3. Again, those differ by 17. I started with 3 and added 17. To get the negatives, subtract 17 rather than add: 3- 13= -14, -31, -48: -14= -1(17)+ 3, -31= -2(17)+ 3, -48= -3(17)+ 3
 
HallsofIvy said:
No, it is the remainders, after division by 17 that must be multiples of 3:
3, 20, 37: 3= 0(17)+ 3, 20= 1(17)+ 3, 37= 2(17)+ 3. Again, those differ by 17. I started with 3 and added 17. To get the negatives, subtract 17 rather than add: 3- 13= -14, -31, -48: -14= -1(17)+ 3, -31= -2(17)+ 3, -48= -3(17)+ 3

Why is it the remainders after division by 17, and not before, that has to be multiples of 3?
 
Last edited:
Because of the way the problem is stated.
You want the numbers in this set -- {-41, -24, -7, 10, 27, 44} -- that are divisible by 3. At least that was my interpretation of the problem. I asked for clarification in post #2, but you didn't reply to my question.
 
Mark44 said:
Because of the way the problem is stated.
You want the numbers in this set -- {-41, -24, -7, 10, 27, 44} -- that are divisible by 3. At least that was my interpretation of the problem. I asked for clarification in post #2, but you didn't reply to my question.

whoups! Part b does not refer to the previous set in part a. Part b is asking for a completely new set.
 
The representatives mod 17 are the numbers in the set {0, 1, 2, 3, ..., 15, 16}. Which of them are multiples of 3?
 
war485 said:
Why is it the remainders after division by 17, and not before, that has to be multiples of 3?
What could you possibly mean by remainder before dividing? There are no remainders until you have divided!
 
Mark44 said:
The representatives mod 17 are the numbers in the set {0, 1, 2, 3, ..., 15, 16}. Which of them are multiples of 3?

obviously 3, 6, 9, etc... as I originally thought, but that would be almost too easy. Would this set "skip" over number 51 (which is 17x3) and 102 (17x6), ... etc? Should this set just be listed from 3 to 48? or can I just list 3, 6, 9 and then put a "..." and assume others will know what I meant? The question never asked for it to be a finite set.

HallsofIvy; said:
What could you possibly mean by remainder before dividing? There are no remainders until you have divided!

I asked that because of the way the question was worded, and I realized I worded my question very poorly (sorry); I wasn't sure if it was asking for a number mod 17 that was divisible by 3 or a number divisible by 3 mod 17.
 
  • #10
If I understand the second problem (I'm not sure that I do), what you want are the representatives modulo 17 that are multiples of 3. The representatives mod 17 are 0, 1, 2, 3, 4, ..., 15, and 16. The answer to the question as I understand it are 3, 6, 9, 12, and 15.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 27 ·
Replies
27
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 8 ·
Replies
8
Views
5K