What is the smallest positive integer b such that the following equivalence is satisfied:
7 3 2 ≡ b ( m o d 7 )
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I wonder how many people originally picked 0 as their answer.
Log in to reply
Forgetful "positive" .... we think negative in life most times....
Log in to reply
What do you think of my modulo set. Good for beginners? :D
Log in to reply
@Sharky Kesa – It's awesome. Every prob uses a different concept.
Log in to reply
@Satvik Golechha – I had been locked away not making any problems because I was thinking about problems I could make. My patience paid off. Modulo seemed like an awesome topic to do.
@Sharky Kesa – Yeah, you also try my sets... 2 of them are better than others, namely "Mistakes give rise to problems" (this one got famous, and @Satvik Golechha also has posted 1 problem for this set.... ) and other one "vegetable combinatorics".... Not that much for beginners, but good level, some of them are level 4 and 5 problems.
Log in to reply
@Aditya Raut – In the 'Mistakes give rise to problems', I got all but one right.
Sharky Kesa, I did.
i was going to write 0 but then i knew that u wouldn't post such an easy question
In the back of my head I knew the answer was 7, it just seemed a little too dumb to actually be the answer though.
The obvious answer is 0 but it's not positive. Therefore the smallest positive integer is 7
Problem Loading...
Note Loading...
Set Loading...
7 k ≡ 0 ( m o d 7 )
Hence the smallest positive value of b is multiple of 7 , the smallest positive one which is 7