Register

Digital fundamental

269 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Made easy test serie...Next → · ME Test Series
← Previous in category · test seriesNext in category → · Minimum number of Fl...
Position:
Show:

Related questions

9 9 votes
4 4 answers
464
464 views
GO Classes asked Mar 3
464 views
GO Classes DPP | Fundamental of Computer Science | Question-1
The number $\frac{2}{\log _4 2000^6}+\frac{3}{\log _5 2000^6}$ can be written as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
6 6 votes
4 4 answers
346
346 views
GO Classes asked Mar 3
346 views
GO Classes DPP | Fundamental of Computer Science | Question-2
$$\sum_{m=1}^4 8 k-6 m=?$$Choose 1 answer:$8 k-6+8 k-12+8 k-18+8 k-24$$2+4+6+8$$8-6 m+16-6 m+24-6 m+32-6 m$$0+2+4+6$
10 10 votes
4 4 answers
339
339 views
GO Classes asked Mar 3
339 views
GO Classes DPP | Fundamental of Computer Science | Question-3
$$\sum_{j=1}^4(2 i j+8 j)^2=?$$Which are equivalent to above summation:$10^2+24^2+42^2+64^2$$(2 i+16)^2+(6 i+32)^2+(10 i+48)^2+(14 i+64)$$(2 i+8)^2+(4 i+16)^2+(6 i+24)^2+...
9 9 votes
4 4 answers
393
393 views
GO Classes asked Mar 3
393 views
GO Classes DPP | Fundamental of Computer Science | Question-4
If $n!$ denotes the product of the integers $1$ through $n$, what is the remainder when $(1! + 2! + 3! + 4! + 5! + 6! + ...)$ is divided by $9$?