Aspire Faculty ID #19288 · Topic: UGC NET Computer Science June 2019 (Paper II) · Just now
UGC NET Computer Science June 2019 (Paper II)

Consider the following statements:

$S_1$: For any integer $n>1$, $a^{\phi(n)}\equiv 1\ (\text{mod }n)$ for all $a\in Z_n^*$, where $\phi(n)$ is Euler's phi function.

$S_2$: If $p$ is prime, then $a^p\equiv 1\ (\text{mod }p)$ for all $a\in Z_p^*$.

Which one of the following is/are correct?

Solution

Statement $S_1$ is true by Euler's theorem.

If $a\in Z_n^*$, then $a$ and $n$ are relatively prime.

So,

$a^{\phi(n)}\equiv 1\ (\text{mod }n)$

Now consider $S_2$.

For prime $p$, Fermat's theorem gives

$a^{p-1}\equiv 1\ (\text{mod }p)$

for $a\in Z_p^*$.

But $S_2$ says

$a^p\equiv 1\ (\text{mod }p)$

This is not generally true.

Actually,

$a^p\equiv a\ (\text{mod }p)$

So, $S_2$ is false.

Previous 10 Questions — UGC NET Computer Science June 2019 (Paper II)

Nearest first
1
Consider the following properties with respect to a flow network $G=(V,E)$ in which a flow is a real-valued function $f…
Topic: UGC NET Computer Science June 2019 (Paper II)
2
Consider the following steps: $S_1$: Characterize the structure of an optimal solution $S_2$: Compute the value of an o…
Topic: UGC NET Computer Science June 2019 (Paper II)
3
Consider the complexity class $CO-NP$ as the set of languages $L$ such that $\overline{L}\in NP$, and the following two…
Topic: UGC NET Computer Science June 2019 (Paper II)
4
Consider double hashing of the form $h(k,i)=(h_1(k)+ih_2(k))\ \text{mod}\ m$ where $h_1(k)=k\ \text{mod}\ m$ $h_2(k)=1+…
Topic: UGC NET Computer Science June 2019 (Paper II)
5
Which of the following is application of depth-first search?
Topic: UGC NET Computer Science June 2019 (Paper II)
6
Which of the following is best running time to sort $n$ integers in the range $0$ to $n^2-1$?
Topic: UGC NET Computer Science June 2019 (Paper II)
7
Consider the Euler's phi function given by $\phi(n)=n\prod\left(1-\dfrac{1}{p}\right)$ where $p$ runs over all the prim…
Topic: UGC NET Computer Science June 2019 (Paper II)
8
There are many sorting algorithms based on comparison. The running time of heapsort algorithm is $O(n\lg n)$. Like $P$,…
Topic: UGC NET Computer Science June 2019 (Paper II)
9
Match List-I with List-II: List-I List-II (a) Prim's al…
Topic: UGC NET Computer Science June 2019 (Paper II)
10
Software validation mainly checks for inconsistencies between:
Topic: UGC NET Computer Science June 2019 (Paper II)

Next 10 Questions — UGC NET Computer Science June 2019 (Paper II)

Ascending by ID
1
Which data structure is used by the compiler for managing variables and their attributes?
Topic: UGC NET Computer Science June 2019 (Paper II)
2
On translating the expression given below into quadruple representation, how many operations are required?$(ij)+(e+f)(a…
Topic: UGC NET Computer Science June 2019 (Paper II)
3
Replacing the expression $4*2.14$ by $8.56$ is known as:
Topic: UGC NET Computer Science June 2019 (Paper II)
4
Shift-reduce parser consists of:$(a)$ Input buffer $(b)$ Stack $(c)$ Parse table Choose the correct option from those …
Topic: UGC NET Computer Science June 2019 (Paper II)
5
How many states are there in a minimum state automata equivalent to regular expression given below? Regular expression …
Topic: UGC NET Computer Science June 2019 (Paper II)
6
Match List-I with List-II: List-I List-II (a) $\overlin…
Topic: UGC NET Computer Science June 2019 (Paper II)
7
How can the decision algorithm be constructed for deciding whether context-free language $L$ is finite? $(a)$ By constr…
Topic: UGC NET Computer Science June 2019 (Paper II)
8
Consider the following grammar: $S\to XY$ $X\to YaY\mid a$ $Y\to bbX$ Which of the following statements is/are true abo…
Topic: UGC NET Computer Science June 2019 (Paper II)
9
Which of the following problems is/are decidable problem(s) on Turing machine $M$? $(a)$ $G$ is a CFG with $L(G)=\phi$ …
Topic: UGC NET Computer Science June 2019 (Paper II)
10
for a statement, a language $L\subseteq \Sigma^*$ is recursive if there exists some Turing machine $M$. Which of the fo…
Topic: UGC NET Computer Science June 2019 (Paper II)
Ask Your Question or Put Your Review.

loading...