Jump to content

Search the Community

Showing results for tags 'math'.

  • Search By Tags

    Type tags separated by commas.
  • Search By Author

Content Type


Forums

  • Talk
    • Everything Else
    • Gaming
    • Questions
    • Business and Enterprise IT
    • Security
    • Hacks & Mods
    • Applications & Coding
    • Trading Post
  • Hak5 Gear
    • Hak5 Cloud C²
    • WiFi Pineapple Mark VII
    • USB Rubber Ducky
    • Bash Bunny
    • Key Croc
    • Packet Squirrel
    • Shark Jack
    • Signal Owl
    • LAN Turtle
    • Screen Crab
    • Plunder Bug
  • O.MG (Mischief Gadgets)
    • O.MG Cable
    • O.MG DemonSeed EDU
  • WiFi Pineapple (previous generations)
    • WiFi Pineapple TETRA
    • WiFi Pineapple NANO
    • WiFi Pineapple Mark V
    • WiFi Pineapple Mark IV
    • Pineapple Modules
    • WiFi Pineapples Mark I, II, III
  • Hak5 Shows
  • Community
    • Forums and Wiki
    • #Hak5
  • Projects
    • SDR - Software Defined Radio
    • Community Projects
    • Interceptor
    • USB Hacks
    • USB Multipass
    • Pandora Timeshifting

Find results in...

Find results that contain...


Date Created

  • Start

    End


Last Updated

  • Start

    End


Filter by number of...

Joined

  • Start

    End


Group


AIM


MSN


Website URL


ICQ


Yahoo


Jabber


Skype


Location


Interests


Enter a five letter word.

Found 4 results

  1. I was kinda curious how other people would do this. So you take a regular Fibonacci sequence like this: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040 1346269 2178309 3524578 5702887 9227465 But I'm changing it up a bit so I get a different sequence like this one: 1, 2, 4, 7, 11, 20, 33, 54, etc The math looks something like this and I can do it on paper. 1+1+2+3+5+8+13+21+34+45+79 1+1+2+3+5+ 8+13+21+34+45 1+1+2+3+ 5+ 8+13+21+34 1+1+2+ 3+ 5+ 8+13+21 1+1+ 2+ 3+ 5+ 8+13 1+ 1+ 2+ 3+ 5+ 8 1+ 1+ 2+ 3+ 5 1+ 1+ 2+ 3 1+ 1+ 2 1+ 1 1 So in a regular fibonacci sequence it's something like this: #include<iostream> using namespace std; int main() { int fib1 = 0, fib2 = 1, fib3 = 1; cout << "The Fibonacci Series is : " << endl << fib1 << " " << fib2 << " "; while (fib1 + fib2 < 1000000) { fib3 = fib1 + fib2; fib1 = fib2; fib2 = fib3; cout << fib3 << " "; } cout << endl; return 0; } Not sure if the best way to to do this is write all of the possible fibonacci numbers to an array then loop through the array to add up the numbers for the sequence or if I should use the final fib values and count backward from the final two fib values just doing a backwards subtaction pattern. These are hypothetical questions. Question: Can you create a dynamic multi-dimensional array without knowing how many dimensions the array will have. I understand the part about creating a dynamic array where you can load in any number of variables. I suppose I could just load all of those values into an array then use nested for loops for each iteration. So int a =x; int b =x-1; int c= x-2; etc. Peronally I like array idea because it is easy but that's not the most optimal way to do it. I'm sure someone a little more savvy could make this happen using less memory and faster. Using Fibonacci's sequence to describe timeline forks. So say you have computer virus that spread from one machine to the next in a given amount of time. The first machine will continue to also infect machine until there are no more machines to infect. But that's not the only application for this.
  2. Hello Everyone!!! I'm a student who loves hardware. I work with it a lot and I'm very good at making my custom devices. I have just ordered the PCBs for my latest design. It is the first prototype of a computer meant only for math. This board isn't very powerful and is a little more than a square inch, but I'm hoping in the future it will be very capable. On the square inch there are four low level processors. I have three of them coming and they should work well. I need someone to help me as I want to use these devices to crack mathematical passwords and encrypted data and I have little skill in software. Would anyone like to help? This could either be a huge failure or a resounding success. Either way I hope to publish all my findings and whoever helps loses nothing but maybe a little of their time. Please reply to the thread or PM me if interested.
  3. I am looking forward to joining my chosen profession in this electronic age. Unfortunately I am not sure where I should stop with my math education and which certs would be a good choice to obtain. I want to work in Information Security: Linux Systems are my preferred side of the digital divide. I also wanted to know where if any place in the U.S. would hire someone, regardless of their past? As, unfortunately mine isn't as clean as most, but my skillset grows as I prepare for a future in IT. Any suggestions on college courses from the KCTCS? That is, if anyone is familiar with that college. Or, is there any other specialized local or titled college one might suggest, aside from the MIT and IT specific schools? Something such as EdX and other Linux guided online and on-site course work that might be acredited nationwide, or internationally?
  4. First let me introduce myself, I am known by unixmito (fork() anyone?). I have both an intellectual and professional interest in programming, networking, auditing, etc. Recently, I purchased the Mark IV, and am waiting to receive it today. In lieu of the 4-6 hours I will have to wait for it to arrive I'm doing a variety of research ahead of time. First question: Second Question: Third question: I appreciate those that have gone through and read this entire post. I only resort to such a long winded approach since using the search function doesn't produce any results for: "solar panels," "solar," "entropy," "fuzzing," or "TOR." Bibliography http://www.math.uni-...ropy/algor.html (Descriptiona Entropy in Logicl) https://blog.torproj...ne-cell-enough/ (One node enough to break TOR) http://docencia.izt..../miscelanea.pdf (Quantified Harmonic Wave Theory)
×
×
  • Create New...