Arithmetic Operations
posted by Parashar .
Find a set of 4 distinct positive integers a,b,c,d such that the smallest positive integer that can not be represented by such expressions involving a,b,c,d (instead of 1,2,3,4) is greater than 22.You can use digits exactly once. You are allowed to reuse operators (*, +, ). You are not allowed to join digits together (12+34). / (divide) is not one of the allowed operators.
Respond to this Question
Similar Questions

arithmetic
Find the smallest positive integer P such that the cube root of 400 times P is an integer. 
discrete math
Find how many positive integers with exactly four decimal digits, that is, positive integers between 1000 and 9999 inclusive, have the following properties: (a) are divisible by 5 and by 7. (b) have distinct digits. (c) are not divisible … 
Math
Find the smallest positive integer d such that d=105m+216n, where m & n are integers. 
Math
Let a be an integer, then there are integers X, Y such that aX+(a+1)Y=1. Find the smallest positive value of Y. 
math
there are three consecutive positive integers such that the sum of the squares of the smallest two is 221. write and equation to find the three consecutive positive integers let x= the smallest integer 
geometry!!! please help me!!!!
Determine the least positive integer n for which the following condition holds: No matter how the elements of the set of the first n positive integers, i.e. {1,2,…n}, are colored in red or blue, there are (not necessarily distinct) … 
MATH combinatorics HELP!!!!!
Determine the least positive integer n for which the following condition holds: No matter how the elements of the set of the first n positive integers, i.e. {1,2,…n}, are colored in red or blue, there are (not necessarily distinct) … 
math
Let S={1,2,3,4,…,2013} and let n be the smallest positive integer such that the product of any n distinct elements in S is divisible by 2013. What are the last 3 digits of n? 
Data Structures and Algorithms
Given integers R,M with M≠0, let S(R,M) denote the smallest positive integer x satisfying the congruence Rx≡1(mod M) if such an x exists. If such an x does not exist, put S(R,M)=0. Each line of this text file contains a … 
Integers
Integers greater than 1000 are created using the digits 2, 0, 1, 4 exactly once in each integer. What is the difference between the average of the largest and smallest of these integers that can be created this way?