Exponential remainders?

can anyone help me in finding the remainder when 39423^{942} is divided by 2014?? I dont need answer just help!!!!! please.

#Algebra #NumberTheory #Remainder-FactorTheorem #Division

Note by Gautam Sharma
6 years, 7 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

ϕ(2014)=936\phi(2014)=936

And gcd(3,2014)=1\gcd(3,2014)=1

By Euler-Fermat theorem we have 3ϕ(2014)39361mod20143^{\phi(2014)}\equiv 3^{936}\equiv 1\mod 2014

3936×363942729mod2014\Rightarrow 3^{936}\times 3^6\equiv 3^{942}\equiv 729 \mod 2014

Aneesh Kundu - 6 years, 7 months ago

Log in to reply

please explain it or give another way please please.........

Gautam Sharma - 6 years, 7 months ago

Log in to reply

Sorry for my mistake I've now edited it. There's no other method to my knowledge. U can look up this theorem in the brilliant wiki.

Aneesh Kundu - 6 years, 7 months ago

Log in to reply

@Aneesh Kundu @GAUTAM SHARMA Check out Euler's Theorem in the Modular Arithmetic Wiki. That should provide you with explanations about how to approach problems like this.

Calvin Lin Staff - 6 years, 7 months ago

Log in to reply

@Calvin Lin Thanks D);.

Gautam Sharma - 6 years, 7 months ago

@Aneesh Kundu NO Problem. BTW IT WAS YOUR QUESTION. I got k=3 but was unable to get remainder.

Gautam Sharma - 6 years, 7 months ago

I always use Euler's totient function since it reduces exponents into a fathomable number. (Though I still do not know the proof of the theorem, would be great if someone presents one)

Marc Vince Casimiro - 6 years, 6 months ago

Log in to reply

U may find it here

Aneesh Kundu - 6 years, 6 months ago

I want to ask How to read it or interpret this like when we do 12/3=4 , we say when 12 is divided by 3 we get 4 as a quotient.How to read it?

Gautam Sharma - 6 years, 6 months ago

Log in to reply

121mod1112\equiv 1 \mod 11

is read as "12 congruent to 1 mod 11" or "12 equivalent to 1 mod 11"

Aneesh Kundu - 6 years, 6 months ago
×

Problem Loading...

Note Loading...

Set Loading...