photo

GeeTwo


Last seen: 5 days 前 |  自 2022 起处于活动状态

Followers: 0   Following: 0

Proud father, underwater acoustician, FIRST robotics volunteer, once and future FIRST mentor

Programming Languages:
C++, C, Java, Javascript, MATLAB, SQL, HTML, CSS, Arduino, Shell, Assembly, Fortran
Spoken Languages:
English

统计学

All
MATLAB Answers

1 个提问
5 个回答

Cody

1 个问题
761 个答案

排名
8,424
of 302,368

声誉
5

贡献数
1 个提问
5 个回答

回答接受率
100.0%

收到投票数
1

排名
 of 21,742

声誉
N/A

平均
0.00

贡献数
0 文件

下载次数
0

ALL TIME 下载次数
0

排名
110
of 181,724

贡献数
1 个问题
761 个答案

评分
11,481

徽章数量
64

贡献数
0 帖子

贡献数
0 公开的 个频道

平均

贡献数
0 个亮点

平均赞数

  • Thankful Level 1
  • Knowledgeable Level 1
  • Creator
  • Combinatorics I Master
  • Cody5 Hard Master
  • Speed Demon
  • Sequences And Series III Master
  • Scholar
  • Promoter
  • Sequences And Series II Master
  • Indexing III Master
  • Computational Geometry I Master

查看徽章

Feeds

排序方式:

已解决


The Omega Protocol: Hyper-dimensional Navigation and the Singularity Constraint
Description [EMERGENCY TRANSMISSION - GALACTIC COMMAND] Subject: Mission Omega-7 - Navigation through the K-94 Tesseract Anoma...

14 days 前

已解决


Play PRIMEGAME
Have you ever used the Sieve of Eratosthenes and said, "I wonder whether there’s a less efficient way to find prime numbers."? N...

24 days 前

已解决


Construct a prime circle
A <https://mathworld.wolfram.com/PrimeCircle.html prime circle> is a circular arrangement of the numbers 1 to 2n such that pairs...

24 days 前

已解决


Determine digits of the Copeland-Erdos constant
<https://www.mathworks.com/matlabcentral/cody/problems/1477-champernowne-constant/solutions/new Cody Problem 1477> asks us to de...

25 days 前

已解决


Identify primorial primes
Cody Problems <https://www.mathworks.com/matlabcentral/cody/problems/46054-count-trailing-zeros-in-a-primorial 46054> and <https...

25 days 前

已解决


Find the last non-zero digit in a primorial
<https://www.mathworks.com/matlabcentral/cody/groups/2001/problems/45251 Cody Problem 45251> asked us to find the last non-zero ...

25 days 前

已解决


Count trailing zeros in a primorial
<https://www.mathworks.com/matlabcentral/cody/problems/44068-the-number-of-trailing-zero-digit-of-a-factorial Cody Problem 44068...

25 days 前

已解决


Identify Wagstaff primes
The numbers 3, 43, and 2731 are examples of <https://mathworld.wolfram.com/WagstaffPrime.html Wagstaff primes>. Write a func...

26 days 前

已解决


Identify full reptend primes

26 days 前

已解决


Determine whether a number is a cluster prime
A <https://mathworld.wolfram.com/ClusterPrime.html cluster prime> is an odd prime number _p_ such that all even numbers less tha...

26 days 前

已解决


Investigate the frequency of last digits of prime numbers
The last digit of a prime number greater than 5 can be 1, 3, 7, or 9. If the primes are distributed randomly, then these digits ...

27 days 前

已解决


Compute the nth Naerogahtyp emirp

27 days 前

已解决


Determine RSA keys (public and private) given two prime number character strings (p and q)
Given two prime number character strings (p and q), generate the RSA public and private keys (n and d) with e = 65537. The more ...

9 months 前

问题


Precise Almost Pythagorean Triples
This is essentially the same as: Problem 52834. Easy Sequences 32: Almost Pythagorean Triples; it even presents the same set o...

9 months 前 | 3 | 3 个解题者

已解决


Weighted Costs ( Hard )
Different actions have different monetary costs: Fill = $10 , Empty = $5 , Pour = $1 #Note: It's just an example Find the mini...

9 months 前

已解决


Record the Actions ( Medium )
Find the minimum steps to get T units from jugs A and B. Return the sequence of actions as cell array of strings. Available act...

9 months 前

已解决


The Broken Jug: Constrain ( Hard )
One of your jugs is "broken": it can not be Emptied to the drain. It can only be Filled or Poured to another jug. Input: C, T, ...

9 months 前

已解决


The Classic 8-5-3 Sharing ( Medium )
You have 3 jugs with capacities [8,5,3]. The 8L jug, the others are empty: [8,0,0]. There is no tap and no drain. You can only p...

9 months 前

已解决


Total Volume Goal ( Medium )
Usually, the target T must be in one jug. In this version, the target T is the sum of water in all N jugs. Example: C = [3,5], ...

9 months 前

已解决


The Ultimate Water Challenge ( Expert )
Description: In the previous problems, you were given a target T and asked to find the minimum number of steps to reach it. ...

9 months 前

已解决


The Generalized N-Jug Water Pouring Problem ( Hard )
Description: You are given N water jugs with maximum capacities specified in a vector C = [ c1, c2, c3,.., c_n]. Initially, all...

9 months 前

已解决


Two Jugs: Minimum Steps ( Medium )
Following the first problem, now you need to find the shortest path. Given two jugs with capacities A and B, find the minimum nu...

9 months 前

已解决


Minimal Waste Pouring ( Hard )
Everytime you perform Empty action, water is wasted. Instead of minimizing steps, find the path that minimizes the total volume ...

9 months 前

已解决


Is it Possible? ( Easy )
In the first part of series, we simplify the problem. Given two jugs with capacities A and B, and a target amount T, determine i...

9 months 前

已解决


Clueless - Lord Ned in the Game Room with the Technical Computing Language
[Warning: this is a nontrivial programming problem] Worried about the decline in reasoning skills in the clueless populace of...

9 months 前

加载更多