Bissoy.com
Doctors Medicines MCQs Q&A

The no. of partitions of which of the following integer will be divisible by 5?

The no. of partitions of which of the following integer will be divisible by 5? Correct Answer 9

According to Ramanujan’s congruence number of partitions of an integer is divisible by 5 if that integer is 4 more than a multiple of 5. So out of the given options 9 is the only integer which satisfies this condition.

Related Questions

An Identity Card has the number ABCDEFG, not necessarily in that order, where each letter represents a distinct digit (1, 2, 4, 5, 7, 8, 9 only). The number is divisible by 9. After deleting the first digit from the right, the resulting number is divisible by 6. After deleting two digits from the right of original number, the resulting number is divisible by 5. After deleting three digits from the right of original number, the resulting number is divisible by 4. After deleting four digits from the right of original number, the resulting number is divisible by 3. After deleting five digits from the right of original number, the resulting number is divisible by 2. Which of the following is a possible value for the sum of the middle three digits of the number?
A, B, and C are divisible by 2. C, D, and E are divisible by 9. B and D are divisible by 3 Conclusion - I 6C is divisible by 54 Conclusion - II B and D are divisible by 6 Conclusion - III 4B + 2E is divisible by 4 Which of the above conclusions logically follows/follow from the given statements?
Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?
A particular BNF definition for a “word” is given by the following rules. ∷ = | | ∷ = |  ∷ = |  ∷ = a | b | c | ….. |y| z  ∷ = 0 |1|2| …… | 9 Which of the following lexical entries can be derived from < word > ? l. pick II. picks lll. c44
While generating partitions of integer 3 we consider 2 1 and 1 2 to be different partitions.
Let X is divisible by 2 and Y is divisible by 6 then which of the following statement is correct regarding (X + Y)? Statement 1: It is divisible by 2 Statement 2: It is divisible by 3 Statement 3: It is divisible by 4
Suppliers(Sid: integer, sname:string, city:string, street:string) Parts(pid:integer, pname:string, color:string) Catalog(sid:integer, pid:integer, cost:real) Consider the following relational query on the above database: SELECT S.sname FROM Suppliers S  WHERE S.sid NOT IN (SELECT C.sid FROM Catalog C WHERE C.pid NOT IN (SELECT P.pid FROM Parts P WHERE P.color < > ‘blue’)) Assume that relations corresponding to the above schema are not empty. Which of the following is the correct interpretation of the above query?
Consider the following relational schema. Students(rollno: integer, sname: string) Courses(courseno: integer, cname: string) Registration(rollno: integer, courseno: integer, percent: real) Which of the following queries are equivalent to this query in English? “Find the distinct names of all students who score more than 90% in the course numbered 107” (I) SELECT DISTINCT S.sname FROM Students as S, Registration as R WHERE R.rollno=S.rollno AND R.courseno=107 AND R.percent >90 (II) Πsname (σcourseno = 107∧percent>90 (Registration ⋈ Students)) (III) {T | ∃S ∈ Students, ∃R ∈ Registration (S.rollno = R.rollno ∧R. courseno = 107 ∧ R.percent > 90 ∧ T.sname = S. sname)} (IV) {〈SN〉 | ∃SR∃RP(〈SR, SN〉 ∈ Students ∧ 〈SR, 107, RP〉 ∈ Registration ∧ RP > 90)}
The sum o three integers is 40. The largest integer is 3 times the middle integer, and the smallest integer is 23 less than the largest integer. what is the product of the three integers?
When a certain positive integer P is divided by another positive integer, the remainder is $${r_{1}}$$ . When a second positive integer Q is divided by the same integer, the remainder is $${r_{2}}$$ and when (P + Q) is divided by the same divisor, the remainder is $${r_{3}}$$ . Then the divisor may be :