For every integer , let be the set of all positive integers not exceeding that are relatively prime to . Consider the polynomial
a) Prove that there exists a positive integer and a polynomial with integer coefficients such that
b)Find all integers such that is irreducible in .
This post has been edited 2 times. Last edited by luutrongphuc, 4 hours ago
I have one topic on how to identify Prime Number and Composite Number quickly? Maybe the number is more than 100 or 1000.......!
If there are some formula that can be used to verify the number easily, it will be highly appreciated.
Does anybody has any good idea for that?
Let be a convex quadrilateral. Suppose that the circles with diameters and intersect at points and . Let and . Prove that the points ,, and are concyclic.
( and are not the diagnols)
<Hey Everyone'>
I'm 10 grader student and Im starting prepration for maths olympiad..>>> From scratch (not 2+2=4 )
Do you haves compiled resources of Handouts,
PDF,
Links,
List of books topic wise
which are shared on AOPS (and from your perspective) for maths olympiad and any useful thing, which will help me in boosting Maths olympiad prepration.
This post has been edited 1 time. Last edited by omega2007, Today at 2:48 AM Reason: Spelling error
A strictly decreasing function attaining all positive values and positive numbers are given. Numbers satisfy for every . Prove that there exists a positive integer satisfying .
A positive integer and a set consisting of disting positive integers smaller than are given. Prove that there exists a positive integer that can be written in the form , for in at least different ways.
Positive integer and colors are given. We will say that a set of points on a plane is , if it contains exactly 2 points of each color and if lines connecting every two points of the same color are pairwise distinct. Find, in terms of the least integer such that: in every set of points of a plane, no three of which are collinear, consisting of points of every color there exists a subset.