Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized for You
we will pick new questions that match your level based on your Timer History
Track Your Progress
every week, we’ll send you an estimated GRE score based on your performance
Practice Pays
we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
Your score will improve and your results will be more realistic
Is there something wrong with our timer?Let us know!
If n^m leaves a remainder of 1 after division by 7 for all positive in
[#permalink]
02 Oct 2022, 09:08
Given that n^m leaves a remainder of 1 after division by 7 for all positive integers n that are not multiples of 7 and we need to find m could be equal to
Let's take each option choice and check which one satisfies the statement
(A) 2 => \(n^2\) gives 1 remainder when divided by 7 for all values of n which are not multiples of 7 Let's take n=2 we get \(2^2\) = 4 divided by 7 gives 4 remainder ≠ 1 => NOT POSSIBLE
(B) 3 => \(n^3\) gives 1 remainder when divided by 7 for all values of n which are not multiples of 7 Let's take n=2 we get \(2^3\) = 8 divided by 7 gives 1 remainder Let's take n=3 we get \(3^3\) = 27 divided by 7 gives 6 remainder ≠ 1 => NOT POSSIBLE
(C) 4 => \(n^4\) gives 1 remainder when divided by 7 for all values of n which are not multiples of 7 Let's take n=2 we get \(2^4\) = 16 divided by 7 gives 2 remainder ≠ 1 => NOT POSSIBLE
(D) 5 => \(n^5\) gives 1 remainder when divided by 7 for all values of n which are not multiples of 7 Let's take n=2 we get \(2^5\) = 32 divided by 7 gives 4 remainder ≠ 1 => NOT POSSIBLE
(E) 6 So, Answer will be E but let's check for 1 number => \(n^6\) gives 1 remainder when divided by 7 for all values of n which are not multiples of 7 Let's take n=2 we get \(2^6\) = 64 divided by 7 gives 1 remainder => POSSIBLE
So, Answer will be E Hope it helps!
Watch the following video to learn the Basics of Remainders
gmatclubot
If n^m leaves a remainder of 1 after division by 7 for all positive in [#permalink]