What is the Remainder When \(121^{103}\) is Divided by 101?

  • Context: MHB 
  • Thread starter Thread starter maxkor
  • Start date Start date
  • Tags Tags
    Division Remainder
Click For Summary
SUMMARY

The remainder when \(121^{103}\) is divided by 101 is 21. This conclusion is derived using Fermat's Little Theorem, which states that for a prime number \(p\), \(a^p \equiv a \pmod{p}\). By applying this theorem, it is established that \(121^{101} \equiv 20 \pmod{101}\) and subsequently calculating \(121^{103} \equiv 97 \cdot 20 \equiv 21 \pmod{101}\).

PREREQUISITES
  • Understanding of modular arithmetic
  • Familiarity with Fermat's Little Theorem
  • Basic exponentiation techniques
  • Knowledge of prime numbers
NEXT STEPS
  • Study the applications of Fermat's Little Theorem in number theory
  • Learn advanced modular arithmetic techniques
  • Explore other theorems related to prime numbers
  • Investigate computational methods for large exponentiation
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in modular arithmetic and prime number applications.

maxkor
Messages
79
Reaction score
0
What is the remainder of the division number $121^{103}$ by 101
 
Mathematics news on Phys.org
Hi maxkor,

Here are two quick hints to point you in the right direction:

1) Note that 101 is prime

2) Fermat's Little Theorem might be useful here

Fermat's little theorem - Wikipedia, the free encyclopedia

See what you can come up with using these notes. Let me know if anything is still unclear/not quite right.
 
maxkor said:
What is the remainder of the division number $121^{103}$ by 101

Hi maxkor,

Fermat's little theorem states that if $$p$$ is a prime number, then for any integer $$a$$, the number $$a^p − a$$ is an integer multiple of $$p$$. In the notation of modular arithmetic, this is expressed as

$$ a^p \equiv a \pmod p. $$

Therefore, we have that

$$ 121^{101}\; \equiv \;121\; \equiv \;20\; (mod \;101) $$
$$ 121\; \equiv \;20\; (mod \;101) $$
$$ 121^{2}\; \equiv \;20^{2} \;\equiv\; 400 \;\equiv \;97 \;(mod \; 101) $$
$$ 121^{103}\; \equiv \;121^{2}\; \cdot\; 121^{101}\; \equiv \;97 \;\cdot \;20\; \equiv \;1940\; \equiv \;21\; (mod \;101) $$

The remainder of the division number $$ 121^{103} $$ by $$ 101 $$ is $$ 21 $$
 
Last edited:

Similar threads

  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
2
Views
2K
Replies
2
Views
2K
Replies
2
Views
2K