Defining & Proving Modulo Multiplication in $\mathbb{Z}_k$

In summary, the conversation is about defining an inductive definition for multiplication in $\mathbb{Z}_k$, specifically for all $x\in \mathbb{N}_0$ and $y\in \mathbb{N}_0$, the expression $x\cdot_k y=(x\cdot y)\mod k$. The conversation also discusses using induction to prove that for $x\in \mathbb{N}_0$, it holds that $(x\cdot y)\mod k=(x\mod k)\cdot_k (y\mod k)$, and the correct way to apply induction in this case. The expert summarizer suggests using an inductive definition of the form $x\cdot_k 0=0
  • #1
mathmari
Gold Member
MHB
5,049
7
Hey! :eek:

Based on the definition of $+_k$, I want to give an inductive definition for the multiplication $\cdot_k$ in $\mathbb{Z}_k$, such that for all $x\in \mathbb{N}_0$ and $y\in \mathbb{N}_0$ it holds that $$x\cdot_k y=(x\cdot y)\mod k$$

What is an inductive definition? (Wondering)

Do we write $x\cdot y=y+y+\ldots +y$ ($n$-times) and we apply each time the addition $+_k$ ? (Wondering)
I want to prove also by induction that for a $x\in \mathbb{N}_0$ it holds for all $y\in \mathbb{N}_0$ that $$(x\cdot y)\mod k=(x\mod k)\cdot_k (y\mod k)$$

We apply the induction on $y$ or not? (Wondering)
 
Mathematics news on Phys.org
  • #2
mathmari said:
I want to prove also by induction that for a $x\in \mathbb{N}_0$ it holds for all $y\in \mathbb{N}_0$ that $$(x\cdot y)\mod k=(x\mod k)\cdot_k (y\mod k)$$

We apply the induction on $y$ or not? (Wondering)

Is the induction as follows? Base case: $y=1$ : $$(x\cdot 1)\mod k=x\mod k$$ The other side is $$ (x\mod k)\cdot_k (1\mod k)=(x\mod k)\cdot_k 1=x\mod k$$ So, they are equal. Inductive Hypothesis: We suppose that it holds for $y=n$ : $$(x\cdot n)\mod k=(x\mod k)\cdot_k(n\mod k)$$ Inductive step: We will show that it holds for $y=n+1$ : $$(x\cdot (n+1))\mod k=(x\cdot n+x)\mod k=(x\cdot n)\mod k+x\mod k \ \ \overset{\text{ Inductive Hypothesis } }{ = } \ \ (x\mod k)\cdot_k (n\mod k)+x\mod k$$ The other side is $$(x\mod k)\cdot_k ((n+1)\mod k)=(x\mod k)\cdot_k (n\mod k+1)\\ =(x\mod k)\cdot_k (n\mod k)+x\mod k$$ So, they are equal.

Is this correct? Could I improve something? (Wondering)
 
Last edited by a moderator:
  • #3
mathmari said:
What is an inductive definition?
Is there a reason why you can't look this up in your lecture notes or textbook? Or see Wikipedia.

mathmari said:
Do we write $x\cdot y=y+y+\ldots +y$ ($n$-times) and we apply each time the addition $+_k$ ?
No inductive definition uses ellipsis.

mathmari said:
Is the induction as follows?
Until there is a definition, it makes no sense to prove anything.
 
  • #4
An inductive definition for the multiplication $\cdot_k$ in $\mathbb{Z}_k$ is the following:
\begin{align*}&x\cdot_k 0=0 \\ &x\cdot_k (y+1)=x\cdot_k y+_kx, \ y\geq 0\end{align*}
right? (Wondering)
 

Related to Defining & Proving Modulo Multiplication in $\mathbb{Z}_k$

1. What is modulo multiplication in $\mathbb{Z}_k$?

Modulo multiplication in $\mathbb{Z}_k$ is a mathematical operation that involves finding the remainder of the division of two numbers, also known as the modulo. In this case, the numbers are elements of the set $\mathbb{Z}_k$, which includes all integers from 0 to k-1. This operation is commonly used in cryptography and number theory.

2. How is modulo multiplication defined?

Modulo multiplication in $\mathbb{Z}_k$ is defined as follows: given two integers a and b, the modulo multiplication of a and b in $\mathbb{Z}_k$ is denoted as a * b (mod k) and is equal to the remainder when a * b is divided by k. In other words, it is the value of the remainder when a * b is divided by k.

3. What is the purpose of proving modulo multiplication in $\mathbb{Z}_k$?

Proving modulo multiplication in $\mathbb{Z}_k$ is important in cryptography, as it helps ensure the security and validity of cryptographic algorithms that use this operation. It also helps in understanding the properties and behavior of modulo multiplication in $\mathbb{Z}_k$, which is essential in various areas of mathematics and computer science.

4. How is modulo multiplication proved in $\mathbb{Z}_k$?

Modulo multiplication in $\mathbb{Z}_k$ is proved using mathematical induction. This involves proving the base case, which is usually when k = 1, and then showing that if the statement holds for k, it also holds for k+1. This process is repeated until the desired result is obtained.

5. What are the properties of modulo multiplication in $\mathbb{Z}_k$?

There are several properties of modulo multiplication in $\mathbb{Z}_k$, including commutativity, associativity, and distributivity. Additionally, the modulo multiplication of two elements in $\mathbb{Z}_k$ is always an element of $\mathbb{Z}_k$. Furthermore, if a and b are relatively prime to k, then a * b (mod k) = 1. These properties are useful in various applications of modulo multiplication in $\mathbb{Z}_k$.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
490
  • Calculus and Beyond Homework Help
Replies
1
Views
563
Replies
4
Views
2K
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
850
  • Calculus and Beyond Homework Help
Replies
3
Views
673
Replies
5
Views
991
  • General Math
Replies
10
Views
2K
Replies
4
Views
2K
  • General Math
Replies
2
Views
1K
Back
Top