Consider the number 18 with all its divisors
1,2,3,6,9,18.
Data are two numbers, such as 1.6 and 2.3.
Given a number x, denoted by [x] its rounding this way: if x is an integer [x] coincides with x itself,
if x is not an integer [x] = integer part of x + 1. For example [3] = 3, while [4:06] = 5.
I have to find the minimum of the following numbers
[1x1.6] x [18x2.3]
[2x1.6] x [9x2.3]
[3x1.6] x [6x2.3]
[6x1.6] x [3x2.3]
[9x1.6] x [2.2.3]
[18x1.6] x [1.2.3]
I do this for each integer N (eg 20 with dividers 1,2,4,5,10) and each copy of 2.8x3.5 type.
I need it with JAVASCRIPT..
Hello
I just finished the required script, but just 1 thing you wrote "[4:06] = 5." if it's considered as described than the same values for every combination, clear it a little bit on message.
your script is done but need clarifation
Good Luck
Thanks
Hi, glad to meet you,
i am a senior web developer with more than 10 years experiences in ASP.NET MVC, C#, JQuery and Javascript.
With you requirement i understand that
step 1: Would you like to find divisors of a number interger? isn't it.
step 2: loop in length of divisors (if it had) and x number (such as 1.6 and 2.3 like your sample) according to ascending and descending of the divisors ? of course x number has regular like you wrote is "Given a number x, denoted by [x] its rounding this way: if x is an integer [x] coincides with x itself"
step 3: you would like to find out the minimum number in there loop.
If i understand that is right, please contact me. hope i can help you.
Thanks and best regard
I already did it in my head (and developed some solution at this very moment)
I will be pleased to do it for you, and I will do it as efficient as I can.
I have strong JavaScript and algorithms skills and feel I can confidently solve this problem. My price is low because I would like this job - however, I will be providing you with a high-quality solution. Please contact me so we can finalize the plan.