4,040 views

2 Answers

Best answer
21 21 votes

Distributive property is as follows:

$a \wedge (b \vee c) = (a \wedge b) \vee (a \wedge c)$

For "divides by" lattice the meet $(\wedge)$ operation is $\gcd$ and the join $(\vee)$ operation is $lcm.$ So, we have to prove:$$ \gcd (a, lcm(b, c) )= lcm (\gcd(a,b), \gcd(a,c))$$ Forward Direction Proof:

Let $p$ be any prime factor of $ \gcd (a, lcm(b, c) )$ and $\alpha$ be the largest integer such that $p^\alpha$ divides $ \gcd (a, lcm(b, c) )$

$\implies p^\alpha$ divides $a$ and $p^\alpha$ divides $lcm(b, c).$

$\implies p^\alpha$ divides $a$ and $(p^\alpha$ divides $b$ OR $p^\alpha$ divides $c)$

$\implies (p^\alpha$ divides $a$ and $p^\alpha$ divides $b)$ OR  $(p^\alpha$ divides $a$ AND $p^\alpha$ divides $c)$

$\implies (p^\alpha$ divides $\gcd(a,b))$ OR  $(p^\alpha$ divides $\gcd(a,c))$

$\implies p^\alpha $ divides $ lcm (\gcd(a,b), \gcd(a,c))$

Reverse Direction Proof:

Let $p$ be any prime factor of $ lcm (\gcd(a,b), \gcd(a,c))$ and $\alpha$ be the largest integer such that $p^\alpha$ divides $\gcd(a,b)$ or $\gcd(a,c).$ So, $p^{\alpha}$ divides $a$ and either $b$ or $c$

$\implies p^\alpha$ divides both $a$ and $lcm(b,c).$

$\implies p^\alpha$ divides $\gcd(a, lcm(b,c))$

Hence, $ \gcd (a, lcm(b, c) )= lcm (\gcd(a,b), \gcd(a,c))$

4 4 votes

 we can take any example to show it distributive  and solve it. and we will find it is distributive

-----------------------------------------------------------------------------------------------------------------------

if N is square free number then it will be boolean algebra

• edited by
1 flag:
✌ Low quality (Sarthak_Patial “No full proof,”)
Position:
Show:

Related questions

32 32 votes
2 answers 2 answers
10.7k
10.7k views
Misbah Ghaya asked Nov 19, 2016
10,690 views
The number of rooted binary trees with $n$ nodes is,Equal to the number of ways of multiplying $(n+1)$ matrices.Equal to the number of ways of arranging $n$ out of $2 n$ ...
31 31 votes
3 answers 3 answers
6.4k
6.4k views
Misbah Ghaya asked Nov 19, 2016
6,390 views
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Groups} & (p) & \text{Associativity} \\\hline (b) & \text{Semigroups} & (q) & \text...
0 0 votes
0 0 answers
913
913 views
Misbah Ghaya asked Nov 26, 2016
913 views
Show, using resolution, that the following well-formed formula is valid for all interpretations:$\left(\forall x \forall y \left(f \left(x, y \right) \Leftarrow \neg y \l...
36 36 votes
3 answers 3 answers
9.0k
9.0k views
Misbah Ghaya asked Nov 26, 2016
9,029 views
Express $T(n)$ in terms of the harmonic number $\displaystyle H_{n}= \sum_{i=1}^{n} \frac{1}{i},\quad n \geq 1$, where $T(n)$ satisfies the recurrence relation,$T(n)=\fra...