Register

GATE1991-15,a

• recategorized by
1,977 views
15 votes
15 votes
<p><span style="line-height: 1.6;">Show that the product of the least common multiple and the greatest common&nbsp;</span><span style="line-height: 1.6;">divisor of two positive integers $a$ and $b$ is $a\times b$.</span></p>

<p>&nbsp; &nbsp; &nbsp; &nbsp;</p>
• recategorized by
User Avatar

5 Answers

Page:
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

41 votes
41 votes
4 answers
2
ibia asked Nov 16, 2015
6,327 views
GATE CSE 1991 | Question: 15,b
Consider the following first order formula: ... Does it have finite models? Is it satisfiable? If so, give a countable model for it.
Consider the following first order formula:$\left ( \matrix{ \forall x \exists y : R(x,y) \\[1em] \Large \land \\[1em] \forall x \forall y : \left ( R(x,y) \impl...
User Avatar
19 votes
19 votes
3 answers
3
Kathleen asked Sep 12, 2014
5,782 views
GATE CSE 1991 | Question: 01,xiv
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
User Avatar
52 votes
52 votes
2 answers
4
Kathleen asked Sep 12, 2014
6,486 views
GATE CSE 1991 | Question: 16,a
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's.$
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's....
User Avatar
Link Copied!