I know this is kind of a vague question, but I'm doing a computer-style puzzle and am completely lost on this one. It gives a display of a table of these numbers:
And asks for a keyword from those numbers. Am I missing something really obvious here?
Got it. The numbers at the top are a clue, telling you the answer is in binary.
If you treat each odd number as a 0, and each even number as 1, then the binary is:
01101001
00111100
00110011
01101101
01100001
01110100
01101000
00100001
which translates to: i<3math!
Related
I am new to using R and actually to most programming language, so I am a bit lost here. Hope you can help. I am using RCMap for whcih I have 4csv documents, I get the following error code:
Error in dimnames(x) <- dn :
length of 'dimnames' [1] not equal to array extent
I am sure it has something to do with my own data, because I get normal output if I use other people´s data. However, I don´t know where the problem is (not even in which of the four documents). I do have a lot of missing data, however changing the missing data to either blank spaces or NA, does not change the error code.
The documents of other people that I am able to run also contain missing data, although to a lesser extend.
Hope you can help,
best wishes, Doriene
I had a similar problem and it helped when i put a space in front of c__bacilli.
Ex: test <- subset_taxa(phylo, Class==" c__Bacilli")
T(1)=5,
and for all n>=2: T(n)=2T(n-1)+(3*n+1).
I tried to solve this problem, but I have a problem with 3*n+1. When I put n-1, n-2,..., I don't know how to determine the formula for this problem.
Since there is only (3*n+1) as term and not T(3*n+1) this is solvable. First impression: you have 2T(n-1) as subterm, so the solution is something like 2^n.
Through a simple Excel data analysis I found the solution T(n)=-7-3n+15 * 2^(n-1), I will try to solve it per hand and will update my answer if I found the right path.
Edit: This was more difficult than expected...
Explanation:
first step is to get a sum formula for n. You can derive this pattern from the first few T(n).
Once you get the pattern, try to get rid of the sum.
To solve sums, try to get them in a similar format as sum_(i=1)^n (1) = n or sum_(i=0)^n (2^i) = 2^(n+1)-1
to do this you can manipulate the index such as sum_(i=2)^n (n-i) = sum_(i=0)^(n-2) (i) or to include/exclude elements from the sum.
the trickiest part was to solve sum_(i=0)^n ((n-i)*(2^i)). The idea here is to convert the multiplication (depending on i) to a sum (also depending on i).
please note the changing indice-numbers. sum_(i=0)^n (2^i) is not the same as sum_(i=1)^n (2^i)
The path is not the most efficient one, simplify as you wish.
I mean 2. Second Length found here
I think I found all mistakes but still, I can't seem to get the right answer.
On line 8 it should be wait1Msec(3000); instead of wait1Msec(4000);
Swing turn to the right should be written as 100 power for C and 0 power for B. I also tried -100 for B and even exchanged letters just in case I misunderstood which of the motors is left and which is right, but I still got the wrong answer (according to the website).
There are mistakes in the comments as well, but that shouldn't be a problem since they're just comments! Still, I corrected them just in case. Replaced 4 with 3 and replaced right with left, still not correct.
Do they expect me to right some specific text in the comments? Or am I missing something?
It seems that you should write the code for your second length after the comment
//END OF FIRST LENGTH
So, your code should be a code for the first length and the second length. I hope that helps.
Why does this ridiculously simple query on data.stackexchange.com return results that don't have [help/dont-ask] in the comment text? I feel like I'm missing something mind-numbingly obvious here.
select top 10 Id, PostId, Text
from comments
where text like '%[help/dont-ask]%'
Results I currently get:
Id PostId Text
-- ------- -----------------------------------
1 35314 not sure why this is getting downvoted -- it is correct! Double check it in your compiler if you don't believe him!
2 35314 Yeah, I didn't believe it until I created a console app - but good lord! Why would they give you the rope to hang yourself! I hated that about VB.NET - the OrElse and AndAlso keywords!
4 35195 I don't see an accepted answer now, I wonder how that got unaccepted. Incidentally, I would have marked an accepted answer based on the answers available at the time. Also, accepted doesn't mean Best :)
9 47239 Jonathan: Wow! Thank you for all of that, you did an amazing amount of work!
10 45651 It will help if you give some details of which database you are using as techniques vary.
12 47428 One of the things that make a url user-friendly is 'discover-ability', meaning you can take a guess at url's simply from the address bar. http://i.love.pets.com/search/cats+dogs could easily lead to http://i.love.pets.com/search/pug+puppies etc
14 47481 I agree, both CodeRush and RefactorPro are visually impressive (most of which can be turned off BTW), but for navigating and refactoring Resharper is much better in my opinion of using both products.
15 47373 Just wanted to mention that this is an excellent solution if you consider the problem to be linear (i.e. treating `A1B2` as a single number). I still think the problem is multi-dimensional, but I guess we'll just have to wait for the author to clarify :)
16 47497 Indeed, the only way to do this is get the server to generate your CSS file which can be done in many ways depending on which language you are using. HttpHandlers are common in C#. You could use jQuery or the likes to add styling to every element with the class 'ourColur' and parametrise your JS
18 47513 This advice goes against the spirit of CSS, which is separation of content and presentation. You way requires changing HTML for presentation sake, and stating in content which elements have same color.
...none of which contains the magic link (or even the text dont-ask).
Because [] delimits a set of characters to find.
You need to escape them.
Or just use CHARINDEX as the search is unsargable anyway.
WHERE CHARINDEX('[help/dont-ask]', text) > 0
I have this insert command where iam trying to insert a number to be taken from loop
i=0
for line in column:
myStmt.executeQuery("INSERT INTO REVERSE_COL
( TABLE_NAME,COL_NAME,POS) values
(,'test','"+column[i]+"','"+i+"'")
i=i+1
POS IS NUMBER DATATYPE
but it works if i hard code as 1
i=0
for line in column:
myStmt.executeQuery("INSERT INTO REVERSE_COL
( TABLE_NAME,COL_NAME,POS) values
(,'test','"+column[i]+"',1")
I have tried only i , +i+ and other method but its not working any suggestion how to solve this .
Thanks everyone .
I have no jython experience, but I will still try to offer my personal approach and advice. Take from it what you will.
The first thing that I would look into, and perhaps this is something someone else knows offhand, is the way that a number is concatenated to the string. I'm speaking from a C++ background here, but a number i may well be converted to the ASCII character representing that value, and not necessarily the character that you intend.
For example, if i is 9, it may be placing a TAB into the string and not the number 9, which would be an ASCII value 57.
Again, I'm not telling you this IS the answer...but it's the first thing that pops into my mind. Good luck!