phil1882

Members
  • Content count

    587
  • Joined

  • Last visited

  • Days Won

    8

phil1882 last won the day on July 26 2015

phil1882 had the most liked content!

Community Reputation

13

About phil1882

  • Rank
    Senior Member

Recent Profile Visitors

9041 profile views
  1. if i spent a month on it i might be able to do the necessary calculation, don't have that kind of patience though.
  2. since it been a couple weeks without even a guess, I'll go ahead and post my answer and see if anyone can do better. i get 59. 0 1 0 2 0 3 0 1 0 3 0 2 0 1 0 3 0 1 0 2 0 1 0 4 0 1 0 2 0 3 0 1 0 3 0 2 0 1 0 4 0 1 0 2 0 1 0 3 0 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 0 2 0 1 0 4 0 1 0 ? 51 52 53 54 55 56 57 58 59 60
  3. heres an alternate version that i came up with, place the digits 1-n where n is 4 such that no consecutive digit of any step value, starting at step value, repeats. here's an example where n is 2. 0 1 0 2 1 0 2 1 2 0 1 ? 1 2 3 4 5 6 7 8 9 10 11 12 here starting from 1 and going a step of 1, there are no repeats. starting from 2 and going a step of 2, no repeats, and so on. However there is no way to get 12 without repeating. your task is to find the max value for 4.
  4. the first rule of fight club is, you do not talk about fight club. there are no rules for how rules are made, with the exception that we try to stabilize and civilize society.
  5. i think you mean... x: this number is surrounded by no more than x true statements. what the maximum number of trues you can have, and what would the board look like? here's my attempt
  6. it seems to me that T F F T should be 1 2 2 1. if you meant this... 3 2 1 4 1 2 3 3 3 3 3 4 6 4 4 2 3 4 4 3 1 1 2 4 3 cannot be solved. F T start for top left corner T T now 1 doesn't work.
  7. i'd say 6. if you take into account letter frequency, the letters to the left of u far outweigh the letters to the right.
  8. alright thanks good to know.
  9. the strings <<>><><>, <><><<>> are considered equivalent, though for the proposes of uniqueness, i put the factors in order from lowest to highest.
  10. correct. one of my questions is about addition. basically my question is, given a number system that uses multiplcation as its basis, (multiplying two numbers in recursive format is just concatenation) an you come up with a method for addition? ill do 7 as an example 7 is prime. < 7 > 7 is the 4th prime so replace the 7 with a 4. < 4 > 4 is composite, its factors are 2 and 2. < 2 2 > 2 and 2 are prime. <<2><2>> the number two is the first prime so cant be reduced further. replace with blank. <<><>>
  11. if n is composite, break it into its prime factors, if n is prime, place < > around n and replace n with the nth prime its is. the first 20 numbers then are... 1 <> 2 <<>> 3 <><> 4 <<<>>> 5 <><<>> 6 <<><>> 7 <><><> 8 <<>><<>> 9 <><<<>>> 10 <<<<>>>> 11 <><><<>> 12 <<><<>>> 13 <><<><>>14 <<>><<<>>> 15 <><><><> 16 <<<><>>> 17 <><<>><<>> 18 <<><><>> 19 <><><<<>>> 20 hypothesis: 1) there is no general method for adding recursive numbers. 2) numbers that differ by 1 wont differ in recursive representation by more than 2 brackets 3) symmetric recursive numbers, recursive numbers that can be represented in such a way that they are a mirror image at the middle, grow at a logarithmic rate somewhat similar to the primes. can you confirm or disprove any of these?
  12. it seems to me what you really need is an encryption method that can be reversed if necessary but would take longer to reverse than to solve the sudoku yourself and get the same encryption. what do you think of this idea? it may not even require a computer, depending on how difficult the encryption method is.
  13. doorenownly is the best i could com up with.
  14. i'd say its
  15. assuming you also had scissors...