Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
m and n are 2 integers, where m<=n. "seq m n" outputs exactly n -m +1 integers, one per line, from m to n inclusive.
a. Not having digit '1' in it.
b. Having at least one '1' in it
c. Having one or more 1's, but not consecutive 1's. (No 1's together : ex '11')
2. Relevant commands, code, scripts, algorithms:
seq/jot (I have a mac). Could output the numbers into a file and search them using grep?
3. The attempts at a solution (include all code and scripts):
a. terri-brashers-macbook-pro:~ Terri$ for i in $(jot 1000)
> do
> echo "No 1's $(i+2)
> done
>
> q
> for i in $(jot 1000); do echo "No 1's $(i+2)
done
This algorithm won't really work, but am I on the right track?
Or should I go with the grep idea?
No progress either way..
4. Complete Name of School (University), City (State), Country, Name of Professor, and Course Number (Link to Course):
University of Alabama at Birmingham, Birmingham (AL), US, Taoqif, cs 333
Note: Without school/professor/course information, you will be banned if you post here! You must complete the entire template (not just parts of it).
---------- Post updated at 10:41 AM ---------- Previous update was at 10:05 AM ----------
Messing around with it, I ended up sending the output to a new file and then used grep to find and/or exclude numbers.