Tech24 Deals Web Search

Search results

1. Results from the Tech24 Deals Content Network

2. Free Online Games: Play board games, card games, casino games ...

   www.aol.com/games

   Discover the best free online games at AOL.com - Play board, card, casino, puzzle and many more online games while chatting with others in real-time.

3. Cool Math Games - Wikipedia

   en.wikipedia.org/wiki/Cool_Math_Games

   Written in. PHP, HTML and Adobe Flash. Cool Math Games (branded as Coolmath Games) [a] is an online web portal that hosts HTML and Flash web browser games targeted at children and young adults. Cool Math Games is operated by Coolmath LLC and first went online in 1997 with the slogan: "Where logic & thinking meets fun & games.".

4. Play 10X10 Online for Free - AOL.com

   www.aol.com/games/play/masque-publishing/10x10

   Your game will start after this ad. 10x10. 10x10 is a Tetris-like puzzle game that’s easy to play, but difficult to master! By Masque Publishing. Last Played. Advertisement. Advertisement.

5. Play Dominoes All Fives Online for Free - AOL.com

   www.aol.com/games/play/masque-publishing/...

   Dominoes: All Fives. All Fives features beautiful art, fast gameplay, and solo or multiplayer modes. Expose multiples of five and score! By Masque Publishing. Advertisement. Advertisement. Feedback.

6. List of open-source software for mathematics - Wikipedia

   en.wikipedia.org/wiki/List_of_open-source...

   This free software had an earlier incarnation, Macsyma. Developed by Massachusetts Institute of Technology in the 1960s, it was maintained by William Schelter from 1982 to 2001. In 1998, Schelter obtained permission to release Maxima as open-source software under the GNU General Public license and the source code was released later that year.

7. List of unsolved problems in mathematics - Wikipedia

   en.wikipedia.org/wiki/List_of_unsolved_problems...

   Tutte's conjectures: every bridgeless graph has a nowhere-zero 5-flow [ 135] every Petersen - minor -free bridgeless graph has a nowhere-zero 4-flow [ 136] Woodall's conjecture that the minimum number of edges in a dicut of a directed graph is equal to the maximum number of disjoint dijoins.