NumberTheory Problems
Easy Prime! There are N numbers in an array. You will have Q queries. In each query, you can make 2 operations. ... |
Life of Phi II You will be given two integers n and m where GCD(n,m)=1. You have to tell that how many numbers are ... |
Co-Prime Enemy Pair Two integers A and B are known as co-prime or relatively prime if their greatest common divisor GCD ... |
Left Prime Prime numbers are the ones which can only be divided by 1 and the number itself. 2, 3, 5, 7, 11, 13 ... |
Chowdhury Saheb & the Numbers You like short description of problems? Me too! Let's go to an easy problem. You are given an array ... |
Birthday Surprise Adnan bhai, Priyom dada and Shuvo bhai are the members of MU_Kheloars. They recently got graduated a... |
Unique Relief Thanos has now figured out how to visit all the houses in the flood-affected area. However, now he h... |
Oh Functions Let’s define functions f and g as: f(x) = 2 * ( f(x-1) + g(x-1) - 1 ) * ( f(x-1) + g(x-1) - 3 ) + 12... |
Phi Numbers in Range! In number theory, Euler’s phi function, denoted as ϕ(n), is an arithmetic function which counts the ... |
A GRE Themed Contest Problem Sadman and Najkin were solving a GRE math problem, Rejbah another friend of theirs listened to that ... |
A Lack of Common Divisors Given a positive integer N, determine how many of the integers between 1 and N are co-prime with N. ... |
Love Letters! Lately Fahim is getting a lot of love letters. A LOT of love letters. Since he is confused about whi... |
Equation Equals Hazards You are given the equation, GCD(A,M)=1. You have to determine whether there exists at least one inte... |
Laali Vs Bessie One day Raju discovered USACO and from that day he would spend all his time solving problems. Laali ... |
Exponential Growth You will be given two integers X and N, you have to calculate XN modulo 1000000007. |
Relatively Prime Given a positive integer N, determine how many of the integers between 1 and N are co-prime with N. ... |
Mystery of Fibonacci Fibonacci sequence is a recursive sequence that depends on the following definition: Fib(N) = Fib(N-... |
Fast Co-Prime Two numbers A and B are called co-prime if the only common positive factor of the two numbers is 1. ... |
Correct the Sieve Sieve of Eratosthenes is a fast algorithm for finding prime numbers in larger ranges. According to W... |
Trick or Trees One day, Raju was out roaming in the woods,when he suddenly stumbled upon a large garden. There were... |
Largest Prime A positive integer number n is called a prime number, if it is only divisible by 1 and n itself, whe... |
Meena O Dosto Sele Dosto sele Dipu and his friends used to disturb Rita Apu everyday on her way to school singing , " র... |
Switches Technology is going ahead very fast. How can we know what will we get in future? One day you met a g... |
The Game Is Back On Moriarty is bored again. When he gets bored, the only thing he wants to do is play with Sherlock. So... |
Find the primes? For a positive integer n, let’s define a function f: f(n) = sum of positive integers less than n whi... |
Tags
2Sat, Adhoc, ApolloneasTheorem, Backtracking, BFS, Bignum, BinarySearch, BipartiteMatching, Bitmask, BruteForce, ChineseRemainderTheorem, Combinatorics, ConvexHull, CutVertex, DataStructure, DFS, DigitDP, DisjointSets, DivideAndConquer, DP, Eertree, EulerTour, ExpectedValue, FenwickTree, FFT, Flow, Game, GCD, Geometry, Graph, Greedy, Hashing, HeavyLightDecomposition, Implementation, InclusionExclusion, Interactive, KnuthMorrisPratt, LowestCommonAncestor, Math, Matrix, MatrixExponentiation, MergeSortTree, ModularExponentiation, MOSAlgorithm, MST, NTT, NumberTheory, Parsing, PersistentLiChaoTree, PersistentSegmentTree, PollardRho, PriorityQueue, Probability, Queue, RabinMiller, RangeOrderStatistics, Scheduling, SegmentTree, ShortestPath, Simulation, Sorting, SparseTable, SpragueGrundyTheorem, SqrtDecomposition, Stack, String, StronglyConnectedComponents, SuffixStructure, TernarySearch, Tree, Trie, TwoPointer, WaveletTree
