Scribd
Upload
50 views1 page

Ramanujan School of Mathematics Number Theory, Combinatorics, Geometry

This document provides instructions for a 1 hour and 30 minute exam on number theory, combinatorics, and geometry for beginners. The exam consists of 6 problems worth 10 points each, covering topics like finding the sum of two prime factors of a number, proving a statement about products of prime numbers, counting non-decreasing sequences, determining a winning strategy in a game with beads, counting subsets with a certain property, and proving a property of a point inside a triangle inscribed in a circle.

Uploaded by

Debangshu Ari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views1 page

Ramanujan School of Mathematics Number Theory, Combinatorics, Geometry

This document provides instructions for a 1 hour and 30 minute exam on number theory, combinatorics, and geometry for beginners. The exam consists of 6 problems worth 10 points each, covering topics like finding the sum of two prime factors of a number, proving a statement about products of prime numbers, counting non-decreasing sequences, determining a winning strategy in a game with beads, counting subsets with a certain property, and proving a property of a point inside a triangle inscribed in a circle.

Uploaded by

Debangshu Ari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Ramanujan School of Mathematics

Number Theory, Combinatorics, Geometry


Beginner

Full Marks-60 Time-1 Hr 30 Min

1 43361 is product of 2 prime numbers p1 and p2 . There are


42900 natural numbers less than 43361 which are coprime
to 43361. Find p1 + p2 . [10]
2 Let p1 ,p2 ,...,pn be first n prime numbers. Prove that,
p1 p2 ...pn + 1 can never be a perfect square. [10]
3 In how many ways non-decreasing sequences of length r
can be formed from (1, 2, ......, n)? [10]
4 A game of numbers involves 2 players and 2017 beads. At
every turn, a player must remove between 1 to 4 beads.
The player who is left with the last bead loses. How many
beads must the first player remove at the start of the game
in order to win? [10]
5 How many 3-element subsets of (1, 2, 3, ..., 100) are there so
that the sum of the 3 elements are divisible by 3? [10]
6 The incircle of 4ABC touches the sides BC, CA, AB at
D, E, F respectively. X is a point inside triangle ABC such
that the incircle of 4XBC touches BC at D and touches
CX and XB at Y and Z respectively. Show that, E, F, Z, Y
are concylic. [10]

You might also like